Abstract: A method and system for forming contacts on semiconductor components, such as wafers, dice and packages, are provided. The method employs magnets to align and hold ferromagnetic balls on bonding sites of a component substrate. The system includes a holder for holding the component substrate, and magnets on the holder aligned with bonding sites on the component. The system also includes a ball placement mechanism for placing the ferromagnetic balls on the bonding sites, and a bonding mechanism, such as an oven, or a focused energy source, for bonding the ferromagnetic balls to the bonding sites. The ferromagnetic balls can be provided as a ferromagnetic core having an outer solder layer, as a solid ferromagnetic material with a conductive adhesive outer layer, or as ferromagnetic particles embedded in a bondable matrix material. An alternate embodiment system includes a focused magnetic source for dynamically aligning the ferromagnetic balls to the bonding sites.

Abstract: Roasted coffee with an increased chlorogenic acid content of more than 2.8% by weight or instant coffee powder with an increased chlorogenic acid content of more than 8.5% by weight have a better compatibility. The increased chlorogenic acid content is achieved either by adding chlorogenic acid or by extracting raw coffee and adding the optionally concentrated extract to the roasted coffee.

Abstract: A method and apparatus for aggregating terminals into clusters that assists in the construction of a distributed data communication network. Terminal locations to be clustered are used as input along with a weight for each one representing the traffic carried by that location. The terminals are placed into boxes based on their geographic coordinates and only boxes with substantial traffic are retained. Any terminals included in a box not retained are assigned to the closest retained box. The retained boxes are merged into clusters so long as the maximum cluster traffic and maximum cluster radius are not exceeded. The center of mass of the resulting clusters are then determined. The representative locations of the resulting clusters are determined as the location of the terminal in the cluster closest to the center of mass.

Abstract: A method for constructing and utilizing a distributed data communication network that will meet its performance specifications in the most economical and efficient manner. The steps of the method include clustering terminals based on their proximity and traffic; selecting backbone node sites based on cost; designing the access network composed of terminals, concentrators, backbone nodes and the links between them; generating a backbone link topology; and determining routes in the backbone given the backbone topology and a traffic matrix.

Abstract: A method for selecting the most cost-efficient configuration for backbone links in a distributed data network is disclosed. The method identifies candidate links between pairs of backbone nodes, evaluates the effect on the network of adding each candidate link to the network, and adds to the network those candidate links which produce a cost savings in the network. The method also routes data through the backbone to minimize transmission delays, and eliminates redundant lines from underutilized links, and removes from the network those links whose removal reduces the cost of the backbone.

Abstract: A method to produce near-optimal routes for the flow of data between clusters in a distributed data communications network. A backbone traffic matrix and a backbone topology at the cluster level are used to produce minimum hop routes, minimum delay routes, or routes which maximize throughput. The inputs of the system are the number of requirements, the number of backbone links, and the number of backbone nodes.

Abstract: A method for selecting the most cost-efficient locations for backbone nodes in a distributed data network is disclosed. The method iteratively evaluates candidate backbone node locations, adding in each iteration the candidate whose addition to the network would create the greatest savings in total network cost. After all candidates which produce savings are added to the network, the method iteratively evaluates the backbone node locations and removes those whose removal would create cost savings. Data terminals are reassigned among the backbone nodes in the least cost manner. The method also estimates total network cost based on the resulting network configuration.

Abstract: A method for locating and selecting concentrators and local access links in a distributed data network in the most cost-efficient way is disclosed. The method first identifies a median concentrator from among a set of candidate concentrators to which all of the data terminals are initially assigned. The method then iteratively evaluates and adds to the network those concentrators which produce savings in the network's cost. The method first adds all of a set of concentrators specified to be mandatory and then adds from among a set of candidate concentrators those which produce cost savings. The method then evaluates concentrators in the network and removes those concentrators whose removal produces savings in the network cost.

Abstract: Chlorogenic acid can be separated and produced as free acid or as salts thereof from plant raw material extracts by means of gel permeation chromatography on cross-linked modified polysaccharides, especially on dextrans. To obtain the free acid, the aqueous extract must be adjusted to a pH in the range of about 2 to 2.8. By use of a column of sufficient length the isomeric 5-, 4- and 3-chlorogenic acid can also be separated by the process of the invention.