公开(公告)号：US20170055596A1

公开(公告)日：2017-03-02

申请号：US15250655

申请日：2016-08-29

申请人： Raquel Smith Colby ,  Paul J. Still ,  James Sexton

发明人： Raquel Smith Colby ,  Paul J. Still ,  James Sexton

IPC分类号： A41D1/00 ,  A63F13/24 ,  A41D31/00 ,  A41D27/20 ,  A41D1/04 ,  G09B19/00

CPC分类号： A41D1/002 ,  A61F5/10 ,  A63F13/212 ,  A63F13/245 ,  G06F1/163 ,  G06F3/016 ,  G09B19/003

摘要： A smart clothing device that is utilized for simulated touch and concussive force provides a force simulation element positioned between a rigid outer material and a flexible inner material. The rigid outer material supports the force simulation element and ensures an impact force is directed inwards, towards the flexible inner material. The rigid outer material and the flexible inner material are formed into a garment corresponding to a desired body part upon which the impact force is to be directed. A control unit actuates the force simulation element in response to a command or signal received from a trigger device. The control unit can vary the specific amount of force and the duration for which the impact force is imparted on the desired body part. The trigger device can be any electronic device either running a software program or producing a detectable signal.

摘要翻译： 用于模拟触摸和震荡力的智能服装装置提供了位于刚性外部材料和柔性内部材料之间的力模拟元件。 刚性外部材料支撑力模拟元件，并确保冲击力向内朝向柔性内部材料。 刚性外部材料和柔性内部材料形成为对应于冲击力将被引导到的所需身体部位的衣服。 控制单元响应于从触发装置接收到的命令或信号来致动力模拟元件。 控制单元可以改变特定的力量和冲击力施加在所需身体部位上的持续时间。 触发装置可以是运行软件程序或产生可检测信号的任何电子装置。

公开(公告)号：US20070153519A1

公开(公告)日：2007-07-05

申请号：US11325799

申请日：2006-01-05

申请人： James Sexton ,  Michael Thalasinos

发明人： James Sexton ,  Michael Thalasinos

IPC分类号： F21V33/00

CPC分类号： A61L9/037

摘要： An apparatus and method is disclosed for providing a reverse hand-painted decorative fragrance lamp. The decorative fragrance lamp comprises at least one glass vessel, at least one access port associated with an interior portion of the at least one glass vessel, a protective barrier disposed within the at least one glass vessel, and a ring coupled to the protective barrier and the at least glass vessel. The decorative fragrance lamp further comprising the at least one glass vessel capable of being reverse hand-painted on the interior portion through the at least one access port.

摘要翻译： 公开了一种用于提供反向手绘装饰香薰灯的装置和方法。 所述装饰香料灯包括至少一个玻璃容器，与所述至少一个玻璃容器的内部部分相关联的至少一个进入口，设置在所述至少一个玻璃容器内的保护屏障，以及联接到所述保护屏障的环和 至少玻璃容器。 所述装饰香料灯还包括所述至少一个玻璃容器，所述至少一个玻璃容器能够通过所述至少一个进入口在所述内部部分上手绘地反向手绘。

公开(公告)号：US07007005B2

公开(公告)日：2006-02-28

申请号：US09858426

申请日：2001-05-16

申请人： Keith Rautenback ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Wayne Plummer ,  Stephen Paul Thomas

发明人： Keith Rautenback ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Wayne Plummer ,  Stephen Paul Thomas

IPC分类号： G06F17/30

CPC分类号： G06F9/4812 ,  G06F8/4442 ,  G06F8/445 ,  G06F9/4484 ,  G06F9/449 ,  G06F9/4491 ,  G06F9/455 ,  G06F9/45516 ,  G06F11/3612 ,  G06F12/0269 ,  G06F2209/481 ,  Y10S707/99932 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A method and structure for reducing search times. The method includes examining the entries in a list in turn beginning with the entry pointed to by a start pointer and continuing until the particular entry is found. The start pointer is then reset to point at the particular entry that was found. The next search will therefore begin to search at the location where the last search ended. Such a strategy increases the likelihood of locating the particular entry faster. The list of entries includes next entry pointers that point to another entry in the list such that the next entry pointers together form a closed loop. If the entire list is searched and the particular entry is not found, the search is aborted.

公开(公告)号：US20050071409A1

公开(公告)日：2005-03-31

申请号：US10671888

申请日：2003-09-29

申请人： Fred Gustavson ,  John Gunnels ,  James Sexton

发明人： Fred Gustavson ,  John Gunnels ,  James Sexton

IPC分类号： G06F12/00 ,  G06F12/08 ,  G06F17/16

CPC分类号： G06F12/0875 ,  G06F17/16

摘要： A method (and structure) of executing a matrix operation, includes, for a matrix A, separating the matrix A into blocks, each block having a size p-by-q. The blocks of size p-by-q are then stored in a cache or memory in at least one of the two following ways. The elements in at least one of the blocks is stored in a format in which elements of the block occupy a location different from an original location in the block, and/or the blocks of size p-by-q are stored in a format in which at least one block occupies a position different relative to its original position in the matrix A.

摘要翻译： 执行矩阵运算的方法（和结构）包括对于矩阵A，将矩阵A分成块，每个块具有大小p-by-q。 然后以p-by-q的大小的块以以下两种方式中的至少一种存储在高速缓存或存储器中。 至少一个块中的元素以块的元素占据与块中的原始位置不同的位置的格式存储，和/或大小为p-by-q的块以 其中至少一个块占据与矩阵A中其原始位置不同的位置。

公开(公告)号：US20060101104A1

公开(公告)日：2006-05-11

申请号：US10963101

申请日：2004-10-12

申请人： Gyan Bhanot ,  Alan Gara ,  Philip Heidelberger ,  Eoin Lawless ,  James Sexton ,  Robert Walkup

发明人： Gyan Bhanot ,  Alan Gara ,  Philip Heidelberger ,  Eoin Lawless ,  James Sexton ,  Robert Walkup

IPC分类号： G06F1/16

CPC分类号： G06F9/5066

摘要： A general computer-implement method and apparatus to optimize problem layout on a massively parallel supercomputer is described. The method takes as input the communication matrix of an arbitrary problem in the form of an array whose entries C(i, j) are the amount to data communicated from domain i to domain j. Given C(i, j), first implement a heuristic map is implemented which attempts sequentially to map a domain and its communications neighbors either to the same supercomputer node or to near-neighbor nodes on the supercomputer torus while keeping the number of domains mapped to a supercomputer node constant (as much as possible). Next a Markov Chain of maps is generated from the initial map using Monte Carlo simulation with Free Energy (cost function) F=Σi,jC(i,j)H(i,j)—where H(i,j) is the smallest number of hops on the supercomputer torus between domain i and domain j. On the cases tested, found was that the method produces good mappings and has the potential to be used as a general layout optimization tool for parallel codes. At the moment, the serial code implemented to test the method is un-optimized so that computation time to find the optimum map can be several hours on a typical PC. For production implementation, good parallel code for our algorithm would be required which could itself be implemented on supercomputer.

摘要翻译： 描述了在大型并行超级计算机上优化问题布局的通用计算机实现方法和装置。 该方法采用数组形式的任意问题的通信矩阵作为输入，其条目C（i，j）是从域i到域j传送的数据量。 给定C（i，j），首先实现启发式映射，其尝试顺序地将域及其通信邻居映射到超级计算机节点或超级计算机环面上的近邻节点，同时保持域的数量映射到 超级计算机节点常数（尽可能多）。 接下来，使用具有自由能量（成本函数）的蒙特卡罗模拟，从初始映射生成马尔可夫链映射，其中F =Σi，j C（i，j）H（i，j） H（i，j）是域i和域j之间的超级计算机环面上的最小跳数。 在测试的情况下，发现该方法产生良好的映射，并且有可能被用作并行代码的通用布局优化工具。 此时，实现测试方法的序列号未优化，以便在典型的PC上找到最佳映射的计算时间可以为几个小时。 对于生产实现，将需要我们的算法的良好的并行代码，这本身可以在超级计算机上实现。

公开(公告)号：US06862728B2

公开(公告)日：2005-03-01

申请号：US09859133

申请日：2001-05-16

申请人： Stephen Darnell ,  William Thomas Charnell ,  Wayne Plummer ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenback ,  Stephen Paul Thomas

发明人： Stephen Darnell ,  William Thomas Charnell ,  Wayne Plummer ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenback ,  Stephen Paul Thomas

IPC分类号： G06F11/28 ,  G06F9/40 ,  G06F9/42 ,  G06F9/44 ,  G06F9/45 ,  G06F9/455 ,  G06F9/46 ,  G06F9/48 ,  G06F11/36 ,  G06F12/02

CPC分类号： G06F9/4812 ,  G06F8/4442 ,  G06F8/445 ,  G06F9/4484 ,  G06F9/449 ,  G06F9/4491 ,  G06F9/455 ,  G06F9/45516 ,  G06F11/3612 ,  G06F12/0269 ,  G06F2209/481 ,  Y10S707/99932 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A hash table dispatch mechanism for interface Methods. The mechanism reduces dispatch times during the execution of an object-oriented language program. An interface hash table having a pointer as an index for either a specific location in a corresponding dispatch table or an interface Method of the program is created for a dispatch table. The interface hash table has an address and a plurality of slots having a hash value related to an interface Method. The mechanism includes a recovery Method for resolving conflicts when two or more slots in the interface hash table contain clashing values.

摘要翻译： 接口方法的散列表调度机制。 该机制在执行面向对象语言程序期间减少了调度时间。 具有指针作为相应调度表中的特定位置的索引或接口的接口散列表，为调度表创建程序的方法。 接口哈希表具有地址和具有与接口方法相关的哈希值的多个时隙。 该机制包括一种在接口哈希表中的两个或多个时隙包含冲突值时解决冲突的恢复方法。

公开(公告)号：US06691303B2

公开(公告)日：2004-02-10

申请号：US09859162

申请日：2001-05-16

申请人： Philippa Joy Guthrie ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Wayne Plummer ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenback ,  Stephen Paul Thomas

发明人： Philippa Joy Guthrie ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Wayne Plummer ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenback ,  Stephen Paul Thomas

IPC分类号： G06F944

CPC分类号： G06F9/4812 ,  G06F8/4442 ,  G06F8/445 ,  G06F9/4484 ,  G06F9/449 ,  G06F9/4491 ,  G06F9/455 ,  G06F9/45516 ,  G06F11/3612 ,  G06F12/0269 ,  G06F2209/481 ,  Y10S707/99932 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A method and system of testing and verifying computer code in a multi-threaded environment. The method includes testing a first piece of computer code that is an implementation of a specification against a second piece of computer code that is a different implementation of the specification. Corresponding synchronization points in the first and second pieces of code are defined and the first piece of code is executed to the first synchronization point of the first piece of code. A state message is generated and sent to the second piece of code. The second piece of code is executed to the first synchronization point of the second piece of code and then a state after message is generated and compared to the state before message. The synchronization points are generally selected from a group including conditional transfers of control, Method calls, Method returns, and backward transfers of control.

摘要翻译： 一种在多线程环境中测试和验证计算机代码的方法和系统。 该方法包括测试第一个计算机代码，该代码是针对作为规范的不同实现的第二计算机代码的规范的实现。 定义第一和第二代码段中相应的同步点，并且第一段代码被执行到第一代码段的第一同步点。 生成状态消息并发送到第二段代码。 第二段代码被执行到第二段代码的第一同步点，然后生成消息之后的状态并与消息之前的状态进行比较。 同步点通常从包括控制的条件转移，方法调用，方法返回和控制的向后传送的组中选择。

公开(公告)号：US07080366B2

公开(公告)日：2006-07-18

申请号：US09858827

申请日：2001-05-16

申请人： Jeremy Paul Kramskoy ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Wayne Plummer ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenback ,  Stephen Paul Thomas

发明人： Jeremy Paul Kramskoy ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Wayne Plummer ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenback ,  Stephen Paul Thomas

IPC分类号： G06F9/45

CPC分类号： G06F9/4812 ,  G06F8/4442 ,  G06F8/445 ,  G06F9/4484 ,  G06F9/449 ,  G06F9/4491 ,  G06F9/455 ,  G06F9/45516 ,  G06F11/3612 ,  G06F12/0269 ,  G06F2209/481 ,  Y10S707/99932 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A dynamic compiler and method of compiling code to generate a dominate path and handle exceptions. The dynamic compiler includes an execution history recorder that is configured to record the number of times a fragment of code is interpreted. When the code is interpreted a threshold number of times, the code is queued for compilation. The execution history recorder also keeps track of where transfer of control came from and where transfer of control goes to for each fragment of code that is executed, thereby allowing for compilation of a dominant path of code. If the execution of code deviates from the dominant path of compiled code (such as when an exception occurs), a fallback interpreter is utilized to interpret the fragment of code to be executed.

公开(公告)号：US06901587B2

公开(公告)日：2005-05-31

申请号：US09859072

申请日：2001-05-16

申请人： Jeremy Paul Kramskoy ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Wayne Plummer ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenbach ,  Stephen Paul Thomas

发明人： Jeremy Paul Kramskoy ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Wayne Plummer ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenbach ,  Stephen Paul Thomas

IPC分类号： G06F11/28 ,  G06F9/40 ,  G06F9/42 ,  G06F9/44 ,  G06F9/45 ,  G06F9/455 ,  G06F9/46 ,  G06F9/48 ,  G06F11/36 ,  G06F12/02 ,  G06F12/00 ,  G06F12/14

CPC分类号： G06F9/4812 ,  G06F8/4442 ,  G06F8/445 ,  G06F9/4484 ,  G06F9/449 ,  G06F9/4491 ,  G06F9/455 ,  G06F9/45516 ,  G06F11/3612 ,  G06F12/0269 ,  G06F2209/481 ,  Y10S707/99932 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A method and a system of cache management using spatial separation of outliers. The system includes a dynamic compiler arranged to create compiled fragments of code having dominant code blocks and outliers. Memory coupled to the dynamic compiler is managed by a compiler manager such that dominant code blocks are stored in one portion of the memory and the outliers are stored in another portion of the memory. Storing the dominant path code separate from the outliers increases efficiency of the system.

摘要翻译： 使用离群值空间分离的缓存管理方法和系统。 该系统包括一个动态编译器，用于创建具有主要代码块和异常值的代码的编译片段。 耦合到动态编译器的存储器由编译器管理器管理，使得主要代码块被存储在存储器的一部分中，异常值存储在存储器的另一部分中。 将主导路径代码与离群值分开可以提高系统的效率。

公开(公告)号：US20120278581A1

公开(公告)日：2012-11-01

申请号：US13365936

申请日：2012-02-03

申请人： Stephen Paul Thomas ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenbach ,  Wayne Plummer

发明人： Stephen Paul Thomas ,  William Thomas Charnell ,  Stephen Darnell ,  Blaise Abel Alec Dias ,  Philippa Joy Guthrie ,  Jeremy Paul Kramskoy ,  Jeremy James Sexton ,  Michael John Wynn ,  Keith Rautenbach ,  Wayne Plummer

IPC分类号： G06F12/02

CPC分类号： G06F9/4812 ,  G06F8/4442 ,  G06F8/445 ,  G06F9/4484 ,  G06F9/449 ,  G06F9/4491 ,  G06F9/455 ,  G06F9/45516 ,  G06F11/3612 ,  G06F12/0269 ,  G06F2209/481 ,  Y10S707/99932 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A computer system which includes a plurality of threads and a garbage collector that traces memory objects and identifies memory objects according to a three-color abstraction. The computer system also includes two methods of deleting compiled code in a self-modifying multi-threaded computer system. The computer system also utilizes a method of handling links between fragments of code in a self-modifying multi-threaded computer system. The computer system also handles patches between two pieces of code.

摘要翻译： 一种包括多个线程的计算机系统和一个跟踪存储器对象并根据三色抽象来识别存储器对象的垃圾收集器。 计算机系统还包括在自修改多线程计算机系统中删除编译代码的两种方法。 计算机系统还利用在自修改多线程计算机系统中处理代码片段之间的链接的方法。 计算机系统还处理两段代码之间的补丁。