Mathematical model for computer simulation and control of steelmaking

A dynamic model for computer simulation and control of steelmaking has been developed. It is essentially based on multicomponent mixed transport control theory with the incorporation of energy balance calculations. The model is applicable to both steelmaking in electric furnaces as well as in oxygen steelmaking converters. The adjustable parameters of the model for simulation of oxygen steelmaking are gas evolution rate (G_co). oxygen flux factor (F_o) and emulsification factor (EM). These simulation parameters, when combined with on-line measurement of off-gas composition and temperature, enable complete dynamic control of the process. The model developed is applied, as an example, to an industrially produced heat in a top blown oxygen steelmaking converter and the results of simulation are discussed.     

3D Hair sketching for real-time dynamic & key frame animations

Physically based simulation of human hair is a well studied and well known problem. But the “pure” physically based representation of hair (and other animation elements) is not the only concern of the animators, who want to “control” the creation and animation phases of the content. This paper describes a sketch-based tool, with which a user can both create hair models with different styling parameters and produce animations of these created hair models using physically and key frame-based techniques. The model creation and animation production tasks are all performed with direct manipulation techniques in real-time.     

Performance of hashed cache data migration schemes on multicomputers

Many researchers approach the problem of programming distributed memory machines by assuming a global shared name space. Thus the user views the distributed memory of the machine as though it were shared. A major issue that arises at this point is how to manage the memory. When a processor accesses data stored on another processor's memory, data must be moved between the two processors. Once these data are retrieved from another processor's memory, several interesting issues are raised. Where should these data be stored locally? What transformations must be performed to the code to guarantee that the nonlocal accesses reference the correct memory location? What optimizations can be performed to reduce the time spent in accessing the nonlocal data? In this paper we examine various data migration mechanisms that allow an explicit and controlled mapping of data to memory. We describe, experimentally evaluate, and model a set of schemes for storing and retrieving off-processor array elements. The schemes are all based on using hash tables for efficient access of nonlocal data. The three different techniques evaluated are the basic hashed cache, partial enumeration, and full enumeration, the details of which are described in the paper. In all three schemes, nonlocal data are stored in hash tables—the difference is in the amount of memory used by the schemes and the retrieval mechanisms for nonlocal data.     

Concurrent error detection of fault-based side-channel cryptanalysis of 128-bit RC6 block cipher

Fault-based side channel cryptanalysis is very effective against symmetric and asymmetric encryption algorithms. Although straightforward hardware and time redundancy based concurrent error detection (CED) architectures can be used to thwart such attacks, they entail significant overhead (either area or performance). In this paper we investigate two systematic approaches to low-cost, low-latency CED for symmetric encryption algorithm RC6. The proposed techniques have been validated on FPGA implementations of RC6, one of the advanced encryption standard finalists.     

Evolutionary Algorithms for Quantum Computers

In this article, we formulate and study quantum analogues of randomized search heuristics, which make use of Grover search (in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM, New York, 1996) to accelerate the search for improved offsprings. We then specialize the above formulation to two specific search heuristics: Random Local Search and the (1+1) Evolutionary Algorithm. We call the resulting quantum versions of these search heuristics Quantum Local Search and the (1+1) Quantum Evolutionary Algorithm. We conduct a rigorous runtime analysis of these quantum search heuristics in the computation model of quantum algorithms, which, besides classical computation steps, also permits those unique to quantum computing devices. To this end, we study the six elementary pseudo-Boolean optimization problems OneMax, LeadingOnes, Discrepancy, Needle, Jump, and TinyTrap. It turns out that the advantage of the respective quantum search heuristic over its classical counterpart varies with the problem structure and ranges from no speedup at all for the problem Discrepancy to exponential speedup for the problem TinyTrap. We show that these runtime behaviors are closely linked to the probabilities of performing successful mutations in the classical algorithms.     

Fabrication and characterization of electrospun psyllium husk-based nanofibers for tissue regeneration

The present study reports for first time the blending of psyllium husk (PH) powder/gelatin (G) in the polymer-rich composition of polyvinyl alcohol (PVA) to make an electrospinnable solution. The composite was prepared in 3 different ratios viz., 100% (wt/wt) (PVA + PH), 75% + 25% (PVA + 75PH + 25G) (wt/wt) and 50% + 50% (PVA + 50PH + 50G) (wt/wt) in 6% PVA solution. Optimum electrospinning parameters were evaluated for all the prepared blends. The fabricated nanofibers were characterized by scanning electron microscopy (SEM), attenuated total reflectance-Fourier transform infrared, differential scanning calorimetry, porosity percentage, and fiber orientation using ImageJ software. A qualitative in vitro degradation study at room temperature is supported by SEM images. The cellular interactions were characterized by MTT assay of NIH-3T3 fibroblast cells for 2 and 4 days with an optimum cell growth of >50% by fourth day of culture and long-term cultivation of L929-RFP cells was observed for 10 days. The nanofibers were formed in the range of 49–600 nm. PVA + 75PH + 25G when cultured with L929-RFP cells exhibited highest fluorescence intensity and thus supported cellular proliferation significantly. Based on the results obtained from various analyses, we anticipate that fabricated psyllium-based nanofiber can be used as a promising candidate for wound healing and other biomedical applications.     

Attack Resilient and Efficient Protocol based on Greedy Perimeter Coordinator Routing—Mobility Awareness for Preventing the Attack in the VANET

Wireless Personal Communications - A Greedy Perimeter Coordinator Routing and Mobility Awareness (GPCR-MA) vehicular routing is a widely accepted routing protocol for VANET (Vehicular Ad hoc...     

A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE

In addition to the classical heuristic algorithms of operations research, there have also been several approaches based on artificial neural networks for solving the traveling salesman problem. Their efficiency, however, decreases as the problem size (number of cities) increases. A technique to reduce the complexity of a large-scale traveling salesman problem (TSP) instance is to decompose or partition it into smaller subproblems. We introduce an all-neural decomposition heuristic that is based on a recent self-organizing map called KNIES, which has been successfully implemented for solving both the Euclidean traveling salesman problem and the Euclidean Hamiltonian path problem. Our solution for the Euclidean TSP proceeds by solving the Euclidean HPP for the subproblems, and then patching these solutions together. No such all-neural solution has ever been reported.     

The effect of categorizing returned products in remanufacturing

An increasing number of companies have been implementing comprehensive recycling and remanufacturing programs. These endeavors typically involve the operation of joint manufacturing and remanufacturing systems. One of the major challenges in managing such hybrid systems is the stochastic nature of product returns. In particular, there is significant variability in the condition of the returns. This paper presents an approach for assessing the impact of quality-based categorization of returned products. Through extensive numerical studies on a continuous-time Markov chain model, we show that incorporation of returned product quality in the remanufacturing and disposal decisions can lead to significant cost savings. We find that these savings are amplified as the return quality decreases, and as the return rate increases. We also show that prioritizing higher quality returns in remanufacturing is, in general, a better strategy.     

Studies of dielectric and electrical properties of a new type of complex tungsten bronze electroceramics

A polycrystalline ceramic with a new type of complex tungsten-bronze type structure, having a general formula K₂Ba₂Nd₂Ti₄Nb₄W₂O₃₀ has been prepared using a high temperature solid-state reaction route after optimizing the calcinations conditions on the basis of thermal analysis results. The material has been characterized by different experimental techniques. The formation of the compound has been confirmed using X-ray diffraction analysis. Dielectric properties (ε_r and tanδ) of the compound as a function of temperature at different frequencies have been carried out. Temperature dependence of dielectric constant indicates the presence of ferroelectric phase transition well above the room temperature. Complex impedance spectroscopic analysis has been carried out as a function of frequency at different temperatures to establish some correlation between the microstructure and electrical properties of the material. The nature of frequency dependence of ac conductivity obeys the Jonscher’s power law. The dc conductivity calculated from the ac conductivity spectrum shows the negative temperature coefficient of resistance behavior like a semiconductor.