Modern Computational Devices Research Articles

STCA: Utilizing a spatio-temporal cross-attention network for enhancing video person re-identification

Video-based re-identification (ReID) is a crucial task in computer vision that draws increasing attention due to advances in deep learning (DL) and modern computational devices. Despite recent success with CNN architectures, single models (e.g., 2D-CNNs or 3D-CNNs) alone failed to leverage temporal information with spatial cues. This is due to uncontrolled surveillance scenarios and variable poses leading to inevitable misalignment of ROIs across the tracklets, which is accompanied by occlusion and motion blur. In this context, designing temporal and spatial cues for two different models and their combinations can be beneficial, considering the global of a video-tracklet. 3D-CNNs allow encoding of temporal information while 2D-CNNs extract spatial or appearance information. In this paper, we propose a Spatio-Temporal Cross Attention (STCA) network to utilize both 2D-CNNs and 3D-CNNs that calculate the cross attention mapping both from the layer of 3D-CNNs and 2D-CNNs along a person's trajectory to gate the following layers of 2D-CNNs; and highlight relevant appearance features for the person ReID. Given an input tracklet, the proposed cross attention (CA) is able to capture the salient regions that propagate throughout the tracklet to obtain the global view. This provides a spatio-temporal attention approach that can be dynamically aggregated with spatial features of 2D-CNNs to perform finer-grained recognition. Additionally, we exploit the advantage of utilizing cosine similarity while triplet sampling as well as for calculating the final recognition score. Experimental analyses on three challenging benchmark datasets indicate that integrating spatio-temporal cross attention into the state-of-the-art video ReID backbone CNN architecture allows for improving their recognition accuracy.

On the hierarchical design of biochemical-based digital computations

The understanding of the biochemical processes underpinning various biological systems has significantly increased in recent decades and has even prompted reverse engineering of certain of life's more complex processes. The most prominent example is modern computers designed to mimic neuron activity. This work forms part of growing endeavors to return advances in the theory of computation and electronics to biology. In this context, we present a set of requirements sufficient for the design of biochemical analogs of modern electronics in a hierarchical, modular fashion that mimics the design of modern computational devices. This theoretical approach is based on a simple enzymatic analog of the transistor and supported by numerical simulations of biochemical models of enzymatic networks equivalent to complex, and modular, interconnecting electronic circuitry (including clocks, Flip-Flops, adders, decoders, and multiplexers). Furthermore, the proposed approach has been implemented in the form of a Python library capable of creating and testing models of complex bio-analog digital computations based on the execution of an elementary universal logic gate. In tribute to Claude Shannon, our biochemical network materializes his example of a “password” recognition that moves the language of the modern theory of automata beyond combinatorial logic and towards sequential logic.

Thermal conductivity enhancement for CuO nanoflakes in oil‐based and oil blend‐based nanofluids

AbstractWe report the synthesis and characterization of copper oxide (CuO) nanoflakes (Nflks) for thermal conductivity analysis. The synthesized Nflks were used for the preparation of oil‐based and oil blend‐based nanofluids. A dynamic light scattering study was carried out for aqueous suspension of CuO Nflks. The size distribution data show the two peaks emerged at 178.2 ± 31.77 nm and 861.7 ± 248.6 nm. The zeta potential was investigated, and the peak was observed at −46.4 ± 14.3 mV. The average thermal conductivity coefficients were calculated for mineral oil, sunflower oil, and oil blend, which were found to be 0.086, 0.105, and 0.099 W/mK, respectively. Furthermore, thermal conductivity enhancement was calculated, and the maximum percent enhancement was recorded for sunflower oil‐based nanofluid, which was found to be ~20.68% at 0.46 vol%. At similar vol%, the enhancement in thermal conductivity in oil blend‐based and mineral oil‐based nanofluids was found to be 16.14 and 15.73%, respectively. The oil‐based nanofluids are promising in electronics and modern computational devices to minimize the heating effect.

Design and analysis of high-speed 8-bit ALU using 18 nm FinFET technology

All modern computational devices consist of ALU. With increase in complexity of software and the consistent shift of software towards parallelism, high speed processors with hardware support for time consuming operations such as multiplication would benefit. Smaller, compact devices such as IoT devices need to run software such as security software and be able to offload computation cost from the cloud. In this paper, a high speed 8-bit ALU using 18 nm FinFET technology is proposed. The arithmetic and logical unit consists of fast compute units such as Kogge Stone fast adder and Dadda multiplier along with basic logic gates. In this paper, an ALU with each compute unit optimized for speed is proposed, while responsibly consuming area. Dadda multiplier is of 8 × 8 architecture as opposed to conventional approach of 4 × 4 making it a true 8-bit ALU. Simulation and analysis is done using Cadence Virtuoso in Analog Design Environment. The transistor count of proposed design is 5298, the power consumption is 219 µW and maximum delay is 166.8 ps. The design is also expected to consume a maximum of one clock cycle for any computation.

Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm.

Global error estimation and control in linearly-implicit parallel two-step peer W-methods

The class of linearly-implicit parallel two-step peer W-methods has been designed recently for efficient numerical solutions of stiff ordinary differential equations. Those schemes allow for parallelism across the method, that is an important feature for implementation on modern computational devices. Most importantly, all stage values of those methods possess the same properties in terms of stability and accuracy of numerical integration. This property results in the fact that no order reduction occurs when they are applied to very stiff problems. In this paper, we develop parallel local and global error estimation schemes that allow the numerical solution to be computed for a user-supplied accuracy requirement in automatic mode. An algorithm of such global error control and other technical particulars are also discussed here. Numerical examples confirm efficiency of the presented error estimation and stepsize control algorithm on a number of test problems with known exact solutions, including nonstiff, stiff, very stiff and large-scale differential equations. A comparison with the well-known stiff solver RODAS is also shown.

The Diffusional Boundary Layer: Some Implications for the Dyeing Technologist

This paper was presented at the Second AA TCC Inter–national Dyeing Symposium held at the Marriott Twin Bridges Hotel, Washington, D. C., USA, on 5–6 May 1980.“mathematics are either pure or mixed. and as for the mixed mathematics, I may only make this prediction, that there cannot fail to be more kinds of them, as nature grows further disclosed.”Modern computational devices of the 1980s, e. g., the new card programmable “pocket” calculators, provide the dyeing technologist with a useful and inexpensive means of reducing the formidability of computation associated with the use of complex diffusion equations. Armed with these modern tools, the dyeing technologist of the 1980s can use the previously imposing “boundary layer”diffusion equations of Newman or Crank in a purely chemical engineering way – coupled with statistical techniques – to estimate the optimum apparent value of L simultaneously with the optimum apparent diffusion coefficient. Analysis of real dyeing systems in terms of these fundamental physico–chemical parameters, although impossible to carry out to rigorous completion, nevertheless can help to improve the modern technologist's awareness of the influence of flow rate on level–ness in commercial dyeing processes.

On Popular Methods and Extant Problems in the Solution of Polynomial Equations

demonstrates immediately the inefficacy of these theorems in finding all the roots. However, at present, with the advent of modern computational devices, new procedures for solving (1.1) have emerged and older ones, once considered folly, have entered into the realm of practicality. Let us examine these, and other interesting techniques, and, where possible, indicate vital remaining problems and inadequacies. The only two assumptions made are that an =l and that the reader who is interested in detailed examples will consult the references given with each technique, where abundant examples exist.