Abstract: A phenomenological model for species spreading which incorporates the Allee effect, a species- maximum attainable growth rate, collective dispersal rate and dispersal adaptability is presented. This builds on a well-established reaction-diffusion model for spatial spreading of invading organisms. The model is phrased in terms of the “hostility" (which quantifies the Allee threshold in relation to environmental sustainability) and dispersal adaptability (which measures how a species is able to adapt its migratory response to environmental conditions). The species- invading/retreating speed and the sharpness of the invading boundary are explicitly characterised in terms of the fundamental parameters, and analysed in detail.
Abstract: The objective of this contribution is to study the
performances in terms of bit error rate, of space-time code algorithms
applied to MIMO communication in tunnels. Indeed, the channel
characteristics in a tunnel are quite different than those of urban or
indoor environment, due to the guiding effect of the tunnel.
Therefore, MIMO channel matrices have been measured in a straight
tunnel, in a frequency band around 3GHz. Correlation between array
elements and properties of the MIMO matrices are first studied as a
function of the distance between the transmitter and the receiver.
Then, owing to a software tool simulating the link, predicted values
of bit error rate are given for VLAST, OSTBC and QSTBC
algorithms applied to a MIMO configuration with 2 or 4 array
elements. Results are interpreted from the analysis of the channel
properties.
Abstract: In Secondary Surveillance Radar (SSR) systems, it is
more difficult to locate and recognise aircrafts in the neighbourhood of civil airports since aerial traffic becomes greater. Here, we propose to apply a recent Blind Source Separation (BSS) algorithm based
on Time-Frequency Analysis, in order to separate messages sent by different aircrafts and falling in the same radar beam in reception. The above source separation method involves joint-diagonalization
of a set of smoothed version of spatial Wigner-Ville distributions.
The technique makes use of the difference in the t-f signatures of the nonstationary sources to be separated. Consequently, as the SSR sources emit different messages at different frequencies, the above fitted to this new application. We applied the technique in simulation to separate SSR replies. Results are provided at the end
of the paper.
Abstract: In this paper, a strategy for long-span bridge disaster response was developed, divided into risk analysis, business impact analysis, and emergency response plan. At the risk analysis stage, the critical risk was estimated. The critical risk was “car accident."The critical process by critical-risk classification was assessed at the business impact analysis stage. The critical process was the task related to the road conditions and traffic safety. Based on the results of the precedent analysis, an emergency response plan was established. By making the order of the standard operating procedures clear, an effective plan for dealing with disaster was formulated. Finally, a prototype software was developed based on the research findings. This study laid the foundation of an information-technology-based disaster response guideline and is significant in that it computerized the disaster response plan to improve the plan-s accessibility.
Abstract: Recently many research has been conducted to
retrieve pertinent parameters and adequate models for automatic
music genre classification. In this paper, two measures based upon
information theory concepts are investigated for mapping the features
space to decision space. A Gaussian Mixture Model (GMM) is used
as a baseline and reference system. Various strategies are proposed
for training and testing sessions with matched or mismatched
conditions, long training and long testing, long training and short
testing. For all experiments, the file sections used for testing are
never been used during training. With matched conditions all
examined measures yield the best and similar scores (almost 100%).
With mismatched conditions, the proposed measures yield better
scores than the GMM baseline system, especially for the short testing
case. It is also observed that the average discrimination information
measure is most appropriate for music category classifications and on
the other hand the divergence measure is more suitable for music
subcategory classifications.
Abstract: It-s difficult for China-s current land transfer
institutions limited to county-wide to solve the contradiction between
urban-rural development and construction land shortage. On the basis of analyzing China-s construction land transfer system, and evaluation
toward Transfer of development rights (TDR) practices in Anhui and
Chongqing, the passage proposes: (1) we should establish a multi-level
land indicators trade market under the guidance of regional spatial
objectives, and allow land transfer paid across cities and counties
within a specific area following the regulation of both government and
market; (2) it would be better to combine organically the policy ntentions of land plan, regional plan, urban plan and economic plan, and link them with land indicators transfer to promote a wider range of
urban-rural balance and regional coordination.
Abstract: (Bi0.5Na0.5)TiO3 doped with 8 mol % BaTiO3 powder
(BNT-BT0.08), prepared by sol-gel method was compacted and
sintered by Spark Plasma Sintering (SPS) process. The influence of
SPS temperature on the densification of BNT-BT0.08 ceramic was
investigated. Starting from sol-gel nanopowder of BNT-BT
containing 8 mol % BaTiO3 with an average particles size of about
30 nm, were obtained ceramics with density around 98 % of the
theoretical density value when the SPS temperature used was about
850 °C. The average grain size of the resulting ceramics was 80 nm.
The BNT-BT0.08 ceramic sample obtained by SPS method has shown
good electric properties at various frequencies.
Abstract: In this paper, for the understanding of the phytoplankton dynamics in marine ecosystem, a susceptible and an infected class of phytoplankton population is considered in spatiotemporal domain.
Here, the susceptible phytoplankton is growing logistically and the
growth of infected phytoplankton is due to the instantaneous Holling
type-II infection response function. The dynamics are studied in terms of the local and global stabilities for the system and further
explore the possibility of Hopf -bifurcation, taking the half saturation period as (i.e., ) the bifurcation parameter in temporal domain.
It is also observe that the reaction diffusion system exhibits spatiotemporal
chaos and pattern formation in phytoplankton dynamics,
which is particularly important role play for the spatially extended phytoplankton system. Also the effect of the diffusion coefficient
on the spatial system for both one and two dimensional case is obtained. Furthermore, we explore the higher-order stability analysis
of the spatial phytoplankton system for both linear and no-linear system. Finally, few numerical simulations are carried out for pattern
formation.
Abstract: Culture and family structure provide a sense security.
Further, the chrono, macro and micro contexts of development
influence developmental transitions and timetable particularly owing
to variations in the macrosystem associated with non normative life
events like migration. Migration threatens family links, security and
attachment bonds. Rising migratory trends have prompted an
increased interest in migration consequences on familial bonds,
developmental autonomy, socialization process, and sense of
security. This paper takes a narrative approach and applies the
attachment paradigm from a lifespan perspective, to examine the
settlement experiences of an India-born migrant student in Sydney,
Australia. It focuses on her quest to preserve family ties; her remote
secure base; her continual struggle to balance dependency and
autonomy, a major developmental milestone. As positional parental
power is culturally more potent in the Indian society, the paper
therefore raises some important concerns related to cultural
expectations, adaptation, acculturative stress and sense of security.
Abstract: In this paper, we propose disease diagnosis hardware
architecture by using Hypernetworks technique. It can be used to
diagnose 3 different diseases (SPECT Heart, Leukemia, Prostate
cancer). Generally, the disparate diseases require specified diagnosis
hardware model for each disease. Using similarities of three diseases
diagnosis processor, we design diagnosis processor that can diagnose
three different diseases. Our proposed architecture that is combining
three processors to one processor can reduce hardware size without
decrease of the accuracy.
Abstract: The Partitioned Global Address Space (PGAS) programming
paradigm offers ease-of-use in expressing parallelism
through a global shared address space while emphasizing performance
by providing locality awareness through the partitioning of
this address space. Therefore, the interest in PGAS programming
languages is growing and many new languages have emerged and
are becoming ubiquitously available on nearly all modern parallel
architectures. Recently, new parallel machines with multiple cores
are designed for targeting high performance applications. Most of the
efforts have gone into benchmarking but there are a few examples of
real high performance applications running on multicore machines.
In this paper, we present and evaluate a parallelization technique
for implementing a local DNA sequence alignment algorithm using
a PGAS based language, UPC (Unified Parallel C) on a chip
multithreading architecture, the UltraSPARC T1.
Abstract: In this paper a one-dimension Self Organizing Map
algorithm (SOM) to perform feature selection is presented. The
algorithm is based on a first classification of the input dataset on a
similarity space. From this classification for each class a set of
positive and negative features is computed. This set of features is
selected as result of the procedure. The procedure is evaluated on an
in-house dataset from a Knowledge Discovery from Text (KDT)
application and on a set of publicly available datasets used in
international feature selection competitions. These datasets come
from KDT applications, drug discovery as well as other applications.
The knowledge of the correct classification available for the training
and validation datasets is used to optimize the parameters for positive
and negative feature extractions. The process becomes feasible for
large and sparse datasets, as the ones obtained in KDT applications,
by using both compression techniques to store the similarity matrix
and speed up techniques of the Kohonen algorithm that take
advantage of the sparsity of the input matrix. These improvements
make it feasible, by using the grid, the application of the
methodology to massive datasets.
Abstract: In this paper a special kind of buffer management policy is studied where the packet are preempted even when sufficient space is available in the buffer for incoming packets. This is done to congestion for future incoming packets to improve QoS for certain type of packets. This type of study has been done in past for ATM type of scenario. We extend the same for heterogeneous traffic where data rate and size of the packets are very versatile in nature. Typical example of this scenario is the buffer management in Differentiated Service Router. There are two aspects that are of interest. First is the packet size: whether all packets have same or different sizes. Second aspect is the value or space priority of the packets, do all packets have the same space priority or different packets have different space priorities. We present two types of policies to achieve QoS goals for packets with different priorities: the push out scheme and the expelling scheme. For this work the scenario of packets of variable length is considered with two space priorities and main goal is to minimize the total weighted packet loss. Simulation and analytical studies show that, expelling policies can outperform the push out policies when it comes to offering variable QoS for packets of two different priorities and expelling policies also help improve the amount of admissible load. Some other comparisons of push out and expelling policies are also presented using simulations.
Abstract: Point quad tree is considered as one of the most
common data organizations to deal with spatial data & can be used to
increase the efficiency for searching the point features. As the
efficiency of the searching technique depends on the height of the
tree, arbitrary insertion of the point features may make the tree
unbalanced and lead to higher time of searching. This paper attempts
to design an algorithm to make a nearly balanced quad tree. Point
pattern analysis technique has been applied for this purpose which
shows a significant enhancement of the performance and the results
are also included in the paper for the sake of completeness.
Abstract: In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used standard sets of instances from the project scheduling problem library (PSPLIB). The results are computationally compared respect to different metrics taken from the literature on evolutionary multi-objective optimization.
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
polynomial ring setting.
However, for many important applications in computer science
such as satisfiability and automated verification of hardware and
software, computations are performed in a Boolean ring. In this paper,
we give an algorithm to show that Groebner bases computation is PSPACE
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: There are two major variants of the Simplex
Algorithm: the revised method and the standard, or tableau method.
Today, all serious implementations are based on the revised method
because it is more efficient for sparse linear programming problems.
Moreover, there are a number of applications that lead to dense linear
problems so our aim in this paper is to present some computational
results on parallel implementation of dense Simplex Method. Our
implementation is implemented on a SMP cluster using C
programming language and the Message Passing Interface MPI.
Preliminary computational results on randomly generated dense
linear programs support our results.
Abstract: In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better knowledge of the solution space of the problem. A new operator of 'insertion' is introduced so as to exploit (utilize) the information that has already been collected before the restarting procedure. Finally, numerical experiments comparing the performance of the classic Genetic Algorithm and the Genetic Algorithm with restartings, for some well known test functions, are given.
Abstract: The purpose of this study is to derive optimal shapes of
a body located in viscous flows by the finite element method using the
acoustic velocity and the four-step explicit scheme. The formulation
is based on an optimal control theory in which a performance function
of the fluid force is introduced. The performance function should be
minimized satisfying the state equation. This problem can be transformed
into the minimization problem without constraint conditions
by using the adjoint equation with adjoint variables corresponding to
the state equation. The performance function is defined by the drag
and lift forces acting on the body. The weighted gradient method
is applied as a minimization technique, the Galerkin finite element
method is used as a spatial discretization and the four-step explicit
scheme is used as a temporal discretization to solve the state equation
and the adjoint equation. As the interpolation, the orthogonal basis
bubble function for velocity and the linear function for pressure
are employed. In case that the orthogonal basis bubble function is
used, the mass matrix can be diagonalized without any artificial
centralization. The shape optimization is performed by the presented
method.
Abstract: Traditional principal components analysis (PCA)
techniques for face recognition are based on batch-mode training
using a pre-available image set. Real world applications require that
the training set be dynamic of evolving nature where within the
framework of continuous learning, new training images are
continuously added to the original set; this would trigger a costly
continuous re-computation of the eigen space representation via
repeating an entire batch-based training that includes the old and new
images. Incremental PCA methods allow adding new images and
updating the PCA representation. In this paper, two incremental
PCA approaches, CCIPCA and IPCA, are examined and compared.
Besides, different learning and testing strategies are proposed and
applied to the two algorithms. The results suggest that batch PCA is
inferior to both incremental approaches, and that all CCIPCAs are
practically equivalent.