公开(公告)号：US07757215B1

公开(公告)日：2010-07-13

申请号：US11402348

申请日：2006-04-11

申请人： Charles Jianping Zhou ,  Yuguang Wu

发明人： Charles Jianping Zhou ,  Yuguang Wu

IPC分类号： G06F9/44

CPC分类号： G06F11/3644

摘要： An approach is provided for performing software fault injection code testing in a framework that allows testers to place flexible tracing and monitoring actions into algorithmic scripts which provide instructions for dynamically switching called software program functions to corresponding fault injected functions during program execution and that allows testers to perform fault injection testing without requiring modification or access to the underlying source code of the software program being tested. The framework suspends execution of the software program when certain conditions are met, removes any existing linking to called functions, changes the software program's runtime dynamic linking, performs any other instructions provided by the algorithmic script, and then resumes the software program's execution until execution of the program is complete or until the framework is again instructed to change the software program's runtime dynamic linking.

摘要翻译： 提供了一种在框架中执行软件故障注入代码测试的方法，该框架允许测试人员将灵活的跟踪和监视动作放置到算法脚本中，该算法脚本提供了在程序执行期间将所称软件程序功能动态切换到相应故障注入功能的指令，并允许测试人员 执行故障注入测试，无需修改或访问正在测试的软件程序的底层源代码。 当满足某些条件时，框架会暂停执行软件程序，删除任何现有的链接到被调用的功能，更改软件程序的运行时动态链接，执行算法脚本提供的任何其他指令，然后恢复软件程序的执行，直到执行 该程序是完整的，或者直到框架再次被指示改变软件程序的运行时动态链接。

公开(公告)号：US07823141B1

公开(公告)日：2010-10-26

申请号：US11240963

申请日：2005-09-30

申请人： Phyllis E. Gustafson ,  Michael H. Paleczny ,  Christopher A. Vick ,  Olaf Manczak ,  Jay R. Freeman ,  Yuguang Wu

发明人： Phyllis E. Gustafson ,  Michael H. Paleczny ,  Christopher A. Vick ,  Olaf Manczak ,  Jay R. Freeman ,  Yuguang Wu

IPC分类号： G06F9/45 ,  G06F9/30 ,  G06F7/38

CPC分类号： G06F9/3851 ,  G06F8/456 ,  G06F9/325 ,  G06F9/3834 ,  G06F9/3861 ,  G06F9/3885 ,  G06F9/5066

摘要： A method for executing a loop in an application that includes executing iterations in a first segment of the loop by a base thread, logging memory transactions that occur during execution of iterations in the first segment by a co-inspector thread to obtain a co-inspector log, executing iterations in a second segment of the loop by a co-thread to obtain temporary results, logging memory transactions that occur during execution of iterations in the second segment to obtain a co-thread log, and comparing the co-inspector log and the co-thread log to determine whether a thread interdependency exists.

摘要翻译： 一种用于在应用程序中执行循环的方法，包括：通过基线程执行所述循环的第一段中的迭代，记录由共检查者线程执行所述第一段中的迭代执行期间发生的存储器事务，以获得共检查器 记录，通过共线程在循环的第二段中执行迭代以获得临时结果，记录在执行第二段中的迭代期间发生的存储器事务以获得共线程日志，并将协同检查器日志和 共线程日志来确定是否存在线程相互依赖关系。

公开(公告)号：US20100067024A1

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

申请号：US12278671

申请日：2007-02-08

申请人： Kirk D. Swenson ,  Robert S. Golabek, JR. ,  Yuguang Wu

发明人： Kirk D. Swenson ,  Robert S. Golabek, JR. ,  Yuguang Wu

IPC分类号： G06F15/00

CPC分类号： B01L3/508 ,  B01L3/5082 ,  B01L3/50825 ,  B01L2300/021 ,  B01L2300/024 ,  B01L2300/046 ,  B01L2300/0663 ,  G01N31/229 ,  G01N2035/00861 ,  G09F3/00 ,  G09F2003/0211 ,  G09F2003/0272

摘要： A system and method are provided for providing information on at least one container for storing a biological sample, including: a holder configured to hold at least one biological sample container and a receiver configured to receive information relating to at least one of the container or the biological sample as well as data relating to at least one instruction for printing the information. The system and method further include a printer configured to print the information in accordance with the at least one instruction. In one embodiment, the printer is configured to print the information directly on the container. In another embodiment, the system and method further include an applicator configured to apply a label on the container and the printer is configured to print the information on the label. In another embodiment, the system and method include a detector configured to detect whether the container contains the biological sample and a processor configured to determine the manner for printing the information. In this embodiment, the determination is based, at least in part, on whether container contains the biological sample.

摘要翻译： 提供了一种用于提供关于至少一个用于存储生物样品的容器的信息的系统和方法，包括：保持器，其构造成容纳至少一个生物样品容器和接收器，所述容器被配置为接收与所述容器或所述容器 生物样本以及与至少一个用于打印信息的指令有关的数据。 该系统和方法还包括被配置为根据至少一个指令打印信息的打印机。 在一个实施例中，打印机被配置为直接在容器上打印信息。 在另一个实施例中，系统和方法还包括施用器，其构造成在容器上施加标签，并且打印机被配置为在标签上打印信息。 在另一个实施例中，系统和方法包括被配置为检测容器是否包含生物样品的检测器和被配置为确定打印信息的方式的处理器。 在该实施例中，该确定至少部分地基于容器是否包含生物样品。

公开(公告)号：US06742135B1

公开(公告)日：2004-05-25

申请号：US09707474

申请日：2000-11-07

申请人： Yuguang Wu

发明人： Yuguang Wu

IPC分类号： G06F1100

CPC分类号： G06F9/526 ,  G06F9/524 ,  G06F11/0724 ,  G06F11/0793

摘要： A generic fault tolerant “match-and-set” locking mechanism and method for controlling access to resources shared among a plurality of users N. The match-and-set lock has a locked operating state and an unlocked operating state controlled by the value C of its content such that the lock is in its locked operating state when C≠0 and in its unlocked operating state where C=0. The lock returns a value R, equal to the lock's current content C, to an inquiring user seeking access to the resource. A return value R=0 denotes that the resource is free, and a return value R≠0 denotes that the resource is locked by another user. The lock is responsive to a command in the form (A, B), such that the lock substitutes B for C if A=C. Thus, the lock may be locked by issuing the command (A, B) where A=C and B≠0; and the lock may be released by issuing the command (A, B) where A=C and B=0. A deadlock condition may be avoided by setting the lock to the value B=P+T*(N+1), where P

公开(公告)号：US09724690B2

公开(公告)日：2017-08-08

申请号：US12278658

申请日：2007-02-08

申请人： Gary D. Fletcher ,  Sol F. Green ,  Myriam Lopez ,  Robert J. Losada ,  Dimitrios Manoussakis ,  C. Mark Newby ,  Girish Parmar ,  Paul R. Soskey ,  Timothy A. Stevens ,  Yuguang Wu

发明人： Gary D. Fletcher ,  Sol F. Green ,  Myriam Lopez ,  Robert J. Losada ,  Dimitrios Manoussakis ,  C. Mark Newby ,  Girish Parmar ,  Paul R. Soskey ,  Timothy A. Stevens ,  Yuguang Wu

IPC分类号： A61J1/06 ,  B01L3/00 ,  G09F3/00 ,  G01N31/22 ,  G01N35/00 ,  G09F3/02

CPC分类号： B01L3/508 ,  B01L3/5082 ,  B01L3/50825 ,  B01L2300/021 ,  B01L2300/024 ,  B01L2300/046 ,  B01L2300/0663 ,  G01N31/229 ,  G01N2035/00861 ,  G09F3/00 ,  G09F2003/0211 ,  G09F2003/0272

摘要： Disclosed is a fluid collection device wherein multiple, individual samples of fluid can be collected simultaneously. The device includes a chamber and an adapter which substantially and simultaneously distributes the blood to individual chambers with chamber specific additives. Also included is a system for using the blood collection device, preferably within a diagnostic testing laboratory.

公开(公告)号：US09037703B1

公开(公告)日：2015-05-19

申请号：US13408421

申请日：2012-02-29

申请人： Yuguang Wu ,  Jianming He

发明人： Yuguang Wu ,  Jianming He

IPC分类号： G06F15/173 ,  G06F9/50 ,  H04L29/08

CPC分类号： G06F9/50 ,  G06F9/5027 ,  G06F2209/503 ,  H04L67/1012 ,  H04L67/1031 ,  H04L67/1048

摘要： Systems and methods for managing system resources on distributed servers are discussed. The servers may determine, using control circuitry, a system resource metric of the server. The system resource metric may be compared with a pre-determined threshold value. Based on the comparison of the system resource metric with a pre-determined threshold value, the server may determine whether to initiate maintenance on the server. If it is determined that maintenance should be initiated, the server may enter a not-in-service mode and the server may initiate maintenance. Once maintenance is complete, the server may exit the not-in-service mode.

摘要翻译： 讨论了分布式服务器上系统资源管理的系统和方法。 服务器可以使用控制电路来确定服务器的系统资源度量。 可以将系统资源量度与预定阈值进行比较。 基于系统资源度量与预定阈值的比较，服务器可以确定是否在服务器上启动维护。 如果确定应启动维护，则服务器可能进入不在服务模式，并且服务器可能会启动维护。 一旦维护完成，服务器可能会退出不在服务模式。

公开(公告)号：US08874558B1

公开(公告)日：2014-10-28

申请号：US13609804

申请日：2012-09-11

申请人： Jianming He ,  Yuguang Wu

发明人： Jianming He ,  Yuguang Wu

IPC分类号： G06F17/30

CPC分类号： G06F17/30864

摘要： A system is configured to identify a particular channel that provides content, where the particular channel includes content items; determine a respective first score, for each of the content items, that reflects a measure of quality of the content item; determine a topic distribution, for each of the content items, that indicates a topic conveyed by the content item; assign a second score, to the particular channel, that reflects a measure of quality of the particular channel; determine a particular term for which the particular channel is authoritative based on the first scores, the topic distributions, and the second score; and store information identifying the particular channel as authoritative for the particular term. A new content item, associated with the particular channel and relating to the particular term, may be promoted in search results for a search query relating to the particular term.

摘要翻译： 系统被配置为识别提供内容的特定频道，其中特定频道包括内容项; 确定反映内容项的质量的度量的每个内容项的相应的第一分数; 为每个内容项确定表示由内容项目传送的主题的主题分发; 将特定频道的第二分数分配给反映特定频道质量的度量; 基于第一分数，主题分布和第二分数确定特定频道是权威的特定术语; 并将识别特定频道的信息存储为特定术语的权威。 可以在与特定术语相关的搜索查询的搜索结果中促进与特定频道相关联并且与特定术语相关联的新内容项。

公开(公告)号：US08611335B1

公开(公告)日：2013-12-17

申请号：US12541092

申请日：2009-08-13

申请人： Yuguang Wu ,  Junlan Zhou

发明人： Yuguang Wu ,  Junlan Zhou

IPC分类号： H04L12/28

CPC分类号： H04L47/41 ,  H04L45/125 ,  H04L45/38 ,  H04L47/2441

摘要： A system and method to assign paths for data flows through a wide area network. A plurality of data flows is received, wherein a respective data flow in the plurality of data flows includes a respective source address and a respective destination address. An ordering of the plurality of data flows is generated. The ordering of the plurality of data flows are iteratively modified until a cost associated with path assignments for the ordering of the plurality of data flows satisfies a predetermined condition, wherein a respective path assignment for a respective data flow specifies a respective path from a respective source address to a respective destination address. The data flows are executed based on the path assignments for the ordering of the plurality of data flows having the cost that satisfies the predetermined condition.

摘要翻译： 为广域网数据流分配路径的系统和方法。 接收多个数据流，其中多个数据流中的相应数据流包括相应的源地址和相应的目的地地址。 生成多个数据流的排序。 迭代地修改多个数据流的顺序，直到与多个数据流的顺序的路径分配相关联的成本满足预定条件，其中相应数据流的相应路径分配指定来自相应源的相应路径 地址到相应的目的地址。 基于具有满足预定条件的成本的多个数据流的排序的路径分配来执行数据流。

公开(公告)号：US08549173B1

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

申请号：US12569405

申请日：2009-09-29

申请人： Yuguang Wu ,  Junlan Zhou ,  Zhengrong Ji

发明人： Yuguang Wu ,  Junlan Zhou ,  Zhengrong Ji

IPC分类号： G06F15/173 ,  H04L5/12

CPC分类号： G06F9/5016

摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for user-space resource management are described. In one aspect, a method includes receiving in a user memory space kernel resource information from a kernel executing in a kernel memory space, the kernel resource information identifying one or more kernel items in the kernel memory space that depend on kernel resources. The method further includes evaluating one or more resource management policies for one or more of the kernel items. The resource management polices are stored in the user memory space. The method further includes selecting a kernel item to be modified based on the evaluation in order to release some or all of the kernel resources, and communicating a request for modification of the selected kernel item to the kernel.

摘要翻译： 描述了用于用户空间资源管理的方法，系统和装置，包括在计算机存储介质上编码的计算机程序。 一方面，一种方法包括在用户存储器中接收来自在内核存储器空间中执行的内核的内核资源信息，所述内核资源信息识别内核存储器空间中依赖于内核资源的一个或多个内核项。 该方法还包括评估一个或多个内核项目的一个或多个资源管理策略。 资源管理策略存储在用户存储空间中。 该方法还包括基于评估来选择要修改的内核项目，以便释放部分或全部内核资源，以及将所选择的内核项目的修改请求传送给内核。

公开(公告)号：US20110299552A1

公开(公告)日：2011-12-08

申请号：US13102558

申请日：2011-05-06

申请人： Junlan Zhou ,  Zhengrong Ji ,  Yuguang Wu

发明人： Junlan Zhou ,  Zhengrong Ji ,  Yuguang Wu

IPC分类号： H04L12/56

CPC分类号： H04L47/622 ,  H04L43/12 ,  H04L45/00 ,  H04L45/128 ,  H04L45/24

摘要： Aspects of the invention pertain to transmitting packet data across a computer network. The packets may be sent via one or more distinct routes from a source to a destination. Each route may employ multiple routers disposed along the network. Non-colliding routes are determined by transmitting pairs of probe packets along the routes. A first probe packet has a maximal length, and a second probe packet has a minimal length. Depending on the order of arrival of the probe packets, the system determines whether two transport layer ports at the destination device collide. If there is a collision, then the system searches for a set of non-colliding ports. Once the non-colliding ports are determined, application data may be sent as packets along the different routes to those ports.