Lenient Execution and Concurrent Execution of Re-entrant Routines: Efficient Implementation in Data Flow Systems

Implementation details of efficient schemes for lenient execution and concurrent execution of re-entrant routines in a data flow model have been discussed in this paper. The proposed schemes require no extra hardware support and utilise the existing hardware resources such as the Matching Unit and Memory Network Interface, effectively to achieve the above mentioned goals.

An efficient marching algorithm for waterhammer analysis by the method of characteristics

A new fast and efficient marching algorithm is introduced to solve the basic quasilinear, hyperbolic partial differential equations describing unsteady, flow in conduits by the method of characteristics. The details of the marching method are presented with an illustration of the waterhammer problem in a simple piping system both for friction and frictionless cases. It is shown that for the same accuracy the new marching method requires fewer computational steps, less computer memory and time.

Mechanical alloying—a novel synthesis route for amorphous phases

Mechanical alloying (MA) pioneered by Benjamin is a technique for the extension of solid solubility in systems where the equilibrium solid solubility is limited. This technique has, in recent years, emerged as a novel alternate route for rapid solidification processing (RSP) for the production of metastable crystalline, quasicrystalline, amorphous phases and nanocrystalline materials. The glass-forming composition range (GFR), in general, is found to be much wider in case of MA in comparison with RSP. The amorphous powders produced by MA can be compacted to bulk shapes and sizes and can be used as precursors to obtain high strength materials. This paper reports the work done on solid state amorphization by MA in Ti-Ni-Cu and Al-Ti systems where a wide GFR has been obtained. Al-Ti is a classic case where no glass formation has been observed by RSP, while a GFR of 25–90 at.% Ti has been obtained in this system, thus demonstrating the superiority of MA over RSP. The free energy calculations made to explain GFR are also presented.

Stabilization of α-nickel hydoxide in the presence of organic additives: chemical route to bulk synthesis

Organic molecules such as glucose or lactose mediate the synthesis and stabilize alpha-nickel hydroxide in a simple precipitation reaction, while, in the absence of these additives, beta-nickel hydroxide is formed. The additives are not incorporated in the product phase.

Synthesis of Novel Oxide Pyrochlores, A2BB?O7 (A = La, Nd; BB? = Pb, Sn, Bi), by Alkali Melt Route

Oxide pyrochlores of the formula A2BB? O7 (A = La, Nd; BB? = Pb, Sn, Bi) have been synthesized by a low-temperature ambient-pressure route employing KOH melts. All the compositions, including La2Bi2O7 and its strontium-substituted derivatives, La2-xSrxBi2O7-?, are deeply colored insulators, confirming that a metallic ground state is not achieved for Pb(IV) and Bi(IV/V) oxides with the pyrochlore structure.

Energy-Efficient Fault Tolerance in Chip Multiprocessors Using Critical Value Forwarding

Relentless CMOS scaling coupled with lower design tolerances is making ICs increasingly susceptible to wear-out related permanent faults and transient faults, necessitating on-chip fault tolerance in future chip microprocessors (CMPs). In this paper we introduce a new energy-efficient fault-tolerant CMP architecture known as Redundant Execution using Critical Value Forwarding (RECVF). RECVF is based on two observations: (i) forwarding critical instruction results from the leading to the trailing core enables the latter to execute faster, and (ii) this speedup can be exploited to reduce energy consumption by operating the trailing core at a lower voltage-frequency level. Our evaluation shows that RECVF consumes 37% less energy than conventional dual modular redundant (DMR) execution of a program. It consumes only 1.26 times the energy of a non-fault-tolerant baseline and has a performance overhead of just 1.2%.

Efficient and Fair Scheduling of Uplink and Downlink in IEEE 802.16 OFDMA Networks

We develop new scheduling algorithms for the IEEE 802.16d OFDMA/TDD based broadband wireless access system, in which radio resources of both time and frequency slots are dynamically shared by all users. Our objective is to provide a fair and efficient allocation to all the users to satisfy their quality of service.

Search Strategies for Multiple UAV Search and Destroy Missions

Multiple UAVs are deployed to carry out a search and destroy mission in a bounded region. The UAVs have limited sensor range and can carry limited resources which reduce with use. The UAVs perform a search task to detect targets. When a target is detected which requires different type and quantities of resources to completely destroy, then a team of UAVs called as a coalition is formed to attack the target. The coalition members have to modify their route to attack the target, in the process, the search task is affected, as search and destroy tasks are coupled. The performance of the mission is a function of the search and the task allocation strategies. Therefore, for a given task allocation strategy, we need to devise search strategies that are efficient. In this paper, we propose three different search strategies namely; random search strategy, lanes based search strategy and grid based search strategy and analyze their performance through Monte-Carlo simulations. The results show that the grid based search strategy performs the best but with high information overhead.

A facile entry to macrocyclic disulfides: an efficient synthesis of redox-switched crown ethers

An interesting sulfur transfer reaction with benzyltriethylammonium tetrathiomolybdate has been used efficiently for the synthesis of macrocyclic disulfides. This methodology has been extended to a high-yield synthesis of ''redox-switched'' crown ethers which have potential application for selective ion transport across liquid membranes.

An Efficient Random Walk Strategy for Sampling Based Robot Motion Planners

Sampling based planners have been successful in path planning of robots with many degrees of freedom, but still remains ineffective when the configuration space has a narrow passage. We present a new technique based on a random walk strategy to generate samples in narrow regions quickly, thus improving efficiency of Probabilistic Roadmap Planners. The algorithm substantially reduces instances of collision checking and thereby decreases computational time. The method is powerful even for cases where the structure of the narrow passage is not known, thus giving significant improvement over other known methods.

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.

An Efficient Simulated Annealing With a Valid Solution Mechanism For TDMA Brodcast Scheduling problem

This paper presents an efficient Simulated Annealing with valid solution mechanism for finding an optimum conflict-free transmission schedule for a broadcast radio network. This is known as a Broadcast Scheduling Problem (BSP) and shown as an NP-complete problem, in earlier studies. Because of this NP-complete nature, earlier studies used genetic algorithms, mean field annealing, neural networks, factor graph and sum product algorithm, and sequential vertex coloring algorithm to obtain the solution. In our study, a valid solution mechanism is included in simulated annealing. Because of this inclusion, we are able to achieve better results even for networks with 100 nodes and 300 links. The results obtained using our methodology is compared with all the other earlier solution methods.

Line clipping revisited: Two efficient algorithms based on simple geometric observations

Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algorithm, that are based on simple geometric observations are presented. These algorithms do not require computation of outcodes nor do they depend on the parametric representations of the lines. It is shown that the opposite-corner algorithm perform consistently better than an algorithm due to Nicholl, Lee, and Nicholl which is claimed to be better than the classic algorithm due to Cohen-Sutherland and the more recent Liang-Barsky algorithm. The pseudo-code of the opposite-corner algorithm is provided in the Appendix.

Nanocomposites by rapid solidification route

Nanometric aggregates of solids can be classified into two types, nanograined or nanophased materials and nanocomposites. In the present paper after a brief review including the relation between size and boundary fraction, the basic principles that can be utilized to synthesize these materials from liquid route has been discussed. We shall present examples to show that with proper choice of systems and conditions it is possible to obtain nanocomposites in systems showing clustering tendencies in liquid as well as the systems exhibiting ordering tendencies leading to compound formation