Organizational maintenance repair parts and special tools lists : intrenching machine, combat, high speed mounted, ladder type, NSN 3805-00-727 6719, Unit Rig model 4262.

Includes index.

High speed tape reader (DX type).

"TEMO-690-010A."

Operator's and organizational maintenance manual : teleprinter, high speed, TT-768/TYC-39(V) (NSN 5805-01-120-2928).

"14 May 1984."

High speed steel /

Mode of access: Internet.

Iron and steel; a treatise on the smelting, refining, and mechanical processes of the iron and steel industry, including the chemical and physical characteristics of wrought iron, carbon, high-speed and alloy steels, cast iron, and steel castings, and the application of these materials in machine and tool construction,

Mode of access: Internet.

Use of the Interstate Highway System right-of-way for magnetic levitation high speed transportation systems : hearing before the Subcommittee on Water Resources, Transportation, and Infrastructure of the Committee on Environment and Public Works, United States Senate, One Hundredth Congress, second session, on S. 2072 ....

"September 28, 1988"--Pt. 2.

Surface infrastructure : high-speed rail projects in the United States : report to the Chairman, Committee on the Budget, House of Representatives /

"B-280830"--P. 1.

Investigation of the high speed impact behavior of fibrous materials

Mode of access: Internet.

Approximate processing of massive continuous quantile queries over high-speed data streams

Quantile computation has many applications including data mining and financial data analysis. It has been shown that an is an element of-approximate summary can be maintained so that, given a quantile query d (phi, is an element of), the data item at rank [phi N] may be approximately obtained within the rank error precision is an element of N over all N data items in a data stream or in a sliding window. However, scalable online processing of massive continuous quantile queries with different phi and is an element of poses a new challenge because the summary is continuously updated with new arrivals of data items. In this paper, first we aim to dramatically reduce the number of distinct query results by grouping a set of different queries into a cluster so that they can be processed virtually as a single query while the precision requirements from users can be retained. Second, we aim to minimize the total query processing costs. Efficient algorithms are developed to minimize the total number of times for reprocessing clusters and to produce the minimum number of clusters, respectively. The techniques are extended to maintain near-optimal clustering when queries are registered and removed in an arbitrary fashion against whole data streams or sliding windows. In addition to theoretical analysis, our performance study indicates that the proposed techniques are indeed scalable with respect to the number of input queries as well as the number of items and the item arrival rate in a data stream.

High speed DSC (hyper-DSC) as a tool to measure the solubility of a drug within a solid or semi-solid matrix

Conventional differential scanning calorimetry (DSC) techniques are commonly used to quantify the solubility of drugs within polymeric-controlled delivery systems. However, the nature of the DSC experiment, and in particular the relatively slow heating rates employed, limit its use to the measurement of drug solubility at the drug's melting temperature. Here, we describe the application of hyper-DSC (HDSC), a variant of DSC involving extremely rapid heating rates, to the calculation of the solubility of a model drug, metronidazole, in silicone elastomer, and demonstrate that the faster heating rates permit the solubility to be calculated under non-equilibrium conditions such that the solubility better approximates that at the temperature of use. At a heating rate of 400°C/min (HDSC), metronidazole solubility was calculated to be 2.16 mg/g compared with 6.16 mg/g at 20°C/min. © 2005 Elsevier B.V. All rights reserved.

A heuristic approach for component scheduling on a high-speed PCB assembly machine

The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.

Polarisation mode dispersion induced transmission penalties for long-haul high speed optical communication systems

Results of full numerical simulations of a guiding-centre soliton system with randomly birefringent SMF fibre are shown and analysed. It emerges that the soliton system becomes unstable even for small amounts of PMD.