KINEMATIC SYNTHESIS AND ANALYSIS OF THE RACK AND PINION MULTIPURPOSE MECHANISM

The general procedure for synthesizing the rack and pinion mechanism up to seven precision conditions is developed. To illustrate the method, the mechanism has been synthesized in closed form for three precision conditions of path generation, two positions of function generation, and a velocity condition at one of the precision points. This mechanism has a number of advantages over conventional four bar mechanisms. First, since the rack is always tangent to the pinion, the transmission angle is always 90 deg minus the pressure angle of the rack. Second, with both translation and rotation of the rock occurring, multiple outputs are available. Other advantages include the generation of monotonic functions for a wide variety of motion and nonmonotonic functions for a full range of motion as well as nonlinear amplified motions. In this work the mechanism is made to satisfy a number of amplified motions. In this work the mechanism is made to satisfy a number of practical design requirements such as completely rotatable input crank and others. By including the velocity specification, the designer has considerably more control of the output motion. The method of solution developed in this work uses the complex number method of mechanism synthesis. A numerical example is included

Kinematic Synthesis and Analysis of the Rack and Pinion Multi-Purpose Mechanism

The general procedure for synthesizing the rack and pinion mechanism up to seven precision conditions is developed. To illustrate the method, the mechanism has been synthesized in closed form for three precision conditions of path generation, two positions of function generation, and a velocity condition at one of the precision points. This mechanism has a number of advantages over conventional four bar mechanisms. First, since the rack is always tangent to the pinion, the transmission angle is always 90 deg minus the pressure angle of the rack. Second, with both translation and rotation of the rack occurring, multiple outputs are available. Other advantages include the generation of monotonic functions for a wide variety of motion and nonmonotonic functions for a full range of motion as well as nonlinear amplified motions. In this work the mechanism is made to satisfy a number of practical design requirements such as completely rotatable input crank and others. By including the velocity specification, the designer has considerably more control of the output motion. The method of solution developed in this work uses the complex number method of mechanism synthesis. A numerical example is included.

Practical Algorithms For Mean Velocity Estimation In Pulse Doppler Weather Radars Using A Small Number Of Samples

Doppler weather radars with fast scanning rates must estimate spectral moments based on a small number of echo samples. This paper concerns the estimation of mean Doppler velocity in a coherent radar using a short complex time series. Specific results are presented based on 16 samples. A wide range of signal-to-noise ratios are considered, and attention is given to ease of implementation. It is shown that FFT estimators fare poorly in low SNR and/or high spectrum-width situations. Several variants of a vector pulse-pair processor are postulated and an algorithm is developed for the resolution of phase angle ambiguity. This processor is found to be better than conventional processors at very low SNR values. A feasible approximation to the maximum entropy estimator is derived as well as a technique utilizing the maximization of the periodogram. It is found that a vector pulse-pair processor operating with four lags for clear air observation and a single lag (pulse-pair mode) for storm observation may be a good way to estimate Doppler velocities over the entire gamut of weather phenomena.

X-ray crystal and molecular structure of a hydrated lithium picrate complex of benzo-15-crown-5; An example of non-chelation of the crown

Complexation of alkali and alkaline earth metal ions with crown ethers is well known (1) and chemical and crystallographic studies have been carried out for number of complexes (2,3). The interaction of the metal with the crown ether depends on the nature of the cation and particularly on the basicity of the anion (4) , In this paper we report the crystal and molecular structure of a lithium picrate complex of benzo-15-crown-5, the first x-ray crystallographic study of a lithlum-crown system.

Complex carbohydrates: 2. The modes of binding of complex carbohydrates to concanavalin A - a computer modelling approach

The probable modes of binding of some complex carbohydrates, which have the trimannosidic core structure (Man3GlcNAc2), to concanavalin A (Con A) have been determined using a computer modelling technique. These studies show that Con a can bind to the terminal mannose residues of the trimannosidic core structure and to the internal mannosyl as well as to the terminal N-acetylglucosamine residues of the N-acetylglucosamine substituted trimannosidic core structure. The oligosaccharide with terminal mannose residues can bind in its minimum energy conformers, whereas the oligosaccharide with internal mannosyl and terminal N-acetylglucosamine residues can bind only in higher energy conformers. In addition the former oligosaccharide forms more hydrogen bonds with Con A than the latter. These results suggest that, for these oligosaccharides, the terminal mannose residue has a much higher probability of reaching the binding site than either the internal mannosyl or the terminal N-acetylglucosamine residues. The substitution of a bisecting N-acetylglucosamine residue on these oligosaccharides, affects significantly the accessibility of the residues which bind to Con A and thereby reduces their binding affinity. It thus seems that the binding affinity of an oligosaccharide to Con A depends not only on the number of sugar residues which possess free 3-, 4- and 6-hydroxyl groups but also on the accessibility of these sugar residues to Con A. This study also reveals that the sugar binding site of Con A is small and that the interactions between Con A and carbohydrates are extended slightly beyond the single sugar residue that is placed in the binding site.

A discrete wavelet transform approach to multiresolution complex SAR image generation

We present a signal processing approach using discrete wavelet transform (DWT) for the generation of complex synthetic aperture radar (SAR) images at an arbitrary number of dyadic scales of resolution. The method is computationally efficient and is free from significant system-imposed limitations present in traditional subaperture-based multiresolution image formation. Problems due to aliasing associated with biorthogonal decomposition of the complex signals are addressed. The lifting scheme of DWT is adapted to handle complex signal approximations and employed to further enhance the computational efficiency. Multiresolution SAR images formed by the proposed method are presented.

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs

Space-time block codes (STBCs) obtained from non-square complex orthogonal designs are bandwidth efficient compared to those from square real/complex orthogonal designs for colocated coherent MIMO systems and has other applications in (i) non-coherent MIMO systems with non-differential detection, (ii) Space-Time-Frequency codes for MIMO-OFDM systems and (iii) distributed space-time coding for relay channels. Liang (IEEE Trans. Inform. Theory, 2003) has constructed maximal rate non-square designs for any number of antennas, with rates given by [(a+1)/(2a)] when number of transmit antennas is 2a-1 or 2a. However, these designs have large delays. When large number of antennas are considered this rate is close to 1/2. Tarokh et al (IEEE Trans. Inform. Theory, 1999) have constructed rate 1/2 non-square CODs using the rate-1 real orthogonal designs for any number of antennas, where the decoding delay of these codes is less compared to the codes constructed by Liang for number of transmit antennas more than 5. In this paper, we construct a class of rate-1/2 codes for arbitrary number of antennas where the decoding delay is reduced by 50% when compared with the rate-1/2 codes given by Tarokh et al. It is also shown that even though scaling the variables helps to lower the delay it can not be used to increase the rate.

Robust heuristics for scalable optimization of complex SQL queries

Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.

On the maximal rate of (n+1) x n and (n+2) x n complex orthogonal designs

For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.

A Novel Construction of Complex Orthogonal Designs with Maximal Rate and Low-PAPR

Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas.In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For a transmit antennas, the maximal rate of a COD is 1/2 + l/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.

Design of speaker identification schemes for large number of speakers (A)

Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.

X-ray studies on crystalline complexes involving amino acids and peptides. XXI. Structure of a (1:1) complex between L-phenylalanine and D-valine

CsHllNO2.C9HilNO2, Mr = 282.3, P1, a = 5.245 (1), b = 5.424 (1), c = 14.414 (2) A, a = 97.86 (1), fl = 93-69 (2), y = 70-48 (2) °, V= 356 A 3, Z = 1, O m = 1-32 (2), Dx = 1.32 g cm-3, h(Mo Ka) = 0-7107 A, g = 5-9 cm-1, F(000) = 158, T= 298 K, R=0.035 for 1518 observed reflections with I>2tr(I). The molecules aggregate in double layers, one ayer made up of L-phenylalanine molecules and the other of D-valine molecules. Each double layer is stabilized by interactions involving main-chain atoms of both types of molecules. The interactions include hydrogen bonds which give rise to two head-to-tail sequences. The arrangement of molecules in the complex is almost the same as that in the structure of DL-valine (and DL-leucine and DL-isoleucine) except for the change in the side chain of L molecules. The molecules in crystals containing an equal number of L and O hydrophobic amino-acid molecules thus appear to aggregate in a similar fashion, irrespective of the precise details of the side chain.

Squeezed states, photon-number distributions, and U(l) invariance

We study the photon-number distribution in squeezed states of a single-mode radiation field. A U(l)-invariant squeezing criterion is compared and contrasted with a more restrictive criterion, with the help of suggestive geometric representations. The U(l) invariance of the photon-number distribution in a squeezed coherent state, with arbitrary complex squeeze and displacement parameters, is explicitly demonstrated. The behavior of the photon-number distribution for a representative value of the displacement and various values of the squeeze parameter is numerically investigated. A new kind of giant oscillation riding as an envelope over more rapid oscillations in this distribution is demonstrated.

Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks

Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using the amplify and forward protocol. For such a network, a new class of high rate, training-symbol embedded (TSE) SSD DSTBCs are proposed from TSE-CODs. The constructed codes include the training symbols within the structure of the code which is shown to be the key point to obtain high rate along with the SSD property. TSE-CODs are shown to offer full-diversity for arbitrary complex constellations. Non-square TSE-CODs are shown to provide better rates (in symbols per channel use) compared to the known SSD DSTBCs for relay networks when the number of relays is less than 10. Importantly, the proposed DSTBCs do not contain zeros in their codewords and as a result, antennas of the relay nodes do not undergo a sequence of switch on and off transitions within every codeword use. Hence, the proposed DSTBCs eliminate the antenna switching problem.

Drug-drug co-crystals: Temperature-dependent proton mobility in the molecular complex of isoniazid with 4-aminosalicylic acid

Two drug-drug co-crystals of the anti-tuberculosis drugs isoniazid (INH), pyrazinamide (PYR) and 4-aminosalicylic acid (PAS) are reported. The first is the 1 : 1 molecular complex of INH and PAS. The second is the monohydrate of the 1 : 1 complex of PYR and PAS. The crystal structures of both co-crystals are characterized by a number of hydrogen bonded synthons. Hydrogen bonding of the COOH center dot center dot center dot N-pyridine type is found in both cases. In the INH : PAS co-crystal, there are two symmetry independent COOH center dot center dot center dot center dot N-pyridine hydrogen bonds. In one of these, the H-atom is located on the carboxylic group and is indicative of a co-crystal. In the second case, partial proton transfer occurs across the hydrogen bond, and the extent of proton transfer depends on the temperature. This is more indicative of a salt. Drug-drug co-crystals may have some bearing in the treatment of tuberculosis.