Towards fused vision and force robust feedback control of nanorobotic-based manipulation and grasping This paper presents the design and development of a fused vision force feedback robust controller for a nanomanipulator used in nanofiber grasping and nano-fabric production applications. The RRP (revolute revolute prismatic) nanomanipulator considered here utilizes two rotational motors with 0.1 mu rad resolution and one linear Nanomotor(R) with 0.25 nm resolution. The nanomanipulator is capable of achieving well-behaved kinematic and backlash-free characteristics in addition to atomic scale precision to guarantee accurate manipulation at the nanoscale. A mathematical model of the nanomanipulator is formulated, along with direct and inverse kinematics and dynamic equations of the system. Unlike typical macroscale manipulator models and controllers, the controller development is not trivial due to nanoscale movement and forces, coupled with unmodeled dynamics, nonlinear structural dynamics and mainly the lack of position and velocity feedbacks in this particular nanomanipulator. Utilizing pure vision feedback to acquire nanomanipulator's tip position is shown to have limited capabilities in achieving the desired control accuracy. To remedy this, a controlled fusion of visual servoing and force feedbacks for nanomanipulator positioning is proposed and analyzed extensively. Following the development of the controller, numerical simulations with generic feedback using a realistic scenario with fused vision and force feedbacks are presented to demonstrate the positioning performance capability in the nano manipulation applications considered here. (C) 2008 Elsevier Ltd. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O

sliding mode control and nanomanipulation


finding programming errors earlier by evaluating runtime monitors ahead-of-time Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate runtime events to detect violations and possibly execute recovery code. Although powerful, runtime monitoring inspects only one program run at a time and so may require many program runs to find errors. Therefore, in this paper, we present ahead-of-time techniques that can (1) prove the absence of property violations on all program runs, or (2) flag locations where violations are likely to occur. Our work focuses on tracematches, an expressive runtime monitoring notation for reasoning about groups of correlated objects. We describe a novel flow-sensitive static analysis for analyzing monitor states. Our abstraction captures both positive information (a set of objects could be in a particular monitor state) and negative information (the set is known not to be in a state). The analysis resolves heap references by combining the results of three points-to and alias analyses. We also propose a machine learning phase to filter out likely false positives. We applied a set of 13 tracematches to the DaCapo benchmark suite and SciMark2. Our static analysis rules out all potential points of failure in 50\% of the cases, and 75\% of false positives on average. Our machine learning algorithm correctly classifies the remaining potential points of failure in all but three of 461 cases. The approach revealed defects and suspicious code in three benchmark programs.

O O B O O O B O O B I O O O O O O O O B O O B O O O O O B B O O B O O O O O O O B B O O B I O O O B O O O O O O O O O B O O O B O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O B I O O B O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B O O O O B I B O O O O O B O O O O O O O O O O O O O B I B O O O O O O O B O O O O O O O O O O O O O B O O B O

static analysis
recovery
use
runtime monitoring
benchmark
analysis
interfaces
paper
runtime
errors
failure
program
machine learning
reasoning
abstraction
code
algorithm
monitor
rules

sensitive
point
applications
event
points-to analysis
express
object
timing
group
filtering
informal
combinational
aliasing
posit
locatability
runtime verification
flow
tracking
static verification
programmer
false positive


Upper paired-domination in claw-free graphs A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The maximum cardinality of a minimal paired-dominating set of G is the upper paired-domination number of G, denoted by I"(pr)(G). We establish bounds on I"(pr)(G) for connected claw-free graphs G in terms of the number n of vertices in G with given minimum degree delta. We show that I"(pr)(G)a parts per thousand currency sign4n/5 if delta=1 and na parts per thousand yen3, I"(pr)(G)a parts per thousand currency sign3n/4 if delta=2 and na parts per thousand yen6, and I"(pr)(G)a parts per thousand currency sign2n/3 if delta a parts per thousand yen3. All these bounds are sharp. Further, if na parts per thousand yen6 the graphs G achieving the bound I"(pr)(G)=4n/5 are characterized, while for na parts per thousand yen9 the graphs G with delta=2 achieving the bound I"(pr)(G)=3n/4 are characterized.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

claw-free graphs
upper paired-domination


Study of short-term water quality prediction model based on wavelet neural network Improved water quality prediction accuracy and reduced computational complexity are vital for ensuring a precise control over the water quality in intensive pearl breeding. This paper combined the wavelet transform with the BP neural network to build the short-term wavelet neural network water quality prediction model. The proposed model was used to predict the water quality of intensive freshwater pearl breeding ponds in Duchang county, Jiangxi province, China. Compared with prediction results achieved by the BP neural network and the Elman neural network, the mean absolute percentage error dropped from 17.464% and 8.438%, respectively, to 3.822%. The results show that the wavelet neural network is superior to the BP neural network and the Elman neural network. Furthermore, the proposed model features a high learning speed, improved predict accuracy, and strong robustness. The model can predict water quality effectively and can meet the management requirements in intensive freshwater pearl breeding. (C) 2012 Elsevier Ltd. All rights reserved.

O O O B I I O O O B I I O B I I O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I I O O O O B I I B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

water quality prediction
wavelet neural network
bp neural network
intensive pearl breeding


Recursive partitioning on incomplete data using surrogate decisions and multiple imputation The occurrence of missing data is a major problem in statistical data analysis. All scientific fields and data of all kinds and size are touched by this problem. There is a number of ad-hoc solutions which unfortunately lead to a loss of power, biased inference, underestimation of variability and distorted relationships between variables. A more promising approach of rising popularity is multiple imputation by chained equations (MICE) also known as imputation by full conditional specification (FCS). Alternatives to imputation are given by methods with built-in procedures. These include recursive partitioning by classification and regression trees as well as corresponding Random Forests. However there is only few literature comparing the two approaches. Existing evaluations often lack generalizability due to restrictions on data structure and simulation schemes. The application of both methods to several kinds of data and different simulation settings is meant to improve and extend the comparative analyses. Classification and regression studies are examined. Recursive partitioning is executed by two popular tree and one Random Forest implementation. Findings show that multiple imputation produces ambiguous performance results for both, simulated and real life data. Using surrogates instead is a fast and simple way to achieve performances which are only negligible worse and in many cases even superior.

B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O B I O B I I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O

recursive partitioning
classification and regression trees
random forests
multiple imputation
mice
surrogates


An ontological approach to support the description of nursing practice in Japan with the ICNP With increasing computerization of nursing records in Japan, standardization of nursing terminology is becoming imperative. Although some efforts have been made to formalize description of nursing practice in Japan with the International Classification of Nursing Practice (ICNP), lack of effective description tools has impacted negatively on the initiatives. To develop and evaluate an ontological approach that could be used to facilitate the description of nursing practice in Japan with the ICNP. An ontology-based support system was developed using Protg-2000, mainly by the following three steps: (1) representing a standard classification of nursing practice (the Nursing Master) in Japan; (2) representing a Japanese version of the ICNP; (3) designing an ontology-based framework. A heuristic matching algorithm was developed to automatically match the action labels in the Nursing Master with the terms of the eight axes of the ICNP Nursing Actions Classification. A preliminary evaluation was performed to examine the usefulness of the system. High hit rate was shown on the ICNP axes ActionType, Target, and Location. The evaluation indicated that 51.75.8% (meanS.D.) of the action labels with only one action type were properly matched, and that in 804% (meanS.D.) of action labels with more than one action type, at least one valid action type was matched correctly. The ontology-based approach using a frame-based knowledge representation system (e.g., Protg-2000) is useful for supporting the formal description of nursing practice in Japan with the ICNP.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O

nursing practice
knowledge representation

nursing terminology systems
ontology
protg-2000


A differential evolution proposal for estimating the maximum power delivered by CPV modules under real outdoor conditions Multivariable model to calculate the maximum power given by concentrating modules. Spectrum additional indexes in the equation proposed by the standard methodology. Calculation of regression coefficients by a differential evolution algorithm. Applicability to the forecasting of the energy produced by big power plants.

O B I O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O

concentrating photovoltaic technology
soft computing


An algorithm for noise correction of dual-energy computed tomography material density images Dual-energy computed tomography (DECT) images can undergo a two-material decomposition process which results in two images containing material density information. Material density images obtained by that process result in images with increased pixel noise. Noise reduction in those images is desirable in order to improve image quality.

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O B I O O O O O O O O O O O

dual-energy computed tomography
anisotropic diffusion


Position location of mobile terminal in wireless MIMO communication systems A promising approach to improve the performance of mobile location system is the use of antenna arrays in both transmitter and receiver sides. Using advanced array signal processing techniques, such multiple-input multiple-output (MIMO) communication systems can offer more mobile location information by exploiting the spatial properties of the multipath channel. In this paper, we propose a novel approach to determine the position of mobile terminal based on estimated multipath signal parameters using only one base station in MIMO communication systems. This approach intends to minimize the error occurring from the estimation of multiple paths and gives an optimal estimation of the position of mobile terminal by simultaneously calculating a set of nonlinear location equations. This solution breaks the bottleneck of conventional mobile location systems which have to require multilateration of at least three base stations.

O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

least squares
multiple-input multiple-output (mimo)
taylor series


On post-buckling analysis and experimental correlation of cylindrical composite shells with ReissnerMindlinVon Krmn type facet model In this paper post-buckling analysis of carbon fibre reinforced plastic cylindrical shells under axial compression is considered. ReissnerMindlinVon Krmn type shell facet model is used in the computations. The effect of geometric imperfection shape and amplitude on nonlinear analysis results is discussed. Numericalexperimental correlation is performed using the results of experimental buckling tests found in the literature. Results show that bringing the diamond shape geometric imperfection in the model significantly improves the correlation and gives good accuracy in simulating cylindrical shell post-buckling behaviour.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reissnermindlinvon krmn shell facet model


Reinventing the Wheel of Cyclic AMP Mechanisms of cAMP signal transduction have been thoroughly investigated for more than 40 years. From the binding of hormonal ligands to their receptors on the outer surface of the plasma membrane to the cytoplasmic activation of effectors, the ensuing cAMP signaling cascades and the nuclear gene regulatory functions, coupled with the structural elucidation of the cAMP-dependent protein kinase (PKA) and in vivo functional characterizations of each of the components of PKA by homologous recombination gene targeting, our understanding of cAMP-mediated signal transduction has reached its pinnacle. Despite this trove of knowledge, some recent findings have emerged that suggest hitherto novel and alternative mechanisms of cAMP action that could increase the signaling bandwidth of cAMP and PKA in cell growth and transcriptional regulation. This article attempts to review some of these novel and unconventional mechanisms of cAMP and PKA signaling, and to generate further enthusiasm in investigating and validating these new frontiers of the cAMP signal transduction pathway.

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

cyclic amp (camp)
camp-dependent protein kinase (pka)
regulatory subunit
function
mechanism


VQ-based watermarking scheme with genetic codebook partition To enhance the traditional vector quantisation (VQ) system by adding the watermarking ability, a digital image watermarking scheme, which modifies the VQ indices to carry watermark bits, is presented. This scheme partitions the main codebook into two sub-codebooks by referring to the user-key. Then, for each input vector of the cover image, a sub-codebook is selected according to the watermark bit to be embedding. The traditional VQ coding procedure is then done using the sub-codebook for the vector. Furthermore, to improve the performance of the scheme, a genetic codebook partition (GCP) procedure, which employs the genetic algorithm (GA) to find a better way to split the codebook, is proposed. It is demonstrated that the proposed methods provide faster encoding time, better imperceptibility, stronger robustness under some common attacks, and easier implementation than some related VQ-based watermarking schemes proposed in the literature.

O O O O O B I O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

image watermarking
vector quantisation
codebook partition
genetic algorithm


Signal and image approximation using interval wavelet transform In signal approximation, classical wavelet synthesis are known to produce Gibbs-like phenomenon around discontinuities when wavelet coefficients in the cone of influence of the discontinuities are quantized. By analyzing a function in a piecewise manner, filtering across discontinuities can be avoided. Using this principle, the interval wavelet transform can generate sparser representations in the vicinity of discontinuities than classical wavelet transforms. This work introduces two new constructions of interval wavelets and shows how they can be used for image compression and upscaling.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

foundary filters
wavelets on the interval


MUBII-TB-DB: a database of mutations associated with antibiotic resistance in Mycobacterium tuberculosis Tuberculosis is an infectious bacterial disease caused by Mycobacterium tuberculosis. It remains a major health threat, killing over one million people every year worldwide. An early antibiotic therapy is the basis of the treatment, and the emergence and spread of multidrug and extensively drug-resistant mutant strains raise significant challenges. As these bacteria grow very slowly, drug resistance mutations are currently detected using molecular biology techniques. Resistance mutations are identified by sequencing the resistance-linked genes followed by a comparison with the literature data. The only online database is the TB Drug Resistance Mutation database (TBDReaM database); however, it requires mutation detection before use, and its interrogation is complex due to its loose syntax and grammar.

O O O O O O O O O O O B B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O


A two-stage synergetic approach for face recognition A two-stage face recognition method is presented in this paper. In the first stage, the set of candidate patterns is narrowed down with the global similarity being taken into account. In the second stage, synergetic approach is employed to perform further recognition. Face image is segmented into meaningful regions, each of which is represented as a prototype vector. The similarity between a given region of the test pattern and a stored sample is obtained as the order parameter which serves as an element of the order vector. Finally, a modified definition of the potential function is given, and the dynamic model of recognition is derived from it. The effectiveness of the proposed method is experimentally confirmed.

O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

synergetic pattern recognition
pca
wavelet decomposition
evolvement process


Life-space characterization from cellular telephone collected GPS data Life-space is an emerging method for measuring older adults functional status. Although global positioning system (GPS)-enabled smartphones can collect life-space data passively and accurately, researchers lack an effective process to derive activity information from the raw GPS data. In addition, the influence of GPS retrieving frequency on life-space characterization is unknown. We describe a GPS data processing procedure to estimate life-space. A cellular telephone was used to collect GPS data by a subject during a 4-month period. The GPS data processing procedure was then implemented and evaluated in terms of classification accuracy, reliability, and sensitivity to observation frequency. The proposed scheme generated sufficient zone-based activity information to characterize an individuals life-space. The speed-based sensitivity assessment suggests 75s as an appropriate GPS observation interval for smartphone based life-space data collection.

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O


mobile urban drama for multimedia-based out-of-school learning This paper describes the notion of Mobile Urban Drama and how a particular production is implemented to support engaging experiences via location-based mobile phone software. Mobile Urban Drama is a general concept that has been adapted for out-of-school learning projects by introducing support for solving assignments and producing multimedia-based documentation for learning purposes. Media production is seamlessly supported through a context-aware media management system. The Mobile Urban Drama project, "HasleInteractive", is presented. It supports biology, geography and math lessons for 7 th to 9 th graders in schools. The story is an environmental thriller that takes place partly on the pupils' mobile phones and partly in the real world - in nature, which must be investigated through exercises. The level of pupil engagement is evaluated through interviews with teachers and pupils, as well as an analysis of pupil productivity and produced media materials during the interactive Mobile Urban Drama experience. It is argued how the out-of-school learning features are successfully supported by the system, and we conclude that the level of productivity and engagement is higher than in usual pupil group work.

B I I O O O O O O O O O O B I I O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

urban computing
2d barcodes
interactive audio
location-based technology
sensor/actuator based interaction
multimedia production
context-aware media management


Migrating from target-controlled infusion to closed-loop control in general anaesthesia The target-controlled infusion (TCI) technique has been successfully and commercially used in clinical general anaesthesia with the intravenous anaesthetic agent propofol. The technique is based on a population pharmacokinetic model and is an open-loop control system. Closed-loop control requires a reliable and consistent signal for feedback utilisation. With all anaesthetic agents the somatosensory evoked potentials (SEP) have been shown to give increased latency as anaesthetic depth is increased. Using infusion rate and SEP response data from rats anaesthetised with propofol a mathematical model was derived to describe the anaesthetic process. This model was used as a design reference to develop a proportional integral (PI) closed-loop control system using SEP as the feedback measure. A serials of 10 trials were conducted to investigate the difference between continuous bolus injection and infusion, all under closed-loop control. The trials showed that the use of SEPs in closed-loop control of anaesthesia is feasible.

O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O

closed-loop control
target-controlled infusion
somatosensory evoked potential


Clustering synchronisation of wireless sensor network based on intersection schedules Wireless sensor network (WSN) technology has gained in importance due to its potential support for a wide range of applications. Most of the WSN applications consist of a large number of distributed nodes that work together to achieve common objectives. Running a large number of nodes requires an efficient mechanism to bring them all together in order to form a multi-hop wireless network that can accomplish specific tasks. Even with the recent developments made in WSN technology, a number of important challenges still create vulnerabilities for WSNs, including: energy waste sources; synchronisation leaks; low network capacity; and self-configuration difficulties. However, energy efficiency perhaps remains both the most challenging and highest priority problem due to the scarce energy resources available in sensor nodes. Synchronization by means of scheduling clusters allows the nodes to cooperate and transmit traffic in a scheduled manner under the duty cycle mechanism. This paper aims to make further advances in this area of work by achieving higher accuracy and precision in time synchronisation through controlling the network topology, self-configuration and estimation of the clock errors between the nodes and finally correcting the nodes clock to the estimated value. Furthermore, the target in designing energy efficient protocol relies on synchronized duty cycle mechanism and requires a precise synchronisation algorithm that can schedule a group of nodes to cooperate by communicating together in a scheduled manner. These techniques are considered as parameters in the proposed OLS-MAC algorithm. This algorithm has been designed with the objective of ensuring the schedules of the clusters overlap by introducing a small shift in time between the adjacent clusters schedules to compensate for the clock drift. The OLS-MAC algorithm is simulated in NS-2 and compared to some S-MAC derived protocols. The simulation results verified that the proposed algorithm outperforms previous protocols in number of performance criterion.

B B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wsn
energy efficiency
synchronisation
clustering
duty cycle


Adaptive energy-efficient spectrum probing in cognitive radio networks In cognitive radio networks, secondary users must constantly probe the spectrum to promptly detect the arrival and the departure of primary users (PUs). However, spectrum probing is an energy-consuming process. This indicates the tradeoff between the frequency of spectrum probing and the delay of detecting the PU state change, and highlights the need for energy-conscious spectrum-probing strategies. In this paper, we provide a theoretical framework to find the optimal spectrum-probing methods that minimize the probing delay under a constraint on energy consumption in real stochastic environments. Moreover, we design a practical, sub-optimal adaptive-probing strategy that self-learns the behavior of the PUs dynamics and exploits the proposed optimal probing method. Specifically, we find that the most widely used spectrum-probing scheme, i.e., periodic probing, is not optimal when the arrival rate of the PU state change is not constant or when the distribution of PU channel occupancy/vacancy is not uniform. On the other hand, the derived optimal and adaptive strategies can adapt to the dynamics of PUs and adjust the probing intervals based on the time-varying arrival rate of the PU state changes or the non-uniform distribution of PU channel occupancy/vacancy. Our simulation results show that the optimal spectrum-probing strategies and adaptive-probing methods perform much better and consume much less energy than periodic probing in realistic environments.

O O B I O B I I O B I I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cognitive radio networks
spectrum probing

energy efficiency
adaptive probing
estimation


A MATHEMATICAL DESCRIPTION OF THE CRITICAL POINT IN PHASE TRANSITIONS Let y(x) be a smooth sigmoidal curve, y((n)) be its nth derivative and {x(m,i)} and {x(a,i)}, i = 1, 2, ... , be the set of points where respectively the derivatives of odd and even order reach their extreme values. We argue that if the sigmoidal curve y(x) represents a phase transition, then the sequences {x(m,i)} and {x(a,i)} are both convergent and they have a common limit x(c) that we characterize as the critical point of the phase transition. In this study, we examine the logistic growth curve and the Susceptible-Infected-Removed (SIR) epidemic model as typical examples of symmetrical and asymmetrical transition curves. Numerical computations indicate that the critical point of the logistic growth curve that is symmetrical about the point (x(0), y(0)) is always the point (x(0), y(0)) but the critical point of the asymmetrical SIR model depends on the system parameters. We use the description of the sol-gel phase transition of polyacrylamide-sodium alginate (SA) composite (with low SA concentrations) in terms of the SIR epidemic model, to compare the location of the critical point as described above with the "gel point" determined by independent experiments. We show that the critical point t(c) is located in between the zero of the third derivative t(a) and the inflection point t(m) of the transition curve and as the strength of activation (measured by the parameter k/eta of the SIR model) increases, the phase transition occurs earlier in time and the critical point, t(c), moves toward t(a).

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O


Towards dependable development tools for embedded systems: a case study in software verification This case study describes the specification and formal verification of the key part of SPaS, a development tool for the design of open loop programmable control developed at the University of Applied Sciences in Leipzig. SPaS translates the high-level representation of an open loop programmable control into a machine executable instruction list. The produced instruction list has to exhibit the same behaviour as suggested by the high-level representation. We discuss the following features of the case study: characterization of the correctness requirements, design of a verification strategy, the correctness proof, and the relation to the Common Criteria evaluation standard.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

programme verification
modular specification
interactive proving


Quantum confinement of carriers in heterostructured GaAs/GaP quantum wires We present theoretical calculations on the confinement of electrons and holes in a heterostructured GaAs/GaP quantum wires within the effective mass approximation. Energy levels (ground state and excited states), as well as electronhole recombination energies for some transitions, are calculated for different combinations of wire radius, well widths, and interface thickness.

O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


SPECIFYING INTONATION FROM CONTEXT FOR SPEECH SYNTHESIS This paper presents a theory and a computational implementation for generating prosodically appropriate synthetic speech in response to database queries. Proper distinctions of contrast and emphasis are expressed in an intonation contour that is synthesized by rule under the control of a grammar, a discourse model and a knowledge base. The theory is based on Combinatory Categorial Grammar, a formalism which easily integrates the notions of syntactic constituency, semantics, prosodic phrasing and information structure. Results from our current implementation demonstrate the system's ability to generate a variety of intonational possibilities for a given sentence depending on the discourse context.

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I

speech synthesis
information structure
combinatory categorial grammar
discourse context


Lessons learned about access to government information after World War II can be applied after September 11 The cost of unrestricted dissemination of government information to Americans' safety and security has been a topic of heated debate since September 11, 2001. The risks of dissemination seem to have skyrocketed in this age of terrorist attacks. However, the United States faced similar risks after World War II, when the secret of the atom bomb required close protection. Congress can learn from the process that the U.S. government went through to pass the Atomic Energy Act of 1946 [Atomic Energy Act of 1946. Pub. L. No. 79-585, 60 Stat. 755] during a similar time of national stress and fear and work to pass laws regulating the dissemination of information to the public. In the absence of legislative guidance, agencies have been left to restrict information as they think is best, with inconsistent and disastrous results.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

national security
information policy
nuclear regulatory commission
cold war
government secrecy
sensitive but unclassified information


A new strategy for skeleton pruning Pruning does not require to be iterated, since it removes in one step the longest possible concatenations of branches. Information on branch significance is collected along the skeleton before performing pruning. Pruning thresholds are suggested as a function of the object's size.

O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O

2d skeleton
skeleton branches
hierarchical structure


Applicability of the single equivalent point dipole model to represent a spatially distributed bio-electrical source Although the single equivalent point dipole model has been used to represent well-localised bio-electrical sources, in realistic situations the source is distributed. Consequently, position estimates of point dipoles determined by inverse algorithms suffer from systematic error due to the non-exact applicability of the inverse model. In realistic situations, this systematic error cannot be avoided, a limitation that is independent of the complexity of the torso model used. This study quantitatively investigates the intrinsic limitations in the assignment of a location to the equivalent dipole due to distributed electrical source. To simulate arrhythmic activity in the heart, a model of a wave of depolarisation spreading from a focal source over the surface of a spherical shell is used. The activity is represented by a sequence of concentric belt sources (obtained by slicing the shell with a sequence of parallel plane pairs), with constant dipole moment per unit length (circumferentially) directed parallel to the propagation direction. The distributed source is represented by N dipoles at equal arc lengths along the belt. The sum of the dipole potentials is calculated at predefined electrode locations. The inverse problem involves finding a single equivalent point dipole that best reproduces the electrode potentials due to the distributed source. The inverse problem is implemented by minimising the chi (2) per degree of freedom. It is found that the trajectory traced by the equivalent dipole is sensitive to the location of the spherical shell relative to the fixed electrodes. It is shown that this trajectory does not coincide with the sequence of geometrical centres of the consecutive belt sources. For distributed sources within a bounded spherical medium, displaced from the sphere's centre by 40% of the sphere's radius, it is found that the error in the equivalent dipole location varies from 3 to 20% for sources with size between 5 and 50% of the sphere's radius. Finally, a method is devised to obtain the size of the distributed source during the cardiac cycle.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O

single equivalent dipole model
dipole localisation


PET and SPECT imaging of tumor biology: New approaches towards oncology drug discovery and development Spiraling drug developmental costs and lengthy time-to-market introduction are two critical challenges facing the pharmaceutical industry. The clinical trials success rate for oncology drugs is reported to be 5% as compared to other therapeutic categories (11%) with most failures often encountered late in the clinical development process. PET and SPECT nuclear imaging technologies could play an important role in facilitating the drug development process improving the speed, efficiency and cost of drug development. This review will focus on recent studies of PET and SPECT radioligands in oncology and their application in the investigation of tumor biology. The use of clinically-validated radioligands as imaging-based biomarkers in oncology could significantly impact new cancer therapeutic development.

B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O B O B B O O O O O O O O O O O O O O O B O O O O O O O O O O O O


Path planning for autonomous vehicle based on heuristic searching using online images In automatic navigation of mobile systems, a path network is required to enable robot/vehicle autonomous motions. Path planning is considered as a significantly important part in creating the path network and thus to be a necessary task for any autonomous vehicle system. This paper proposes a method that constructs the shortest path for vehicle auto-navigation in outdoor environments. The method using two layers of GIS information of online map images, which support to estimate not only the shape of road network but also the directed road. This is also the advantage as compared to methods, which use only aerial/satellite images. Accomplishing the estimation according to the use of this application requires several stages as follows. First, a raw road network is detected using the road map and the satellite image. Second, the road network is refined and represented by a direct graph. Third, the road network is converted into the global coordinate, which is much more convenient for performing online auto-navigation task than the other types of coordinate. Finally, the shortest path for motion is estimated by heuristic searching method based on a hybrid algorithm that is originated from Dijkstra algorithm in a combination with greedy breadth-first search algorithm. The experimental results demonstrate robustness and effectiveness of the proposed method for path network estimation under large scenes of outdoor environments.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

road network detection
autonomous navigation
the shortest path estimation
utm/wg84 coordinate system


Morphological elastic graph matching applied to frontal face authentication under well-controlled and real conditions In this paper, morphological elastic graph matching is applied to frontal face authentication on databases ranging from small to large multimedia ones collected under either well-controlled or real-world conditions.It is shown that the morphological elastic graph matching achieves a very low equal error rate on databases collected under well-controlled conditions. However, its performance deteriorates when it is applied to databases recorded in real-world scenarios. The compensation for variable recording conditions such as changes in illumination, scale differences and varying face position prior to the application of morphological elastic matching is proposed.

B I I I O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

frontal face verification
large databases
face normalization
receiver operating characteristics


Modeling of supersonic plasma flow in the scrape-off layer The substantial drop of the plasma temperature along magnetic field lines with increasing plasma density is one of the main features in tokamak divertors. As a result the temperature gradient at the divertor plates becomes very steep and the boundary condition normally applied for the parallel Mach number M at the target, M(t) = 1, cannot be satisfied. In this case the value of M, based on the general form of the Bohm criterion, M(t) >= 1, has to be determined from the continuity of plasma parameters. In the present paper a new approach to resolve the Mach number at the target for such a situation is proposed. This method avoids the singularity problem that arises by treating the particle balance and parallel motion equations in a differential form. Instead, the integral representation of the equations is formulated for an arbitrary form of particle and momentum sources. The approach can also take into account transport perpendicular to the magnetic field lines. The proposed method is demonstrated on the example of a one-dimensional stationary model for the scrape-off layer (SOL) plasma and includes the continuity-, parallel momentum- and heat transfer equations. The recycled neutrals are described in the diffusion approximation. In the case of low density the normal condition M(t) = 1 is satisfied and the results are in agreement with the two-point model. At high enough plasma density solutions with the supersonic flow at the divertor plates, M(t) > 1, are found. These states correspond to a partially detached plasma with a temperature of a few eV. (c) 2007 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bohm criterion
mach number
supersonic flow


An interpolating piecewise bicubic surface with shape parameters This paper presents a new method for the generation of a surface interpolating a mesh of control points. The surface is generated by piecewise bicubic interpolation and is derived from a classical Coons patch. The introduction of three shape parameters (namely the tension, continuity and bias parameters) provides the surface designer with a set of flexible user handles for shaping the surface locally. Modifying the values of the shape parameters allows the designer to introduce soft or hard cross patch boundaries thus introducing creases and corners to the curved surface. This approach is based on a generalisation of KochanekBartels splines.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

surface design
interpolating surfaces
piecewise surfaces


history trajectory privacy-preserving through graph partition With rapid development of positioning techniques and location based services (LBS), locations and traces of moving objects are collected by service providers, the data will then be published for novel applications. Although analyzing and mining trajectories is useful for mobility-related applications, new challenges of trajectory privacy leakage arise accordingly. Trajectories contain rich spatio-temporal history information that may expose users' whereabouts and other personal privacy. At present, trajectory k -anonymity which aims at anonymizing k trajectories together on all sample points is one of the most popular techniques to protect trajectory privacy. The challenge lies in how to find trajectory k -anonymity sets. In this paper, a trajectory graph is constructed to simulate spatial relations of trajectories, based on which we propose to find trajectory k -anonymity sets through graph partition, which is proven NP-complete . We then propose a greedy partition method to find trajectory k -anonymity sets, as well as yielding low information loss. We run a series of experiments on both real-world and synthetic datasets, the results show the effectiveness of our method.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

trajectory k-anonymity
privacy-preserving
data publication


Cogging torque calculation considering magnetic anisotropy tor permanent magnet synchronous motors This paper describes the cogging torque of the permanent magnet synchronous (PM) motors due to the magnetic anisotropy of motor core. The cogging torque due to the magnetic anisotropy is calculated by the finite element method using two kinds of modeling methods: one is the 2D magnetization property method, and the other is the conventional method. As a result, the PM motors with parallel laminated core show different cogging torque waveform from the PM motors with the rotational laminated core due to the influence of the magnetic anisotropy. The amplitudes of the cogging torque are different depending on the modeling methods in the region of high flux density.

O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O


Engineering 400G for Colorless-Directionless-Contentionless Architecture in Metro/Regional Networks [Invited] Metro/regional networks are beginning the transition from 10 to 100 Gb/s on dispersion unmanaged optical links. Long-haul networks have a head start in the move to all-coherent networking and have popularized route-and-select-based node designs and colorless, directionless, and contentionless add/drop structures. Both metro and long-haul coherent networks are expected to support future 400 Gb/s transmission. This paper examines the node architecture and 400G transmission options for coherent metro networks with the distinctive characteristics of short spans and high optical filtering penalties. Reach results are derived for signals based on 100, 200, and 400 Gb/s superchannels. Additionally, blocking probabilities are reported for two approaches to nodal add/drop architecture. The results provide a clear direction for metro/regional node and network architecture decisions.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

modulation formats
nonlinearity tolerance
optical networks
wavelength-division multiplexing (wdm)


Editorial: Some thoughts on geospatial analysis and modeling This issue contains papers selected from the contributions presented at the 1st International Cartographic Association (ICA) Workshop on Geospatial Analysis and Modeling held in Vienna on the 8th of July, 2006 (http://www.hig.se/~bjg/ica/workshop/). The theme papers demonstrate partially recent developments in geospatial analysis and modeling for uncovering knowledge for various applications. This research has seen intensive growth over the past decade due to application needs and the increasing availability of geospatial information collected from various sources. The challenge for the research is to go beyond the conventional cartographic and geographic (mainly statistics-based) methods, and to develop more advanced and robust models for analyzing and mining geospatial information.

O O O O B I I I O O O O O O O O O O O O O O O B O O B I I I O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Discrete-time model predictive contouring control for biaxial feed drive systems and experimental verification In this paper we present a novel algorithm to model predictive contouring control for biaxial feed drive systems, model predictive control (MPC) refers to a class of model-based controllers that uses an explicit process model and tracking error dynamics to predict the future behavior of a plant, making it effective for machine tool feed drive systems that must achieve high-precision motion and are severely affected by friction, cutting force and changes in the workpiece mass. To improve contouring performance, we propose a new performance index in which error components orthogonal to the desired contour curve are given more importance than tracking errors with respect to each feed drive axis. Controller parameters are calculated in real time by solving an optimization problem. The parameters depend on the instantaneous slope of the reference trajectory and thus vary with time for curved reference trajectories, resulting in a time-varying controller. Weighting factors for the error components in orthogonal and tangential directions are used to adjust the error importance in each direction. In addition, to consider the required feed drive energy, the control inputs in both directions are included in the performance index. The effectiveness of the proposed control approach is demonstrated with an experimental biaxial feed drive system for circular and non-circular trajectories. The proposed contouring controller allows the feed drive to follow smooth curves and reduces contouring error. (C) 2010 Elsevier Ltd. All rights reserved.

O B I O O O O B I O O O O O O O O O O O O O B I O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O B I O O O O O O O

model predictive
feed drive
contouring error


Optimal schedules for d-D grid graphs with communication delays We consider a task graph model taking into account the communication among tasks of a parallel system. First, we assume that the available number of processors is adequate for dealing with the whole width of the task graph (i.e. the number of processors is unbounded), and we propose a scheduling strategy, called Line-Schedule, which executes the tasks of a d-dimensional grid graph (d-D grid in short) in the optimal time. We continue by proving that Line-Schedule is the only strategy able to execute a d-D grid in the optimal time. Furthermore, we compute the minimum number of processors required to execute a d-D grid optimally.

O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


important placement considerations for modern vlsi chips In recent years the role of placement in the Physical Design of large chips has grown dramatically. One factor for this growth is that wire delays are increasing as a percentage of overall cycle time. As a result, placement needs to consider more than just routability of the final design. Placement is now a major contributor to timing closure results. The problem space for placement now covers a broad range of design styles, including ASIC, SOC, and Microprocessor. Each of these introduce unique challenges to placement algorithms. In addition, the ability of the placement algorithms to operate incrementally within a timing closure system is growing in significance. This talk will outline the variety of placement problems that are routinely encountered, describe major algorithmic approaches that are used to solve the problems, and discuss timing closure characteristics of different approaches.

O B O O O O O O O O O B O B O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B B O O O O O O B O O O O B O B O O O O O O B O O O O O B O O O O O O O B O O O O O O O B O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O

role
physical design
placement
timing
microprocessor
factor
space
design


Dictionary learning with the cosparse analysis model based on summation of blocked determinants as the sparseness measure Dictionary learning is crucially important for sparse representation of signals. Most existing methods are based on the so called synthesis model, in which the dictionary is column redundant. This paper addresses the dictionary learning and sparse representation with the so-called analysis model. In this model, the analysis dictionary multiplying the signal can lead to a sparse outcome. Though it has been studied in the literature, there is still not an investigation in the context of dictionary learning for nonnegative signal representation, while the algorithms designed for general signal are found not sufficient when applied to the nonnegative signals. In this paper, for a more efficient dictionary learning, we propose a novel cost function that is termed as the summation of blocked determinants measure of sparseness (SBDMS). Based on this measure, a new analysis sparse model is derived, and an iterative sparseness maximization scheme is proposed to solve this model. In the scheme, the analysis sparse representation problem can be cast into row-to-row optimizations with respect to the analysis dictionary, and then the quadratic programming (QP) technique is used to optimize each row. Therefore, we present an algorithm for the dictionary learning and sparse representation for nonnegative signals. Numerical experiments on recovery of analysis dictionary show the effectiveness of the proposed method.

O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B O O O O O O O O O O O O O O O

sparse representation
nonnegative
analysis model

summation of blocked determinants measure of sparseness (sbdms)


Participation in videoconferenced meetings: user disposition and meeting context Although videoconferencing systems are increasingly becoming important in the support of geographically dispersed groups, there are few studies that identify the types of tasks that are most effectively performed within videoconferenced meetings. This study investigates the relationship between (a) technology quality and communication activity during videoconferenced meetings, and (b) the intention of participants to support subsequent meetings. The data consists of a sample (n=295) of participants in a group videoconferencing system trial conducted by twenty government departments and incorporated bodies. Meeting sessions involved real work activities chosen by each of the participating groups. The results show that perceptions about the quality of technology and the communication activity conducted during the session are significantly related to the intentions of participants to support the use of the technology. Contrary to what might have been presumed, the findings also sbow that a significant majority of the participating groups chose communication activities least suited to the processing capabilities of the videoconferencing media.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

videoconferenced meetings
technology quality

telecommunications
information richness
media richness
communication task
task and media fit


A new scheme for rectifying recognition results of printed Chinese characters Chinese character recognition error occurs when the correct character is not the highest rank character in a candidate set or, more seriously, is excluded from the set. This paper presents a new scheme aimed at rectifying the above error in printed Chinese character recognition. The rectification scheme employs a line-segment cancellation method with low sensitivity to misshapen line segments caused by noise and hence powerful discriminating ability to inspect character images. In addition, the scheme can determine possibly invalid candidate sets, which may exclude the correct characters, and then, for the invalid sets, retrieve additional possibly correct characters to be inspected with the cancellation method. Therefore, the scheme is not only able to pick out the correct character not only in the highest rank position but can also recover the correct character originally excluded from a candidate set. Experimental results showed that 75% of the recognition errors for normal quality documents and 48% for low quality ones were rectified by our new rectification scheme. (C) 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

recognition rectification
post-processing
image deformation
word information


A novel mortality model for acute alcoholic hepatitis including variables recorded after admission to hospital Severe forms of alcoholic hepatitis in patients with alcoholic liver disease are associated with high mortality; it is therefore vital to identify those patients at greatest risk of mortality in 28 days as they may benefit from aggressive intervention. The aim of this study is to propose a new predictive model that can be used in clinical practice to identify such patients and to monitor their progress while in hospital. A cohort of 82 patients was selected and for each of them, a number of clinical findings and standard laboratory tests at the time of admission to hospital were recorded. Also, some variables were collected up to 7 days after admission. The proposed logistic regression model selected four statistically significant predictors (namely, the level of creatinine on and after admission, the presence of encephalopathy and prothrombin time evaluated after admission). A comparison with the available mortality predictive scores showed an increase by 25% in predictive power, demonstrating increased accuracy in identifying these sick patients with alcoholic hepatitis in clinical practice.

O O B I O O B I O O O O O O O O O O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O

alcoholic hepatitis
alcoholic liver disease
logistic regression
mortality model


Silicon-based microelectrode arrays for stimulation and signal recording of in vitro cultured neurons Microelectrode arrays (MEAs) for stimulation and signal recording of in vitro cultured neurons are presented. Each MEA is composed of 60 independent electrodes with 59 working ones and one reference one. These electrodes are divided into 30 pairs. Through each pair of electrodes, four independent states can be realized to define the accessing modes of neurons cultured on the surface of the electrodes. A total MEA covers an area of 10 mm x 10 mm. MEAs are fabricated in a silicon-based semiconductor process. An implemented MEA is bonded on a specially designed printed-circuit-board (PCB) and surrounded by a culture chamber. An impedance measurement has been made to verify the electrical characteristics of MEAs. The surface was modified to enhance the biocompatibility. A series of PC12 cells culture experiments validates the effectiveness of the modification. An extracellular signal recording experiment with acetylcholine (Ach) as a stimulant has been carried out, and the results show the feasibility of MEAs for extracellular action potential recording. Extracellular electrical stimulation and recording experiments have been carried out too. They indicate that MEAs can be used for extracellular stimulation, recording, simultaneous stimulation and recording, and isolation of PC12 cells network cultured in vitro.

O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O B I I O O O O O O O B I

microelectrode arrays (meas)
extracellular recording
neurons network


Tangential characteristic symmetries and first order hyperbolic systems Hyperbolic systems of first order partial differential equations in two dependent and two independent variables are studied from the point of view of their local geometry. We illustrate an earlier result on such systems, which derived a complete set of local invariants for the class of systems which are (2,2)-Darboux integrable on the 1-jets, by explicitly computing the tangential characteristic symmetries of a certain Fermi-Pasta-Ulam equation. As a consequence we reduce its associated intrinsic hyperbolic structure to Vessiot normal form and prove that this equation may be regarded as an ordinary differential equation on R-2. This result has a far reaching generalisation in which the well known local linearisation of this equation by a hodograph transformation is shown to be a special case of a theorem due to Vessiot. This is further illustrated by studying the Born-Infeld system of Arik, Neyzi, Nutku, Olver and Verosky and the s = 0 Liouville system of Bryant, Griffiths and Hsu. It is shown that the latter may be regarded as an ordinary differential equation on the Lie group of affine transformations of the real line.

O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


accurate on-line prediction of processor and memoryenergy usage under voltage scaling Minimising energy use is an important factor in the operation of many classes of embedded systems - in particular, battery-powered devices. Dynamic voltage and frequency scaling (DVFS) provides some control over a processor's performance and energy consumption. In order to employ DVFS for managing a system's energy use, it is necessary to predict the effect this scaling has on the system's total energy consumption. Simple (yet widely-used) energy models lead to dramatically incorrect results for important classes of application programs. Predicting the energy used under scaling requires (i) a prediction of the dependency of program performance (and hence duration of execution) on the frequencies and (ii) a prediction of the power drawn by the execution as a function of the frequencies and voltages. As both of these characteristics are workload-specific our approach builds a model that, given a workload execution at one frequency setpoint, will predict the run-time and power at any other frequency setpoint. We assume temporal locality (which is valid for the vast majority of applications) so predicting the characteristics of one time slice, frame, or other instance of a task, will imply the characteristics of subsequent time slices, frames or instances (e.g. MPEG video decoding). We present a systematic approach to building these models for a hardware platform, determining the best performance counters and weights. This characterisation, done once for a particular platform, produces platform-specific but workload-independent performance and power models. We implemented the model on a real system and evaluated it under a comprehensive benchmark suite against measurements of the actual energy consumption. The results show that the model can accurately predict the energy use of a wide class of applications and is highly responsive to changes in the application behaviour.

O O O O B O O O O O O O B B O O O B O O O O O O O O B O O O O O B O O O O B O O B O O O B O B I O B O O B O O O B B B O O O O B O B O O O O O B O B I O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O B B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O B O O O B O O O O O O O B B O O O O O O O O B O O O O O O O B O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O B B O O O B O O O O O O O O O O B O O O O B O B O O O O B O O O O O O O O O O B O O O O O O B I O O O O O B O O B O B B O O O B O B O O O O O O O O O O

task
applications
order
video
platform
use
benchmark
performance
temporal
slice
model
control
locality
predict
processor
program
systems
energy consumption
dvfs
factor
workload
dynamic
energy
power
hardware
effect
class

measurement
power model
scale
batteries
response
timing
voltage-scaling
pmc
management
change
dependencies
device
functional
performance counter
dvs
decode
embedded systems


Refinement algebra with dual operator We introduce an extension of the general refinement algebra with a dual operator. We introduce assertions and assumptions with simpler definitions than before. We defined the termination and enabledness operators in our algebra. We prove data refinement and Hoare rules, and we used them for an example program. All results are formalized in the Isabelle theorem prover.

B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

algebra of programming
refinement calculus
hoare logic


Intensity Based Methods for Brain MRI Longitudinal Registration. A Study on Multiple Sclerosis Patients Registration is a key step in many automatic brain Magnetic Resonance Imaging (MRI) applications. In this work we focus on longitudinal registration of brain MRI for Multiple Sclerosis (MS) patients. First of all, we analyze the effect that MS lesions have on registration by synthetically eliminating some of the lesions. Our results show how a widely used method for longitudinal registration such as rigid registration is practically unconcerned by the presence of MS lesions while several non-rigid registration methods produce outputs that are significantly different. We then focus on assessing which is the best registration method for longitudinal MRI images of MS patients. In order to analyze the results obtained for all studied criteria, we use both descriptive statistics and statistical inference: one way ANOVA, pairwise t-tests and permutation tests.

O O O O B I O B O O O B I O B O O O O O O O O O O O O O O O O O O O O B O B I O B I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

brain mri
multiple sclerosis
registration


Semi-automated schema integration with SASMINT The emergence of increasing number of collaborating organizations has made clear the need for supporting interoperability infrastructures, enabling sharing and exchange of data among organizations. Schema matching and schema integration are the crucial components of the interoperability infrastructures, and their semi-automation to interrelate or integrate heterogeneous and autonomous databases in collaborative networks is desired. The Semi-Automatic Schema Matching and INTegration (SASMINT) System introduced in this paper identifies and resolves several important syntactic, semantic, and structural conflicts among schemas of relational databases to find their likely matches automatically. Furthermore, after getting the user validation on the matched results, it proposes an integrated schema. SASMINT uses a combination of a variety of metrics and algorithms from the Natural Language Processing and Graph Theory domains for its schema matching. For the schema integration, it utilizes a number of derivation rules defined in the scope of the research work explained in this paper. Furthermore, a derivation language called SASMINT Derivation Markup Language (SDML) is defined for capturing and formulating both the results of matching and the integration that can be further used, for example for federated query processing from independent databases. In summary, the paper focuses on addressing: (1) conflicts among schemas that make automatic schema matching and integration difficult, (2) the main components of the SASMINT approach and system, (3) in-depth exploration of SDML, (4) heuristic rules designed and implemented as part of the schema integration component of the SASMINT system, and (5) experimental evaluation of SASMINT.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O

collaboration
data sharing
heterogeneity


Prevents

Loss

of

Cell

Viability

and

Caspase

Activation

Induced

by

Acid

in

Cells

In

this

study,

we

analyzed

the

effect

of

overexpression,

an

important

anti-apoptotic

protein,

by

using

two

hypothalamic

cell

lines,

or

acid

mediated

a

dose-dependent

decrease

in

cell

viability

in

cells,

as

determined

by

following

the

MTT

(3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium

bromide)

reduction,

which

was

significantly

prevented

in

cells.

In

addition,

activation

of

and

induced

by

was

prevented

by

overexpression.

The

data

suggest

that

irreversible

inhibition

of

mitochondrial

complex

II

induces

apoptotic

features

of

cell

death

in

a

process

prevented

by

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

apoptosis
bcl-2
gt1-7 cells
mitochondria
3-nitropropionic acid


Controlling chaos and bifurcations of SMIB power system experiencing SSR phenomenon using SSSC This paper presents the effect of Static Synchronous Series Compensation (SSSC) on the bifurcations of heavily loaded Single Machine Infinite Bus (SMIB) power system experiencing Subsynchronous Resonance (SSR). In SSR phenomenon, the series compensation increases the power transfer capability of the transmission line. However, Hopf bifurcation is depicted at certain compensation levels. The system then routes to chaos via torus breakdown scenario in case of conventional compensation (variable series capacitor) scheme. In this study, the effect of replacing the conventional compensation with SSSC is highlighted. Varying the SSSC controller reference voltage changes the compensation degree. The results show that the operating point of the system never loses stability at any realistic compensation degree in case of SSSC which means that all bifurcations of the system have been eliminated. Time domain simulations coincide with the results of the bifurcation analysis. The robustness of the SSSC compensation scheme and its controller is verified by subjecting a single-phase to ground fault at the end of the transmission line. The results are compared with the case of conventional compensation. Additionally, the effect of the SSSC controller gain on the location of the Hopf bifurcation is addressed.

O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

subsynchronous resonance
static synchronous series compensation

analysis and control of chaos and bifurcations


An Efficient Projector-Based Passivity Test for Descriptor Systems An efficient passivity test based on canonical projector techniques is proposed for descriptor systems (DSs) widely encountered in circuit and system modeling. The test features a natural flow that first evaluates the index of a DS, followed by possible decoupling into its proper and improper subsystems. Explicit state-space formulations for respective subsystems are derived to facilitate further processing such as model order reduction and/or passivity enforcement. Efficient projector construction and a fast generalized Hamiltonian test for the proper-part passivity are also elaborated. Numerical examples then confirm the superiority of the proposed method over existing passivity tests for DSs based on linear matrix inequalities or skew-Hamiltonian/Hamiltonian matrix pencils.

O O O B O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B I O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O

passivity
canonical projector
generalized hamiltonian


AI optimization of a billiard player In this paper, we take a look back at the problem of creating an intelligent billiard player on a computer simulated table by using optimization techniques. We setup the problem by first defining the equations that describe the ball movements on a pool table, and go on to create a function that will be minimised to give us a player with the ability to reposition itself almost anywhere on a given table. We then look at possible strategies that the player can use to play intelligently while at the same time only looking one shot in advance. Pre-computed tables are introduced in the context of finding good starting points for the optimization model, thus reducing execution time and allowing the possibility of looking more than one shot ahead.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Explaining Computation Without Semantics: Keeping it Simple This paper deals with the question: how is computation best individuated? 1. The semantic view of computation: computation is best individuated by its semantic properties. 2. The causal view of computation: computation is best individuated by its causal properties. 3. The functional view of computation: computation is best individuated by its functional properties. Some scientific theories explain the capacities of brains by appealing to computations that they supposedly perform. The reason for that is usually that computation is individuated semantically. I criticize the reasons in support of this view and its presupposition of representation and semantics. Furthermore, I argue that the only justified appeal to a representational individuation of computation might be that it is partly individuated by implicit intrinsic representations.

O B O B O O O O O O O O O O O B O O O O O O O B B O O O O O O O O O O O O B B O O O O O B I O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O B O O O O O O O O O B O

computation
semantics
representation
intrinsic
causal properties

cognitive science
cognition
mental states
mechanistic explanation


Development of vertical-looking radar technology for monitoring insect migration The development of vertical-looking radar (VLR) has allowed long-term monitoring of the altitudinal and temporal dynamics of high-flying insect populations to be a practical proposition for the first time. The system also provides a unique insight into the behaviour of migrating insects. A new analysis routine for estimating body mass of over-flying insects is described. Procedures for calculating the maximum range of detection for insects of different sizes and the volume of air sensed by the VLR have also been developed. Sample data of diurnal patterns of activity, temporal variation of abundance and densityheight profiles of aerial insect populations are presented.

O O O B O O B B I O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

radar
insect migration
monitoring
insects


Collaborative clustering with the use of Fuzzy C-Means and its quantification. In this study, we introduce the concept of collaborative fuzzy clustering-a conceptual and algodthmic machinery for the collective discovery of a common structure (relationships) within a finite family of data residing at individual data sites. There are two fundamental features of the proposed optimization environment. First, given existing constraints which prevent individual sites from exchanging detailed numeric data, any communication has to be realized at the level of information granules. The specificity of these granules impacts the effectiveness of ensuing collaborative activities. Second, the fuzzy clustering realized at the level of the individual data site has to constructively consider the findings communicated by other sites and act upon them while running the optimization confined to the particular data site. Adhering to these two general guidelines, we develop a comprehensive optimization scheme and discuss its two-phase character in which the communication phase of the granular findings intertwines with the local optimization being realized at the level of the individual site and exploits the evidence collected from other sites. The proposed augmented form of the objective function is essential in the navigation of the overall optimization that has to be completed on a basis of the data and available information granules. The intensity of collaboration is optimized by choosing a suitable tradeoff between the two components of the objective function. The objective function based clustering used here concerns the well-known Fuzzy C-Means (FCM) algorithm. Experimental Studies presented include some synthetic data, selected data sets coming from the machine learning repository and the weather data coming from Environment Canada. (C) 2008 Elsevier B.V. All rights reserved.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information granules and granular computing


RF MEMS capacitive switch on semi-suspended CPW using low-loss high-resistivity silicon substrate A high capacitive ratio RF MEMS switch, with low-actuation voltage is designed, fabricated and experimentally validated on high-resistivity silicon (HRS) substrate. Thanks to very good fabrication control of all steps and to the high dielectric constant of TiO2, a down/up capacitive ratio close to 200 is achieved with 8V pull-in. It is also demonstrated that, using a passivated-surface HRS and semi-suspended conductors on air, the microwave losses in the CPW line are as low as 0.1dB/mm at 20GHz. The reported RF MEMS shunt capacitor is expected to serve as core device for phase shifting applications in the 1020GHz range, both for switching operations and as a variable capacitor in distributed MEMS transmission lines (DMTLs).

O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

semi-suspended cpw
high-resistivity silicon (hrs)
surface-passivation hrs
titanium oxide (tio2)


using a secure permutational covert channel to detect local and wide area interposition attacks In this paper, we present new techniques to detect interposition attacks on stream-based connections in local and wide area networks. The approach developed here is general enough to apply uniformly to all circumstances where the man-in-the-middle attacker achieves interposition by corrupting higher-layer to low-layer address mappings . Thus, both the problem of local area network interposition through ARP poisoning, and the problem wide area interposition through DNS poisoning are addressed as special cases of our work. Like other solutions that reside between Layers 3 and 4 (e.g. IPSEC), our techniques enjoy the property that they do not require redesigning legacy software, as is the case for approaches that reside above Layer 4 (e.g. SSL/TLS). Unlike IPSEC, however, the developed system is tailored only to the detection of interposition attacks, and thus circumvents the overhead and complexity introduced in guaranteeing stream confidentiality and integrity. We describe the design of the system, demonstrate its efficacy, and provide a publicly accessible prototype implementation.

O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O B O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Solving nonlinear multi-objective optimization problems with fuzzy relation inequality constraints regarding Archimedean triangular norm compositions We propose an approach to solve a nonlinear multi-objective problem subject to fuzzy relation inequalities with max-Archimedean-t-norm composition by a genetic algorithm. The additive generator of Archimedean t-norms is utilized to reform the existent genetic algorithm to solve the constrained nonlinear multi-objective optimization problems. We consider thoroughly the feasible set of the fuzzy relation inequality systems in three possible cases, namely "a parts per thousand currency signaEuroe, "a parts per thousand yenaEuroe and the combination of them. In general, their feasible sets are nonconvex which are completely determined by one vector as their maximum solution and a finite number of minimal solutions. The maximum and minimal solutions are formulated by using the additive generator. Additionally, we present some conditions for each case under which the problem can be reduced. Finally, each reduced problem is solved by the genetic algorithm and the efficiency of the proposed method is shown by some numerical examples.

O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

genetic algorithms
multi-objective optimization
archimedean t-norm
efficient solutions


Remote Monitoring and Control of Horticultural Cool Storage Over the Internet In this article, a distributed architecture that allows remote control and monitoring of horticultural cool storage (HCS) is presented. The various stages in the design and implementation of system for monitoring temperature and relative humidity and controlling HCS environment conditions are presented and discussed. The required hardware include a microcontroller and accompanying electronic circuitry, a server computer, serial port, temperature and relative humidity sensors and two actuators. Microcontroller transfers the sensors data to the server via serial port. Both the client and the server side programs are coded in VB programming language. They use VB MSComm control in order to communicate with the microcontroller. Internet communications is relied on socket programming. Winsock is used for network communications via the TCP/IP protocol. Sockets are configured to listen to a data port or to connect and then transmit to a remote one. Consequently information can be easily and reliably transmitted, monitored and/or controlled by the two machines. The performance of system was evaluated for 2 weeks and the results were quite satisfactory. This system can be easily adapted in other agricultural facilities such as greenhouses and silos. (C) 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 19: 136-145, 2011; View this article online at wileyonlinelibrary.com; DO! 10.1002/cae.20299

O B O B O O O O O O B O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O B O O O O O O B O O O O O B O O B O O O O O O O O O O O O B O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

monitoring control microcontroller internet server client


Unsupervised inference of data formats in human-readable notation One common approach to validating data such as email addresses and phone numbers is to check whether values conform to some desired data format. Unfortunately, users may need to learn a specialized notation such as regular expressions to specify the format, and even after learning the notation, specifying formats may take substantial time. To address these problems, this paper introduces Topei, a system that infers a format from an unlabeled collection of examples (which may contain errors). The generated format is presented as understandable English, so users can review and customize the format. In addition, the format can be used to automatically check data against the format and find outliers that do not match. Topei shows substantially higher precision and recall than an alternate algorithm (Lapis) on test data. Topei's usefulness is demonstrated by integrating it with spreadsheet, database, and web services systems.

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

data integration
unsupervised learning
outlier finding
spreadsheets
databases


A lattice Boltzmann approach for the non-Newtonian effect in the blood flow A new lattice Boltzmann approach within the framework of D2Q9 lattice for simulating shear-thinning non-Newtonian blood flows described by the power-law, CarreauYasuda and Casson rheology models is proposed in this study. The essence of this method lies in splitting the complete non-Newtonian effect up into two portions: one as the Newtonian result and the other as an effective external source. This arrangement takes the advantage in remaining fixed relaxation time during the whole course of numerical simulation that can avoid the potential numerical instability caused by the relaxation time approaches to 1/2, an inherent difficulty in the conventional lattice Boltzmann methods using varying relaxation times for the non-Newtonian effect. Macroscopically, consistency of the proposed model with the equations of motion for the three target non-Newtonian models is demonstrated through the technique of ChapmanEnskog multi-scale expansion. The feasibility and accuracy of the method are examined by comparing with the analytical solutions of the two-dimensional Poiseuille flows based on the power-law and Casson models. The results show that the velocity profiles agree very well with those of analytical solutions and the error analyses demonstrate that the proposed scheme is with second-order accuracy. The present approach also demonstrates its superiority over the conventional lattice Boltzmann method in the extent of numerical stability for simulating the power-law-based shear-thinning flows. The straightforwardness in scheme derivation and implementation renders the present approach as a potential method for the complex non-Newtonian flows.

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

non-newtonian fluid
power-law model
carreauyasuda model
casson model


A spatial warping method for freeform modeling based on a level-set method Providing an intuitive and effective tool for freeform geometric modeling is important for product design. We introduce in this paper a level-set based spatial warping method for freeform modeling, allowing shape deformation to be initialed by rigid body transformations of volumetric tools. Intuitive user operations including imprinting, deformation and smoothing are developed to shield the user from the underlying geometric complexity. Unlike mesh-based spatial warping methods, the developed method represents a digital model by implicit distance field data and describes its change of geometry by the level-set method. This guarantees the generation of topologically correct triangular mesh models and circumvents the error-prone remeshing and mesh-repairing processes, thus preventing topological errors such as self-intersections. We present this method with algorithm details, numerical experiments and modeling examples.

O B I I O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

freeform geometric modeling
spatial warping method


SIMDE: An educational simulator of ILP architectures with dynamic and static scheduling This article presents SIMDE, a cycle-by-cycle simulator to support teaching of Instruction -Level Parallelism (ILP) architectures. The simulator covers dynamic and static instruction scheduling by using a shared structure for both approaches. Dynamic scheduling is illustrated by means of a simple superscalar processor based on Tomasulo's algorithm. A basic Very Long Instruction Word (VLIW) processor has been designed for static scheduling. The simulator is intended as an aid-tool for teaching theoretical contents in Computer Architecture and Organization courses. The students are provided with an easy-to-use common environment to perform different simulations and comparisons between superscalar and VLIW processors. Furthermore, the simulator has been tested by students in a Computer Architecture course in order to assess its real usefulness. (C) 2007 Wiley Periodicals, Inc.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O

educational technology
simulation
processor scheduling