Antiwear Action of Mineral Lubricants Modified by Conventional and Uncoventional Additives

The authors of this paper investigated the influence of esters of rapeseed oil fatty acids on the lubricating properties of mineral lubricants containing chosen AW/EP additives. Methyl esters, ethylene glycol esters, and glycerol esters as well as some commercial AW/EP packages based on zinc dialkyldithiophosphate, S–P organic compounds, and sulphurized esters of fatty acids were tested. The tribological tests were carried out with the use of a four-ball machine. Antiwear (AW) properties of tested compositions were determined using their limiting load of wear (G_oz(40)). It appears that the AW action of esters of rapeseed oil fatty acids depends on their structure. The best AW action is shown by compositions of mineral oil lubricants containing AW/EP additives and methyl esters of rapeseed oil fatty acids. The SEM/EDS analysis of the scar surface layer indicated that the presence of these esters in lubricants causes a change in the interaction between AW/EP additives and the metal surface. These observations were confirmed by the XPS surface analysis.     

Response time variability

Response time variability is a new optimization problem with a broad range of applications and a distinctive number of theoretic flavour. The problem occurs whenever events, jobs, clients or products need to be sequenced so as to minimize the variability of time for which they wait for the next turn in obtaining the resources necessary for their advance. The problem has numerous real-life applications. We study its computational complexity, present efficiency, polynomial time algorithms for some cases, and the NP-hardness proof for a general problem. We propose a position exchange heuristic and apply it to improve the total response time variability of an initial sequence. The latter is the optimum bottleneck sequence, Webster or Jefferson sequence of the apportionment, or a random sequence. We report on computational experiments with the heuristic.     

Simulating Ramsey-Type Fringes in a Pulsed Microwave-Driven Classical Josephson Junction

We present evidence for a close analogy between the nonlinear behaviour of a pulsed microwave-driven Josephson junction at low temperature and the experimentally observed behaviour of Josephson systems operated below the quantum transition temperature under similar conditions. We specifically address observations of Ramsey-type fringe oscillations, which can be understood in classical nonlinear dynamics as results of slow transient oscillations in a pulsed microwave environment. Simulations are conducted to mimic experimental measurements by recording the statistics of microwave-induced escape events from the anharmonic potential well of a zero-voltage state. Observations consistent with experimentally obtained Ramsey-type oscillations are found in the classical model. An erratum to this article can be found at     

Correlations in a General Theory of Quantum Measurement

The paper investigates correlations in a general theory of quantum measurement based on the notion of instrument. The analysis is performed in the algebraic formalism of quantum theory in which the observables of a physical system are described by a von Neumann algebra, and the states—by normal positive normalized functionals on this algebra. The results extend and generalise those obtained for the classical case where one deals with the full algebra of operators on a Hilbert space.     

Six Synthesis Methods for Reversible Logic

The (2 ^w )! reversible transformations on w wires, i.e. reversible logic circuits with w inputs and w outputs, together with the action of cascading, form a group, isomorphic to the symmetric group S ₂ ^w . Therefore, we investigate the group S _n as well as one of its subgroups isomorphic to S _n/2 × S _n/2. We then consider the left cosets, the right cosets, and the double cosets generated by the subgroup. Each element of a coset can function as the representative of the coset. The coset can then be considered as the set of all group elements that differ from the representative by merely multiplying (either to the left or to the right or to both sides) by an arbitrary element of the subgroup. Different choices of the coset space and different choices of the coset representatives lead to six different syntheses for implementing an arbitrary reversible logic operation into hardware. Evaluation of all six methods, by means of three different cost functions (gate cost, switch cost, and quantum cost), leads to a best choice.     

SQL extension for spatio-temporal data

An SQL extension is formalized for the management of spatio-temporal data, i.e. of spatial data that evolves with respect to time. The extension is dedicated to applications such as topography, cartography, and cadastral systems, hence it considers discrete changes both in space and in time. It is based on the rigid formalization of data types and of SQL constructs. Data types are defined in terms of time and spatial quanta. The SQL constructs are defined in terms of a kernel of few relational algebra operations, composed of the well-known operations of the 1NF model and of two more, Unfold and Fold. In conjunction with previous work, it enables the uniform management of 1NF structures that may contain not only spatio-temporal but also either purely temporal or purely spatial or conventional data. The syntax and semantics of the extension is fully consistent with the {SQL:2003} standard.     

Representations by Contact and Intersection of Segments

A necessary and sufficient condition is given for a connected bipartite graph to be the incidence graph of a contact family of segments and points. We deduce that any four-connected three-colorable plane graph is the contact graph of a family of segments and that any four-colored planar graph without an induced C₄ using four colors is the intersection graph of a family of straight line segments.     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.