Abstract: The spiral angle of the elementary cellulose fibril in
the wood cell wall, often called microfibril angle, (MFA). Microfibril
angle in hardwood is one of the key determinants of solid timber
performance due to its strong influence on the stiffness, strength,
shrinkage, swelling, thermal-dynamics mechanical properties and
dimensional stability of wood. Variation of MFA (degree) in the S2
layer of the cell walls among Acacia mangium trees was determined
using small-angle X-ray scattering (SAXS). The length and
orientation of the microfibrils of the cell walls in the irradiated
volume of the thin samples are measured using SAXS and optical
microscope for 3D surface measurement. The undetermined
parameters in the analysis are the MFA, (M) and the standard
deviation (σФ) of the intensity distribution arising from the wandering
of the fibril orientation about the mean value. Nine separate pairs of
values are determined for nine different values of the angle of the
incidence of the X-ray beam relative to the normal to the radial
direction in the sample. The results show good agreement. The
curve distribution of scattered intensity for the real cell wall structure
is compared with that calculated with that assembly of rectangular
cells with the same ratio of transverse to radial cell wall length. It is
demonstrated that for β = 45°, the peaks in the curve intensity
distribution for the real and the rectangular cells coincide. If this
peak position is Ф45, then the MFA can be determined from the
relation M = tan-1 (tan Ф45 / cos 45°), which is precise for rectangular
cells. It was found that 92.93% of the variation of MFA can be
attributed to the distance from pith to bark. Here we shall present our
results of the MFA in the cell wall with respect to its shape, structure
and the distance from pith to park as an important fast check and yet
accurate towards the quality of wood, its uses and application.
Abstract: The present models and simulation algorithms of intracellular stochastic kinetics are usually based on the premise that diffusion is so fast that the concentrations of all the involved species are homogeneous in space. However, recents experimental measurements of intracellular diffusion constants indicate that the assumption of a homogeneous well-stirred cytosol is not necessarily valid even for small prokaryotic cells. In this work a mathematical treatment of diffusion that can be incorporated in a stochastic algorithm simulating the dynamics of a reaction-diffusion system is presented. The movement of a molecule A from a region i to a region j of the space is represented as a first order reaction Ai k- ! Aj , where the rate constant k depends on the diffusion coefficient. The diffusion coefficients are modeled as function of the local concentration of the solutes, their intrinsic viscosities, their frictional coefficients and the temperature of the system. The stochastic time evolution of the system is given by the occurrence of diffusion events and chemical reaction events. At each time step an event (reaction or diffusion) is selected from a probability distribution of waiting times determined by the intrinsic reaction kinetics and diffusion dynamics. To demonstrate the method the simulation results of the reaction-diffusion system of chaperoneassisted protein folding in cytoplasm are shown.
Abstract: This paper proposes a fast code acquisition scheme for
optical code division multiple access (O-CDMA) systems. Unlike the
conventional scheme, the proposed scheme employs multiple thresholds
providing a shorter mean acquisition time (MAT) performance.
The simulation results show that the MAT of the proposed scheme
is shorter than that of the conventional scheme.
Abstract: The conjugate gradient optimization algorithm
usually used for nonlinear least squares is presented and is
combined with the modified back propagation algorithm yielding
a new fast training multilayer perceptron (MLP) algorithm
(CGFR/AG). The approaches presented in the paper consist of
three steps: (1) Modification on standard back propagation
algorithm by introducing gain variation term of the activation
function, (2) Calculating the gradient descent on error with
respect to the weights and gains values and (3) the determination
of the new search direction by exploiting the information
calculated by gradient descent in step (2) as well as the previous
search direction. The proposed method improved the training
efficiency of back propagation algorithm by adaptively modifying
the initial search direction. Performance of the proposed method
is demonstrated by comparing to the conjugate gradient algorithm
from neural network toolbox for the chosen benchmark. The
results show that the number of iterations required by the
proposed method to converge is less than 20% of what is required
by the standard conjugate gradient and neural network toolbox
algorithm.
Abstract: This paper presents a novel two-phase hybrid optimization algorithm with hybrid genetic operators to solve the optimal control problem of a single stage hybrid manufacturing system. The proposed hybrid real coded genetic algorithm (HRCGA) is developed in such a way that a simple real coded GA acts as a base level search, which makes a quick decision to direct the search towards the optimal region, and a local search method is next employed to do fine tuning. The hybrid genetic operators involved in the proposed algorithm improve both the quality of the solution and convergence speed. The phase–1 uses conventional real coded genetic algorithm (RCGA), while optimisation by direct search and systematic reduction of the size of search region is employed in the phase – 2. A typical numerical example of an optimal control problem with the number of jobs varying from 10 to 50 is included to illustrate the efficacy of the proposed algorithm. Several statistical analyses are done to compare the validity of the proposed algorithm with the conventional RCGA and PSO techniques. Hypothesis t – test and analysis of variance (ANOVA) test are also carried out to validate the effectiveness of the proposed algorithm. The results clearly demonstrate that the proposed algorithm not only improves the quality but also is more efficient in converging to the optimal value faster. They can outperform the conventional real coded GA (RCGA) and the efficient particle swarm optimisation (PSO) algorithm in quality of the optimal solution and also in terms of convergence to the actual optimum value.
Abstract: In this study, a new and fast algorithm for Ascending
Aorta (AscA) and Descending Aorta (DesA) segmentation is
presented using Computed Tomography Angiography images. This
process is quite important especially at the detection of aortic
plaques, aneurysms, calcification or stenosis. The applied method has
been carried out at four steps. At first step, lung segmentation is
achieved. At the second one, Mediastinum Region (MR) is detected
to use in the segmentation. At the third one, images have been
applied optimal threshold and components which are outside of the
MR were removed. Lastly, identifying and segmentation of AscA and
DesA have been carried out. The performance of the applied method
is found quite well for radiologists and it gives enough results to the
surgeries medically.
Abstract: This paper presents a fast and efficient on-line technique for estimating impedance of unbalanced loads in power systems. The proposed technique is an application of a discrete timedynamic filter based on stochastic estimation theory which is suitable for estimating parameters in noisy environment. The algorithm uses sets of digital samples of the distorted voltage and current waveforms of the non-linear load to estimate the harmonic contents of these two signal. The non-linear load impedance is then calculated from these contents. The method is tested using practical data. Results are reported and compared with those obtained using the conventional least error squares technique. In addition to the very accurate results obtained, the method can detect and reject bad measurements. This can be considered as a very important advantage over the conventional static estimation methods such as the least error square method.
Abstract: In this paper, we employ the approach of linear
programming to propose a new interactive broadcast method. In our
method, a film S is divided into n equal parts and broadcast via k
channels. The user simultaneously downloads these segments from k
channels into the user-s set-top-box (STB) and plays them in order.
Our method assumes that the initial p segments will not have
fast-forwarding capabilities. Every time the user wants to initiate d
times fast-forwarding, according to our broadcasting strategy, the
necessary segments already saved in the user-s STB or are just
download on time for playing. The proposed broadcasting strategy not
only allows the user to pause and rewind, but also to fast-forward.
Abstract: Motion estimation is the most computationally
intensive part in video processing. Many fast motion estimation
algorithms have been proposed to decrease the computational
complexity by reducing the number of candidate motion vectors.
However, these studies are for fast search algorithms themselves while
almost image and video compressions are operated with software
based. Therefore, the timing constraints for running these motion
estimation algorithms not only challenge for the video codec but also
overwhelm for some of processors. In this paper, the performance of
motion estimation is enhanced by using Intel's Streaming SIMD
Extension 2 (SSE2) technology with Intel Pentium 4 processor.
Abstract: This paper presents a novel control strategy of a threephase
four-wire Unified Power Quality (UPQC) for an improvement
in power quality. The UPQC is realized by integration of series and
shunt active power filters (APFs) sharing a common dc bus capacitor.
The shunt APF is realized using a thee-phase, four leg voltage source
inverter (VSI) and the series APF is realized using a three-phase,
three leg VSI. A control technique based on unit vector template
technique (UTT) is used to get the reference signals for series APF,
while instantaneous sequence component theory (ISCT) is used for
the control of Shunt APF. The performance of the implemented
control algorithm is evaluated in terms of power-factor correction,
load balancing, neutral source current mitigation and mitigation of
voltage and current harmonics, voltage sag and swell in a three-phase
four-wire distribution system for different combination of linear and
non-linear loads. In this proposed control scheme of UPQC, the
current/voltage control is applied over the fundamental supply
currents/voltages instead of fast changing APFs currents/voltages,
there by reducing the computational delay and the required sensors.
MATLAB/Simulink based simulations are obtained, which support
the functionality of the UPQC. MATLAB/Simulink based
simulations are obtained, which support the functionality of the
UPQC.
Abstract: The increasing interest on processing data created by
sensor networks has evolved into approaches to implement sensor
networks as databases. The aggregation operator, which calculates a
value from a large group of data such as computing averages or sums,
etc. is an essential function that needs to be provided when
implementing such sensor network databases. This work proposes to
add the DURING clause into TinySQL to calculate values during a
specific long period and suggests a way to implement the aggregation
service in sensor networks by applying materialized view and
incremental view maintenance techniques that is used in data
warehouses. In sensor networks, data values are passed from child
nodes to parent nodes and an aggregation value is computed at the root
node. As such root nodes need to be memory efficient and low
powered, it becomes a problem to recompute aggregate values from all
past and current data. Therefore, applying incremental view
maintenance techniques can reduce the memory consumption and
support fast computation of aggregate values.
Abstract: Today, cancer remains one of the major diseases that
lead to death. The main obstacle in chemotherapy as a main cancer
treatment is the toxicity to normal cells due to Multidrug Resistance
(MDR) after the use of anticancer drugs. Proposed solution to
overcome this problem is the use of MDR efflux inhibitor of cinchona
alkaloids which is delivered together with anticancer drugs
encapsulated in the form of polymeric nanoparticles. The particles
were prepared by the hydration method. The characterization of
nanoparticles was particle size, zeta potential, entrapment efficiency
and in vitro drug release. Combination nanoparticle size ranged 29-45
nm with a neutral surface charge. Entrapment efficiency was above
87% for the use quinine, quinidine or cinchonidine in combination
with etoposide. The release test results exhibited that the cinchona
alkaloids release released faster than that of etoposide. Collectively,
cinchona alkaloids can be packaged along with etoposide in
nanomicelles for better cancer therapy.
Abstract: It is well known that during the developments in the
economic sector and through the financial crises occur everywhere in
the whole world, volatility measurement is the most important
concept in financial time series. Therefore in this paper we discuss
the volatility for Amman stocks market (Jordan) for certain period of
time. Since wavelet transform is one of the most famous filtering
methods and grows up very quickly in the last decade, we compare
this method with the traditional technique, Fast Fourier transform to
decide the best method for analyzing the volatility. The comparison
will be done on some of the statistical properties by using Matlab
program.
Abstract: This paper presents an algorithm for the recognition
and tracking of moving objects, 1/10 scale model car is used to verify
performance of the algorithm. Presented algorithm for the recognition
and tracking of moving objects in the paper is as follows. SURF
algorithm is merged with Lucas-Kanade algorithm. SURF algorithm
has strong performance on contrast, size, rotation changes and it
recognizes objects but it is slow due to many computational
complexities. Processing speed of Lucas-Kanade algorithm is fast but
the recognition of objects is impossible. Its optical flow compares the
previous and current frames so that can track the movement of a pixel.
The fusion algorithm is created in order to solve problems which
occurred using the Kalman Filter to estimate the position and the
accumulated error compensation algorithm was implemented. Kalman
filter is used to create presented algorithm to complement problems
that is occurred when fusion two algorithms. Kalman filter is used to
estimate next location, compensate for the accumulated error. The
resolution of the camera (Vision Sensor) is fixed to be 640x480. To
verify the performance of the fusion algorithm, test is compared to
SURF algorithm under three situations, driving straight, curve, and
recognizing cars behind the obstacles. Situation similar to the actual is
possible using a model vehicle. Proposed fusion algorithm showed
superior performance and accuracy than the existing object
recognition and tracking algorithms. We will improve the performance
of the algorithm, so that you can experiment with the images of the
actual road environment.
Abstract: The Muslim faith requires individuals to fast between
the hours of sunrise and sunset during the month of Ramadan. Our
recent work has concentrated on some of the changes that take place
during the daytime when fasting. A questionnaire was developed to
assess subjective estimates of physical, mental and social activities,
and fatigue. Four days were studied: in the weeks before and after
Ramadan (control days) and during the first and last weeks of
Ramadan (experimental days). On each of these four days, this
questionnaire was given several times during the daytime and once
after the fast had been broken and just before individuals retired at
night.
During Ramadan, daytime mental, physical and social activities
all decreased below control values but then increased to abovecontrol
values in the evening. The desires to perform physical and
mental activities showed very similar patterns. That is, individuals
tried to conserve energy during the daytime in preparation for the
evenings when they ate and drank, often with friends. During
Ramadan also, individuals were more fatigued in the daytime and
napped more often than on control days. This extra fatigue probably
reflected decreased sleep, individuals often having risen earlier
(before sunrise, to prepare for fasting) and retired later (to enable
recovery from the fast).
Some physiological measures and objective measures of
performance (including the response to a bout of exercise) have also
been investigated. Urine osmolality fell during the daytime on
control days as subjects drank, but rose in Ramadan to reach values
at sunset indicative of dehydration. Exercise performance was also
compromised, particularly late in the afternoon when the fast had
lasted several hours. Self-chosen exercise work-rates fell and a set
amount of exercise felt more arduous. There were also changes in
heart rate and lactate accumulation in the blood, indicative of greater
cardiovascular and metabolic stress caused by the exercise in
subjects who had been fasting. Daytime fasting in Ramadan produces
widespread effects which probably reflect combined effects of sleep
loss and restrictions to intakes of water and food.
Abstract: Some meta-schedulers query the information system of individual supercomputers in order to submit jobs to the least busy supercomputer on a computational Grid. However, this information can become outdated by the time a job starts due to changes in scheduling priorities. The MSR scheme is based on Multiple Simultaneous Requests and can take advantage of opportunities resulting from these priorities changes. This paper presents the SWARM meta-scheduler, which can speed up the execution of large sets of tasks by minimizing the job queuing time through the submission of multiple requests. Performance tests have shown that this new meta-scheduler is faster than an implementation of the MSR scheme and the gLite meta-scheduler. SWARM has been used through the GridQTL project beta-testing portal during the past year. Statistics are provided for this usage and demonstrate its capacity to achieve reliably a substantial reduction of the execution time in production conditions.
Abstract: Computers are being integrated in the various aspects
of human every day life in different shapes and abilities. This fact
has intensified a requirement for the software development
technologies which is ability to be: 1) portable, 2) adaptable, and 3)
simple to develop. This problem is also known as the Pervasive
Computing Problem (PCP) which can be implemented in different
ways, each has its own pros and cons and Context Oriented
Programming (COP) is one of the methods to address the PCP.
In this paper a design for a COP framework, a context aware
framework, is presented which has eliminated weak points of a
previous design based on interpreter languages, while introducing the
compiler languages power in implementing these frameworks.
The key point of this improvement is combining COP and
Dependency Injection (DI) techniques. Both old and new frameworks
are analyzed to show advantages and disadvantages. Finally a
simulation of both designs is proposed to indicating that the practical
results agree with the theoretical analysis while the new design runs
almost 8 times faster.
Abstract: The Shanghai Cooperation Organization is one of the successful outcomes of China's foreign policy since the end of the Cold war. The expansion of multilateral ties all over the world by dint of pursuing institutional strategies as SCO, identify China as a more constructive power. SCO became a new model of cooperation that was formed on remains of collapsed Soviet system, and predetermined China's geopolitical role in the region. As the fast developing effective regional mechanism, SCO today has more of external impact on the international system and forms a new type of interaction for promoting China's grand strategy of 'peaceful rise'.
Abstract: The least mean square (LMS) algorithmis one of the
most well-known algorithms for mobile communication systems
due to its implementation simplicity. However, the main limitation
is its relatively slow convergence rate. In this paper, a booster
using the concept of Markov chains is proposed to speed up the
convergence rate of LMS algorithms. The nature of Markov
chains makes it possible to exploit the past information in the
updating process. Moreover, since the transition matrix has a
smaller variance than that of the weight itself by the central limit
theorem, the weight transition matrix converges faster than the
weight itself. Accordingly, the proposed Markov-chain based
booster thus has the ability to track variations in signal
characteristics, and meanwhile, it can accelerate the rate of
convergence for LMS algorithms. Simulation results show that the
LMS algorithm can effectively increase the convergence rate and
meantime further approach the Wiener solution, if the
Markov-chain based booster is applied. The mean square error is
also remarkably reduced, while the convergence rate is improved.
Abstract: In this paper, we propose a single sample path based
algorithm with state aggregation to optimize the average rewards of
singularly perturbed Markov reward processes (SPMRPs) with a
large scale state spaces. It is assumed that such a reward process
depend on a set of parameters. Differing from the other kinds of
Markov chain, SPMRPs have their own hierarchical structure. Based
on this special structure, our algorithm can alleviate the load in the
optimization for performance. Moreover, our method can be applied
on line because of its evolution with the sample path simulated.
Compared with the original algorithm applied on these problems of
general MRPs, a new gradient formula for average reward
performance metric in SPMRPs is brought in, which will be proved
in Appendix, and then based on these gradients, the schedule of the
iteration algorithm is presented, which is based on a single sample
path, and eventually a special case in which parameters only
dominate the disturbance matrices will be analyzed, and a precise
comparison with be displayed between our algorithm with the old
ones which is aim to solve these problems in general Markov reward
processes. When applied in SPMRPs, our method will approach a fast
pace in these cases. Furthermore, to illustrate the practical value of
SPMRPs, a simple example in multiple programming in computer
systems will be listed and simulated. Corresponding to some practical
model, physical meanings of SPMRPs in networks of queues will be
clarified.