Abstract: The purpose of this article is to optimize the Equivalent Electric Circuit Model (EECM) of different orders to obtain greater precision in the modeling of Li-ion battery packs. Optimization includes considering circuits based on 1RC, 2RC and 3RC networks, with a dependent voltage source and a series resistor. The parameters are obtained experimentally using tests in the time domain and in the frequency domain. Due to the high non-linearity of the behavior of the battery pack, Genetic Algorithm (GA) was used to solve and optimize the parameters of each EECM considered (1RC, 2RC and 3RC). The objective of the estimation is to minimize the mean square error between the measured impedance in the real battery pack and those generated by the simulation of different proposed circuit models. The results have been verified by comparing the Nyquist graphs of the estimation of the complex impedance of the pack. As a result of the optimization, the 2RC and 3RC circuit alternatives are considered as viable to represent the battery behavior. These battery pack models are experimentally validated using a hardware-in-the-loop (HIL) simulation platform that reproduces the well-known New York City cycle (NYCC) and Federal Test Procedure (FTP) driving cycles for electric vehicles. The results show that using GA optimization allows obtaining EECs with 2RC or 3RC networks, with high precision to represent the dynamic behavior of a battery pack in vehicular applications.
Abstract: Lead time is a critical measure of a supply chain's
performance. It impacts both the customer satisfactions as well as the
total cost of inventory. This paper presents the result of a study on the
analysis of the customer order lead-time for a multinational company.
In the study, the lead time was divided into three stages respectively:
order entry, order fulfillment, and order delivery. A sample of size 2,425 order lines was extracted from the
company's records to use for this study. The sample data entails
information regarding customer orders from the time of order entry
until order delivery. Data regarding the lead time of each stage for
different orders were also provided. Summary statistics on lead time
data reveals that about 30% of the orders were delivered later than the
scheduled due date. The result of the multiple linear regression
analysis technique revealed that component type, logistics parameter,
order size and the customer type have significant impacts on lead
time. Data analysis on the stages of lead time indicates that stage 2
consumed over 50% of the lead time. Pareto analysis was made to
study the reasons for the customer order delay in each stage.
Recommendation was given to resolve the problem.
Abstract: In this paper, an optimal design of linear phase digital
high pass finite impulse response (FIR) filter using Particle Swarm
Optimization with Constriction Factor and Inertia Weight Approach
(PSO-CFIWA) has been presented. In the design process, the filter
length, pass band and stop band frequencies, feasible pass band and
stop band ripple sizes are specified. FIR filter design is a multi-modal
optimization problem. The conventional gradient based optimization
techniques are not efficient for digital filter design. Given the filter
specifications to be realized, the PSO-CFIWA algorithm generates a
set of optimal filter coefficients and tries to meet the ideal frequency
response characteristic. In this paper, for the given problem, the
designs of the optimal FIR high pass filters of different orders have
been performed. The simulation results have been compared to those
obtained by the well accepted algorithms such as Parks and
McClellan algorithm (PM), genetic algorithm (GA). The results
justify that the proposed optimal filter design approach using PSOCFIWA
outperforms PM and GA, not only in the accuracy of the
designed filter but also in the convergence speed and solution
quality.
Abstract: A new strategy of control is formulated for chaos synchronization of non-identical chaotic systems with different orders using the Borne and Gentina practical criterion associated with the Benrejeb canonical arrow form matrix, to drift the stability property of dynamic complex systems. The designed controller ensures that the state variables of controlled chaotic slave systems globally synchronize with the state variables of the master systems, respectively. Numerical simulations are performed to illustrate the efficiency of the proposed method.
Abstract: The theory of Groebner Bases, which has recently been
honored with the ACM Paris Kanellakis Theory and Practice Award,
has become a crucial building block to computer algebra, and is
widely used in science, engineering, and computer science. It is wellknown
that Groebner bases computation is EXP-SPACE in a general
setting. In this paper, we give an algorithm to show that Groebner
bases computation is P-SPACE in Boolean rings. We also show that
with this discovery, the Groebner bases method can theoretically be
as efficient as other methods for automated verification of hardware
and software. Additionally, many useful and interesting properties of
Groebner bases including the ability to efficiently convert the bases
for different orders of variables making Groebner bases a promising
method in automated verification.
Abstract: Existing work in temporal logic on representing the
execution of infinitely many transactions, uses linear-time temporal
logic (LTL) and only models two-step transactions. In this paper,
we use the comparatively efficient branching-time computational tree
logic CTL and extend the transaction model to a class of multistep
transactions, by introducing distinguished propositional variables
to represent the read and write steps of n multi-step transactions
accessing m data items infinitely many times. We prove that the
well known correspondence between acyclicity of conflict graphs
and serializability for finite schedules, extends to infinite schedules.
Furthermore, in the case of transactions accessing the same set of
data items in (possibly) different orders, serializability corresponds
to the absence of cycles of length two. This result is used to give an
efficient encoding of the serializability condition into CTL.
Abstract: A new approach for timestamp ordering problem in
serializable schedules is presented. Since the number of users using
databases is increasing rapidly, the accuracy and needing high
throughput are main topics in database area. Strict 2PL does not
allow all possible serializable schedules and so does not result high
throughput. The main advantages of the approach are the ability to
enforce the execution of transaction to be recoverable and the high
achievable performance of concurrent execution in central databases.
Comparing to Strict 2PL, the general structure of the algorithm is
simple, free deadlock, and allows executing all possible serializable
schedules which results high throughput. Various examples which
include different orders of database operations are discussed.