-
公开(公告)号：US20130318111A1
公开(公告)日：2013-11-28
申请号：US13480835
申请日：2012-05-25
IPC分类号： G06F19/00
摘要： A system facilitates management of public health data. The system includes an input interface, a policy data structure, a notification compliance engine, and a data translator. The input interface receives input data content descriptive of a public health event. The policy data structure stores reporting conditions for a plurality of public health jurisdictions. The notification compliance engine reviews at least some of the reporting conditions of the policy data structure and identifies a relevant reporting condition for the input data content. The data translator derives and arranges output data content based on the input data content according to the relevant reporting condition identified by the notification compliance engine.
摘要翻译： 系统便于管理公共卫生数据。 该系统包括输入接口，策略数据结构，通知合规引擎和数据转换器。 输入界面接收描述公共卫生事件的输入数据内容。 政策数据结构存储多个公共卫生管辖区的报告条件。 通知合规引擎至少回顾了政策数据结构的一些报告条件，并确定了输入数据内容的相关报告条件。 数据转换器根据通知合规引擎识别的相关报告条件，根据输入数据内容导出和排列输出数据内容。
-
公开(公告)号：US09043345B2
公开(公告)日：2015-05-26
申请号：US13480835
申请日：2012-05-25
摘要： A system facilitates management of public health data. The system includes an input interface, a policy data structure, a notification compliance engine, and a data translator. The input interface receives input data content descriptive of a public health event. The policy data structure stores reporting conditions for a plurality of public health jurisdictions. The notification compliance engine reviews at least some of the reporting conditions of the policy data structure and identifies a relevant reporting condition for the input data content. The data translator derives and arranges output data content based on the input data content according to the relevant reporting condition identified by the notification compliance engine.
摘要翻译： 系统便于管理公共卫生数据。 该系统包括输入接口，策略数据结构，通知合规引擎和数据转换器。 输入界面接收描述公共卫生事件的输入数据内容。 政策数据结构存储多个公共卫生管辖区的报告条件。 通知合规引擎至少回顾了政策数据结构的一些报告条件，并确定了输入数据内容的相关报告条件。 数据转换器根据通知合规引擎识别的相关报告条件，根据输入数据内容导出和排列输出数据内容。
-
3.发明授权Efficient super cluster implementation for solving connected problems in a distributed environment 失效有效的超级群集实现，用于解决分布式环境中的连接问题公开(公告)号：US08090762B2
公开(公告)日：2012-01-03
申请号：US11329263
申请日：2006-01-10
IPC分类号： G06F15/16 , G06F15/163
CPC分类号： G06F9/5066
摘要： Embodiments herein present a system, method, etc. for an efficient super cluster implementation for solving connected problems in a distributed environment. More specifically, the system adapts computing latency to communication latency, wherein the system comprises VPPs wrapped within OCW layers. The VPPs represent a subset of an overall computer task; and, the OCW layers are adapted to enclose the VPPs. Specifically, the number of OCWs that enclose a VPP correspond to the number of computing iterations that may be locally executed by the VPP during an inter-VPP communication cycle. In addition, each VPP comprises collections of OPCs, wherein the OPCs comprise data, methods, and pointers to neighbors. The OPCs are indexed separately based on whether the OPC is part of an OCW layer.
摘要翻译： 本文的实施例提出了用于解决分布式环境中的连接问题的有效的超群集实现的系统，方法等。 更具体地，系统将计算延迟适应于通信等待时间，其中系统包括包含在OCW层内的VPP。 VPP代表整个计算机任务的一个子集; 并且，OCW层适于包围VPP。 具体地，包围VPP的OCW的数量对应于在VPP通信周期期间由VPP本地执行的计算迭代次数。 另外，每个VPP包括OPC集合，其中OPC包括数据，方法和指向邻居的指针。 OPC是根据OPC是否是OCW层的一部分分开索引。
-
公开(公告)号：US07027995B2
公开(公告)日：2006-04-11
申请号：US09870656
申请日：2001-06-01
申请人： James H. Kaufman , Joann Ruvolo
发明人： James H. Kaufman , Joann Ruvolo
IPC分类号： G06Q90/00
CPC分类号： G06Q10/109 , G06Q10/0631
摘要： A global positioning system (GPS) is used to detect locations (dynamic locations) associated with meeting participants and the proximity between participants is used to create one or more location clusters. Next, the availability of suitable meeting locations (static locations) are identified and an optimum meeting location, given the participant clusters and their proximity to the available meeting locations, is determined. Additionally, the center of mass associated with each of the clusters is also used to determine optimal meeting locations. Lastly, participants are notified regarding the optimized location for the meeting.
-
公开(公告)号：US06515857B2
公开(公告)日：2003-02-04
申请号：US09858751
申请日：2001-05-15
IPC分类号： G06F120
CPC分类号： G06F1/203
摘要： Attractive heat sinks are used to cool the central processing unit and other solid state electronic components in electronic devices such as computers. In preferred embodiments, heat sinks snap onto one or both sides of a laptop computer to provide cooling. The heat sinks may consist of one or more sealed tubes of various cross sections containing a fluid mixture or solution. Preferred embodiments of the heat sinks rely on the principle of Rayleigh-Benard convection to provide a visually attractive “bubble lamp” display, “glitter lamp” display, or other convective fluid lamp display.
摘要翻译： 有吸引力的散热器用于冷却电子设备（如计算机）中的中央处理单元和其他固态电子元件。 在优选实施例中，散热器卡在笔记本电脑的一侧或两侧以提供冷却。 散热器可由包含流体混合物或溶液的各种横截面的一个或多个密封管组成。 散热器的优选实施例依赖于瑞利 - 贝纳德对流的原理来提供视觉吸引人的“气泡灯”显示器，“闪光灯”显示器或其它对流液体灯显示器。
-
6.发明授权Distributing and geographically load balancing location aware communication device client-proxy applications 有权分布和地理位置负载平衡位置感知通信设备客户端 - 代理应用程序公开(公告)号：US07702784B2
公开(公告)日：2010-04-20
申请号：US12172473
申请日：2008-07-14
申请人： Viktors Berstis , John Daniel Sieron Bethencourt , Kevin Blake Damm , Robert Glenn Deen , Matthew Hammer , James H. Kaufman , Tobin J. Lehman
发明人： Viktors Berstis , John Daniel Sieron Bethencourt , Kevin Blake Damm , Robert Glenn Deen , Matthew Hammer , James H. Kaufman , Tobin J. Lehman
IPC分类号： G06F15/173
CPC分类号： G06F9/5083 , G06F9/5061 , G06F9/5077 , H04L67/1002 , H04L67/1008 , H04L67/1012 , H04L67/1021 , H04L67/1029 , H04L67/18 , H04W4/02
摘要： A method and system for balancing server work load for cellular phone client-proxy applications in an environment where the clients change position within a given geographic area is disclosed. The method comprises the steps of mapping, monitoring, automatically re-mapping the system when required, updating a map address book, and updating a client address book. The system has a mapping system and a communication system connected to a plurality of servers, proxy servers and applications by an internal network. The proxy servers are connected to a plurality of clients by the Internet. If a threshold is exceeded, the monitoring program sends a message to a mapping program. Upon receipt of the message, the mapping program uses a rules engine to calculate a new map graph to remove load from an overloaded server (or servers) and to adjust communication requirements for data by reconfiguring partitions.
摘要翻译： 公开了一种用于在客户端改变给定地理区域内的位置的环境中平衡蜂窝电话客户端 - 代理应用的服务器工作负载的方法和系统。 该方法包括以下步骤：在需要时映射，监控，自动重新映射系统，更新地图地址簿，更新客户端地址簿。 该系统具有映射系统和通过内部网络连接到多个服务器，代理服务器和应用的通信系统。 代理服务器通过因特网连接到多个客户端。 如果超过阈值，则监视程序向映射程序发送消息。 在收到消息后，映射程序使用规则引擎来计算新的映射图，以从过载的服务器（或服务器）中删除负载，并通过重新配置分区来调整数据的通信要求。
-
7.发明申请SYSTEM AND METHOD FOR AUTOMATICALLY SEGMENTING AND POPULATING A DISTRIBUTED COMPUTING PROBLEM 失效自动分类和分配分布式计算问题的系统和方法公开(公告)号：US20080301405A1
公开(公告)日：2008-12-04
申请号：US12191483
申请日：2008-08-14
申请人： James H. Kaufman , Tobin Jon Lehman
发明人： James H. Kaufman , Tobin Jon Lehman
CPC分类号： G06F17/5018
摘要： The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).
摘要翻译： 分布式计算问题的初始划分可能是至关重要的，并且通常是用户的烦恼的来源。 提供了一种基于所指定的问题的复杂性以及可用于整个作业的各种口径的计算代理的组合，将问题自动地将问题分解成原始程序单元（OPC）的固定大小的集合。 位于集合边缘的OPC可与相邻集合边缘的OPC通信，并与集合“核心”或内部非边缘部分内的OPC分开索引。 因此，核心OPC可以独立于迭代集合和集合集（VPP）之间的任何通信。 边缘上的所有OPC都具有与远程信息（即它们的邻居都在相邻集合的相同边缘上）的公共依赖关系。
-
8.发明授权System and method for automatically segmenting and populating a distributed computing problem 失效用于自动分段和填充分布式计算问题的系统和方法公开(公告)号：US08606844B2
公开(公告)日：2013-12-10
申请号：US12191483
申请日：2008-08-14
申请人： James H. Kaufman , Tobin Jon Lehman
发明人： James H. Kaufman , Tobin Jon Lehman
CPC分类号： G06F17/5018
摘要： The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).
摘要翻译： 分布式计算问题的初始划分可能是至关重要的，并且通常是用户的烦恼的来源。 提供了一种基于所指定的问题的复杂性以及可用于整个作业的各种口径的计算代理的组合，将问题自动地将问题分解成原始程序单元（OPC）的固定大小的集合。 位于集合边缘的OPC可与相邻集合边缘的OPC通信，并与集合“核心”或内部非边缘部分内的OPC分开索引。 因此，核心OPC可以独立于迭代集合和集合集（VPP）之间的任何通信。 边缘上的所有OPC都具有与远程信息（即它们的邻居都在相邻集合的相同边缘上）的公共依赖关系。
-
9.发明授权System and method for balancing a computing load among computing resources in a distributed computing problem 失效用于在分布式计算问题中平衡计算资源之间的计算负载的系统和方法公开(公告)号：US07590984B2
公开(公告)日：2009-09-15
申请号：US10448625
申请日：2003-05-29
申请人： James H. Kaufman , Tobin Jon Lehman
发明人： James H. Kaufman , Tobin Jon Lehman
IPC分类号： G06F9/46
CPC分类号： G06F9/5066
摘要： A distributed parallel computing system actively takes advantage of problem partitioning to balance the computing load among computing resources continually during processing. Variable problem partitions (VPPs) are initially defined as groups of original problem cells (OPCs). VPPs may be redefined and redistributed during execution, if necessary, to optimize performance based on the actual computing agent parameters and costs observed or reported through self-tests. For example, a good rule for efficient execution of a computing problem may be that the time required to perform a computation sequence (iteration) of all OPCs in a VPP should be comparable to the time required to share results via edge OPCs at the VPP collection perimeters. The rules that yield cost-efficient execution may be saved and re-used to generate initial partitionings for subsequent computing problem execution runs.
摘要翻译： 分布式并行计算系统积极利用问题划分，在处理过程中不断平衡计算资源之间的计算负担。 可变问题分区（VPPs）最初被定义为原始问题单元（OPC）的组。 如果需要，可以在执行期间重新定义和重新分配VPP，以根据实际的计算代理参数和通过自检来观察或报告的成本优化性能。 例如，有效执行计算问题的一个好的规则可能是执行VPP中所有OPC的计算序列（迭代）所需的时间应该与VPP集合上的边缘OPC共享结果所需的时间相当 周长 可以保存产生成本效益的执行的规则，并重新使用这些规则来生成用于后续计算问题执行运行的初始分区。
-
公开(公告)号：US07467180B2
公开(公告)日：2008-12-16
申请号：US10448949
申请日：2003-05-29
申请人： James H. Kaufman , Tobin Jon Lehman
发明人： James H. Kaufman , Tobin Jon Lehman
IPC分类号： G06F15/16
CPC分类号： G06F17/5018
摘要： A method is described for automatically segmenting and populating a distributed problem, including determining a bounding space that is at least equal in size to a problem space volume, partitioning the bounding space into a plurality of sub-spaces capable of holding collections of original problem cells, mapping the distributed problem into the partitioned bounding space to populate the sub-spaces with data from the problem, and determining boundaries between the sub-spaces. The method further includes determining coupling interdependencies between sub-spaces, determining complexities associated with boundaries, calculating densities of the data from the problem, and if the densities of two or more contiguous collections fall below a lower level threshold, dynamically joining the two or more contiguous collections, if a particular collection density exceeds an upper threshold, dynamically subdividing the particular collection into a finer granularity, and processing the problem based on the boundaries, the coupling interdependencies, the complexities, and the densities.
摘要翻译： 描述了一种用于自动分割和填充分布式问题的方法，包括确定与问题空间体积大小至少相等的边界空间，将边界空间划分成能够保存原始问题单元的集合的多个子空间 将分布式问题映射到分区边界空间中，以便从问题的数据中填充子空间，并确定子空间之间的边界。 该方法还包括确定子空间之间的耦合相互依赖性，确定与边界相关联的复杂性，计算来自问题的数据的密度，以及如果两个或更多个连续集合的密度落入低于下限阈值，则动态地连接两个或多个 连续集合，如果特定集合密度超过上限阈值，则将特定集合动态细分为更精细的粒度，并且基于边界，耦合相互依赖性，复杂性和密度来处理该问题。
-
-
-
-
-
-
-
-
-
搜索结果
19 条记录 (耗时 0.026 秒)
