Abstract: This study is concerned with pH solution detection
using 2 × 4 flexible sensor array based on a plastic polyethylene
terephthalate (PET) substrate that is coated a conductive layer and a
ruthenium dioxide (RuO2) sensitive membrane with the technologies
of screen-printing and RF sputtering. For data analysis, we also
prepared a dynamic measurement system for acquiring the response
voltage and analyzing the characteristics of the working electrodes
(WEs), such as sensitivity and linearity. In this condition, an array
measurement system was designed to acquire the original signal from
sensor array, and it is based on the method of digital signal processing
(DSP). The DSP modifies the unstable acquisition data to a direct
current (DC) output using the technique of digital filter. Hence, this
sensor array can obtain a satisfactory yield, 62.5%, through the design
measurement and analysis system in our laboratory.
Abstract: Multiple-input multiple-output (MIMO) systems are
widely in use to improve quality, reliability of wireless transmission
and increase the spectral efficiency. However in MIMO systems,
multiple copies of data are received after experiencing various
channel effects. The limitations on account of complexity due to
number of antennas in case of conventional decoding techniques have
been looked into. Accordingly we propose a modified sphere decoder
(MSD-1) algorithm with lower complexity and give rise to system
with high spectral efficiency. With the aim to increase signal
diversity we apply rotated quadrature amplitude modulation (QAM)
constellation in multi dimensional space. Finally, we propose a new
architecture involving space time trellis code (STTC) concatenated
with space time block code (STBC) using MSD-1 at the receiver for
improving system performance. The system gains have been verified
with channel state information (CSI) errors.
Abstract: Load balancing in distributed computer systems is the
process of redistributing the work load among processors in the
system to improve system performance. Most of previous research in
using fuzzy logic for the purpose of load balancing has only
concentrated in utilizing fuzzy logic concepts in describing
processors load and tasks execution length. The responsibility of the
fuzzy-based load balancing process itself, however, has not been
discussed and in most reported work is assumed to be performed in a
distributed fashion by all nodes in the network. This paper proposes a
new fuzzy dynamic load balancing algorithm for homogenous
distributed systems. The proposed algorithm utilizes fuzzy logic in
dealing with inaccurate load information, making load distribution
decisions, and maintaining overall system stability. In terms of
control, we propose a new approach that specifies how, when, and by
which node the load balancing is implemented. Our approach is
called Centralized-But-Distributed (CBD).
Abstract: In this paper, we propose a fast and efficient method for drawing very large-scale graph data. The conventional force-directed method proposed by Fruchterman and Rheingold (FR method) is well-known. It defines repulsive forces between every pair of nodes and attractive forces between connected nodes on a edge and calculates corresponding potential energy. An optimal layout is obtained by iteratively updating node positions to minimize the potential energy. Here, the positions of the nodes are updated every global timestep at the same time. In the proposed method, each node has its own individual time and time step, and nodes are updated at different frequencies depending on the local situation. The proposed method is inspired by the hierarchical individual time step method used for the high accuracy calculations for dense particle fields such as star clusters in astrophysical dynamics. Experiments show that the proposed method outperforms the original FR method in both speed and accuracy. We implement the proposed method on the MDGRAPE-3 PCI-X special purpose parallel computer and realize a speed enhancement of several hundred times.
Abstract: This paper features the modeling and design of a
Robust Decentralized Fast Output Sampling (RDFOS) Feedback
control technique for the active vibration control of a smart flexible
multimodel Euler-Bernoulli cantilever beams for a multivariable
(MIMO) case by retaining the first 6 vibratory modes. The beam
structure is modeled in state space form using the concept of
piezoelectric theory, the Euler-Bernoulli beam theory and the Finite
Element Method (FEM) technique by dividing the beam into 4 finite
elements and placing the piezoelectric sensor / actuator at two finite
element locations (positions 2 and 4) as collocated pairs, i.e., as
surface mounted sensor / actuator, thus giving rise to a multivariable
model of the smart structure plant with two inputs and two outputs.
Five such multivariable models are obtained by varying the
dimensions (aspect ratios) of the aluminium beam. Using model
order reduction technique, the reduced order model of the higher
order system is obtained based on dominant Eigen value retention
and the Davison technique. RDFOS feedback controllers are
designed for the above 5 multivariable-multimodel plant. The closed
loop responses with the RDFOS feedback gain and the magnitudes of
the control input are obtained and the performance of the proposed
multimodel smart structure system is evaluated for vibration control.
Abstract: Because of the great advance in multimedia
technology, digital multimedia is vulnerable to malicious
manipulations. In this paper, a public key self-recovery block-based
video authentication technique is proposed which can not only
precisely localize the alteration detection but also recover the missing
data with high reliability. In the proposed block-based technique,
multiple description coding MDC is used to generate two codes (two
descriptions) for each block. Although one block code (one
description) is enough to rebuild the altered block, the altered block
is rebuilt with better quality by the two block descriptions. So using
MDC increases the ratability of recovering data. A block signature is
computed using a cryptographic hash function and a doubly linked
chain is utilized to embed the block signature copies and the block
descriptions into the LSBs of distant blocks and the block itself. The
doubly linked chain scheme gives the proposed technique the
capability to thwart vector quantization attacks. In our proposed
technique , anyone can check the authenticity of a given video using
the public key. The experimental results show that the proposed
technique is reliable for detecting, localizing and recovering the
alterations.
Abstract: Using Internet communication, new home electronics
have functions of monitoring and control from remote. However in
many case these electronics work as standalone, and old electronics
are not followed. Then, we developed the total remote system include
not only new electronics but olds. This systems node is a adapter of
electrical power plug that embed relay switch and some sensors, and
these nodes communicate with each other. the system server was build
on the Internet, and users access to this system from web browsers.
To reduce the cost to set up of this system, communication between
adapters are used ZigBee wireless network instead of wired LAN
cable[3]. From measured RSSI(received signal strength indicator)
information between each nodes, the system can estimate roughly
adapters were mounted on which room, and where in the room. So
also it reduces the cost of mapping nodes. Using this system, energy
saving and house monitoring are expected.
Abstract: A novel idea presented in this paper is to combine
multihop routing with single-frequency networks (SFNs) for a
broadcasting scenario. An SFN is a set of multiple nodes that transmit
the same data simultaneously, resulting in transmitter macrodiversity.
Two of the most important performance factors of multihop
networks, node reachability and routing robustness, are analyzed.
Simulation results show that our proposed SFN-D routing algorithm
improves the node reachability by 37 percentage points as compared
to non-SFN multihop routing. It shows a diversity gain of 3.7 dB,
meaning that 3.7 dB lower transmission powers are required for the
same reachability. Even better results are possible for larger
networks. If an important node becomes inactive, this algorithm can
find new routes that a non-SFN scheme would not be able to find.
Thus, two of the major problems in multihopping are addressed;
achieving robust routing as well as improving node reachability or
reducing transmission power.
Abstract: In this paper, we propose a dynamic TDMA slot
reservation (DTSR) protocol for cognitive radio ad hoc networks.
Quality of Service (QoS) guarantee plays a critically important role
in such networks. We consider the problem of providing QoS
guarantee to users as well as to maintain the most efficient use of
scarce bandwidth resources. According to one hop neighboring
information and the bandwidth requirement, our proposed protocol
dynamically changes the frame length and the transmission schedule.
A dynamic frame length expansion and shrinking scheme that
controls the excessive increase of unassigned slots has been
proposed. This method efficiently utilizes the channel bandwidth by
assigning unused slots to new neighboring nodes and increasing the
frame length when the number of slots in the frame is insufficient to
support the neighboring nodes. It also shrinks the frame length when
half of the slots in the frame of a node are empty. An efficient slot
reservation protocol not only guarantees successful data
transmissions without collisions but also enhance channel spatial
reuse to maximize the system throughput. Our proposed scheme,
which provides both QoS guarantee and efficient resource utilization,
be employed to optimize the channel spatial reuse and maximize the
system throughput. Extensive simulation results show that the
proposed mechanism achieves desirable performance in multichannel
multi-rate cognitive radio ad hoc networks.
Abstract: The paper discusses optimising work on a method of processing ceramic / metal composite coatings for various applications and is based on preliminary work on processing anodes for solid oxide fuel cells (SOFCs). The composite coating is manufactured by the electroless co-deposition of nickel and yttria stabilised zirconia (YSZ) simultaneously on to a ceramic substrate. The effect on coating characteristics of substrate surface treatments and electroless nickel bath parameters such as pH and agitation methods are also investigated. Characterisation of the resulting deposit by scanning electron microscopy (SEM) and energy dispersive X-ray analysis (EDXA) is also discussed.
Abstract: Experiments were carried out at the Latvia State
Institute of Fruit-Growing in 2011. Fresh-cut minimally processed
apple and pear mixed salad were packed by passive modified
atmosphere (MAP) in PP containers, which were hermetically sealed
by breathable conventional BOPP PropafreshTM P2GAF, and Amcor
Agrifresh films. Biodegradable NatureFlexTM NVS INNOVIA Films
and VC999 BioPack PLA films coated with a barrier of pure silicon
oxide (SiOx) were used to compare the fresh-cut produce quality
with this packed in conventional packaging films. Samples were cold
stored at temperature +4.0±0.5 °C up to 10 days. The quality of salad
was evaluated by physicochemical properties – weight losses,
moisture, firmness, the effect of packaging modes on the colour,
dynamics in headspace atmosphere concentration (CO2 and O2),
titratable acidity values, as well as by microbiological contamination
(yeasts, moulds and total bacteria count) of salads, analyzing before
packaging and after 2, 4, 6, 8, and 10 storage days.
Abstract: The purpose of the article is to illustrate the main
characteristics of the corporate governance challenge facing the
countries of South-Eastern Europe (SEE) and to subsequently
determine and assess the extensiveness and effectiveness of corporate
governance regulations in these countries. Therefore, we start with an
overview on the subject of the key problems of corporate governance
in transition. We then address the issue of corporate governance
measurement for SEE countries. To this end, we include a review of
the methodological framework for determining both the
extensiveness and the effectiveness of corporate governance
legislation. We then focus on the actual analysis of the quality of
corporate governance codes, as well as of legal institutions
effectiveness and provide a measure of corporate governance in
Romania and other SEE emerging markets. The paper concludes by
emphasizing the corporate governance enforcement gap and by
identifying research issues that require further study.
Abstract: All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and torus. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on message transmission, which have not be achieved among other existing indirect algorithms. For 2D r × c ( r % c ) all-port torus, the algorithm has time complexities of optimal transmission cost and O(c) message startup cost. In addition, the proposed algorithms accommodate non-power-of-two tori where the number of nodes in each dimension needs not be power-of-two or square. Finally, the algorithms are conceptually simple and symmetrical for every message and every node so that they can be easily implemented and achieve the optimum in practice.
Abstract: This paper investigates the problem of spreading
sequence and receiver code synchronization techniques for satellite
based CDMA communications systems. The performance of CDMA
system depends on the autocorrelation and cross-correlation
properties of the used spreading sequences. In this paper we propose
the uses of chaotic Lu system to generate binary sequences for
spreading codes in a direct sequence spread CDMA system. To
minimize multiple access interference (MAI) we propose the use of
genetic algorithm for optimum selection of chaotic spreading
sequences. To solve the problem of transmitter-receiver
synchronization, we use the passivity controls. The concept of
semipassivity is defined to find simple conditions which ensure
boundedness of the solutions of coupled Lu systems. Numerical
results are presented to show the effectiveness of the proposed
approach.
Abstract: This paper presents a novel method for inferring the
odor based on neural activities observed from rats- main olfactory
bulbs. Multi-channel extra-cellular single unit recordings were done
by micro-wire electrodes (tungsten, 50μm, 32 channels) implanted in
the mitral/tufted cell layers of the main olfactory bulb of anesthetized
rats to obtain neural responses to various odors. Neural response
as a key feature was measured by substraction of neural firing rate
before stimulus from after. For odor inference, we have developed a
decoding method based on the maximum likelihood (ML) estimation.
The results have shown that the average decoding accuracy is about
100.0%, 96.0%, 84.0%, and 100.0% with four rats, respectively. This
work has profound implications for a novel brain-machine interface
system for odor inference.
Abstract: This paper presents an adaptive motion estimator
that can be dynamically reconfigured by the best algorithm
depending on the variation of the video nature during the lifetime
of an application under running. The 4 Step Search (4SS) and the
Gradient Search (GS) algorithms are integrated in the estimator in
order to be used in the case of rapid and slow video sequences
respectively. The Full Search Block Matching (FSBM) algorithm
has been also integrated in order to be used in the case of the
video sequences which are not real time oriented.
In order to efficiently reduce the computational cost while
achieving better visual quality with low cost power, the proposed
motion estimator is based on a Variable Block Size (VBS) scheme
that uses only the 16x16, 16x8, 8x16 and 8x8 modes.
Experimental results show that the adaptive motion estimator
allows better results in term of Peak Signal to Noise Ratio
(PSNR), computational cost, FPGA occupied area, and dissipated
power relatively to the most popular variable block size schemes
presented in the literature.
Abstract: The angular distribution of Compton scattering of two
quanta originating in the annihilation of a positron with an electron
is investigated as a quantum key distribution (QKD) mechanism in
the gamma spectral range. The geometry of coincident Compton
scattering is observed on the two sides as a way to obtain partially
correlated readings on the quantum channel. We derive the noise
probability density function of a conceptually equivalent prepare
and measure quantum channel in order to evaluate the limits of the
concept in terms of the device secrecy capacity and estimate it at
roughly 1.9 bits per 1 000 annihilation events. The high error rate
is well above the tolerable error rates of the common reconciliation
protocols; therefore, the proposed key agreement protocol by public
discussion requires key reconciliation using classical error-correcting
codes. We constructed a prototype device based on the readily
available monolithic detectors in the least complex setup.
Abstract: The purpose of this paper is to assess the value of neural networks for classification of cancer and noncancer prostate cells. Gauss Markov Random Fields, Fourier entropy and wavelet average deviation features are calculated from 80 noncancer and 80 cancer prostate cell nuclei. For classification, artificial neural network techniques which are multilayer perceptron, radial basis function and learning vector quantization are used. Two methods are utilized for multilayer perceptron. First method has single hidden layer and between 3-15 nodes, second method has two hidden layer and each layer has between 3-15 nodes. Overall classification rate of 86.88% is achieved.
Abstract: IEEE 802.16 is a new wireless technology standard, it
has some advantages, including wider coverage, higher bandwidth,
and QoS support. As the new wireless technology for last mile
solution, there are designed two models in IEEE 802.16 standard. One
is PMP (point to multipoint) and the other is Mesh. In this paper we
only focus on IEEE 802.16 Mesh model. According to the IEEE
802.16 standard description, Mesh model has two scheduling modes,
centralized and distributed. Considering the pros and cons of the two
scheduling, we present the combined scheduling QoS framework that
the BS (Base Station) controls time frame scheduling and selects the
shortest path from source to destination directly. On the other hand, we
propose the Expedited Queue mechanism to cut down the transmission
time. The EQ mechanism can reduce a lot of end-to-end delay in our
QoS framework. Simulation study has shown that the average delay is
smaller than contrasts. Furthermore, our proposed scheme can also
achieve higher performance.
Abstract: In this paper, the periodic surveillance scheme has
been proposed for any convex region using mobile wireless sensor
nodes. A sensor network typically consists of fixed number of
sensor nodes which report the measurements of sensed data such as
temperature, pressure, humidity, etc., of its immediate proximity
(the area within its sensing range). For the purpose of sensing an
area of interest, there are adequate number of fixed sensor
nodes required to cover the entire region of interest. It implies
that the number of fixed sensor nodes required to cover a given
area will depend on the sensing range of the sensor as well as
deployment strategies employed. It is assumed that the sensors to
be mobile within the region of surveillance, can be mounted on
moving bodies like robots or vehicle. Therefore, in our
scheme, the surveillance time period determines the number of
sensor nodes required to be deployed in the region of interest.
The proposed scheme comprises of three algorithms namely:
Hexagonalization, Clustering, and Scheduling, The first algorithm
partitions the coverage area into fixed sized hexagons that
approximate the sensing range (cell) of individual sensor node.
The clustering algorithm groups the cells into clusters, each of
which will be covered by a single sensor node. The later
determines a schedule for each sensor to serve its respective cluster.
Each sensor node traverses all the cells belonging to the cluster
assigned to it by oscillating between the first and the last cell for
the duration of its life time. Simulation results show that our
scheme provides full coverage within a given period of time using
few sensors with minimum movement, less power consumption,
and relatively less infrastructure cost.