Exact N-Wave Solutions for the Non-Planar Burgers Equation

An exact representation of N-wave solutions for the non-planar Burgers equation u(t) + uu(x) + 1/2ju/t = 1/2deltau(xx), j = m/n, m < 2n, where m and n are positive integers with no common factors, is given. This solution is asymptotic to the inviscid solution for Absolute value of x < square-root (2Q0 t), where Q0 is a function of the initial lobe area, as lobe Reynolds number tends to infinity, and is also asymptotic to the old age linear solution, as t tends to infinity; the formulae for the lobe Reynolds numbers are shown to have the correct behaviour in these limits. The general results apply to all j = m/n, m < 2n, and are rather involved; explicit results are written out for j = 0, 1, 1/2, 1/3 and 1/4. The case of spherical symmetry j = 2 is found to be 'singular' and the general approach set forth here does not work; an alternative approach for this case gives the large time behaviour in two different time regimes. The results of this study are compared with those of Crighton & Scott (1979).

Planar triazinium cations from VO2+-assisted ring cyclizations: a remarkably efficient thiazole species for nuclear staining, PDT and anaerobic photocleavage of DNA

Planar triazinium cationic species, from VO2+-assisted cyclization of 1-(2-thiazolylazo)-2-naphthol, shows efficient DNA intercalative binding, visible light-induced anaerobic plasmid DNA photocleavage activity and photocytotoxicity in HeLa and MCF-7 cancer cells by an apoptotic pathway with selective localization of the compound in the nucleus as evidenced from the nuclear staining and confocal imaging.

Blind separation of multiple co-channel BPSK signals arriving at an antenna array

In this letter, we propose a method for blind separation of d co-channel BPSK signals arriving at an antenna array. Our method involves two steps. In the first step, the received data vectors at the output of the array is grouped into 2d clusters. In the second step, we assign the 2d d-tuples with ±1 elements to these clusters in a consistent fashion. From the knowledge of the cluster to which a data vector belongs, we estimate the bits transmitted at that instant. Computer simulations are used to study the performance of our method

Work fluctuations in an elastic dumbbell model of polymers in planar elongational flow

We use a path-integral approach to calculate the distribution P(w, t) of the fluctuations in the work W at time t of a polymer molecule (modeled as an elastic dumbbell in a viscous solvent) that is acted on by an elongational flow field having a flow rate (gamma) over dot. We find that P(w, t) is non-Gaussian and that, at long times, the ratio P(w, t)/ P (-w, t) is equal to expw/(k(B)T)], independent of (gamma) over dot. On the basis of this finding, we suggest that polymers in elongational flows satisfy a fluctuation theorem.

Nonresonant edge slot antenna for phased array applications: Theory and experiment

The design and development of nonresonant edge slot antenna for phased array applications has been presented. The radiating element is a slot cut on the narrow wall of rectangular waveguide (edge slot). The admittance characteristics of the edge slot have been rigorously studied using a novel hybrid method. Nonresonant arrays have been fabricated using the present slot characterization data and the earlier published data. The experimentally measured electrical characteristics of the antenna are presented which clearly brings out the accuracy of the present method.

Synthesis of workspaces of planar manipulators with arbitrary topology using shape representation and simulated annealing

This paper presents a general methodology for the synthesis of the external boundary of the workspaces of a planar manipulator with arbitrary topology. Both the desired workspace and the manipulator workspaces are identified by their boundaries and are treated as simple closed polygons. The paper introduces the concept of best match configuration and shows that the corresponding transformation can be obtained by using the concept of shape normalization available in image processing literature. Introduction of the concept of shape in workspace synthesis allows highly accurate synthesis with fewer numbers of design variables. This paper uses a new global property based vector representation for the shape of the workspaces which is computationally efficient because six out of the seven elements of this vector are obtained as a by-product of the shape normalization procedure. The synthesis of workspaces is formulated as an optimization problem where the distance between the shape vector of the desired workspace and that of the workspace of the manipulator at hand are minimized by changing the dimensional parameters of the manipulator. In view of the irregular nature of the error manifold, the statistical optimization procedure of simulated annealing has been used. A number of worked-out examples illustrate the generality and efficiency of the present method. (C) 1998 Elsevier Science Ltd. All rights reserved.

On Training and Training Voids for Receive Antenna Subset Selection in Time-Varying Channels

Antenna selection (AS) provides most of the benefits of multiple-antenna systems at drastically reduced hardware costs. In receive AS, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. The "best" subset to be used for data reception is determined by means of channel estimates acquired using training sequences. Due to the nature of AS, the channel estimates at different antennas are obtained from different transmissions of the pilot sequence, and are, thus, outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N, we highlight a new issue of "training voids", in which the last pilot transmission is not fully exploited by the receiver. We present a "void-filling" method for fully exploiting these voids, which essentially provides more accurate training for some antennas, and derive the optimal subset selection rule for any void-filling method. We also derive new closed-form equations for the performance of receive AS with optimal subset selection.

A double U-slot patch antenna with dual wideband characteristics

Microstrip patch antennas are strong candidates for use in many wireless communications applications. This paper proposes the use of a patch antenna with two U-shaped slots to achieve dual band operation. A thick substrate helps broaden the individual bandwidths. The antenna is designed based on extensive IE3D simulation studies. A prototype antenna is fabricated and experimentally verified for the required performance.

Elliptic slot antenna for broadband wireless communications

This paper presents the design of a broadband antenna suitable for wireless communications operating over the frequency range of 3.1-10.6 GHz. Parametric studies on the effect of stub and elliptic slot have been carried out to arrive at optimum dimensions to achieve enhanced bandwidth of the proposed antenna. An experimental antenna has been designed and tested to validate the proposed design. Measured return loss characteristics have been compared against the simulation results. Simulated radiation patterns at 3.1 GHz, 6.85 GHz and 10.6 GHz have also been presented in this paper.

Training and Voids in Receive Antenna Subset Selection in Time-Varying Channels

Receive antenna selection (AS) provides many benefits of multiple-antenna systems at drastically reduced hardware costs. In it, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. Due to the nature of AS, the channel estimates at different antennas, which are required to determine the best subset for data reception, are obtained from different transmissions of the pilot sequence. Consequently, they are outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is necessary and optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N , we highlight a new issue of ``training voids'', in which the last pilot transmission is not fully exploited by the receiver. We then present new ``void-filling'' methods that exploit these voids and greatly improve the performance of AS. The optimal subset selection rules with void-filling, in which different antennas turn out to have different numbers of estimates, are also explicitly characterized. Closed-form equations for the symbol error probability with and without void-filling are also developed.

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

Static Balancing of Spring-loaded Planar Revolute-joint Linkages without Auxiliary Links

We present a method to statically balance a general treestructured,planar revolute-joint linkage loaded with linear springs or constant forces without using auxiliary links. The balancing methods currently documented in the literature use extra links; some do not apply when there are spring loads and some are restricted to only two-link serial chains. In our method, we suitably combine any non-zero-free-length load spring with another spring to result in an effective zero-free-length spring load. If a link has a single joint (with the parent link), we give a procedure to attach extra zero-free-length springs to it so that forces and moments are balanced for the link. Another consequence of this attachment is that the constraint force of the joint on the parent link becomes equivalent to a zero-free-length spring load. Hence, conceptually,for the parent link, the joint with its child is removed and replaced with the zero-free-length spring. This feature allows recursive application of this procedure from the end-branches of the tree down to the root, satisfying force and moment balance of all the links in the process. Furthermore, this method can easily be extended to the closed-loop revolute-joint linkages, which is also illustrated in the paper.