Abstract: In this paper, FinFET devices are analyzed with
emphasis on sub-threshold leakage current control. This is achieved
through proper biasing of the back gate, and through the use of
asymmetric work functions for the four terminal FinFET devices. We
are also examining different configurations of multiplexers and XOR
gates using transistors of symmetric and asymmetric work functions.
Based on extensive characterization data for MUX circuits, our
proposed configuration using symmetric devices lead to leakage
current and delay improvements of 65% and 47% respectively
compared to results in the literature. For XOR gates, a 90%
improvement in the average leakage current is achieved by using
asymmetric devices. All simulations are based on a 25nm FinFET
technology using the University of Florida UFDG model.
Abstract: In this paper, we study the application of Extreme
Learning Machine (ELM) algorithm for single layered feedforward
neural networks to non-linear chaotic time series problems. In this
algorithm the input weights and the hidden layer bias are randomly
chosen. The ELM formulation leads to solving a system of linear
equations in terms of the unknown weights connecting the hidden
layer to the output layer. The solution of this general system of
linear equations will be obtained using Moore-Penrose generalized
pseudo inverse. For the study of the application of the method we
consider the time series generated by the Mackey Glass delay
differential equation with different time delays, Santa Fe A and
UCR heart beat rate ECG time series. For the choice of sigmoid,
sin and hardlim activation functions the optimal values for the
memory order and the number of hidden neurons which give the
best prediction performance in terms of root mean square error are
determined. It is observed that the results obtained are in close
agreement with the exact solution of the problems considered
which clearly shows that ELM is a very promising alternative
method for time series prediction.
Abstract: In this paper, we consider the control of time delay system
by Proportional-Integral (PI) controller. By Using the Hermite-
Biehler theorem, which is applicable to quasi-polynomials, we seek
a stability region of the controller for first order delay systems. The
essence of this work resides in the extension of this approach to
second order delay system, in the determination of its stability region
and the computation of the PI optimum parameters. We have used
the genetic algorithms to lead the complexity of the optimization
problem.
Abstract: The problem of delay-range-dependent exponential synchronization is investigated for Lur-e master-slave systems with delay feedback control and Markovian switching. Using Lyapunov- Krasovskii functional and nonsingular M-matrix method, novel delayrange- dependent exponential synchronization in mean square criterions are established. The systems discussed in this paper is advanced system, and takes all the features of interval systems, Itˆo equations, Markovian switching, time-varying delay, as well as the environmental noise, into account. Finally, an example is given to show the validity of the main result.
Abstract: The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive for solving problems with multiple and conflicting objectives. This paper uses an elitist multiobjective evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm (NSGA), for solving the dynamic shortest path routing problem in computer networks. A priority-based encoding scheme is proposed for population initialization. Elitism ensures that the best solution does not deteriorate in the next generations. Results for a sample test network have been presented to demonstrate the capabilities of the proposed approach to generate well-distributed pareto-optimal solutions of dynamic routing problem in one single run. The results obtained by NSGA are compared with single objective weighting factor method for which Genetic Algorithm (GA) was applied.
Abstract: MANEMO is the integration of Network Mobility
(NEMO) and Mobile Ad Hoc Network (MANET). A MANEMO
node has an interface to both a MANET and NEMO network, and
therefore should choose the optimal interface for packet delivery,
however such a handover between interfaces will introduce packet
loss. We define the steps necessary for a MANEMO handover,
using Mobile IP and NEMO to signal the new binding to the
relevant Home Agent(s). The handover steps aim to minimize the
packet loss by avoiding waiting for Duplicate Address Detection
and Neighbour Unreachability Detection. We present expressions for
handover delay and packet loss, and then use numerical examples to
evaluate a MANEMO handover. The analysis shows how the packet
loss depends on level of nesting within NEMO, the delay between
Home Agents and the load on the MANET, and hence can be used
to developing optimal MANEMO handover algorithms.
Abstract: The effect of a time delay on the transmission on
dengue fever is studied. The time delay is due to the presence of an
incubation period for the dengue virus to develop in the mosquito
before the mosquito becomes infectious. The conditions for the
existence of a Hopf bifurcation to limit cycle behavior are
established. The conditions are different from the usual one and they
are based on whether a particular third degree polynomial has
positive real roots. A theorem for determining whether for a given
set of parameter values, a critical delay time exist is given. It is
found that for a set of realistic values of the parameters in the model,
a Hopf bifurcation can not occur. For a set of unrealistic values of
some of the parameters, it is shown that a Hopf bifurcation can occur.
Numerical solutions using this last set show the trajectory of two of
the variables making a transition from a spiraling orbit to a limit
cycle orbit.
Abstract: In this paper we propose a method for modeling the
correlation between the received signals by two or more antennas
operating in a multipath environment. Considering the maximum
excess delay in the channel being modeled, an elliptical region
surrounding both transmitter and receiver antennas is produced. A
number of scatterers are randomly distributed in this region and
scatter the incoming waves. The amplitude and phase of incoming
waves are computed and used to obtain statistical properties of the
received signals. This model has the distinguishable advantage of
being applicable for any configuration of antennas. Furthermore the
common PDF (Probability Distribution Function) of received wave
amplitudes for any pair of antennas can be calculated and used to
produce statistical parameters of received signals.
Abstract: Since 2004, we have been developing an in-situ storage image sensor (ISIS) that captures more than 100 consecutive images at a frame rate of 10 Mfps with ultra-high sensitivity as well as the video camera for use with this ISIS. Currently, basic research is continuing in an attempt to increase the frame rate up to 100 Mfps and above. In order to suppress electro-magnetic noise at such high frequency, a digital-noiseless imaging transfer scheme has been developed utilizing solely sinusoidal driving voltages. This paper presents highly efficient-yet-accurate expressions to estimate attenuation as well as phase delay of driving voltages through RC networks of an ultra-high-speed image sensor. Elmore metric for a fundamental RC chain is employed as the first-order approximation. By application of dimensional analysis to SPICE data, we found a simple expression that significantly improves the accuracy of the approximation. Similarly, another simple closed-form model to estimate phase delay through fundamental RC networks is also obtained. Estimation error of both expressions is much less than previous works, only less 2% for most of the cases . The framework of this analysis can be extended to address similar issues of other VLSI structures.
Abstract: Wheat has a bimodal starch granule population and the dependency of the rate of enzymatic hydrolysis on particle size has been investigated. Ungelatinised wheaten starch granules were separated into two populations by sedimentation and decantation. Particle size was analysed by laser diffraction and morphological characteristics were viewed using SEM. The sedimentation technique though lengthy, gave satisfactory separation of the granules. Samples (10μm and original) were digested with a-amylase using a dialysis model. Granules of 10μm (p10μm. Moreover, the digestion rate was dependent on particle size whereby smaller granules produced higher rate of release. The methodology and results reported here can be used as a basis for further evaluations designed to delay the release of glucose during the digestion of native starches.
Abstract: Signalized intersections on high-volume arterials are
often congested during peak hours, causing a decrease in through
movement efficiency on the arterial. Much of the vehicle delay
incurred at conventional intersections is caused by high left-turn
demand. Unconventional intersection designs attempt to reduce
intersection delay and travel time by rerouting left-turns away from
the main intersection and replacing it with right-turn followed by Uturn.
The proposed new type of U-turn intersection is geometrically
designed with a raised island which provides a protected U-turn
movement. In this study several scenarios based on different
distances between U-turn and main intersection, traffic volume of
major/minor approaches and percentage of left-turn volumes were
simulated by use of AIMSUN, a type of traffic microsimulation
software. Subsequently some models are proposed in order to
compute travel time of each movement. Eventually by correlating
these equations to some in-field collected data of some implemented
U-turn facilities, the reliability of the proposed models are approved.
With these models it would be possible to calculate travel time of
each movement under any kind of geometric and traffic condition. By
comparing travel time of a conventional signalized intersection with
U-turn intersection travel time, it would be possible to decide on
converting signalized intersections into this new kind of U-turn
facility or not. However comparison of travel time is not part of the
scope of this research. In this paper only travel time of this innovative
U-turn facility would be predicted. According to some before and
after study about the traffic performance of some executed U-turn
facilities, it is found that commonly, this new type of U-turn facility
produces lower travel time. Thus, evaluation of using this type of
unconventional intersection should be seriously considered.
Abstract: In this paper, we investigate the problem of the existence, uniqueness and global asymptotic stability of the equilibrium point for a class of neural networks, the neutral system has mixed time delays and parameter uncertainties. Under the assumption that the activation functions are globally Lipschitz continuous, we drive a new criterion for the robust stability of a class of neural networks with time delays by utilizing the Lyapunov stability theorems and the Homomorphic mapping theorem. Numerical examples are given to illustrate the effectiveness and the advantage of the proposed main results.
Abstract: In vitro gastro-duodenal digestion model was used to investigate the changes of emulsions under digestion conditions. Oil in water emulsions stabilized by whey proteins (2%) and stabilized by whey proteins (2%) with addition of carboxymethyl cellulose (0.75%) as gelling agent of continuous phase were prepared at pH7. Both emulsions were destabilized under gastric conditions; however the protective role of carboxymethyl cellulose was indicated by recording delay of fat digestibility of this emulsion. In the presence of carboxymethyl cellulose whey proteins on the interfacial surface of droplets were more resistant to gastric degradation causing limited hydrolysis of fat due to the poor acceptability of lipids for the enzymes. Studies of emulsions using in vivo model supported results from in vitro studies. Lower content of triglycerides in blood serum and higher amount of fecal fat of rats were determined when rats were fed by diet containing emulsion made with whey proteins and carboxymethyl cellulose.
Abstract: Structural representation and technology mapping of
a Boolean function is an important problem in the design of nonregenerative
digital logic circuits (also called combinational logic
circuits). Library aware function manipulation offers a solution to
this problem. Compact multi-level representation of binary networks,
based on simple circuit structures, such as AND-Inverter Graphs
(AIG) [1] [5], NAND Graphs, OR-Inverter Graphs (OIG), AND-OR
Graphs (AOG), AND-OR-Inverter Graphs (AOIG), AND-XORInverter
Graphs, Reduced Boolean Circuits [8] does exist in
literature. In this work, we discuss a novel and efficient graph
realization for combinational logic circuits, represented using a
NAND-NOR-Inverter Graph (NNIG), which is composed of only
two-input NAND (NAND2), NOR (NOR2) and inverter (INV) cells.
The networks are constructed on the basis of irredundant disjunctive
and conjunctive normal forms, after factoring, comprising terms with
minimum support. Construction of a NNIG for a non-regenerative
function in normal form would be straightforward, whereas for the
complementary phase, it would be developed by considering a virtual
instance of the function. However, the choice of best NNIG for a
given function would be based upon literal count, cell count and
DAG node count of the implementation at the technology
independent stage. In case of a tie, the final decision would be made
after extracting the physical design parameters.
We have considered AIG representation for reduced disjunctive
normal form and the best of OIG/AOG/AOIG for the minimized
conjunctive normal forms. This is necessitated due to the nature of
certain functions, such as Achilles- heel functions. NNIGs are found
to exhibit 3.97% lesser node count compared to AIGs and
OIG/AOG/AOIGs; consume 23.74% and 10.79% lesser library cells
than AIGs and OIG/AOG/AOIGs for the various samples considered.
We compare the power efficiency and delay improvement achieved
by optimal NNIGs over minimal AIGs and OIG/AOG/AOIGs for
various case studies. In comparison with functionally equivalent,
irredundant and compact AIGs, NNIGs report mean savings in power
and delay of 43.71% and 25.85% respectively, after technology
mapping with a 0.35 micron TSMC CMOS process. For a
comparison with OIG/AOG/AOIGs, NNIGs demonstrate average
savings in power and delay by 47.51% and 24.83%. With respect to
device count needed for implementation with static CMOS logic
style, NNIGs utilize 37.85% and 33.95% lesser transistors than their
AIG and OIG/AOG/AOIG counterparts.
Abstract: As embedded and portable systems were emerged power consumption of circuits had been major challenge. On the other hand latency as determines frequency of circuits is also vital task. Therefore, trade off between both of them will be desirable. Modulo 2n+1 adders are important part of the residue number system (RNS) based arithmetic units with the interesting moduli set (2n-1,2n, 2n+1). In this manuscript we have introduced novel binary representation to the design of modulo 2n+1 adder. VLSI realization of proposed architecture under 180 nm full static CMOS technology reveals its superiority in terms of area, power consumption and power-delay product (PDP) against several peer existing structures.
Abstract: To comply with the international human right
legislation concerning the freedom of movement, transport systems
are required to be made accessible in order that all citizens, regardless
of their physical condition, have equal possibilities to use them. In
Hungary, apparently there is a considerable default in the
improvement of accessible public transport. This study is aiming to
overview the current Hungarian situation and to reveal the reasons of
the deficiency. The result shows that in spite of the relatively
favourable juridical background linked to the accessibility needs and
to the rights of persons with disabilities there is a strong delay in
putting all in practice in the field of public transport. Its main reason
is the lack of financial resource and referring to this the lack of
creating mandatory regulations. In addition to this the proprietary
rights related to public transport are also variable, which also limits
the improvement possibilities. Consequently, first of all an accurate
and detailed regulatory procedure is expected to change the present
unfavourable situation and to create the conditions of the fast
realization, which is already behind time.
Abstract: To achieve the desired specifications of gain and
phase margins for plants with time-delay that stabilized with FO-PID
controller a lead compensator is designed. At first the range of
controlled system stability based on stability boundary criteria is
determined. Using stability boundary locus method in frequency
domain the fractional order controller parameters are tuned and then
with drawing bode diagram in frequency domain accessing to desired
gain and phase margin are shown. Numerical examples are given to
illustrate the shapes of the stabilizing region and to show the design
procedure.
Abstract: In this paper, first we introduce the stable distribution, stable process and theirs characteristics. The a -stable distribution family has received great interest in the last decade due to its success in modeling data, which are too impulsive to be accommodated by the Gaussian distribution. In the second part, we propose major applications of alpha stable distribution in telecommunication, computer science such as network delays and signal processing and financial markets. At the end, we focus on using stable distribution to estimate measure of risk in stock markets and show simulated data with statistical softwares.
Abstract: LSP routing is among the prominent issues in MPLS
networks traffic engineering. The objective of this routing is to
increase number of the accepted requests while guaranteeing the
quality of service (QoS). Requested bandwidth is the most important
QoS criterion that is considered in literatures, and a various number
of heuristic algorithms have been presented with that regards. Many
of these algorithms prevent flows through bottlenecks of the network
in order to perform load balancing, which impedes optimum
operation of the network. Here, a modern routing algorithm is
proposed as MIRAD: having a little information of the network
topology, links residual bandwidth, and any knowledge of the
prospective requests it provides every request with a maximum
bandwidth as well as minimum end-to-end delay via uniform load
distribution across the network. Simulation results of the proposed
algorithm show a better efficiency in comparison with similar
algorithms.
Abstract: For several high speed networks, providing resilience against failures is an essential requirement. The main feature for designing next generation optical networks is protecting and restoring high capacity WDM networks from the failures. Quick detection, identification and restoration make networks more strong and consistent even though the failures cannot be avoided. Hence, it is necessary to develop fast, efficient and dependable fault localization or detection mechanisms. In this paper we propose a new fault localization algorithm for WDM networks which can identify the location of a failure on a failed lightpath. Our algorithm detects the failed connection and then attempts to reroute data stream through an alternate path. In addition to this, we develop an algorithm to analyze the information of the alarms generated by the components of an optical network, in the presence of a fault. It uses the alarm correlation in order to reduce the list of suspected components shown to the network operators. By our simulation results, we show that our proposed algorithms achieve less blocking probability and delay while getting higher throughput.