公开(公告)号：US20170273283A1

公开(公告)日：2017-09-28

申请号：US15083269

申请日：2016-03-28

Applicant: Rui HOU ,  Yuwei WANG ,  Huifang LIANG ,  Zhanguo ZHANG ,  Zhimin LIU ,  Binhao ZHANG ,  Bixiang ZHANG ,  Xiaoping CHEN

Inventor： Rui HOU ,  Yuwei WANG ,  Huifang LIANG ,  Zhanguo ZHANG ,  Zhimin LIU ,  Binhao ZHANG ,  Bixiang ZHANG ,  Xiaoping CHEN

IPC: A01K67/027 ,  C12N9/02 ,  C12N5/09

CPC classification number: A01K67/0271 ,  A01K2207/12 ,  A01K2227/105 ,  A01K2267/0331 ,  C12N5/0693 ,  C12N9/0069 ,  C12Y113/12007

Abstract: A method for establishing an animal model of hepatocellular carcinoma (HCC) bone metastasis, the method including: 1) establishing 97H and LM3 cell clones with stable expression of firefly luciferase (LUC); 2) allowing HCC cells to form bone metastasis in nude mice via intratibial injection; 3) reproducing HCC bone metastasis in nude mice via intracardiac injection of tumor cells; and 4) isolating a sub-population of tumor cells that targets metastasis to bone. The 97H and the LM3 are highly metastatic HCC cell lines transfected with luciferase gene. BALB/cA-nu mice are 4-5 weeks old and maintained in laminar flow cabinets under SPF conditions and received human care throughout an entire study. A cell number for intratibial injection is 0.5×106, and a cell number for intracardiac injection is 1×106.

公开(公告)号：US20170239273A1

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

申请号：US15505540

申请日：2015-08-22

Applicant: Kang ZHANG ,  Stanley KIM ,  Jie ZHU ,  Rui HOU ,  J Jefferson PERRY

Inventor： Kang ZHANG ,  Stanley KIM ,  Jie ZHU ,  Rui HOU ,  J Jefferson PERRY

IPC: A61K31/575 ,  A61K9/00 ,  A61K47/40

CPC classification number: A61K31/575 ,  A61K9/0048 ,  A61K31/404 ,  A61K31/58 ,  A61K47/40 ,  C07J9/00 ,  C07J43/003

Abstract: The disclosure generally relates to compositions and uses thereof to treat vision disorders that affect the normal function of the lens in the eye in a subject having or at risk of developing such vision disorders.

公开(公告)号：US08943482B2

公开(公告)日：2015-01-27

申请号：US12467011

申请日：2009-05-15

Applicant: Henrique Andrade ,  Bugra Gedik ,  Rui Hou ,  Hua Yong Wang ,  Kun-Lung Wu

Inventor： Henrique Andrade ,  Bugra Gedik ,  Rui Hou ,  Hua Yong Wang ,  Kun-Lung Wu

IPC: G06F9/45 ,  G06F9/44 ,  G06F9/445

CPC classification number: G06F8/71 ,  G06F8/10 ,  G06F8/30 ,  G06F8/60 ,  G06F8/70

Abstract: One embodiment of a method for constructing executable code for a component-based application includes receiving a request to compile source code for the component-based application, wherein the request identifies the source code, and wherein the source code comprises a plurality of source code components, each of the source code components implementing a different component of the application, and performing a series of steps for each source code component where the series of steps includes: deriving a signature for the source code component, retrieving a stored signature corresponding to a currently available instance of executable code for the source code component, comparing the derived signature with the stored signature, compiling the source code component into the executable code when the derived signature does not match the stored signature, and obtaining the executable code for the source code component from a repository when the derived signature matches the stored signature.

Abstract translation: 一种用于构建用于基于组件的应用的可执行代码的方法的一个实施例包括：接收针对所述基于组件的应用编译源代码的请求，其中所述请求标识所述源代码，并且其中所述源代码包括多个源代码组件 每个源代码组件实现应用程序的不同组件，并为每个源代码组件执行一系列步骤，其中该系列步骤包括：导出源代码组件的签名，检索与当前的对应的存储的签名 用于源代码组件的可执行代码的可用实例，将导出的签名与存储的签名进行比较，当派生的签名与存储的签名不匹配时，将源代码组件编译成可执行代码，以及获得源代码组件的可执行代码 当派生签名与存储的签名匹配时，从存储库中获取。

公开(公告)号：US08578377B2

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

申请号：US13165926

申请日：2011-06-22

Applicant: Yi Ge ,  Rui Hou ,  Wu Yu Hui ,  Liang Liu ,  Wei Liu

Inventor： Yi Ge ,  Rui Hou ,  Wu Yu Hui ,  Liang Liu ,  Wei Liu

IPC: G06F9/455

CPC classification number: G06F9/45558 ,  G06F9/4856 ,  G06F9/5077 ,  G06F2009/4557

Abstract: A computer-implemented method, an accelerator hardware unit, and an article of manufacture for supporting virtual machine migration. The method includes: acquiring a task request from a task queue of an accelerator hardware unit; extracting identification information of a related virtual machine from the task request; determining whether the identification information of the related virtual machine matches the identification information of a virtual machine to be migrated, where the identification information of a virtual machine to be migrated is recorded in a virtual machine identification information table; and deleting the task request from the task queue if the extracted identification information matches the identification information of a virtual machine to be migrated.

Abstract translation: 一种计算机实现的方法，加速器硬件单元和用于支持虚拟机迁移的制品。 该方法包括：从加速器硬件单元的任务队列获取任务请求; 从所述任务请求提取相关虚拟机的识别信息; 确定所述相关虚拟机的识别信息是否与要迁移的虚拟机的识别信息相匹配，其中要迁移的虚拟机的识别信息被记录在虚拟机识别信息表中; 以及如果所提取的标识信息与要迁移的虚拟机的标识信息匹配，则从任务队列中删除任务请求。

公开(公告)号：US08544415B2

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

申请号：US13257746

申请日：2010-06-12

Applicant: Zhenmin Bao ,  Shan Wang ,  Ning Li ,  Jingjie Hu ,  Rui Hou ,  Xiaoliang Ren ,  Xiaoli Hu ,  Wei Lu

Inventor： Zhenmin Bao ,  Shan Wang ,  Ning Li ,  Jingjie Hu ,  Rui Hou ,  Xiaoliang Ren ,  Xiaoli Hu ,  Wei Lu

IPC: A01K61/00

CPC classification number: A01K61/54 ,  Y02A40/822

Abstract: The present invention relates to a method in the field of shellfish breeding techniques, for breeding a scallop population that have improved carotenoid content in the orange-red adductor muscles or other muscle tissues. This method includes the steps of selecting the rare individuals that have orange-red adductor muscles from natural scallop populations, growing the selected scallops, inducing the reproduction, artificially fertilization, and finally breeding a scallop population with orange-red adductor muscles which can be expanded for the cultivation on a large scale. Comparing to other known breeding methods, the present method does not use transgenic technologies to include introduce any exogenous genes, thus does not have any bio-safety and ethics issues. All the mutant scallops with orange-red adductor muscles are selected from natural or cultivated populations. After breeding for four generations, the obtained scallops have abundant carotenoid ingredients in their orange-red adductor muscles. The obtained scallop population is genetically stable and has high survival rate, and it thus can be used for cultivation on a large scale. In summary, this breeding method is simple, low cost and the breeding scallop population has high economic and nutritious values.

Abstract translation: 本发明涉及一种贝类育种技术领域的方法，用于培育在橙红色的内收肌或其他肌肉组织中具有改善的类胡萝卜素含量的扇贝群体。 该方法包括以下步骤：从天然扇贝种群中选出具有橙红色内收肌的罕见个体，生长所选择的扇贝，诱导繁殖，人为受精，并最终培育具有橙红色内收肌的扇贝种群，其可扩展 用于大规模种植。 与其他已知的育种方法相比，本方法不使用转基因技术来引入任何外源基因，因此没有任何生物安全和伦理问题。 所有具有橙红色内收肌的突变体扇贝都选自天然或栽培种群。 经过四代繁殖后，获得的扇贝在其橙红色的内收肌中具有丰富的类胡萝卜素成分。 获得的扇贝种群基因稳定，存活率高，可大规模种植。 总之，这种育种方法简单，成本低，养殖扇贝种群具有较高的经济和营养价值。

公开(公告)号：US08490098B2

公开(公告)日：2013-07-16

申请号：US12348933

申请日：2009-01-06

Applicant: Ying Chen ,  Yi Ge ,  Rui Hou ,  Liang Liu ,  Xiao Zhong

Inventor： Ying Chen ,  Yi Ge ,  Rui Hou ,  Liang Liu ,  Xiao Zhong

IPC: G06F9/46

CPC classification number: G06F9/4881 ,  G06F2209/484

Abstract: A method and an apparatus for concomitance scheduling a work thread and assistant threads associated with the work thread in a multi-threading processor system. The method includes: searching one or more assistant threads associated with the running of the work thread when preparing to run/schedule the work thread; running the one or more assistant threads that are searched; and running the work thread after all of the one or more assistant threads associated with the running of the work thread have run.

Abstract translation: 一种用于在多线程处理器系统中调度工作线程和与工作线程相关联的辅助线程的方法和装置。 该方法包括：在准备运行/调度工作线程时，搜索与工作线程的运行相关联的一个或多个辅助线程; 运行所搜索的一个或多个辅助线程; 并且在运行与工作线程的运行相关联的所有一个或多个辅助线程之后运行工作线程。

公开(公告)号：US08447951B2

公开(公告)日：2013-05-21

申请号：US12725513

申请日：2010-03-17

Applicant: Xiao Tao Chang ,  Rui Hou ,  Wei Liu ,  Kun Wang

Inventor： Xiao Tao Chang ,  Rui Hou ,  Wei Liu ,  Kun Wang

IPC: G06F12/00 ,  G06F12/10

CPC classification number: G06F12/1036 ,  G06F12/109

Abstract: An apparatus and method for managing a translation look-aside buffer (TLB). The TLB is shared by a plurality of jobs. The method including the steps of: obtaining at least one attribute of each job of the plurality of jobs; assigning a priority level to each job according to at least one attribute of each job; and managing the related TLB entries of each job according to the priority level of each job. The present invention also provides an apparatus for managing TLB corresponding to the above method. The method and apparatus according to the present invention provide an efficient use of the shared TLB.

Abstract translation: 一种用于管理翻译后备缓冲器（TLB）的装置和方法。 TLB由多个作业共享。 该方法包括以下步骤：获得多个作业的每个作业的至少一个属性; 根据每个作业的至少一个属性为每个作业分配优先级; 并根据每个作业的优先级来管理每个作业的相关TLB条目。 本发明还提供了一种用于管理对应于上述方法的TLB的装置。 根据本发明的方法和装置提供了共享TLB的有效使用。

公开(公告)号：US20130013549A1

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

申请号：US13606763

申请日：2012-09-07

Applicant: XIAO T. CHANG ,  BUGRA GEDIK ,  RUI HOU ,  KUN WANG ,  QIONG ZOU

Inventor： XIAO T. CHANG ,  BUGRA GEDIK ,  RUI HOU ,  KUN WANG ,  QIONG ZOU

IPC: G06N5/02

CPC classification number: G06Q30/0251 ,  G06Q30/0269 ,  G06Q50/01

Abstract: A method and apparatus are provided for hardware-assisted local triangle counting in a graph. The method includes converting vertex relationships of the graph into rule patterns. The method also includes compiling the rule patterns into a binary file, wherein the rule patterns are organized into a finite state machine. The method further includes loading at least a part of the binary file and a search string to be compared there against into a hardware pattern matching accelerator. The method additionally includes receiving a number of matching outputs from the pattern matching accelerator.

Abstract translation: 在图中提供了用于硬件辅助的局部三角形计数的方法和装置。 该方法包括将图的顶点关系转换成规则模式。 该方法还包括将规则模式编译成二进制文件，其中规则模式被组织成有限状态机。 该方法还包括将二进制文件的至少一部分和要在其中比较的搜索字符串加载到硬件模式匹配加速器中。 该方法还包括从模式匹配加速器接收多个匹配输出。

公开(公告)号：US20130013534A1

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

申请号：US13178181

申请日：2011-07-07

Applicant: XIAO T. CHANG ,  BUGRA GEDIK ,  RUI HOU ,  KUN WANG ,  QIONG ZOU

Inventor： XIAO T. CHANG ,  BUGRA GEDIK ,  RUI HOU ,  KUN WANG ,  QIONG ZOU

IPC: G06F15/18

CPC classification number: G06Q30/0251 ,  G06Q30/0269 ,  G06Q50/01

Abstract: A method and apparatus are provided for hardware-assisted local triangle counting in a graph. The method includes converting vertex relationships of the graph into rule patterns. The method also includes compiling the rule patterns into a binary file, wherein the rule patterns are organized into a finite state machine. The method further includes loading at least a part of the binary file and a search string to be compared there against into a hardware pattern matching accelerator. The method additionally includes receiving a number of matching outputs from the pattern matching accelerator.

公开(公告)号：US20110246667A1

公开(公告)日：2011-10-06

申请号：US13074121

申请日：2011-03-29

Applicant: Xiao Tao Chang ,  Rui Hou ,  Wei Liu ,  Kun Wang ,  Yu Zhang

Inventor： Xiao Tao Chang ,  Rui Hou ,  Wei Liu ,  Kun Wang ,  Yu Zhang

IPC: G06F15/16

CPC classification number: G06F12/0806 ,  G06F12/0879 ,  G06F15/167 ,  G06F15/7807 ,  Y02D10/12 ,  Y02D10/13

Abstract: A processing unit coupled to a bus for accelerating data transmission and a method for accelerating data transmission. The present invention provides a streaming data transmission mode in which a plurality of data blocks are transmitted via one handshake. The present invention employs handshake save policy, when a processing unit sends a request comprising a plurality of data blocks on a bus, a cache or memory will perform address matching to judge whether there is any hit data block. If there is any hit data block, the cache or memory only needs to reply once and then start to continuously transmit the hit data blocks it possesses. Thus, a separate handshake for each data block is no longer needed.

Abstract translation: 耦合到总线用于加速数据传输的处理单元和加速数据传输的方法。 本发明提供一种流式数据传输模式，其中通过一个握手传送多个数据块。 本发明采用握手保存策略，当处理单元在总线上发送包括多个数据块的请求时，高速缓存或存储器将执行地址匹配以判断是否存在命中数据块。 如果有任何命中数据块，高速缓存或存储器只需要回复一次，然后开始连续发送它拥有的命中数据块。 因此，不再需要每个数据块的单独握手。