Computing Fractal Dimension of Signals using Multiresolution Box-counting Method

In this paper, we have developed a method to compute fractal dimension (FD) of discrete time signals, in the time domain, by modifying the box-counting method. The size of the box is dependent on the sampling frequency of the signal. The number of boxes required to completely cover the signal are obtained at multiple time resolutions. The time resolutions are made coarse by decimating the signal. The loglog plot of total number of boxes required to cover the curve versus size of the box used appears to be a straight line, whose slope is taken as an estimate of FD of the signal. The results are provided to demonstrate the performance of the proposed method using parametric fractal signals. The estimation accuracy of the method is compared with that of Katz, Sevcik, and Higuchi methods. In ddition, some properties of the FD are discussed.

S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

On the utility of an instrumented impact set-up to characterise the response of discontinuous buffer strips in carbon–epoxy systems in dry and wet conditions

The use of an instrumented impact test set-up to evaluate the influence of water ingress on the impact response of a carbon–epoxy (C–E) laminated composite system containing discontinuous buffer strips (BS) has been examined. The data on the BS-free C–E sample in dry conditions are used as reference to compare with the data derived from those immersed in water. The work demonstrated the utility of an instrumented impact test set-up in characterising the response, first owing to the architectural difference due to introduction of buffer strips and then due to the presence of an additional phase in the form of water ingressed into the sample. The presence of water was found to enhance the energy absorption characteristics of the C–E system with BS insertions. It was also noticed that with an increasing number of BS layer insertions, the load–time plots displayed characteristic changes. The ductility indices (DI) were found to display a lower value for the water immersed samples compared to the dry ones.

The utility of Bacillus subtilis as a bioflocculant for fine coal

The application of Bacillus subtilis as a flocculant for fine coal has been reported here. Zeta-potential measurements showed that both the coal and bacteria had similar surface charge as a function of pH. Surface free energy calculations showed that the coal was hydrophobic while the bacterium was hydrophilic. The adhesion of the bacteria to coal and subsequent settling was studied in detail. Adhesion of bacteria to coal surface and subsequent settling of coal was found to be quick. Both adhesion and settling were found to be independent of pH, which makes the process very attractive for field applications. The presence of an electrolyte along with the bacterium was found to not only enhance adhesion of bacteria, but also produce a clear supernatant. Further, the settled fraction was more compact than with bacteria alone. Interaction energy calculations using the extended DLVO theory showed that the electrical forces along with the acid-base interaction energy play a dominant role in the lower pH range. Above pH 7, the acid-base interaction energy is the predominant attractive force and is sufficient enough to overcome the repulsive forces due to electrical charges to brine about adhesion and thus settling of fine coal. With increase in electrolyte concentration, the change in total interaction energy with pH is minimal which probably leads to better adhesion and hence settling. (C) 2003 Elsevier Science B.V. All rights reserved.

Power control and transmission scheduling for network utility maximization in wireless networks

We consider a joint power control and transmission scheduling problem in wireless networks with average power constraints. While the capacity region of a wireless network is convex, a characterization of this region is a hard problem. We formulate a network utility optimization problem involving time-sharing across different "transmission modes," where each mode corresponds to the set of power levels used in the network. The structure of the optimal solution is a time-sharing across a small set of such modes. We use this structure to develop an efficient heuristic approach to finding a suboptimal solution through column generation iterations. This heuristic approach converges quite fast in simulations, and provides a tool for wireless network planning.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Editorial optical computing circuits, devices and systems

Information forms the basis of modern technology. To meet the ever-increasing demand for information, means have to be devised for a more efficient and better-equipped technology to intelligibly process data. Advances in photonics have made their impact on each of the four key applications in information processing, i.e., acquisition, transmission, storage and processing of information. The inherent advantages of ultrahigh bandwidth, high speed and low-loss transmission has already established fiber-optics as the backbone of communication technology. However, the optics to electronics inter-conversion at the transmitter and receiver ends severely limits both the speed and bit rate of lightwave communication systems. As the trend towards still faster and higher capacity systems continues, it has become increasingly necessary to perform more and more signal-processing operations in the optical domain itself, i.e., with all-optical components and devices that possess a high bandwidth and can perform parallel processing functions to eliminate the electronic bottleneck.

Phenylboronic acids in crystal engineering: Utility of the energetically unfavorable syn,syn-conformation in co-crystal design

Phenylboronic acids can exist, in principle, in three different conformers (syn,syn; syn,anti and anti,anti) with distinct energy profiles. In their native state, these compounds prefer the energetically favored syn, anti-conformation. In molecular complexes, however, the functionality exhibits conformational diversity. In this paper we report a series of co-crystals, with N-donor compounds, prepared by a design strategy involving the synthons based on the syn, syn-conformation of the boronic acid functionality. For this purpose, we employed compounds with the 1,2-diazo fragment (alprazolam, 1H-tetrazole, acetazolamide and benzotriazole), 1,10-phenanthroline and 2,2'-bipyridine for the co-crystallization experiments. However, our study shows that the mere presence of the 1,2-diazo fragment in the coformer does not guarantee the successful formation of co-crystals with a syn, syn-conformation of the boronic acid. [GRAPHICS] The -B(OH)(2) fragment makes unsymmetrical O-H center dot center dot center dot N heterosynthons with alprazolam (ALP) and 1,10-phenanthroline (PHEN). In the co-crystals of phenylboronic acids with 1H-tetrazole (TETR) and 2,2'-bipyridine (BPY), the symmetrical boronic acid dimer is the major synthon. In the BPY complex, boronic acid forms linear chains and the pyridine compound interacts with the lateral OH of boronic acid dimers that acts as a connector, thus forming a ladder structure. In the TETR complex, each heterocycle interacts with three boronic acids. While two boronic acids interact using the phenolic group, the third molecule generates O-H center dot center dot center dot N hydrogen bonds using the extra OH group, of -B(OH)(2) fragment, left after the dimer formation. Thus, although molecules were selected retrosynthetically with the 1,2-diazo fragment or with nearby hetero-atoms to induce co-crystal formation using the syn,syn-orientation of the -B(OH)(2) functionality, co-crystal formation is in fact selective and is probably driven by energy factors. Acetazolamide (ACET) contains self-complementary functional groups and hence creates stable homosynthons. Phenylboronic acids being weak competitors fail to perturb the homosynthons and hence the components crystallize separately. Therefore, besides the availability of possible hydrogen bond acceptors in the required position and orientation, the ability of the phenyl-boronic acid to perturb the existing interactions is also a prerequisite to form co-crystals. This is illustrated in the table below. In the case of ALP, PHEN and BPY, the native structures are stabilized by weak interactions and may be influenced by the boronic acid fragment. Thus phenylboronic acids can attain co-crystals with those compounds, wherein the cyclic O-H center dot center dot center dot N hydrogen bonds are stronger than the individual homo-interactions. This can lower the lattice energy of the molecular complex as compared with the individual crystals. [GRAPHICS] Phenylboronic acids show some selectivity in the formation of co-crystals with N-heterocycles. The differences in solubility of the components fall short to provide a possible reason for the selective formation of co-crystals only with certain compounds. These compounds, being weak acids, do not follow the Delta pK(a) analysis and hence fail to provide any conclusive observation. Theoretical results show that of the three conformers possible, the syn,anti conformer is the most stable. The relative stabilities of the three conformers syn,anti,syn,syn and anti,anti are 0.0, 2.18 and 3.14 kcal/mol, respectively. The theoretical calculations corroborate the fact that only energetically favorable synthons can induce the formation of heterosynthons, as in ALP and PHEN complexes. From a theoretical and structural analysis it is seen that phenylboronic acids will form interactions with those molecules wherein the heterocyclic and acidic fragments can interrupt the homosynthons. However, the energy profile is shallow and can be perturbed easily by the presence of competing functional groups (such as OH and COOH) in the vicinity. [GRAPHICS] .

Dioxomolybdenum reagents in organic synthesis: utility of redox capability to design reduction and oxidation

The usefulness of dioxomolybdenum reagents in oxo-transfer reactions have been reviewed. The redox ability of dioxomolybdenum reagent has been utilized in designing several synthetic methods, which are useful in organic synthesis. Several reactions such as oxidation of alcohols, sulfides, amines, azides olefins etc are accomplished by using dioxomolybdenum reagents. Similarly, it is also demonstrated that dioxomolybdenum complex is useful in performing reduction of aldehydes, ketones, esters, azides etc. A fine tuning of reaction conditions provides suitable conditions to perform either oxidation or reduction by using catalytic amount of reagents. The oxidation reactions are further simplified by employing the polymer supported molybdenum reagents.

Fragment Finder 2.0: a computing server to identify structurally similar fragments

Fragment Finder 2.0 is a web-based interactive computing server which can be used to retrieve structurally similar protein fragments from 25 and 90% nonredundant data sets. The computing server identifies structurally similar fragments using the protein backbone C alpha angles. In addition, the identified fragments can be superimposed using either of the two structural superposition programs, STAMP and PROFIT, provided in the server. The freely available Java plug-in Jmol has been interfaced with the server for the visualization of the query and superposed fragments. The server is the updated version of a previously developed search engine and employs an in-house-developed fast pattern matching algorithm. This server can be accessed freely over the World Wide Web through the URL http://cluster.physics.iisc.ernet.in/ff/.

A novel oxidative transformation of alcohols to nitriles: an efficient utility of azides as a nitrogen source

An efficient methodology to oxidize benzylic and cinnamyl alcohols to their corresponding nitriles in excellent yields has been developed. This methodology employs DDQ as an oxidant and TMSN3 as a source of nitrogen in the presence of a catalytic amount of Cu(ClO4)(2)center dot 6H(2)O.