Abstract: The modern telecommunication industry demands
higher capacity networks with high data rate. Orthogonal frequency
division multiplexing (OFDM) is a promising technique for high data
rate wireless communications at reasonable complexity in wireless
channels. OFDM has been adopted for many types of wireless
systems like wireless local area networks such as IEEE 802.11a, and
digital audio/video broadcasting (DAB/DVB). The proposed research
focuses on a concatenated coding scheme that improve the
performance of OFDM based wireless communications. It uses a
Redundant Residue Number System (RRNS) code as the outer code
and a convolutional code as the inner code. Here, a direct conversion
of analog signal to residue domain is done to reduce the conversion
complexity using sigma-delta based parallel analog-to-residue
converter. The bit error rate (BER) performances of the proposed
system under different channel conditions are investigated. These
include the effect of additive white Gaussian noise (AWGN),
multipath delay spread, peak power clipping and frame start
synchronization error. The simulation results show that the proposed
RRNS-Convolutional concatenated coding (RCCC) scheme provides
significant improvement in the system performance by exploiting the
inherent properties of RRNS.
Abstract: Every day human life experiences new equipments
more automatic and with more abilities. So the need for faster
processors doesn-t seem to finish. Despite new architectures and
higher frequencies, a single processor is not adequate for many
applications. Parallel processing and networks are previous solutions
for this problem. The new solution to put a network of resources on a
chip is called NOC (network on a chip). The more usual topology for
NOC is mesh topology. There are several routing algorithms suitable
for this topology such as XY, fully adaptive, etc. In this paper we
have suggested a new algorithm named Intermittent X, Y (IX/Y). We
have developed the new algorithm in simulation environment to
compare delay and power consumption with elders' algorithms.
Abstract: A motion protection system is designed for a parallel
motion platform with subsided cabin. Due to its complex structure,
parallel mechanism is easy to encounter interference problems
including link length limits, joints limits and self-collision. Thus a
virtual spring algorithm in operational space is developed for the
motion protection system to avoid potential damages caused by
interference. Simulation results show that the proposed motion
protection system can effectively eliminate interference problems and
ensure safety of the whole motion platform.
Abstract: We propose the use of magneto-optic Kerr effect (MOKE) to realize single-qubit quantum gates. We consider longitudinal and polar MOKE in reflection geometry in which the magnetic field is parallel to both the plane of incidence and surface of the film. MOKE couples incident TE and TM polarized photons and the Hamiltonian that represents this interaction is isomorphic to that of a canonical two-level quantum system. By varying the phase and amplitude of the magnetic field, we can realize Hadamard, NOT, and arbitrary phase-shift single-qubit quantum gates. The principal advantage is operation with magnetically non-transparent materials.
Abstract: Since the one-to-one word translator does not have the
facility to translate pragmatic aspects of Javanese, the parallel text
alignment model described uses a phrase pair combination. The
algorithm aligns the parallel text automatically from the beginning to
the end of each sentence. Even though the results of the phrase pair
combination outperform the previous algorithm, it is still inefficient.
Recording all possible combinations consume more space in the
database and time consuming. The original algorithm is modified by
applying the edit distance coefficient to improve the data-storage
efficiency. As a result, the data-storage consumption is 90% reduced
as well as its learning period (42s).
Abstract: This paper describes a method to measure and
compensate a 4 axes ultra-precision machine tool that generates micro
patterns on the large surfaces. The grooving machine is usually used
for making a micro mold for many electrical parts such as a light guide
plate for LCD and fuel cells. The ultra precision machine tool has three
linear axes and one rotational table. Shaping is usually used to
generate micro patterns. In the case of 50 μm pitch and 25 μm height
pyramid pattern machining with a 90° wedge angle bite, one of linear
axis is used for long stroke motion for high cutting speed and other
linear axis are used for feeding. The triangular patterns can be
generated with many times of long stroke of one axis. Then 90°
rotation of work piece is needed to make pyramid patterns with
superposition of machined two triangular patterns.
To make a two dimensional positioning error, straightness of two
axes in out of plane, squareness between the each axis are important.
Positioning errors, straightness and squarness were measured by laser
interferometer system. Those were compensated and confirmed by
ISO230-6. One of difficult problem to measure the error motions is
squareness or parallelism of axis between the rotational table and
linear axis. It was investigated by simultaneous moving of rotary table
and XY axes. This compensation method is introduced in this paper.
Abstract: Considering today-s increasing speed of change,
radical and innovative improvement - Kaikaku, is a necessity parallel
to continuous incremental improvement - Kaizen, especially for
SME-s in order to attain the competitive edge needed to be profitable.
During 2011, a qualitative single case study with the objective of
realizing a kaikaku in production has been conducted. The case study
was run as a one year project using a collaborative approach
including both researchers and company representatives. The case
study was conducted with the purpose of gaining further knowledge
about kaikaku realization as well as its implications. The empirical
results provide insights about the great productivity results achieved
by applying a specific kaikaku realization approach. However, it also
sheds light on the difficulty and contradiction of combining
innovation management and production system development.
Abstract: In this document we studied more in detail the Performances of the vertical handover in the networks WLAN, WiMAX, UMTS before studying of it the Procedure of Handoff Vertical, the whole buckled by simulations putting forward the performances of the handover in the heterogeneous networks. The goal of Vertical Handover is to carry out several accesses in real-time in the heterogeneous networks. This makes it possible a user to use several networks (such as WLAN UMTS andWiMAX) in parallel, and the system to commutate automatically at another basic station, without disconnecting itself, as if there were no cut and with little loss of data as possible.
Abstract: The paper describes the workings for four models of
CONWIP systems used till date; the basic CONWIP system, the
hybrid CONWIP system, the multi-product CONWIP system, and the
parallel CONWIP system. The final novel model is introduced in this
paper in a general form. These models may be adopted for analysis
for both simulation studies and implementation on the shop floor. For
each model, input parameters of interest are highlighted and their
impacts on several system performance measures are addressed.
Abstract: An original Direct Numerical Simulation (DNS) method to tackle the problem of particulate flows at moderate to high concentration and finite Reynolds number is presented. Our method is built on the framework established by Glowinski and his coworkers [1] in the sense that we use their Distributed Lagrange Multiplier/Fictitious Domain (DLM/FD) formulation and their operator-splitting idea but differs in the treatment of particle collisions. The novelty of our contribution relies on replacing the simple artificial repulsive force based collision model usually employed in the literature by an efficient Discrete Element Method (DEM) granular solver. The use of our DEM solver enables us to consider particles of arbitrary shape (at least convex) and to account for actual contacts, in the sense that particles actually touch each other, in contrast with the simple repulsive force based collision model. We recently upgraded our serial code, GRIFF 1 [2], to full MPI capabilities. Our new code, PeliGRIFF 2, is developed under the framework of the full MPI open source platform PELICANS [3]. The new MPI capabilities of PeliGRIFF open new perspectives in the study of particulate flows and significantly increase the number of particles that can be considered in a full DNS approach: O(100000) in 2D and O(10000) in 3D. Results on the 2D/3D sedimentation/fluidization of isometric polygonal/polyedral particles with collisions are presented.
Abstract: Many studies have shown that parallelization decreases efficiency [1], [2]. There are many reasons for these decrements. This paper investigates those which appear in the context of parallel data integration. Integration processes generally cannot be allocated to packages of identical size (i. e. tasks of identical complexity). The reason for this is unknown heterogeneous input data which result in variable task lengths. Process delay is defined by the slowest processing node. It leads to a detrimental effect on the total processing time. With a real world example, this study will show that while process delay does initially increase with the introduction of more nodes it ultimately decreases again after a certain point. The example will make use of the cloud computing platform Hadoop and be run inside Amazon-s EC2 compute cloud. A stochastic model will be set up which can explain this effect.
Abstract: An approach and its implementation in 0.18 m CMOS process of the multichannel ASIC for capacitive (up to 30 pF) sensors are described in the paper. The main design aim was to study an analog data-driven architecture. The design was done for an analog derandomizing function of the 128 to 16 structure. That means that the ASIC structure should provide a parallel front-end readout of 128 input analog sensor signals and after the corresponding fast commutation with appropriate arbitration logic their processing by means of 16 output chains, including analog-to-digital conversion. The principal feature of the ASIC is a low power consumption within 2 mW/channel (including a 9-bit 20Ms/s ADC) at a maximum average channel hit rate not less than 150 kHz.
Abstract: This paper presents the design and analysis of a parallel
connected inverter configuration of. The configuration consists of
parallel connected three-phase dc/ac inverter. Series resistors added
to the inverter output to maintain same current in each inverter of the
two parallel inverters, and to reduce the circulating current in the
parallel inverters to the minimum. High frequency third harmonic
injection PWM (THIPWM) employed to reduce the total harmonic
distortion and to make maximum use of the voltage source. DSP was
used to generate the THIPWM and the control algorithm for the
converter. Selected experimental results have been shown to validate
the proposed system.
Abstract: In a previous work, we presented the numerical
solution of the two dimensional second order telegraph partial
differential equation discretized by the centred and rotated five-point
finite difference discretizations, namely the explicit group (EG) and
explicit decoupled group (EDG) iterative methods, respectively. In
this paper, we utilize a domain decomposition algorithm on these
group schemes to divide the tasks involved in solving the same
equation. The objective of this study is to describe the development
of the parallel group iterative schemes under OpenMP programming
environment as a way to reduce the computational costs of the
solution processes using multicore technologies. A detailed
performance analysis of the parallel implementations of points and
group iterative schemes will be reported and discussed.
Abstract: This paper discusses the novel graphical approach for
stability analysis of multi induction motor drive controlled by a single
inverter. Stability issue arises in parallel connected induction motors
under unbalanced load conditions. The two powerful globally
accepted modeling and simulation software packages such as
MATLAB and LabVIEW are selected to perform the stability
analysis. The stability investigation is performed for different load
conditions and difference in stator and rotor resistances among the
two motors. It is very simple and effective than the techniques
presented to obtain the stability of the parallel connected induction
motor drive under unbalanced load conditions. Approximate transfer
functions are considered to model the induction motors, load
dynamics, speed controllers and inverter. Simulink library tools are
utilized to model the entire drive scheme in MATLAB. Stability
study is discussed in LabVIEW using control design and simulation
toolkits. Simulation results are illustrated for various running
conditions to demonstrate the effectiveness of the transfer function
method.
Abstract: We consider a network of two M/M/1 parallel queues having the same poisonnian arrival stream with rate λ. Upon his arrival to the system a customer heads to the shortest queue and stays until being served. If the two queues have the same length, an arriving customer chooses one of the two queues with the same probability. Each duration of service in the two queues is an exponential random variable with rate μ and no jockeying is permitted between the two queues. A new numerical method, based on linear programming and convex optimization, is performed for the computation of the steady state solution of the system.
Abstract: The demand for higher performance graphics
continues to grow because of the incessant desire towards realism.
And, rapid advances in fabrication technology have enabled us to
build several processor cores on a single die. Hence, it is important to
develop single chip parallel architectures for such data-intensive
applications. In this paper, we propose an efficient PIM architectures
tailored for computer graphics which requires a large number of
memory accesses. We then address the two important tasks necessary
for maximally exploiting the parallelism provided by the architecture,
namely, partitioning and placement of graphic data, which affect
respectively load balances and communication costs. Under the
constraints of uniform partitioning, we develop approaches for optimal
partitioning and placement, which significantly reduce search space.
We also present heuristics for identifying near-optimal placement,
since the search space for placement is impractically large despite our
optimization. We then demonstrate the effectiveness of our partitioning
and placement approaches via analysis of example scenes; simulation
results show considerable search space reductions, and our heuristics
for placement performs close to optimal – the average ratio of
communication overheads between our heuristics and the optimal was
1.05. Our uniform partitioning showed average load-balance ratio of
1.47 for geometry processing and 1.44 for rasterization, which is
reasonable.
Abstract: In theoretical computer science, the Turing machine has played a number of important roles in understanding and exploiting basic concepts and mechanisms in computing and information processing [20]. It is a simple mathematical model of computers [9]. After that, M.Blum and C.Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing, and investigated their pattern recognition abilities in 1967 [7]. Since then, a lot of researchers in this field have been investigating many properties about automata on a two- or three-dimensional tape. On the other hand, the question of whether processing fourdimensional digital patterns is much more difficult than two- or threedimensional ones is of great interest from the theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computasional model of four-dimensional pattern processing has been meaningful [8]-[19],[21]. This paper introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape where these finite automata work independently (in parallel). Those finite automata whose input heads scan the same cell of the input tape can communicate with each other, that is, every finite automaton is allowed to know the internal states of other finite automata on the same cell it is scanning at the moment. In this paper, we mainly investigate some accepting powers of a cooperating system of eight- or seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is an eight-way four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the fu-ture, but not in the past on a four-dimensional input tape.
Abstract: In this paper we present the modeling, design, and
experimental testing of a nerve cuff multi-electrode system for
diameter-selective vagus nerve stimulation.
The multi-electrode system contained ninety-nine platinum
electrodes embedded within a self-curling spiral silicone sheet. The
electrodes were organized in a matrix having nine parallel groups,
each containing eleven electrodes.
Preliminary testing of the nerve cuff was performed in an isolated
segment of a swinish left cervical vagus nerve. For selective vagus
nerve stimulation, precisely defined current quasitrapezoidal,
asymmetric and biphasic stimulating pulses were applied to
preselected locations along the left vagus segment via appointed
group of three electrodes within the cuff. Selective stimulation was
obtained by anodal block. However, these pulses may not be safe for
a long-term application because of a frequently used high imbalance
between the cathodic and anodic part of the stimulating pulse.
Preliminary results show that the cuff was capable of exciting A
and B-fibres, and, that for a certain range of parameters used in
stimulating pulses, the contribution of A-fibres to the CAP was
slightly reduced and the contribution of B-fibres was slightly larger.
Results also showed that measured CAPs are not greatly
influenced by the imbalance between a charge Qc injected in cathodic
and Qa in anodic phase of quasitrapezoidal, asymmetric and biphasic
pulses.
Abstract: Large-scale systems such as Grids offer
infrastructures for both data distribution and parallel processing. The
use of Grid infrastructures is a more recent issue that is already
impacting the Distributed Database Management System industry. In
DBMS, distributed query processing has emerged as a fundamental
technique for ensuring high performance in distributed databases.
Database placement is particularly important in large-scale systems
because it reduces communication costs and improves resource
usage. In this paper, we propose a dynamic database placement
policy that depends on query patterns and Grid sites capabilities. We
evaluate the performance of the proposed database placement policy
using simulations. The obtained results show that dynamic database
placement can significantly improve the performance of distributed
query processing.