The ‘time of occurrence’ in quantum mechanics

Apart from serving as a parameter in describing the evolution of a system, time appears also as an observable property of a system in experiments where one measures ‘the time of occurrence’ of an event associated with the system. However, while the observables normally encountered in quantum theory (and characterized by self-adjoint operators or projection-valued measures) correspond to instantaneous measurements, a time of occurrence measurement involves continuous observations being performed on the system to monitor when the event occurs. It is argued that a time of occurrence observable should be represented by a positive-operator-valued measure on the interval over which the experiment is carried out. It is shown that while the requirement of time-translation invariance and the spectral condition rule out the possibility of a self-adjoint time operator (Pauli’s theorem), they do allow for time of occurrence observables to be represented by suitable positive-operator-valued measures. It is also shown that the uncertainty in the time of occurrence of an event satisfies the time-energy uncertainty relation as a consequence of the time-translation invariance, only if the time of occurrence experiment is performed on the entire time axis.     

Quantum corrections to liquid correlations

Sudarshan's semi-classical treatment of correlation functions is applied to the study of quantum corrections to the Van Hove function. In its generalised form, it enables one to choose the best correlation function for a given potential. Higher-order correlations are also sketched briefly and the details are similar to those considered by Oppenheim and Bloom.     

A carbohydrate-based approach for the total synthesis of 1,3-polyol/alpha-pyrone antifungal natural products

[Chemical reaction: see text] An elimination and stereoselective hydrogenation of alpha-D-glucoheptonic-gamma-lactone derivative has been applied to prepare a differentially protected anti,anti-1,3,5-triol system, the utility of which has been extended for the total synthesis of anti-fungal 1,3-polyol/alpha-pyrone natural products.     

Studies of mass and energy correlations in thermal neutron fission of U-235 accompanied by long range alpha particles

Several characteristics of fission accompanied by long range alpha particles (LRA) have been studied in the thermal neutron induced fission of²³⁵U. The kinetic energies of fission fragments and the LRA were measured with a back-to-back ionization chamber and semiconductor detectors respectively. The kinetic energies of the two fragments and the LRA in LRA fission, along with the energies of pair fragments in the normal binary fissions, were recorded event by event on a magnetic tape by means of a four-parameter data acquisition system. The data were analysed to study the dependence of different quantities in LRA fission on the fragment mass ratio, LRA energy and the total kinetic energy of the fission fragments. It is seen that the most probable energy of LRA increases significantly for near symmetric mass divisions. The total kinetic energy for all mass ratios in LRA fission is found to be (2.6±0.7) MeV larger than that in binary fission. The difference in the total kinetic energies in LRA and binary fissions is seen to be dependent on mass ratio. This result may suggest that the scission configuration in LRA fission is different for different mass ratios. Correlations between the fission fragment and LRA energies have been studied for several mass ratios. It is seen that the most probable fragment kinetic energyĒ _k varies nearly linearly with the LRA energyE _a for various mass divisions but the variation of the most probable LRA energyĒ _a with fragment kinetic energyE _k is found to deviate from linearity for several mass ratios. From a least square fit to the variation ofĒ _k withE _a it is found that the slope (dĒ _k/dE_a) increases with the increase in mass ratio. The present results are discussed to arrive at a better understanding of the scission configuration in the fission accompanied by LRA emission.     

Speeding up Exponentiation using an Untrusted Computational Resource

We present protocols for speeding up fixed-base variable-exponent exponentiation and variable-base fixed-exponent exponentiation using an untrusted computational resource. In the fixed-base protocols, the exponent may be blinded. In the variable-base protocols, the base may be blinded. The protocols are described for exponentiation in a cyclic group. We describe how to extend them to exponentiation modulo an integer where the modulus is the product of primes with single multiplicity. The protocols provide a speedup of over the square-and-multiply algorithm, where k is the bitlength of the exponent. One application of the protocols is to speed up exponentiation-based verification in discrete log-based signature and credential schemes. The protocols also allow signature verifiers to dynamically choose, for each message, the amount of work it would like to perform to verify the signature. This results in a work-security tradeoff. We introduce a fifth protocol to perform variable-base variable- exponent exponentiation, which also has this feature. Our model allows the trusted resource to perform computations in its idle time. The protocols facilitate the offloading of work to the offline stage, such that the work the trusted resource performs when it has to do an exponentiation is smaller. Our protocols are unconditionally secure.     

Characterization of a microscale cyclical electrical field flow fractionation system

A microscale cyclical electrical field flow fractionation (CyElFFF) channel is characterized with regard to the effect of various operating parameters and comparison made to recent theoretical developments. Challenges associated with various operating conditions are reported along with some of the optimized operating parameters. The effect of retention wall choice, an offset voltage, relaxation steps, and flow rates, along with the basic operating parameters of voltage, frequency, and electrophoretic mobility are reported. Retention of polystyrene nanoparticle standards is accomplished and the first separations using this technique in a microscale system are also demonstrated. Relaxation steps and offset voltages are found to be effective in eliminating early peaks and in improving plate heights. Plate heights were also found to decrease with increasing flow rates, which is the opposite of the behavior seen in most existing chromatographic systems. The experimental results are compared to the analytical and empirical models of CyElFFF and found to be compatible. Suggestions are made for improving the separation and analysis methods used with CyElFFF.     

Further exploration of antimicrobial ketodihydronicotinic acid derivatives by multiple parallel syntheses

A synthetic reexamination of a series of ketodihydronicotinic acid class antibacterial agents was undertaken in an attempt to improve their therapeutic potential. A convenient new synthesis was developed involving hetero Diels-Alder chemistry producing 74 new analogs in a multiple parallel synthetic manner and these were examined in vitro for their antimicrobial potential. Several compounds demonstrated significant broad-spectrum activity against clinically derived bacterial strains but previously known 1-(2,4-difluorophenyl)-6-(4-dimethylaminophenyl)-4-pyridone-3-carboxylic acid (7) remained the most potent compound in this class. Cross-resistance with ciprofloxacin supported a commonality of mode of action. Permiabilization of Escherichia coli cells by polymyxin B significantly enhanced potency with these agents suggesting that poor cellular uptake was primarily responsible for the disappointing activity against bacteria that some of the analogs exhibited.     

Algorithms for non-uniform size data placement on parallel disks

We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d₁,d₂,…,d_N. We are also given sets U₁,U₂,…,U_M such that U_i is the set of clients seeking the ith data item. Data item i has size s_i. Each disk d_j is characterized by two parameters, namely, its storage capacity C_j which indicates the maximum total size of data items that may be assigned to it, and a load capacity L_j which indicates the maximum number of clients that it can serve. The goal is to find a placement of data items to disks and an assignment of clients to disks so as to maximize the total number of clients served, subject to the capacity constraints of the storage system.We study this data placement problem for homogeneous storage systems where all the disks are identical. We assume that all disks have a storage capacity of k and a load capacity of L. Previous work on this problem has assumed that all data items have unit size, in other words s_i=1 for all i. Even for this case, the problem is NP-hard. For the case where s_i{1,…,Δ} for some constant Δ, we develop a polynomial time approximation scheme (PTAS). This result is obtained by developing two algorithms, one that works for constant k and one that works for arbitrary k. The algorithm for arbitrary k guarantees that a solution where at least -fraction of all clients are assigned to a disk (under certain assumptions). In addition we develop an algorithm for which we can prove tight bounds when s_i{1,2}. In fact, we can show that a -fraction of all clients can be assigned (under certain natural assumptions), regardless of the input distribution.