Microstructure evolution during batch annealing

Design of industrial annealing cycles requires recrystallization and grain growth studies, which are typically carried out under isothermal laboratory condition. The kinetics coefficients of these phase transformations are obtained from such studies, which are subsequently used in designing the industrial nonisothermal cycles using the additivity principles. However, the strong heating rate effects on the grain growth kinetics necessitate such kinetics studies using industrial thermal profiles. In the present work, the hot and cold spot cycles of an industrial batch annealing cycle for AIK grade steel have been simulated in a programmable laboratory furnace. Subsequently, the effect of annealing temperature, soaking time, and heating rate on the microstructural features, such as grain size distribution, grain shape anisotropy, and grain orientation, have been investigated through extensive quantitative microscopy. The implications of these results on the design of industrial batch annealing cycles have been discussed.     

An entropy-based persistence barcode

In persistent homology, the persistence barcode encodes pairs of simplices meaning birth and death of homology classes. Persistence barcodes depend on the ordering of the simplices (called a filter) of the given simplicial complex. In this paper, we define the notion of “minimal” barcodes in terms of entropy. Starting from a given filtration of a simplicial complex K, an algorithm for computing a “proper” filter (a total ordering of the simplices preserving the partial ordering imposed by the filtration as well as achieving a persistence barcode with small entropy) is detailed, by way of computation, and subsequent modification, of maximum matchings on subgraphs of the Hasse diagram associated to K. Examples demonstrating the utility of computing such a proper ordering on the simplices are given.     

Realization of a quantum gate using gravitational search algorithm by perturbing three-dimensional harmonic oscillator with an electromagnetic field

The aim of this paper is to design a current source obtained as a representation of p information symbols \(\{I_k\}\) so that the electromagnetic (EM) field generated interacts with a quantum atomic system producing after a fixed duration T a unitary gate U(T) that is as close as possible to a given unitary gate \(U_g\). The design procedure involves calculating the EM field produced by \(\{I_k\}\) and hence the perturbing Hamiltonian produced by \(\{I_k\}\) finally resulting in the evolution operator produced by \(\{I_k\}\) up to cubic order based on the Dyson series expansion. The gate error energy is thus obtained as a cubic polynomial in \(\{I_k\}\) which is minimized using gravitational search algorithm. The signal to noise ratio (SNR) in the designed gate is higher as compared to that using quadratic Dyson series expansion. The SNR is calculated as the ratio of the Frobenius norm square of the desired gate to that of the desired gate error.     

A Deep Learning Approach to Detection and Mitigation of Distributed Denial of Service Attacks in High Availability Intelligent Transport Systems

Mobile Networks and Applications - In the era of Internet of Things (IoT) powered by 5G technologies, Automobile Industry is headed towards a revolution. In Intelligent Transport Systems (ITS),...     

Lévy flight artificial bee colony algorithm

Artificial bee colony (ABC) optimisation algorithm is a relatively simple and recent population-based probabilistic approach for global optimisation. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the ABC, there is a high chance to skip the true solution due to its large step sizes. In order to balance between diversity and convergence in the ABC, a Lévy flight inspired search strategy is proposed and integrated with ABC. The proposed strategy is named as Lévy Flight ABC (LFABC) has both the local and global search capability simultaneously and can be achieved by tuning the Lévy flight parameters and thus automatically tuning the step sizes. In the LFABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Furthermore, to improve the exploration capability, the numbers of scout bees are increased. The experiments on 20 test problems of different complexities and five real-world engineering optimisation problems show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest-guided ABC, best-so-far ABC and modified ABC in most of the experiments.     

Garuda: a scalable tiled display wall using commodity PCs

Cluster-based tiled display walls can provide cost-effective and scalable displays with high resolution and a large display area. The software to drive them needs to scale too if arbitrarily large displays are to be built. Chromium is a popular software API used to construct such displays. Chromium transparently renders any OpenGL application to a tiled display by partitioning and sending individual OpenGL primitives to each client per frame. Visualization applications often deal with massive geometric data with millions of primitives. Transmitting them every frame results in huge network requirements that adversely affect the scalability of the system. In this paper, we present Garuda, a client-server-based display wall framework that uses off-the-shelf hardware and a standard network. Garuda is scalable to large tile configurations and massive environments. It can transparently render any application built using the Open Scene Graph (OSG) API to a tiled display without any modification by the user. The Garuda server uses an object-based scene structure represented using a scene graph. The server determines the objects visible to each display tile using a novel adaptive algorithm that culls the scene graph to a hierarchy of frustums. Required parts of the scene graph are transmitted to the clients, which cache them to exploit the interframe redundancy. A multicast-based protocol is used to transmit the geometry to exploit the spatial redundancy present in tiled display systems. A geometry push philosophy from the server helps keep the clients in sync with one another. Neither the server nor a client needs to render the entire scene, making the system suitable for interactive rendering of massive models. Transparent rendering is achieved by intercepting the cull, draw, and swap functions of OSG and replacing them with our own. We demonstrate the performance and scalability of the Garuda system for different configurations of display wall. We also show that the server and network loads grow sublinearly with the increase in the number of tiles, which makes our scheme suitable to construct very large displays.     

Nano and micro structural studies of thin films of ZnO

Zinc oxide thin films grown by sol–gel and RF sputtering methods have been characterized. The characterization techniques used involve ellipsometry, optical absorption, scanning tunneling microscopy, scanning and transmission electron microscopy. The films grown by sol–gel spin method which followed zinc acetate route exhibited a smoother texture than the films, which were deposited by using zinc nitrate route. The later type of films showed a dendritic character. Nano-structured fine grains of size ranging from 20 to 60 nm were observed with zinc nitrate precursor film. Individual grains show a sharp contrast with different facets and boundaries. Crystal planes and lattice parameters calculated by electron diffraction and X-ray diffraction are quite close and in agreement with the reported values in literature. Scanning tunneling microscopy has been used for measuring the average roughness of the surface and estimating the lattice constants. The STM studies of RF sputtered films, although showing a ZnO structure, exhibited a disturbed lattice. This was presumably due to the fact that after deposition the films were not annealed. Nanographs of 2D and 3D view of atomic positions of ZnO have been presented by using scanning tunneling microscopy.     

A parametrization for dissipative behaviors

The behavioral equivalent of single input single output (SISO) systems are behaviors with two manifest variables. Passive SISO systems can, therefore, be viewed as J-dissipative behaviors with two manifest variables. Here the special matrix J defines a QDF that captures the passivity property of SISO systems. In this paper, we investigate more general QDFs Q_Φs induced by some operator Φ. These QDFs define some relation between the input, the output and their derivatives of a SISO system. We characterize all behaviors that are dissipative with respect to the prescribed QDF Q_Φ. In fact, we parametrize all the behaviors dissipative with respect to Q_Φ in terms of those dissipative with respect to the special QDF Q_J induced by the matrix J. Similar results can also be given for lossless systems.