Synthesis,characterization, and supercapacitor studies of manganese (IV) oxide nanowires

One-dimensional manganese (IV) oxide (MnO₂) (～20 nm in average diameter) were synthesized by cathodic electrodeposition and heat treatment. The mechanism of electrodeposition and nanowire formation were discussed. The product was characterized by X-ray diffraction (XRD), scanning electron microscopy (SEM), transmission electron microscopy (TEM) and Fourier transform infrared (FT-IR). Nanowires with varying lengths and diameters were found in TEM and SEM images of the sample. The results of N₂ adsorption–desorption analysis indicated that the BET surface area of the MnO₂ nanowires was 157 m² g^?1 and the pore size distributions were 2.5 and 4.5 nm. The electrochemical performances of the prepared MnO₂ as an electrode material for supercapacitors were evaluated by cyclic voltammetry and galvanostatic charge/discharge measurements in a solution of 0.5 M Na₂SO₄. The higher specific capacitance of 318 F g^?1 and good capacity retention of 86% were achieved after 1000 charge–discharge cycles had been observed for the MnO₂ nanowires electrode.     

Steady-state analysis of quantized distributed incremental LMS algorithm without Gaussian restriction

In this paper, we analyze the steady-state performance of the distributed incremental least mean-square (DILMS) algorithm when it is implemented in finite-precision arithmetic. Our analysis in this paper does not consider any distribution of input data. We first formulate the update equation for quantized DILMS algorithm, and then we use a spatial-temporal energy conservation argument to derive theoretical expressions that evaluate the steady-state performance of individual nodes in the network. We consider mean-square error, excess mean-square error, and mean-square deviation as the performance criteria. Simulation results are generated by using two types of signals, Gaussian and non-Gaussian distributed signals. As the simulation results show, there is a good match between the theory and simulation.     

Velocity-image model for online signature verification.

In general, online signature capturing devices provide outputs in the form of shape and velocity signals. In the past, strokes have been extracted while tracking velocity signal minimas. However, the resulting strokes are larger and complicated in shape and thus make the subsequent job of generating a discriminative template difficult. We propose a new stroke-based algorithm that splits velocity signal into various bands. Based on these bands, strokes are extracted which are smaller and more simpler in nature. Training of our proposed system revealed that low- and high-velocity bands of the signal are unstable, whereas the medium-velocity band can be used for discrimination purposes. Euclidean distances of strokes extracted on the basis of medium velocity band are used for verification purpose. The experiments conducted show improvement in discriminative capability of the proposed stroke-based system.     

Collision avoidance slot allocation scheme for multi-cluster wireless sensor networks

This paper introduces a collision avoidance slot allocation scheme for Time Division Multiple Access (TDMA) based Medium Access Control (MAC) in multi-cluster wireless sensor networks. TDMA MAC protocols have built-in active-sleep duty cycle that can be leveraged for limiting idle listening. Also, they can overcome the overhearing problem, thus have better energy efficiency. Enabling concurrent intra-cluster communications using a single radio channel is a key issue in TDMA MAC protocols. Using orthogonal frequency channels or different Code Division Multiple Access codes for different adjacent clusters can solve the problem at the expense of cost. In this paper, we propose a new distributed slot allocation protocol called  Coordinated   Time   Slot   Allocation (CTSA) that can reduce collisions significantly using a single radio channel. We use simulations to study the effects of different system parameters on the performance of our proposed protocol. Simulation results show that applying CTSA over clustering protocols can significantly reduce collisions. It also shows fast convergence for our proposed CTSA protocol. In this paper we apply our CTSA scheme to the Low Energy Adaptive Clustering Hierarchy protocol which forms the basis for many cluster based routing protocols. CTSA is also compared with the SRSA algorithm proposed by Wu and Biswas (Wirel Netw 13(5):691–703, 2007) by means of simulation.     

Two new low-power Full Adders based on majority-not gates

Two novel low-power 1-bit Full Adder cells are proposed in this paper. Both of them are based on majority-not gates, which are designed with new methods in each cell. The first cell is only composed of input capacitors and CMOS inverters, and the second one also takes advantage of a high-performance CMOS bridge circuit. These kinds of designs enjoy low power consumption, a high degree of regularity, and simplicity. Low power consumption is targeted in implementation of our designs. Eight state-of-the-art 1-bit Full Adders and two proposed Full Adders are simulated using 0.18 μm CMOS technology at many supply voltages. Simulation results demonstrate improvement in terms of power consumption and power-delay product (PDP).     

MDP-Based Network Selection Scheme by Genetic Algorithm and Simulated Annealing for Vertical-Handover in Heterogeneous Wireless Networks

The hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. Markov processes are widely used in performance modelling of wireless and mobile communication systems. We address the problem of optimal wireless network selection during vertical handover, based on the received information, by embedding the decision problem in a Markov decision process (MDP) with genetic algorithm (GA), we use GA to find a set of optimal decisions that ensures the best trade-off between QoS based on their priority level. Then, we emerge improved genetic algorithm (IGA) with simulated annealing (SA) as leading methods for search and optimization problems in heterogeneous wireless networks. We formulate the vertical handoff decision problem as a MDP, with the objectives of maximizing the expected total reward and minimizing average number of handoffs. A reward function is constructed to assess the QoS during each connection, and the AHP method are applied in an iterative way, by which we can work out a stationary deterministic handoff decision policy. As it is, the characteristics of the current mobile devices recommend using fast and efficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithm that avoid the slow and massive computations. This paper compares the formulation and results of five recent optimization algorithms: artificial bee colony, GA, differential evolution, particle swarm optimization and hybrid of (GA–SA). Simulation results indicated that choosing the SA rules would minimize the cost function, and also that, the IGA–SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.     

Efficient Pattern Generation for Small-Delay Defects Using Selection of Critical Faults

Testing for small-delay defects (SDDs) has become necessary as technology further scales. Existing tools and methodologies for generating SDD patterns suffer from: limited long-paths sensitization capability, overwhelming pattern volume, time-consuming pattern generation process, and vague evaluations of pattern quality. Such situation places patterns in a dilemma where the generation and application effort are huge yet the results cannot reflect the physical phenomena clearly enough for correct binning and diagnosis. In this paper, we focus on establishing a pattern generation flow that produces patterns of high application value. Firstly, critical faults are identified in order to generate high-quality original pattern repository with n-detect ATPG.A novelpattern evaluation and selection method that further minimizes pattern count while maintaining the SDD detection ability is then presented. Top-off ATPG is then performed to ensure meeting the target fault coverage. Along with the flow, multiple evaluation metrics are also proposed to measure the pattern’s efficiency on SDD coverage, unique SDD detection, detectable SDD size, long path distribution, etc. Experimental results demonstrate that the proposed critical fault-based method improves long path sensitization efficiency by 2.5× without impairing its average delay and saves approximately 80 % CPU runtime compared with total fault-based method. Comparing with timing-aware ATPG, the generated pattern set detects equivalent or even more SDDs with significantly reduced pattern count.