公开(公告)号：US09605043B2

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

申请号：US14125021

申请日：2012-06-08

Applicant: Hyo Jeong Hong ,  Rohit Singh

Inventor： Hyo Jeong Hong ,  Rohit Singh

IPC: A61K38/18 ,  C07K14/71 ,  C07K14/475 ,  C07K16/28 ,  C07K16/32 ,  C07K14/52 ,  A61K38/17 ,  A61K39/00 ,  A61K38/00

CPC classification number: C07K14/475 ,  A61K38/00 ,  A61K38/179 ,  A61K2039/505 ,  C07K14/52 ,  C07K16/2863 ,  C07K16/32 ,  C07K2317/24 ,  C07K2317/622 ,  C07K2317/73 ,  C07K2319/30 ,  C07K2319/32 ,  A61K2300/00

Abstract: The present invention relates to a fusion protein resulting from the fusion of a cancer-specific antibody and an angiogenesis inhibitor, and relates to an anti-cancer composition including the same. More specifically, in the present invention, it is preferable that the cancer-specific antibody is trastuzumab or a fragment thereof, and the angiogenesis inhibitor is a VEGF-Trap. When the fusion protein according to the present invention is used, there are advantages in that angiogenesis and cancer cell growth can be effectively inhibited as compared to trastuzumab or VEGF-Trap, and side effects can also be reduced.

公开(公告)号：US09262484B2

公开(公告)日：2016-02-16

申请号：US14158936

申请日：2014-01-20

Applicant: Bonnie Berger Leighton ,  Rohit Singh

Inventor： Bonnie Berger Leighton ,  Rohit Singh

IPC: H04W4/02 ,  G06F17/30 ,  H04L12/24

CPC classification number: G06F17/3053 ,  G06F17/30958 ,  H04L41/12 ,  Y10S707/99932

Abstract: A similarity measure is computed between nodes of first and second networks. Sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. A pairwise score is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The process identifies node pairs that exhibit high pairwise values. Preferably, nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of network similarity. If node feature data is available, nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Using the similarity scores, a common subgraph between the first and second networks is computed.

Abstract translation: 在第一和第二网络的节点之间计算相似性度量。 计算成对分数的集合以在各个网络中找到彼此之间良好匹配的节点。 计算第一网络中的节点i和第二网络中的节点j的成对分数。 为每个网络中的每个节点计算类似的成对分数。 该过程识别表现出高成对值的节点对。 优选地，如果节点i和j的邻居是很好的匹配，则它们是很好的匹配。 该技术产生网络相似性的度量。 如果节点特征数据可用，如果节点i和j的邻居是一个很好的匹配（网络相似度），并且它们的节点特征是一个很好的匹配（节点相似度），则它们被认为是一个很好的匹配。 使用相似性分数，计算第一和第二网络之间的公共子图。

公开(公告)号：US20140337365A1

公开(公告)日：2014-11-13

申请号：US14158936

申请日：2014-01-20

Applicant: Bonnie Berger Leighton ,  Rohit Singh

Inventor： Bonnie Berger Leighton ,  Rohit Singh

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06F17/30958 ,  H04L41/12 ,  Y10S707/99932

Abstract: A similarity measure is computed between nodes of first and second networks. Sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. A pairwise score is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The process identifies node pairs that exhibit high pairwise values. Preferably, nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of network similarity. If node feature data is available, nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Using the similarity scores, a common subgraph between the first and second networks is computed.

Abstract translation: 在第一和第二网络的节点之间计算相似性度量。 计算成对分数的集合以在各个网络中找到彼此之间良好匹配的节点。 为第一网络中的节点i和第二网络中的节点j计算成对分数。 为每个网络中的每个节点计算类似的成对分数。 该过程识别表现出高成对值的节点对。 优选地，如果节点i和j的邻居是很好的匹配，则它们是很好的匹配。 该技术产生网络相似性的度量。 如果节点特征数据可用，如果节点i和j的邻居是一个很好的匹配（网络相似度），并且它们的节点特征是一个很好的匹配（节点相似度），则它们被认为是一个很好的匹配。 使用相似性分数，计算第一和第二网络之间的公共子图。

公开(公告)号：US07945591B2

公开(公告)日：2011-05-17

申请号：US11154162

申请日：2005-06-16

Applicant: Arun Kumar ,  Rohit Singh

Inventor： Arun Kumar ,  Rohit Singh

IPC: G06F7/00

CPC classification number: G06F11/3644 ,  G06F8/316 ,  G06F11/3624 ,  G06F11/3636 ,  Y10S707/99942

Abstract: A method, computer program product, and data processing system for efficiently diagnosing errors and inefficiencies in database application code are disclosed. According to a preferred embodiment, techniques of aspect-oriented programming (AOP) are used to instrument database application code to monitor the usage of database resources. Specifically, pointcuts are defined to intercept accesses of database resources. Advice code associated with these pointcuts is used to collect information about the usage of database resources and to detect certain errors, such as resource leaks, when they occur. In a preferred embodiment, the AspectJ aspect-oriented programming language/system is used to define the pointcuts and advice code.

Abstract translation: 公开了一种用于有效诊断数据库应用代码中的错误和低效率的方法，计算机程序产品和数据处理系统。 根据优选实施例，使用面向方面编程（AOP）的技术来编制数据库应用程序代码以监视数据库资源的使用。 具体来说，切入点被定义为拦截数据库资源的访问。 与这些切入点相关联的建议代码用于收集有关数据库资源使用的信息，并在发生资源泄漏时检测某些错误（如资源泄漏）。 在优选实施例中，AspectJ面向方面的编程语言/系统用于定义切入点和建议代码。

公开(公告)号：US07415936B2

公开(公告)日：2008-08-26

申请号：US10877823

申请日：2004-06-25

Applicant: Eskild Storteig ,  Martin Howlid ,  Rohit Singh

Inventor： Eskild Storteig ,  Martin Howlid ,  Rohit Singh

IPC: B63B21/06

CPC classification number: G01V1/3861 ,  B63B21/66 ,  G01V1/3817

Abstract: A seismic survey system includes a winch having a winch cable coupleable to a source array towable between two deflected lead-ins, a positioning system for determining a current position of the source array and a controller for adjusting the winch to modify the current position of the source array to a desired crossline position. The winches may be attached to the deflected lead-ins or mounted on a tow vessel. The winches exert lateral forces on the source array, derived from the deflected lead-ins, to control the inline position of the source array. A method includes positioning a seismic source array in tow behind a vessel comprises determining a current position of the source array and adjusting a lateral force applied to the source array to move the source array to a desired crossline position. Optionally, by adjusting the gun cable winch, the inline position may be controlled.

Abstract translation: 一种地震测量系统包括绞盘，其具有可耦合到可在两个偏转引线之间拖动的源极阵列的绞盘电缆，用于确定源极阵列的当前位置的定位系统和用于调节绞盘以修改绞盘的当前位置的控制器 源阵列到所需的交叉位置。 绞车可以附接到偏转的引线上或安装在拖船上。 绞盘在源极阵列上施加横向力，源自偏转引线，以控制源阵列的在线位置。 一种方法包括将地震源阵列定位在船舶后面，包括确定源阵列的当前位置并调整施加到源阵列的横向力以将源阵列移动到期望的交叉位置。 可选地，通过调整喷枪缆绳绞盘，可以控制在线位置。

公开(公告)号：US20080175097A1

公开(公告)日：2008-07-24

申请号：US10877823

申请日：2004-06-25

Applicant: Eskild Storteig ,  Martin Howlid ,  Rohit Singh

Inventor： Eskild Storteig ,  Martin Howlid ,  Rohit Singh

IPC: G01V1/38

CPC classification number: G01V1/3861 ,  B63B21/66 ,  G01V1/3817

Abstract: A seismic survey system includes a winch having a winch cable coupleable to a source array towable between two deflected lead-ins, a positioning system for determining a current position of the source array and a controller for adjusting the winch to modify the current position of the source array to a desired crossline position. The winches may be attached to the deflected lead-ins or mounted on a tow vessel. The winches exert lateral forces on the source array, derived from the deflected lead-ins, to control the inline position of the source array. A method includes positioning a seismic source array in tow behind a vessel comprises determining a current position of the source array and adjusting a lateral force applied to the source array to move the source array to a desired crossline position. Optionally, by adjusting the gun cable winch, the inline position may be controlled.

公开(公告)号：US20140213769A1

公开(公告)日：2014-07-31

申请号：US14125021

申请日：2012-06-08

Applicant: Hyo Jeong Hong ,  Rohit Singh

Inventor： Hyo Jeong Hong ,  Rohit Singh

IPC: C07K14/475 ,  C07K16/28

CPC classification number: C07K14/475 ,  A61K38/00 ,  A61K38/179 ,  A61K2039/505 ,  C07K14/52 ,  C07K16/2863 ,  C07K16/32 ,  C07K2317/24 ,  C07K2317/622 ,  C07K2317/73 ,  C07K2319/30 ,  C07K2319/32 ,  A61K2300/00

Abstract: The present invention relates to a fusion protein resulting from the fusion of a cancer-specific antibody and an angiogenesis inhibitor, and relates to an anti-cancer composition including the same. More specifically, in the present invention, it is preferable that the cancer-specific antibody is trastuzumab or a fragment thereof, and the angiogenesis inhibitor is a VEGF-Trap. When the fusion protein according to the present invention is used, there are advantages in that angiogenesis and cancer cell growth can be effectively inhibited as compared to trastuzumab or VEGF-Trap, and side effects can also be reduced.

Abstract translation: 本发明涉及由癌特异性抗体与血管生成抑制剂融合而产生的融合蛋白质，涉及包含其的抗癌组合物。 更具体地，在本发明中，癌特异性抗体优选为曲妥珠单抗或其片段，血管发生抑制剂为VEGF-Trap。 当使用根据本发明的融合蛋白时，具有与曲妥单抗或VEGF-Trap相比可以有效抑制血管发生和癌细胞生长的优点，并且还可以降低副作用。

公开(公告)号：US20110302127A1

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

申请号：US13209983

申请日：2011-08-15

Applicant: Bonnie Berger Leighton ,  Rohit Singh

Inventor： Bonnie Berger Leighton ,  Rohit Singh

IPC: G06N5/02

CPC classification number: G06F17/3053 ,  G06F17/30958 ,  H04L41/12 ,  Y10S707/99932

Abstract: A method of computing a measure of similarity between nodes of first and second networks is described. In particular, sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. Thus, a pairwise score, referred to as Rij, is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The goal of this process is to identify node pairs that exhibit high Rij values. According to the technique described herein, the intuition is that nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of “network similarity.” If node feature data also is available, the intuition may be expanded such that nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Node feature data typically is domain-specific. Using the similarity scores, a common subgraph between the first and second networks then can be computed.

Abstract translation: 描述了计算第一和第二网络的节点之间的相似性度量的方法。 特别地，计算成对分数集合以找到彼此良好匹配的各个网络中的节点。 因此，对于第一网络中的节点i和第二网络中的节点j计算称为Rij的成对分数。 为每个网络中的每个节点计算类似的成对分数。 该过程的目标是识别表现出高Rij值的节点对。 根据本文描述的技术，直觉是如果它们的邻居是好的匹配，则节点i和j是很好的匹配。 如果节点特征数据也可用，则可以扩展直觉，使得节点i和j如果它们的邻居是良好的匹配（网络相似度）和它们的节点特征，则被认为是一个很好的匹配 是一个很好的匹配（节点相似度）。 节点特征数据通常是域特定的。 使用相似性分数，则可以计算第一和第二网络之间的公共子图。

公开(公告)号：US08000262B2

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

申请号：US12105815

申请日：2008-04-18

Applicant: Bonnie Berger Leighton ,  Rohit Singh

Inventor： Bonnie Berger Leighton ,  Rohit Singh

IPC: H04L12/28

CPC classification number: G06F17/3053 ,  G06F17/30958 ,  H04L41/12 ,  Y10S707/99932

Abstract: A method of computing a measure of similarity between nodes of first and second networks is described. In particular, sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. Thus, a pairwise score, referred to as Rij, is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The goal of this process is to identify node pairs that exhibit high Rij values. According to the technique described herein, the intuition is that nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of “network similarity.” If node feature data also is available, the intuition may be expanded such that nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Node feature data typically is domain-specific. Using the similarity scores, a common subgraph between the first and second networks then can be computed.

公开(公告)号：US07574698B2

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

申请号：US11154161

申请日：2005-06-16

Applicant: Arun Kumar ,  Rohit Singh

Inventor： Arun Kumar ,  Rohit Singh

IPC: G06F9/44 ,  G06F15/16 ,  G06F11/00

CPC classification number: G06F8/316

Abstract: A method, computer program product, and data processing system for detecting and identifying data crossover errors in servlet code are disclosed. According to a preferred embodiment, techniques of aspect-oriented programming (AOP) are used to instrument JAVA Servlet code to detect potential data crossover errors. Specifically, pointcuts are defined to intercept both the association follow an object with a particular session and the “getting” and “setting” of such objects. Advice code associated with these pointcuts is used to update and/or consult a “collator” data structure, which is used to determine if an object or variable associated with one session is being accessed by a different session. In a preferred embodiment, the AspectJ aspect-oriented programming language/system is used to define the pointcuts and advice code.

Abstract translation: 公开了一种用于检测和识别servlet码中的数据交叉错误的方法，计算机程序产品和数据处理系统。 根据优选实施例，面向方面的编程（AOP）的技术用于测试JAVA Servlet代码以检测潜在的数据交叉错误。 具体来说，切点被定义为截取对象与特定会话的关联以及这些对象的“获取”和“设置”。 与这些切入点相关联的咨询代码用于更新和/或查阅“整理器”数据结构，其用于确定与一个会话相关联的对象或变量是否被不同会话访问。 在优选实施例中，AspectJ面向方面的编程语言/系统用于定义切入点和建议代码。