摘要:
A thin film metal alloy magnetic recording disk has an improved protective overcoat that creates a low level of static friction in a contact start/stop disk drive. The disk has an amorphous carbon overcoat containing a transition liquid metal interlayer (TLMI). The carbon overcoat is formed by depositing an initial amorphous carbon layer to a first thickness, then depositing an interlayer material of a low-melting point metal or metal alloy (such as In or In--Nb) while maintaining the temperature of the disk substrate above the melting point of the interlayer material, and then depositing a top additional layer of amorphous carbon. Because the initial carbon layer presents a nonwetting surface, the interlayer material "balls up" on the carbon and forms discontinuous spheres of the interlayer material. The additional top layer of carbon bonds to the initial carbon layer and to the metal or metal alloy spheres. The completed disk protective overcoat presents a continuous but textured surface of amorphous carbon for the head-disk interface in the disk drive.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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).
摘要:
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.
摘要:
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).
摘要:
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.