公开(公告)号：US20060130067A1

公开(公告)日：2006-06-15

申请号：US11011344

申请日：2004-12-14

申请人： Genady Grabarnik ,  Moon Kim ,  Lev Kozakov ,  Sheng Ma

发明人： Genady Grabarnik ,  Moon Kim ,  Lev Kozakov ,  Sheng Ma

IPC分类号： G06F9/46

CPC分类号： G06F9/5083

摘要： Under the present invention, a computer work gradient matrix (hereinafter “matrix”) is developed by applying a set of background loading levels and a set of elemental work increments to a computer system, and then measuring the resource consumption of the computer system based thereon. Task work path(s) are also constructed by applying specific tasks to the computer system at a certain background loading level, and measuring the resource consumption of the computer system over time. Once the matrix and task work path(s) have been provided, they can be used to approximate the resource consumption of the computer system in response to a task applied at any background loading level.

摘要翻译： 在本发明中，通过将一组背景加载级别和一组基本工作增量应用于计算机系统来开发计算机工作梯度矩阵（以下称为“矩阵”），然后基于该方法测量计算机系统的资源消耗 。 任务工作路径也是通过在特定的后台加载级别将特定任务应用到计算机系统，并随时间测量计算机系统的资源消耗来构建的。 一旦提供了矩阵和任务工作路径，它们可用于响应于在任何后台加载级别应用的任务来近似计算机系统的资源消耗。

公开(公告)号：US20070209034A1

公开(公告)日：2007-09-06

申请号：US11365373

申请日：2006-03-01

申请人： Yurdaer Doganata ,  Genady Grabarnik ,  Moon Kim ,  Galina Kofman ,  Lev Kozakov ,  Dikran Meliksetian ,  Larisa Shwartz

发明人： Yurdaer Doganata ,  Genady Grabarnik ,  Moon Kim ,  Galina Kofman ,  Lev Kozakov ,  Dikran Meliksetian ,  Larisa Shwartz

IPC分类号： G06F9/445

CPC分类号： G06F9/505 ,  G06F9/5055 ,  G06F9/548 ,  G06F2209/5017

摘要： Under the present invention, it is determined whether sufficient resources exist for deploying a platform dependent application on its specific “native” platform in a grid environment. If not, a platform dependent portion of the application is identified, and the application is split into the platform dependent portion and a platform independent portion. Thereafter, the platform dependent portion is deployed on its corresponding native platform, while the platform independent portion is deployed on another platform in the grid environment based on available resources. Interconnections between the two portions can then be automatically generated. This can include, for example, creating remote method invocation facade interfaces, creating remote method invocation-enabled facade classes, and building a remote method invocation server for the first platform.

摘要翻译： 在本发明中，确定是否有足够的资源用于在网格环境中的平台相关应用部署其特定的“本地”平台。 如果不是，则识别应用的平台依赖部分，并且将应用程序拆分为平台依赖部分和与平台无关的部分。 此后，平台依赖部分部署在其对应的本机平台上，而平台独立部分基于可用资源部署在网格环境中的另一平台上。 然后可以自动生成两部分之间的互连。 这可以包括例如创建远程方法调用外观接口，创建支持远程方法调用的外观类，以及为第一个平台构建远程方法调用服务器。

公开(公告)号：US20060212512A1

公开(公告)日：2006-09-21

申请号：US11358304

申请日：2006-02-21

申请人： Genady Grabarnik ,  Moon Kim ,  Lev Kozakov ,  Yefim Michlin ,  Larisa Shwartz

发明人： Genady Grabarnik ,  Moon Kim ,  Lev Kozakov ,  Yefim Michlin ,  Larisa Shwartz

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

CPC分类号： H04L67/16

摘要： Under the present invention, a stability and updateability (SUP) ratio for a grid computing environment is generated. Thereafter, a size of a set (e.g., at least one) of scale free graphs for the grid computing environment is estimated. Then, based on at least one predetermined parameter such as a quantity of nodes in the grid computing environment, the set of scale free graphs is actually generated. Based on the set of scale free graphs a set of perturbed scale free graphs is generated. In one example, this may be accomplished using a preferential rewiring technique. This process is repeated for each of the monitoring and discovery services, which will yield at least two sets of perturbed scale free graphs. Using these sets of graphs, a set of monitoring and discovery service (MDS) topology graphs for the grid computing environment will be generated and deployed for optimization.

摘要翻译： 在本发明中，产生了网格计算环境的稳定性和可更新性（SUP）比。 此后，估计用于网格计算环境的一组（例如，至少一个）无规模图形的大小。 然后，基于网格计算环境中的诸如节点数量的至少一个预定参数，实际上生成了无量纲图。 基于无量纲图的集合，生成一组扰动的无量纲图。 在一个示例中，这可以使用优先重新布线技术来实现。 对每个监测和发现服务重复这个过程，这将产生至少两组扰动的无量纲图。 使用这些图表，将生成并部署用于网格计算环境的一组监视和发现服务（MDS）拓扑图，以进行优化。

公开(公告)号：US20060253855A1

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

申请号：US11121828

申请日：2005-05-04

申请人： Genady Grabarnik ,  Moon Kim ,  Lev Kozalov ,  Larisa Shwartz

发明人： Genady Grabarnik ,  Moon Kim ,  Lev Kozalov ,  Larisa Shwartz

IPC分类号： G06F9/46

CPC分类号： G06F11/3447 ,  G06F9/505 ,  G06F9/5072 ,  G06F11/3404 ,  G06F11/3409 ,  G06F11/3414 ,  G06F11/3466 ,  G06F2209/5019

摘要： Under the present invention, a computer work gradient matrix is built for each computer system that is interconnected in an environment. For each computer system for which resource consumption is desired to be predicted (e.g., “target” computer systems), a transition work cocycle is generated and provided to a master computer system. A set of task work paths will be constructed for the master computer system. Thereafter, an initial resource consumption value can be computed on the master computer system based on the computer work gradient matrix and the set of task work paths for the master computer system as well as a current background loading level that is being experienced by the target computer system. Then, using the initial resource consumption and the transition work cocycle for the target computer system(s), a resource consumption of the target computer system(s) can be predicted on the master computer system.

摘要翻译： 根据本发明，为在环境中互连的每个计算机系统构建计算机工作梯度矩阵。 对于期望预测资源消耗的每个计算机系统（例如，“目标”计算机系统）），生成转换工作循环并将其提供给主计算机系统。 将为主计算机系统构建一组任务工作路径。 此后，可以在主计算机系统上基于计算机工作梯度矩阵和主计算机系统的任务工作路径集合以及目标计算机正在经历的当前后台加载水平来计算初始资源消耗值 系统。 然后，使用初始资源消耗和目标计算机系统的转换工作循环，可以在主计算机系统上预测目标计算机系统的资源消耗。

公开(公告)号：US20050223354A1

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

申请号：US10814925

申请日：2004-03-31

申请人： Youssef Drissi ,  Tong-Haing Fin ,  Moon Kim ,  Lev Kozakov ,  Juan Rodriguez

发明人： Youssef Drissi ,  Tong-Haing Fin ,  Moon Kim ,  Lev Kozakov ,  Juan Rodriguez

IPC分类号： G06F9/44

CPC分类号： G06F8/36

摘要： Under the present invention, a best practice violation (BPV) engine resource is first built. This typically occurs by: receiving sets of source code from a plurality of sources; detecting a programming language of each of the sets of source code; extracting code patterns from the sets of source code; defining meta data for each code pattern that indicates a quality thereof; classifying each code pattern; and assigning a rank to each of the code pattern based on it's corresponding meta data as well as a skill level and an experience level of the developer thereof. Once the BPV engine resource is built, it will be used to detect best practice violations in other sets of source code.

摘要翻译： 根据本发明，首先构建最佳实践违规（BPV）引擎资源。 这通常发生在：从多个源接收源代码集合; 检测每个源代码集的编程语言; 从源代码集中提取代码模式; 为表示其质量的每个代码模式定义元数据; 对每个代码模式进行分类; 并且基于其对应的元数据以及其开发者的技能水平和经验水平为每个代码模式分配等级。 一旦构建了BPV引擎资源，它将被用于检测其他源代码集中的最佳实践违规。

公开(公告)号：US20060195688A1

公开(公告)日：2006-08-31

申请号：US11068368

申请日：2005-02-28

申请人： Youssef Drissi ,  Moon Kim ,  Lev Kozakov ,  Dikran Meliksetian ,  Blanche Waddell

发明人： Youssef Drissi ,  Moon Kim ,  Lev Kozakov ,  Dikran Meliksetian ,  Blanche Waddell

IPC分类号： H04L9/00

CPC分类号： H04L63/083 ,  G06F21/6218

摘要： Under the present invention, when an application is deployed, certain information corresponding thereto will be stored in an Enterprise Application Directory (EAD). Thereafter, when an instance of the application is requested (e.g., by a requestor), the information is retrieved from the EAD. In addition, the instance is registered with an Application Access Registry (AAR). Registering the instance involves creating a record in the AAR, generating a unique application access key for the instance, and storing the access key with the information in the record. The access key (and optionally the information) is then returned to the requestor, which can then issue service requests to one or more grid services in the shared computer infrastructure. The service request will include the access key so that the grid service can identify the application by searching for the record in the registry using the access key.

摘要翻译： 在本发明中，当部署应用时，与其对应的某些信息将被存储在企业应用程序目录（EAD）中。 此后，当请求应用的实例（例如，由请求者）时，从EAD检索该信息。 此外，该实例已经向应用程序访问注册表（AAR）注册。 注册实例涉及在AAR中创建记录，为实例生成唯一的应用访问密钥，并将访问密钥与信息存储在记录中。 然后将访问密钥（以及可选的信息）返回给请求者，该请求者然后可以向共享计算机基础设施中的一个或多个网格服务发出服务请求。 服务请求将包括访问密钥，使得网格服务可以使用访问密钥搜索注册表中的记录来识别应用。

公开(公告)号：US20050080806A1

公开(公告)日：2005-04-14

申请号：US10681612

申请日：2003-10-08

申请人： Yurdaer Doganata ,  Youssef Drissi ,  Tong-Haing Fin ,  Jun-Jang Jeng ,  Moon Kim ,  Lev Kozakov

发明人： Yurdaer Doganata ,  Youssef Drissi ,  Tong-Haing Fin ,  Jun-Jang Jeng ,  Moon Kim ,  Lev Kozakov

IPC分类号： G06F17/00

CPC分类号： G06F11/0709 ,  G06F11/079 ,  G06F11/2257 ,  Y10S707/99943

摘要： A method, system, and computer program product for associating events. A provided event dataset includes events occurring in each of N successive time intervals (N≧3). Association rules pertaining to successive events in the event dataset are deduced. Sequences of events are generated from the association rules. Clusters of the sequences of events are formed. Sequences of the clusters are created. The clusters of the sequences may be used: to identify at least one event occurring in a time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; or to predict an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.

摘要翻译： 一种用于关联事件的方法，系统和计算机程序产品。 提供的事件数据集包括在N个连续时间间隔（N> = 3）中发生的事件。 推导出与事件数据集中的连续事件有关的关联规则。 事件序列是从关联规则生成的。 形成事件序列的集群。 创建集群的序列。 可以使用序列的簇：将在N个时间间隔的时间间隔中发生的至少一个事件识别为在N个时间间隔的稍后发生的时间间隔中发生的至少一个事件的可能原因; 或者在N个时间间隔之后的时间间隔中预测至少一个事件的发生，其中至少一个事件发生在N个时间间隔内。

公开(公告)号：US20070294264A1

公开(公告)日：2007-12-20

申请号：US11847365

申请日：2007-08-30

申请人： Roberto Bayardo ,  Yurdaer Doganata ,  Youssef Drissi ,  Tong-Haing Fin ,  Moon Kim ,  Lev Kozakov ,  Juan Rodriguez

发明人： Roberto Bayardo ,  Yurdaer Doganata ,  Youssef Drissi ,  Tong-Haing Fin ,  Moon Kim ,  Lev Kozakov ,  Juan Rodriguez

IPC分类号： G06F17/30

CPC分类号： G06Q10/10 ,  G06F17/30011

摘要： Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

摘要翻译： 根据本发明，源代码可以在对等网络中的节点之间共享。 具体来说，将首先分析要共享的源代码以识别一组代码模式，基于代码模式集合分配一个或多个预定类别，然后选择性地编制索引。 希望在创建新程序时使用以前创建的源代码的开发人员可以根据他/她的工作代码执行与上下文相关的搜索，以识别和检索相关的源代码。

公开(公告)号：US20050234898A1

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

申请号：US11151047

申请日：2005-06-13

申请人： Youssef Drissi ,  Moon Kim ,  Lev Kozakov ,  Juan Leon Rodriguez

发明人： Youssef Drissi ,  Moon Kim ,  Lev Kozakov ,  Juan Leon Rodriguez

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

CPC分类号： G06F17/30669 ,  G06F17/289 ,  G06F17/30622 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99937 ,  Y10S707/99938 ,  Y10S707/99939 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945 ,  Y10S707/99948

摘要： A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.

公开(公告)号：US20120087065A1

公开(公告)日：2012-04-12

申请号：US12899509

申请日：2010-10-06

申请人： Moon Kim ,  Abbas Jamshidi Roudbari ,  Qishan Yu ,  Wei Yao ,  Scott Mullins

发明人： Moon Kim ,  Abbas Jamshidi Roudbari ,  Qishan Yu ,  Wei Yao ,  Scott Mullins

IPC分类号： H05K7/00

CPC分类号： H04B15/02 ,  G06F1/1656 ,  H04B1/40 ,  H04M1/0266

摘要： Electronic devices such as computers and handheld devices are provided. The electronic devices may have electrical components such as displays that are driven by driver circuitry. During operation, the driver circuitry may generate radio-frequency noise. Communications circuitry in the electronic devices may be shielded from the radio-frequency noise by radio-frequency shielding structures. The shielding structures may be mounted on portions of the display module, on a cover glass layer, or on other structures such as housing structures. The radio-frequency shielding structures may be formed from one or more metal segments. The metal segments may run along edges of the display. A device housing may have a ground formed from a conductive peripheral member that runs around peripheral edges of the housing and a conductive plate that is connected to the conductive peripheral member. The radio-frequency shielding structure may be connected to the ground using conductive structures.

摘要翻译： 提供诸如计算机和手持设备之类的电子设备。 电子设备可以具有诸如由驱动器电路驱动的显示器的电气部件。 在操作期间，驱动器电路可能产生无线电频率噪声。 电子设备中的通信电路可以通过射频屏蔽结构屏蔽射频噪声。 屏蔽结构可以安装在显示模块的一部分上，覆盖玻璃层上，或其它结构上，如外壳结构上。 射频屏蔽结构可以由一个或多个金属片段形成。 金属片段可以沿着显示器的边缘延伸。 设备壳体可以具有由围绕壳体的周边边缘延伸的导电周边构件形成的接地和连接到导电周边构件的导电板。 射频屏蔽结构可以使用导电结构连接到地面。