Exceptional adhesive and gelling properties of fibrous nanoscopic tapes of self-assembled bipolar urethane amides of L-phenylalanine

Seven L-phenylalanine based alkyl (monopolar) and alkanediyl (bipolar) derivatives are synthesized; while the bipolar urethane amides form gels and show strong adhesive properties, the monopolar analogues form fibrous nanoscopic cloth-like tapes.

Macroporous metal oxide foams through self-sustained combustion reactions

A number of macroporous metal oxide foams were prepared through self-sustained combustion reactions starting from dough made of the corresponding metal nitrate, urea and starch. The nitrate ion acts as an oxidizing agent, urea as fuel and starch as an organic binder. The metal oxide foams are characterized by scanning electron microscopy and powder X-ray diffraction.

Self-Assembled Pd(II) Metallocycles Using an Ambidentate Donor and the Study of Square-Triangle Equilibria

The self-assembly reaction of a cis-blocked 90° square planar metal acceptor with a symmetrical linear flexible linker is expected to yield a [4 + 4] self-assembled square, a [3 + 3] assembled triangle, or a mixture of these.However, if the ligand is a nonsymmetrical ambidentate, it is expected to form a complex mixture comprising several linkage isomeric squares and triangles as a result of different connectivities of the ambidentate linker. We report instead that the reaction of a 90° acceptor cis-(dppf)Pd(OTf)2 [where dppf ) 1,1′-bis(diphenylphosphino)- ferrocene] with an equimolar amount of the ambidentate unsymmetrical ligand Na-isonicotinate unexpectedly yields a mixture of symmetrical triangles and squares in the solution. An analogous reaction using cis-(tmen)Pd(NO3)2 instead of cis-(dppf)Pd(OTf)2 also produced a mixture of symmetrical triangles and squares in the solution. In both cases the square was isolated as the sole product in the solid state, which was characterized by a single crystal structure analysis. The equilibrium between the triangle and the square in the solution is governed by the enthalpic and entropic contributions. The former parameter favors the formation of the square due to less strain in the structure whereas the latter one favors the formation of triangles due to the formation of more triangles from the same number of starting linkers. The effects of temperature and concentration on the equilibria have been studied by NMR techniques. This represents the first report on the study of square-triangle equilibria obtained using a nonsymmetric ambidentate linker. Detail NMR spectroscopy along with the ESI-mass spectrometry unambiguously identified the components in the mixture while the X-ray structure analysis determined the solid-state structure.

Implicit and multigrid procedures for steady-state computations with upwind algorithms

A computational study for the convergence acceleration of Euler and Navier-Stokes computations with upwind schemes has been conducted in a unified framework. It involves the flux-vector splitting algorithms due to Steger-Warming and Van Leer, the flux-difference splitting algorithms due to Roe and Osher and the hybrid algorithms, AUSM (Advection Upstream Splitting Method) and HUS (Hybrid Upwind Splitting). Implicit time integration with line Gauss-Seidel relaxation and multigrid are among the procedures which have been systematically investigated on an individual as well as cumulative basis. The upwind schemes have been tested in various implicit-explicit operator combinations such that the optimal among them can be determined based on extensive computations for two-dimensional flows in subsonic, transonic, supersonic and hypersonic flow regimes. In this study, the performance of these implicit time-integration procedures has been systematically compared with those corresponding to a multigrid accelerated explicit Runge-Kutta method. It has been demonstrated that a multigrid method employed in conjunction with an implicit time-integration scheme yields distinctly superior convergence as compared to those associated with either of the acceleration procedures provided that effective smoothers, which have been identified in this investigation, are prescribed in the implicit operator.

Impressive Gelation in Organic Solvents by Synthetic, Low Molecular Mass, Self-Organizing Urethane Amides of L-Phenylalanine

Synthetic routes leading to 12 L-phenylalanine based mono- and bipolar derivatives (1-12) and an in-depth study of their structure-property relationship with respect to gelation have been presented. These include monopolar systems such as N-[(benzyloxy)carbonyl]-L-phenylalanine-N-alkylamides and the corresponding bipolar derivatives with flexible and rigid spacers such as with 1,12-diaminododecane and 4,4'-diaminodiphenylmethane, respectively. The two ends of the latter have been functionalized with N-[(benzyloxy)carbonyl]-L-phenylalanine units via amide connection. Another bipolar molecule was synthesized in which the middle portion of the hydrocarbon segment contained polymerizable diacetylene unit. To ascertain the role of the presence of urethane linkages in the gelator molecule protected L-phenylalanine derivatives were also synthesized in which the (benzyloxy)carbonyl group has been replaced with (tert-butyloxy)carbonyl, acetyl, and benzoyl groups, respectively. Upon completion of the synthesis and adequate characterization of the newly described molecules, we examined the aggregation and gelation properties of each of them in a number of solvents and their mixtures. Optical microscopy and electron microscopy further characterized the systems that formed gels. Few representative systems, which showed excellent gelation behavior was, further examined by FT-IR, calorimetric, and powder X-ray diffraction studies. To explain the possible reasons for gelation, the results of molecular modeling and energy-minimization studies were also included. Taken together these results demonstrate the importance of the presence of (benzyloxy)carbonyl unit, urethane and secondary amide linkages, chiral purities of the headgroup and the length of the alkyl chain of the hydrophobic segment as critical determinants toward effective gelation.

2.5-dimensional solution of the advective accretion disk:a self-similar approach

We provide a 2.5-dimensional solution to a complete set of viscous hydrodynamical equations describing accretion- induced outflows and plausible jets around black holes/compact objects. We prescribe a self-consistent advective disk-outflow coupling model, which explicitly includes the information of vertical flux. Inter-connecting dynamics of an inflow-outflow system essentially upholds the conservation laws. We provide a set of analytical family of solutions through a self-similar approach. The flow parameters of the disk-outflow system depend strongly on the viscosity parameter α and the cooling factor.

Synthesis and characterisation of heterometallic molecular triangles using ambidentate linker: self-selection of a single linkage isomer

The coordination driven self-assembly of discrete molecular triangles from a non-symmetric ambidentate linker 5-pyrimidinecarboxylate (5-pmc) and Pd(II)/Pt(II) based 90◦ acceptors is presented. Despite the possibility of formation of a mixture of isomeric macrocycles (linkage isomers) due to different connectivity of the ambidentate linker, formation of a single and symmetrical linkage somer in both the cases is an interesting observation. Moreover, the reported macrocycles represent the first example of discrete metallamacrocycles of bridging 5-pmc. While solution composition in both the cases was characterised by multinuclear NMR study and electrospray ionization mass spectrometry (ESI-MS), the identity of the assemblies in the solid state was established by X-ray single crystals structure analysis. Variable temperature NMR study clearly ruled out the formation of any other macrocycles by [4 + 4] or [2 + 2] self-assembly of the reacting components.

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.

A comparative study of side-band Fresnel holograms recorded with self-imaging and general objects

This paper deals with new results obtained in regard to the reconstruction properties of side-band Fresnel holograms (SBFH) of self-imaging type objects (for example, gratings) as compared with those of general objects. The major finding is that a distribution I2, which appears on the real-image plane along with the conventional real-image I1, remains a 2Z distribution (where 2Z is the axial distance between the object and its self-imaging plane) under a variety of situations, while its nature and focusing properties differ from one situation to another. It is demonstrated that the two distributions I1 and I2 can be used in the development of a novel technique for image subtraction.

Ant Colony Optimization Algorithms for Shortest Path Problems

We propose four variants of recently proposed multi-timescale algorithm in [1] for ant colony optimization and study their application on a multi-stage shortest path problem. We study the performance of the various algorithms in this framework. We observe, that one of the variants consistently outperforms the algorithm [1].

Improved Algorithms for Reservoir Capacity Calculation Incorporating Storage-Dependent Losses and Reliability Norm

Two algorithms that improve upon the sequent-peak procedure for reservoir capacity calculation are presented. The first incorporates storage-dependent losses (like evaporation losses) exactly as the standard linear programming formulation does. The second extends the first so as to enable designing with less than maximum reliability even when allowable shortfall in any failure year is also specified. Together, the algorithms provide a more accurate, flexible and yet fast method of calculating the storage capacity requirement in preliminary screening and optimization models.

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.

SHAMP: An experimental shared memory multimicroprocessor system for performance evaluation of parallel algorithms

In this paper, the design and implementation of a single shared bus, shared memory multiprocessing system using Intel's single board computers is presented. The hardware configuration and the operating system developed to execute the parallel algorithms are discussed. The performance evaluation studies carried out on Image are outlined.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.