Abstract: Apparatus and methods are disclosed for optimizing the transfer time of files in a peer-to-peer network. In disclosed embodiments, a requesting peer desires to transfer a file from a group of supplying peers creates a list of segments available of the file to be transferred available from each of the supplying peers, and orders the list in order of increasing segment size available. The supplying peers are then grouped based on available segments. Then, beginning with the group of supplying peers having the largest portion of the file to be transferred, the requesting peer assigning segments to transfer and a corresponding transfer time to each of the members of the group of supplying peers. The requesting peer then transfers in parallel the assigned segments from the group of supplying peers.

Abstract: Techniques for presenting a key to a human across a human-machine interface include receiving key data that indicates a key to be input to a target process. The key is reversibly converted to a first human-language statement. The human language statement is designed so that multiple variations in the human-language statement due to common human errors can be correctly reversed to regenerate the key data. The common human-language statement is presented to a human user for use in the target process. After receiving input data that indicates a second human language statement based on human memory of the first human language statement, the second human language statement is corrected for common human language errors. The corrected second human language statement is then converted to second key data and sent to the target process. Thus multiple human inputs are accepted and correctly converted to the key for the target process.

Abstract: Methods and apparatus for weighing an article, such as a mail piece, while the article is moving at high speed, and for checking that the correct amount of postage has been paid for delivery of the article. An article (900) is received from an intake transport (1200), and gripped in a weighing station (1310), in between a capstan roller and a pinch roller (1316), which are synchronized to minimize slipping. A first precision closed-loop servo system (1252, 1250) alters the speed of the article, and in the process acquires torque data for storage and analysis (1212, 1282) to determine weight. Correct postage is determined in a processor (1212), and the postage actually paid is checked either by image analysis (1204, 1214, 1280) or by accessing a stored mailer manifest (1280).

Abstract: Methods and apparatus for weighing an article, such as a mail piece, while the article is moving at high speed. An article (900) is received from an intake transport (1200), and gripped in a weighing station (1310), in between a capstan roller and a pinch roller (1316), which are synchronized to minimize slipping. A first precision servo system (1252, 1250) alters the speed of the article, and in the process acquires torque data for storage and analysis (1212, 1282). A second precision servo system (1260, 1330) applies a constant force, via a tension arm (1320), urging the pinch roller (1316) against the capstan roller, independently of the thickness of the mail piece. Fourier analysis can conveniently be applied for analyzing the acquired current data and comparing to stored calibration data to determine weight. Weight is determined without regard to the actual speed of the moving article.

Abstract: Techniques for locating an object such as a data item or service on a node in a distributed system on a computer network include receiving communication cost data that indicates a cost of physically transferring data among nodes in a computer network. A node identifier for a node is determined based on the communication cost data such that a distance between two node identifiers for a pair of nodes is based on a cost of physically transferring data between the pair of nodes. For a particular object that has a particular object identifier, a closest node is determined among the plurality of nodes based on the particular object identifier and node identifiers corresponding to the nodes. The object is located through the closest node, such as by retrieving it or a pointer or an identifier for another node that is still closer to the object.

Abstract: Techniques for presenting identification of a remote network entity to a human user include determining one or more vectors of presentation elements that are readily distinguishable and memorable to a user. Message data is received from a remote process on the network and includes a network identity that uniquely identifies an associated remote entity. The network identity is input to a secure function to produce a secure number. A secure function produces dissimilar output values for similar input values. A particular presentation element is selected from a vector based only on the secure number and presented to the user. Even when the network identity is similar to that of a trusted entity, the particular presentation element is expected to be dissimilar to one associated with the trusted entity.

Abstract: In one embodiment, a method includes receiving data that indicates a maximum number of end nodes with which to set up real-time data sessions that is less than a conference number of nodes whose data is mixed in a single real-time data conference. Real-time data sessions are established with a connected set of a connected number of nodes not greater than the maximum number. A mix of the real-time data received from the connected set is presented to a user of the first node. Local real-time data is received from a user. The received real-time data is distributed by mixing and sending. This includes, for each individual node in the connected set, mixing received local real-time data with real-time data received from other nodes in the connected set different from the individual node to form individual mixed real-time data, and sending the individual mixed real-time data to the individual node.

Abstract: In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change.

Abstract: Data structures, methods, programs for computers, apparatus and systems for capturing, and analysing digital data, especially in the context of digital evidence gathering and analysis. Digital evidence is captured in digital evidence bags having an index file and one or more evidence units, the evidence units each comprising an index file and an evidence file. The evidence files contain copies of raw captured data whilst the associated index files contain text details of the contents and structure of the evidence files. The tag file contains data descriptive of the source and/or provenance of the evidence units and/or the digital evidence bag as a whole. Index information and evidence data may be in the same or distinct files.

Abstract: Techniques for presenting a key to a human across a human-machine interface include receiving key data that indicates a key to be input to a target process. The key is reversibly converted to a first human-language statement. The human language statement is designed so that multiple variations in the human-language statement due to common human errors can be correctly reversed to regenerate the key data. The common human-language statement is presented to a human user for use in the target process. After receiving input data that indicates a second human language statement based on human memory of the first human language statement, the second human language statement is corrected for common human language errors. The corrected second human language statement is then converted to second key data and sent to the target process. Thus multiple human inputs are accepted and correctly converted to the key for the target process.

Abstract: A corrugating adhesive that improves the bonding of coated papers, including latex coated medium and linerboards. The corrugating adhesive may comprise a hydrocolloid portion of the adhesive that improves tack and bonding and buffers and absorbs caustic in the adhesive allowing higher caustic in the adhesive formula without premature gelling of the secondary starch portion. Also, methods for making waterproof or water resistant corrugated board from corrugated media and paper liner.

Abstract: A corrugating adhesive that improves the bonding of coated papers, including latex coated medium and linerboards. The corrugating adhesive may comprise a hydrocolloid portion of the adhesive that improves tack and bonding and buffers and absorbs caustic in the adhesive allowing higher caustic in the adhesive formula without premature gelling of the secondary starch portion. Also, methods for making waterproof or water resistant corrugated board from corrugated media and paper liner.

Abstract: Apparatus and methods are disclosed for optimizing the transfer time of files in a peer-to-peer network. In disclosed embodiments, a requesting peer desires to transfer a file from a group of supplying peers creates a list of segments available of the file to be transferred available from each of the supplying peers, and orders the list in order of increasing segment size available. The supplying peers are then grouped based on available segments. Then, beginning with the group of supplying peers having the largest portion of the file to be transferred, the requesting peer assigning segments to transfer and a corresponding transfer time to each of the members of the group of supplying peers. The requesting peer then transfers in parallel the assigned segments from the group of supplying peers.

Abstract: A network provides distributed database services based on replicating data records to a new storage location that is closest to consumers of the data records, based on comparing a network distance between the new storage location and an attribute identifying a center of activity of at least one data element, relative to the network distance between any existing storage location in the center of activity. If the new storage location is closer to the center of activity relative to any of the other existing stores locations, than at least the one data element associated with the center of activity is copied to the new storage location. Multiple centers of activity may be utilized for respective data records, enabling data records to be copied on a per-record basis, or grouped as needed.

Abstract: A network has a file system configured for providing a selected version of a first file to a client, having requested the file, based on detecting that the client has opened a second file having an identified relationship with the first file. Files are identified as having a relationship based on membership in a file group, wherein each file group identifies only one version of each file specified in the corresponding file group; hence, multiple file groups can identify files associated with respective versions of a file set. In response to determining the first file belongs to a file group, the file system identifies the version of the second file opened by the client, and selects the version of the first file to be provided to the client based on determining the file group associated with the version of the second file opened by the client.

Abstract: A network provides distributed client services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed client service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed client service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each distributed client service also includes service attributes that define parameters for execution of the distributed client service, and data attributes that define the attributes required for data to be used in the distributed client service.

Abstract: Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file.

Abstract: A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions.

Abstract: Techniques for presenting identification of a remote network entity to a human user include determining one or more vectors of presentation elements that are readily distinguishable and memorable to a user. Message data is received from a remote process on the network and includes a network identity that uniquely identifies an associated remote entity. The network identity is input to a secure function to produce a secure number. A secure function produces dissimilar output values for similar input values. A particular presentation element is selected from a vector based only on the secure number and presented to the user. Even when the network identity is similar to that of a trusted entity, the particular presentation element is expected to be dissimilar to one associated with the trusted entity.

Abstract: Techniques for locating an object such as a data item or service on a node in a distributed system on a computer network include receiving communication cost data that indicates a cost of physically transferring data among nodes in a computer network. A node identifier for a node is determined based on the communication cost data such that a distance between two node identifiers for a pair of nodes is based on a cost of physically transferring data between the pair of nodes. For a particular object that has a particular object identifier, a closest node is determined among the plurality of nodes based on the particular object identifier and node identifiers corresponding to the nodes. The object is located through the closest node, such as by retrieving it or a pointer or an identifier for another node that is still closer to the object.