公开(公告)号：US08170028B1

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

申请号：US12511856

申请日：2009-07-29

申请人： Dennis C Ferguson ,  Hann-Hwan Ju ,  Atsushi Kasuya ,  Gerald Cheung ,  Devereaux C Chen

发明人： Dennis C Ferguson ,  Hann-Hwan Ju ,  Atsushi Kasuya ,  Gerald Cheung ,  Devereaux C Chen

IPC分类号： H04L12/56

CPC分类号： H04L69/14

摘要： A network device includes an input interface, at least one processing path and an output interface. The input interface receives data units on a plurality of streams and assigns a first sequence number to each of the received data units. The at least one processing path performs a route look-up for each of the data units, where the route look-up determines a routing destination for a respective data unit. The output interface assigns a second sequence number to each of the processed data units based on a number of memory references associated with the route look-up for each of the data units and re-orders the processed data units based on the second sequence number assigned to each of the processed data units.

摘要翻译： 网络设备包括输入接口，至少一个处理路径和输出接口。 输入接口在多个流上接收数据单元，并向每个接收到的数据单元分配第一序列号。 至少一个处理路径对每个数据单元执行路线查找，其中路线查找确定相应数据单元的路由目的地。 输出接口基于与每个数据单元的路由查找相关联的存储器引用的数量为每个处理的数据单元分配第二序列号，并且基于分配的第二序列号重新排序处理后的数据单元 到每个处理的数据单元。

公开(公告)号：US07586917B1

公开(公告)日：2009-09-08

申请号：US10848574

申请日：2004-05-19

申请人： Dennis C. Ferguson ,  Hann-Hwan Ju ,  Atsushi Kasuya ,  Gerald Cheung ,  Devereaux C. Chen

发明人： Dennis C. Ferguson ,  Hann-Hwan Ju ,  Atsushi Kasuya ,  Gerald Cheung ,  Devereaux C. Chen

IPC分类号： H04L12/56

CPC分类号： H04L69/14

摘要： A network device includes an input interface, at least one processing path and an output interface. The input interface receives data units on a plurality of streams and assigns a first sequence number to each of the received data units. The at least one processing path performs a route look-up for each of the data units, where the route look-up determines a routing destination for a respective data unit. The output interface assigns a second sequence number to each of the processed data units based on a number of memory references associated with the route look-up for each of the data units and re-orders the processed data units based on the second sequence number assigned to each of the processed data units.

摘要翻译： 网络设备包括输入接口，至少一个处理路径和输出接口。 输入接口在多个流上接收数据单元，并向每个接收到的数据单元分配第一序列号。 至少一个处理路径对每个数据单元执行路线查找，其中路线查找确定相应数据单元的路由目的地。 输出接口基于与每个数据单元的路由查找相关联的存储器引用的数量为每个处理的数据单元分配第二序列号，并且基于分配的第二序列号重新排序处理后的数据单元 到每个处理的数据单元。

公开(公告)号：US08117333B1

公开(公告)日：2012-02-14

申请号：US10419798

申请日：2003-04-22

申请人： Junying James Yu ,  Dennis C. Ferguson ,  Hasan F. Ugurdag ,  Atsushi Kasuya

发明人： Junying James Yu ,  Dennis C. Ferguson ,  Hasan F. Ugurdag ,  Atsushi Kasuya

IPC分类号： G06F15/16 ,  G06F15/173 ,  H04L12/28

CPC分类号： H04L49/3009 ,  H04L12/56 ,  H04L49/552

摘要： A network device includes at least one input interface, at least one processing path and at least one output interface. The at least one input interface receives data blocks from a plurality of streams in a first order. The at least one processing path processes each of the data blocks, the processing including performing one or more route look-ups for each of the data blocks. The at least one output interface re-orders the data blocks based on a number of the one or more route look-ups associated with each of the data blocks.

摘要翻译： 网络设备包括至少一个输入接口，至少一个处理路径和至少一个输出接口。 所述至少一个输入接口以第一顺序从多个流接收数据块。 至少一个处理路径处理每个数据块，该处理包括对每个数据块执行一个或多个路由查找。 至少一个输出接口基于与每个数据块相关联的一个或多个路由查找的数量来重新排序数据块。

公开(公告)号：US20100280898A1

公开(公告)日：2010-11-04

申请号：US12433160

申请日：2009-04-30

申请人： Atsushi Kasuya

发明人： Atsushi Kasuya

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0233 ,  G06Q30/02

摘要： A method for a personalized reward system, the method includes obtaining a reward list comprising one or more reward each associated with a corresponding reward point required for a corresponding reward redemption, obtaining a task list comprising one or more tasks each associated with a corresponding reward point that can be earned upon a corresponding task completion, receiving a input from a user indicating a task of the one or more tasks is completed, adding a corresponding reward point associate with the task to generate a cumulative reward point based on a first pre-determined criterion, comparing the cumulative reward point to the reward list based on a second first pre-determined criterion to generate a result, and notifying the user of a reward redemption based on the result.

摘要翻译： 一种用于个性化奖励系统的方法，所述方法包括获得包括与相应奖励兑换所需的相应奖励点相关联的一个或多个奖励的奖励列表，获得包括与相应奖励积分相关联的一个或多个任务的任务列表 可以在相应的任务完成时获得，在从用户接收到指示一个或多个任务的任务的输入完成后，添加与该任务相关联的相应奖励点，以便基于第一预先确定的累积奖励积 标准，基于第二预先确定的标准将累积奖励点与奖励列表进行比较以生成结果，并且基于结果通知用户奖励兑换。

公开(公告)号：US07606826B2

公开(公告)日：2009-10-20

申请号：US11633868

申请日：2006-12-04

申请人： Chaoji Li ,  Atsushi Kasuya ,  Jianzhou Zhao ,  Baodong Yu

发明人： Chaoji Li ,  Atsushi Kasuya ,  Jianzhou Zhao ,  Baodong Yu

IPC分类号： G06F7/00 ,  G06F17/00

CPC分类号： G06F8/427 ,  G06F8/43 ,  G06F17/504 ,  Y10S707/99943

摘要： Evaluation information of a temporal description is displayed by: structuring data structures into a logical tree structure that is representative of the hierarchy of the temporal expressions, with each tree node representing a temporal primitive operator, and a unique index assigned to each primitive; evaluating the temporal expression, and recording the evaluation trace information that contains the corresponding unique index to the primitive node, the evaluation time stamp, and other information of the evaluation; and selectively displaying an evaluation sequence of the selected result at any level, including from the top of the tree structure of the temporal evaluation in order to show the evaluation history of the selected result at a lower level of the expression tree, where the selection methods include a graphical interface on the screen to select a child expression at a given tree level.

摘要翻译： 通过以下方式显示时间描述的评估信息：将数据结构构造成代表时间表达式的层次结构的逻辑树结构，每个树节点表示时间原语运算符，以及分配给每个基元的唯一索引; 评估时间表达，并将包含相应唯一索引的评估跟踪信息记录到原始节点，评估时间戳和评估的其他信息; 并且在包括从时间评估的树结构的顶部的任何级别选择性地显示所选择的结果的评估序列，以便在表达式树的较低级别显示所选择的结果的评估历史，其中选择方法 在屏幕上包括图形界面，以在给定树级别选择子表达式。

公开(公告)号：US20060271345A1

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

申请号：US11132742

申请日：2005-05-18

申请人： Atsushi Kasuya

发明人： Atsushi Kasuya

IPC分类号： G06F17/50

CPC分类号： G06F17/5022

摘要： A circuit is tested using a device under test, a circuit simulator, and a circuit simulation verifier. Executing the verifier drives the simulator and collects trace information. This trace information enables the verifier to be executed backwards to a past execution point or clock cycle. The internal state of the verifier's execution is reconstructed at the past point. A state of verifier execution includes values of variables (including any ports or clocks) and an execution point (e.g., which code statement was last executed). A past state of execution can be determined by using trace information to modify the current state of execution. After a line of trace information has been processed, the “current” state of verifier execution becomes the previous state as modified based on the trace information.

摘要翻译： 使用被测器件，电路仿真器和电路仿真验证器对电路进行测试。 执行验证者驱动模拟器并收集跟踪信息。 该跟踪信息使得验证者可以向后执行到过去的执行点或时钟周期。 验证者执行的内部状态在过去重建。 验证者执行的状态包括变量（包括任何端口或时钟）和执行点（例如，最后执行哪个代码语句）的值。 可以通过使用跟踪信息来修改当前的执行状态来确定过去的执行状态。 在处理了一行跟踪信息之后，验证者执行的“当前”状态变为根据跟踪信息修改的先前状态。

公开(公告)号：US07769962B2

公开(公告)日：2010-08-03

申请号：US11775767

申请日：2007-07-10

申请人： Atsushi Kasuya

发明人： Atsushi Kasuya

IPC分类号： G06F12/00

CPC分类号： G06F12/0284 ,  G06F9/4843 ,  G06F12/10

摘要： A system and a method for thread creation where only copied threads share the same stack location for execution, so unrelated threads have individual stack space and can be executed concurrently in multi-processor system. Also, the copy operation of the stack frame is only necessary among the copied threads, so the speed of context switching among individual threads is fast. This operation can be a simple page table modification in the virtual memory management mechanism for further speed up.

摘要翻译： 线程创建的系统和方法，其中只有复制的线程共享相同的堆栈位置才能执行，所以不相关的线程具有单独的堆栈空间，并且可以在多处理器系统中并发执行。 此外，复制的线程只需要堆栈帧的复制操作，因此各个线程之间的上下文切换速度很快。 此操作可以在虚拟内存管理机制中进行简单的页表修改，进一步加快。

公开(公告)号：US20060277534A1

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

申请号：US11148126

申请日：2005-06-07

申请人： Atsushi Kasuya

发明人： Atsushi Kasuya

IPC分类号： G06F9/45

CPC分类号： G06F8/427 ,  G06F8/43 ,  G06F17/504 ,  Y10S707/99943

摘要： A translation module translates a temporal description into a temporal expression. The translation module is adapted to translate a temporal description in the form of an extended syntax or a preprocessing macro to the temporal expression. The temporal expression includes a native expression of a general purpose programming language. The temporal expression may also include one or more construct functions. A parsing module parses the temporal expression to generate a data structure that represents the temporal expression without evaluating the native expression. An evaluation module evaluates the data structure to execute the temporal expression including the native expression.

摘要翻译： 翻译模块将时间描述转换为时间表达式。 翻译模块适于将扩展语法或预处理宏的形式的时间描述转换为时间表达。 时间表达式包括通用编程语言的本机表达式。 时间表达式还可以包括一个或多个构造函数。 解析模块解析时间表达式以生成表示时间表达式的数据结构，而不评估本机表达式。 评估模块评估数据结构以执行包括本机表达式的时间表达式。

公开(公告)号：US20180302324A1

公开(公告)日：2018-10-18

申请号：US15956733

申请日：2018-04-18

申请人： Atsushi Kasuya

发明人： Atsushi Kasuya

IPC分类号： H04L12/741

摘要： Effective data distribution without special hardware such as CAM. A unique Route ID in the network is used to determine the destinations for a sent packet. On creating the routing information for the Route ID, each node in the network creates an entry in its own forwarding table within the node. A linear memory offset in the table, called LookUp ID, is used to access the entry. By exchanging the LookUp ID with neighboring nodes and updating the forwarding table entry, the packet distribution path can be determined for the given Route ID. When a packet is sent for the given Route ID, each node updates the predetermined field in the packet with neighbor LookUp ID and sends it to the neighbor node, so the neighbor node can access its own entry as a regular memory access with the LookUp ID to determine where to forward the packet.

公开(公告)号：US20080010432A1

公开(公告)日：2008-01-10

申请号：US11775767

申请日：2007-07-10

申请人： Atsushi Kasuya

发明人： Atsushi Kasuya

IPC分类号： G06F12/02

CPC分类号： G06F12/0284 ,  G06F9/4843 ,  G06F12/10

摘要： A system and a method for thread creation where only copied threads share the same stack location for execution, so unrelated threads have individual stack space and can be executed concurrently in multi-processor system. Also, the copy operation of the stack frame is only necessary among the copied threads, so the speed of context switching among individual threads is fast. This operation can be a simple page table modification in the virtual memory management mechanism for further speed up.

摘要翻译： 线程创建的系统和方法，其中只有复制的线程共享相同的堆栈位置才能执行，所以不相关的线程具有单独的堆栈空间，并且可以在多处理器系统中并发执行。 此外，复制的线程只需要堆栈帧的复制操作，因此各个线程之间的上下文切换速度很快。 此操作可以在虚拟内存管理机制中进行简单的页表修改，进一步加快。