Abstract: In a computer network environment, a server protocol is provided to process read requests from clients. Rather than all read requests being processed synchronously or all read requests being processed asynchronously, an attempt is first made to perform a synchronous read. If the synchronous read is unsuccessful, the connection through which the request was received by the server is registered with a monitoring service. When the data is ready to be read, an appropriate callback is called and the data transmitted. An optional delay may be imposed before the synchronous read is attempted to increase the likelihood that the attempt will be successful. A series of delays/read attempts may also be employed in order to increase the likelihood still further that an attempt will be successful.

Abstract: Systems and methods for designing storage area network fabric. Preferably included are an arrangement for collecting user requirements on data flows to be supported by the fabric, an arrangement for grouping the data flows into flow groups according to at least one physical location parameter, an arrangement for designing components of fabric for the flow groups, the components being associated with at least one geographical region, and an arrangement for obtaining fabric by joining the fabric components via interconnection fabric, whereby flow groups over a plurality of geographical regions are supported.

Abstract: Methods and arrangements for constructing a network overlay via embedding an interconnection network in a network overlay graph. Presented herein is one example of an approximation algorithm for efficient mapping of hypercube topology on a network overlay of N nodes such that the average network delay distance measured on the network overlay is minimized. The network delay distances between pairs of overlay nodes are measured on the shortest network paths. The mapping of the interconnection topology to the network overlay nodes preferably involves assigning 2m m-length binary indexes to the network overlay nodes. There is proposed herein a polynomial time algorithm for interconnection topology embedding using iterative cluster division and node binary index assignment. There is further proposed herein a method for construction of network overlays through interconnection network topology embedding, with the objective of optimizing a quality of service metric (e.g.

Abstract: The present invention relates to attenuating phase shift mask blanks for use in lithography, a method of fabricating such a mask blank.

Abstract: The state or condition of a system may be evaluated by comparing a set of selected parameter values, converted into a trial vector, with a number of model or exemplar vectors, each of which was represents a particular state or condition of a sample system. Examples of such conditions may include “good”, “marginal”, “unacceptable”, “worn”, “defective”, or other general or specific conditions. Sets of parameter values from the system are converted into input vectors. Unprocessed vectors are then processed against the input vectors in an artificial neural network to generate the exemplar vectors. The exemplar vectors are stored in a memory of an operational system. During operation of the system, the trial vector is compared with the exemplar vectors. The exemplar vector which is closest to the trial vector represents a state which most closely represents the current state of the system.

Abstract: In a power controller or other computing resource shared by multiple processors, an ID is written to the lock register, thereby designating a master processor. A timer is then initialized to count for a predetermined period. Periodically, the master processor transmits a “heartbeat” signal to the shared resource, indicating that its operation remains normal. Upon receipt of the heartbeat signal, the timer is reset and begins a new count for the predetermined period. If the timer reaches the end of the period without having received a heartbeat signal, indicating that the master processor has failed or hung, the lock register is cleared again and an interrupt signal is broadcast to all of the processors. The processors compete for master status anew and, when an ID is successfully written to the lock register, the timer is restarted and the new master periodically transmits its heartbeat signal.

Abstract: The state or condition of a data storage drive, or a subsystem within a drive, may be evaluated by comparing a set of selected parameter values, converted into a trial vector, with a number of model or exemplar vectors, each of which was represents a particular state or condition of a sample drive. Examples of such conditions may include “good”, “marginal”, “unacceptable”, “worn”, “defective”, or other general or specific conditions. Sets of parameter values from the drive are converted into input vectors. Unprocessed vectors are then processed against the input vectors in an artificial neural network to generate the exemplar vectors. The exemplar vectors are stored in a memory of an operational drive. During operation of the drive, the trial vector is compared with the exemplar vectors. The exemplar vector which is closest to the trial vector represents a state which most closely represents the current state of the drive.

Abstract: A method, apparatus, and article of manufacture containing instructions for the management of data in a point-in-time logical copy relationship between a source and multiple target storage devices. The method consists of establishing first and second point-in-time logical copy relationships between a source storage device and at least two target storage devices concerning an extent of data. Upon establishment of the point-in-time copy relationships, a first cache scan request is received relating to the first point-in-time logical copy relationship to remove a first extent of data from cache; a similar cache scan request is received related to the second point-in-time logical copy relationship. The first cache scan request is processed, and the successful completion of both the first cache scan request and the second cache scan request is returned to the storage controller upon the processing of only the first cache scan request.

Abstract: A distributed computer system includes links and routing devices coupled between the links and routing frames between the links. Each of the routing devices includes a congestion control mechanism for detecting congestion at the routing device and responding to detected congestion by gradually reducing an injection rate of frames routed from the routing device.

Abstract: An inline electron holograph method for observing a specimen with a transmission electron microscope having an electron gun, a collimating lens system, two spaced objective lenses, a biprism, and an imaging means comprises the steps of: with the first objective lens forming a virtual image of a portion of the specimen; with the second objective lens focussing the virtual image at an intermediate image plane to form an intermediate image; and projecting the intermediate image onto the imaging means.

Abstract: A system, method, and computer readable medium are provided for consistently rendering graphical user interface (GUI) components from disparate web server delivery mechanisms. To this end, a Javascript script is downloaded with a web page and, when executed, accesses a style sheet which is typically used when displaying HTML. From the style sheet, the Javascript script retrieves GUI information describing the look and feel of the user interface components composing the web page. Utilizing an application programming interface (API), a downloaded Java® applet retrieves the GUI information from the Javascript script. The Java® applet utilizes the retrieved GUI information to render subsequent GUI screens.

Abstract: Arrangements and methods for configuring at least one computing device using at least one reference group. In a preferred embodiment, a reference group of peer devices is identified, configuration settings of the peer devices are extracted, the extracted configuration settings are analyzed and at least one configuration template is provided. A recommended configuration template is then selected for the at least one computing device.

Abstract: A method, apparatus, and article of manufacture containing instructions for processing multiple point-in-time consistent data sets. The method consists of creating multiple point-in-time data sets associated with a backup appliance which is associated with backup storage. Upon the transfer of a first update from a primary storage controller to the backup appliance, a determination is made whether the update affects data stored in the backup storage has been unchanged following the creation of the respective data sets. If the update does affect data which is unchanged following the creation of a data set, the current, non-updated data is read from the backup storage. A copy of the current, non-updated data thus read from the backup storage is stored in a storage location which can be one of the data sets or an independent memory location. In addition, pointers are associated with the remaining applicable data sets and directed to the copy at its storage location.

Abstract: Computer networks are provided with a resource efficient ability to generate link performance statistics. To calculate the average link utilization per I/O operation, a first counter accumulates the number of I/O operations processed by a link and a second counter accumulates the time required by the link to complete each I/O operation. The second value is then divided by the first value. The number of operations per second for a link may be computed by dividing the first number by a predetermined period of time and the average number of operations using the link may be computed by dividing the second number by the predetermined period of time. A third counter may be employed to accumulate the number of bytes transferred by a link during each I/O operation. Then, average size of an I/O operation may be computed by dividing the third number by the first number and the average bandwidth per link operation may be computed by dividing the third number by the predetermined period of time.

Abstract: Disclosed is a new process that permits the transfer and reflow of solder features produced by Injection Molded Solder (IMS) from a mold plate to a solder receiving substrate without the use of flux. Several embodiments produce solder transfer and reflow separately or together and use either formic acid vapor or partial concentration of hydrogen, both in nitrogen, as the oxide reducing atmosphere. A final embodiment produces fluxless transfer and reflow in only nitrogen through the use of ultrasonic vibration between the solder filled mold plate and solder receiving substrate.

Abstract: A data storage device for recording to and reading from magnetic thread includes a head assembly having an opening through which the magnetic thread passes. Transducing elements are positioned around the inner surface of the opening and interact with longitudinally-extending parallel tracks formatted around the surface of the magnetic thread. If the number of tracks is greater than the number of transducing elements, the transducing elements may be rotatable about the magnetic thread to position the transducing elements to interact with other tracks. The head assembly may open to aid positioning the magnetic thread within the opening in the head assembly during loading. If desired, multiple head assemblies may be placed in the thread path to improve data throughput. The magnetic thread may be formed with a non-circular cross-section and the opening in the head assembly may have a corresponding cross-section to reduce twisting of the magnetic thread as it passes through the opening.

Abstract: A method of, apparatus for, or storage device medium having instructions for publishing a first notification within a data processing system where the data processing system comprises a first source generating the first notification, a first destination device, and a second destination device. The source may be a storage unit, a printer, a processing unit, or any other device which is a component of the data processing system. The destination device is typically a monitor, a workstation, a computer, a PC, or other input/output type workstation. The method comprises of having the first destination device subscribe to receive notifications from the first source. In addition, the second destination device subscribes to receive the notifications serially republished from the first destination device. Upon the publication of a notification from the first source to the first destination device, the first destination device will publish the notification to the second destination device.

Abstract: Semiconductor structure formed on a substrate and process of forming the semiconductor. The semiconductor includes a plurality of field effect transistors having a first portion of field effect transistors (FETS) and a second portion of field effect transistors. A first stress layer has a first thickness and is configured to impart a first determined stress to the first portion of the plurality of field effect transistors. A second stress layer has a second thickness and is configured to impart a second determined stress to the second portion of the plurality of field effect transistors.

Abstract: Most recent research of scalable inductive learning on very large streaming dataset focuses on eliminating memory constraints and reducing the number of sequential data scans. However, state-of-the-art algorithms still require multiple scans over the data set and use sophisticated control mechanisms and data structures. There is discussed herein a general inductive learning framework that scans the dataset exactly once. Then, there is proposed an extension based on Hoeffding's inequality that scans the dataset less than once. The proposed frameworks are applicable to a wide range of inductive learners.

Abstract: In connection with the mining of time-evolving data streams, a general framework that mines changes and reconstructs models from a data stream with unlabeled instances or a limited number of labeled instances. In particular, there are defined herein statistical profiling methods that extend a classification tree in order to guess the percentage of drifts in the data stream without any labelled data. Exact error can be estimated by actively sampling a small number of true labels. If the estimated error is significantly higher than empirical expectations, there preferably re-sampled a small number of true labels to reconstruct the decision tree from the leaf node level.