Constructive quantum scaling of unitary matrices

In this work, we present a method of decomposition of arbitrary unitary matrix \(U\in \mathbf {U}(2^k)\) into a product of single-qubit negator and controlled-\(\sqrt{\text{ NOT }}\) gates. Since the product results with negator matrix, which can be treated as complex analogue of bistochastic matrix, our method can be seen as complex analogue of Sinkhorn–Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively, and resulting circuit consists of \(O(4^k)\) entangling gates, which is proved to be optimal. An example of such transformation is presented.     

Studies on a New Concept of 3D Data Integration about Reaches and Forces of a Disabled Person on a Wheelchair (CAD Methods in Car and Market Ergonomics)

The article presents a new concept of combining the three dimensions (3D) of a person's manipulation space. The data concern information about the reach of the arms and biomechanical data about limiting the load of a disabled person sitting in a wheelchair. Measurement data were acquired empirically, on original measuring station. The data included, respectively, arms' reach (static and dynamic) or, alternatively, measurements of limiting forces. The obtained data were processed into virtual 3D surfaces of arms' reach and forces. These surfaces provide the required graphic model of anthropotechnical and biomechanical data. Developed model was utilized to perform a virtual analysis of the accessibility of a disabled person to technical means: in a market sale space and in the ergonomic analysis into the space of a personal car. The presented method of 3D graphic modeling of anthropometrical and biomechanical data can be universally applied in ergonomic designing of work stations not only for disabled persons. © 2011 Wiley Periodicals, Inc.     

Code reordering using local random extraction and insertion (LREI) operator for GPGPU-based track-before-detect systems

Track-before-detect (TBD) algorithms are used for tracking systems, where the object’s signal is below the noise floor (low-SNR objects). A lot of computations and memory transfers for real-time signal processing are necessary. GPGPU in parallel processing devices for TBD algorithms is well suited. Finding optimal or suboptimal code, due to lack of documentation for low-level programming of GPGPUs is not possible. High-level code optimization is necessary and the evolutionary approach, based on the single parent and single child is considered, that is local search approach. Brute force search technique is not feasible, because there are N! code variants, where N is the number of motion vectors components. The proposed evolutionary operator—LREI (local random extraction and insertion) allows source code reordering for the reduction of computation time due to better organization of memory transfer and the texture cache content. The starting point, based on the sorting and the minimal execution time metric is proposed. The unbiased random and biased sorting techniques are compared using experimental approach. Tests shows significant improvements of the computation speed, about 8 % over the conventional code for CUDA code. The time period of optimization for the sample code is about 1 h (1,000 iterations) for the considered recursive spatio-temporal TBD algorithm.     

Hydrophilic polycarbonate chips for generation of oil-in-water (O/W) and water-in-oil-in-water (W/O/W) emulsions

Modification of the surfaces of polycarbonate (PC) with the use of a solution of tin (II) chloride renders them hydrophilic. The surface draping is stable against exposure to water and to alcohols. Exposure to alkanes reduces but does not diminish the effect. The method is compatible—in using the same solvent and temperature—with the hydrophobic modification of PC Jankowski et al. ( Lab Chip 11:748–752, 2011). The combination of these methods makes it possible to generate single and multiple monodisperse emulsions with the use of flow-focusing junctions in systems made in PC—material that is suitable for fabrication of multilayer, high throughput microfluidic devices.     

Low-latency atomic broadcast in the presence of contention

The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in the order of these timestamps. Both positive and negative statements are used: “m broadcast at time 51” vs. “no messages broadcast between times 31 and 51”. To prevent crashed processes from blocking the system, the -elected leader broadcasts negative statements on behalf of the processes it suspects () to have crashed. A new cheap Generic Broadcast algorithm is used to ensure consistency between conflicting statements. It requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new lower bounds, which are proved in this paper.     

Studies of the changes in the geometry of grain boundaries and grains during recovery/continuous recrystallization in α-Fe

Samples of -Fe (Armco) have been deformed by 50% in compression. These have then been annealed at 400 °C, considerably below the conventional recrystallization temperature, and the evolution of grain size and shape quantified. Initially the grain size is found to decrease whilst, at the same time, the grain-shape anisotropy also decreases. It is suggested that a continuous recrystallization process which favours the generation of higher angle grain boundaries is the underlying mechanism. Annealing for longer times gives rise to an increase in grain size with the development of undulations on the grain surfaces. The mechanism suggested for this behaviour involves the annihilation of segments of sub-boundaries on to a pre-existing boundary from either side of the boundary.     

Investigation of the degree of crystallinity of acrylonitrile-divinylbenzene copolymers

Using the wide-angle X-ray scattering method, the degree of crystallinity of suspension copolymers and terpolymers of acrylonitrile (AN) and divinylbenzene (DVB) were determined. Copolymers with various degrees of cross-linking (5%–50% DVB) were prepared in the presence of thermodynamically different solvents added in order to obtain porous structure. It was found that copolymers with a degree of cross-linking of 0.1% DVB have a crystallinity index below 0.2, although the crystallinity index of PAN obtained under the same conditions is 0.5. Owing to the solvation conditions, even in copolymers with a degree of cross-linking of 20% DVB, ordered regions occur, and dilution of the polymerization mixture with poor solvents cause a decrease in the degree of crystallinity of these copolymers. Terpolymers AN, butyl acrylate (BA) or vinyl acetate (VA) have less ordered structure for the same amount of DVB. Methacrylonitrile and DVB copolymers obtained under the same conditions as AN and DVB are amorphous.