会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Method for making an infeasible sequence of things feasible
    • 使不可行序列可行的方法
    • US20070239363A1
    • 2007-10-11
    • US11696914
    • 2007-04-05
    • Daniel ReaumeWayne CaiJeffrey Alden
    • Daniel ReaumeWayne CaiJeffrey Alden
    • G06F19/00
    • G05B19/41805G05B2219/31052G05B2219/45234G06Q10/06312Y02P90/04
    • A method for making an infeasible sequence of things feasible. The method includes generating a series of matrices that define the relative position of the things in the sequence based on graph theory, and multiplying the matrices to determine the required order of the things in the sequence based on prior pre-determined constraints. The method selects a current position for each thing in the sequence, and looks at each thing before the current position of a thing on a sequential basis to determine whether the thing at the current position should come before any of the previous things based on the multiplied matrices. The method also looks at other constraints, including determining if any of the things must follow each other in the sequence, determining whether any of the things in the sequence cannot follow one after the other, etc.
    • 使不可行序列的方法可行。 该方法包括生成一系列矩阵,其基于图理论定义序列中的物体的相对位置,并且乘以矩阵以基于先前的预定约束确定序列中的物体的所需顺序。 该方法为序列中的每个事物选择一个当前位置,并且在连续的基础上查看一个事物的当前位置之前的每个事物,以确定当前位置的事物是否应该在先前的任何事物之前基于乘法 矩阵。 该方法还考虑其他约束,包括确定任何事物是否必须在序列中彼此遵循,确定序列中的任何内容是否不能一个接一个地遵循。
    • 2. 发明申请
    • Apparatus for removing and inserting optically read disks
    • 用于去除和插入光学读取盘的装置
    • US20070075556A1
    • 2007-04-05
    • US11239826
    • 2005-09-30
    • Jeffrey Alden
    • Jeffrey Alden
    • B25B9/02
    • B25B9/00G11B17/02G11B23/00
    • An apparatus is provided that enables users to insert and remove optically read disks without touching them by hand. The apparatus comprises a hollow frame and a spring-loaded plunger with flexible hooks. When the plunger is pushed down out of the locked position, protrusions on the hooks are forced out of convex indentations and against the inner sides of the frame, compressing the hooks. The apparatus can then be inserted through the central hole in a disk. The user then releases the plunger, which is forced upward by a compressed spring so that the protrusions on the hooks fit back into the indentations. The hooks then expand outward so that the disk is held securely and may be removed from its storage case or a player. Reversing this operation allows a user to insert a disk into a storage case or player.
    • 提供了一种使用户能够插入和移除光学读取盘而不用手触摸的装置。 该装置包括中空框架和具有柔性钩的弹簧加载柱塞。 当柱塞被向下压出锁定位置时,钩上的突起被压出凸出的凹陷并抵靠框架的内侧,压缩钩。 然后可以将设备插入盘中的中心孔。 然后用户释放柱塞,该柱塞被压缩的弹簧向上推动,使得钩上的突起装回凹陷中。 然后,钩子向外扩展,使得盘被牢固地保持,并且可以从其存储箱或玩家移除。 反转此操作允许用户将磁盘插入存储盒或播放器。
    • 5. 发明申请
    • Fictitious play based assembly sequence optimization considering process constraints
    • 考虑到过程约束,基于虚拟游戏的装配顺序优化
    • US20070239362A1
    • 2007-10-11
    • US11696905
    • 2007-04-05
    • Daniel ReaumeWayne CaiJeffrey Alden
    • Daniel ReaumeWayne CaiJeffrey Alden
    • G06F19/00
    • G05B19/41805G05B2219/31052G05B2219/45234Y02P90/04
    • A method for optimizing a sequence of things that employs a fictitious play algorithm. The method includes assigning an agent to each thing in the sequence, and defining an objective function that is a function of certain performance indices of the things. The method also includes determining an initial sequence of the things, and defining a random sample of a plurality of past sequence of the things. The method then sequentially and independently selects an optimal position for each thing in the sequence that minimizes the objective function relative to the sampled sequences. The method then determines a new sequence of the things based on the selected positions of the things in the sequence, and then determines whether the new sequence is closer to optimal than the previous sequences of the things.
    • 一种优化采用虚拟播放算法的事物序列的方法。 该方法包括将代理分配给序列中的每个事物,并且定义作为事物的某些性能指标的函数的目标函数。 该方法还包括确定事物的初始序列,以及定义事物的多个过去序列的随机样本。 该方法然后顺序地并且独立地选择在相对于采样序列使目标函数最小化的序列中的每个事物的最佳位置。 然后,该方法基于序列中事物的选定位置来确定事物的新序列,然后确定新序列是否比事先的序列更接近于最优。