Modular and incremental automated termination proofs We propose a modular approach of term rewriting systems, making the best of their hierarchical structure. We define rewriting modules and then provide a new method to prove termination incrementally. We obtain new and powerful termination criteria for standard rewriting, thanks to the combination of dependency pairs and C-epsilon-termination. Taking benefit of the generality of the module approach while restraining the notion of termination itself (thus relaxing constraints over hierarchies components), we can easily express previous results and methods the premises of which either include restrictions over unions or make a particular reduction strategy compulsory. We describe our implementation of the modular approach. Proofs are fully automated and performed incrementally. Since convenient orderings are simpler, we observe a dramatic speedup in the finding of the proof.

O O O O B 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 B 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 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


Treatment of chronic nonhealing neurotrophic corneal epithelial defects with thymosin ?4 Neurotrophic corneal defects are difficult to heal and all too often lead to scarring and vision loss. Medical management is often of limited success. We describe the results of nine patients (ages 3784) with chronic nonhealing neurotrophic corneal epithelial defects who were treated with thymosin beta 4 (T?4) sterile eye drops for 28 or 49 days with a follow-up period of 30 days. Those with geographic defects (six patients) showed dramatic healing without clinically significant neovascularization. Stromal thinning was observed in one patient. Three patients with punctate epithelial defects did not have a demonstrable change in their clinical findings. Reduced ocular irritation was reported by all patients soon after treatment initiation. Results from these compassionate use cases indicate that T?4 may provide a novel, topical approach to wound healing in chronic nonhealing neurotrophic corneal ulcers.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

t?4
neurotrophic keratitis
neurotrophic keratopathy
corneal ulceration
herpes zoster ophthalmicus
diabetes


cost metric algorithm for transit routing in manets with internet connectivity Many have proposed to connect Mobile Ad Hoc Networks (MANETs) to a wired backbone Internet access network. This paper demonstrates that a wired backbone network can be utilized for more than just providing access to the global Internet. Traffic between mobile nodes in the ad hoc network may also be routed via this backbone network to achieve higher throughput, and to reduce the load in the ad hoc network. This is referred to as transit routing. This paper proposes a cost metric algorithm that facilitates transit routing for some of the traffic flows between nodes in the MANET. The algorithm aims at carrying out transit routing for a flow only when it leads to improvements of the performance. The proposal is implemented and tested in the ns-2 network simulator, and the simulation results are promising.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Designing palmprint based recognition system using local structure tensor and force field transformation for human identification This paper presents an efficient palmprint based automatic recognition system. It uses local structure tensor to extract features from the palmprint. Each enhanced palmprint image has been divided into sub-images and features are obtained based on local properties within the sub-image. Force field transformation is used to emphasize the texture of the palmprint and the chosen dominant orientation pixels are used for feature extraction to reduce the effect of noise. Structure tensor values of the dominant orientation pixels within a sub-image are averaged to form the tensor matrix for the sub-image. Eigen decomposition of each tensor matrix is used to generate the feature matrix. Euclidean distance between feature matrices of two palmprints has been used to make the decision on matching. The system has been tested on three databases viz. IITK, CASIA and PolyU and achieved high accuracy. It has also been compared with two best known systems using PolyU database and it has performed better than these two systems.

O B O O O O B I I O B I I O O O O O O O O B O O O O O O B I I O O O O O B O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O 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

palmprint
force field transformation
local structure tensor
feature matrix


Monitoring information security risks within health care This paper presents an overview of possible risks to the security of health care data. These risks were detected with a novel approach to information security. It is based on the philosophy that information security risk monitoring should include human and societal factors, and that collaboration between organisations and experts is essential to gain knowledge about potential risks. The methodology uses a mixed methods approach including a quantitative analysis of historical security incident data and expert elicitation through a Delphi study. The result is an overview of the possible socio-technical risks that a panel of experts expect to materialise in health care organisations in the near future. These risks include (amongst others): staff leaving data assets unattended on the premises and these assets consequently go missing, staff sharing passwords to access patient data and staff sending email containing personal patient data to the wrong addressee thus disclosing data to unauthorised persons. The expert panel recognized risks from current discussion topics such as outsourcing, but these risks are still considered to appear less frequently than the more traditional information security risks. Furthermore, the panel did not estimate a high frequency of occurrence of socio-technical information security risks caused by new technologies such as cloud computing or RFID.

O B I 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 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 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 B I O O O O O O O O O O O

delphi method
patient privacy
risk management
sociotechnical information security


Robust H-infinity for a class of discrete time fuzzy systems via delta operator approach In this paper, we investigate a robust H-infinity control problem for a class of T-S fuzzy systems with time delays by using delta operator approach. It is known that a better control effect can be obtained by using delta operator approach than using shift operator approach for small sampling periods. Furthermore, the delta operator can unify some previous related continuous and discrete fuzzy systems into fuzzy delta operator system framework. Based on Lyapunov-Krasovskii functionals in delta domain, a new fuzzy H-infinity state feedback controller is presented in terms of linear matrix inequalities. Some experiment results of an ball and beam model on a laboratory-scale setup are presented to illustrate the effectiveness and potential for the developed techniques. (C) 2011 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 O 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

t-s fuzzy model
norm-bounded uncertainty
linear matrix inequality (lmi)
time delay
h-infinity state feedback


An overlay approach to data security in ad-hoc networks ? While it has been argued that application-layer overlay protocols can enhance services in mobile ad-hoc networks, hardly any empirical data is available on the throughput and delay performance achievable in this fashion. This paper presents performance measurements of an application-layer overlay approach that ensures integrity and confidentiality of application data in an ad-hoc environment. A key management and encryption scheme, called neighborhood key method, is presented where each node shares secrets only with authenticated neighbors in the ad-hoc network, thus avoiding global re-keying operations. All proposed solutions have been implemented and empirically evaluated in an existing software system for application-layer overlay networking. Results from indoor and outdoor measurement experiments with mobile handheld devices provide insight into the performance and overhead of overlay networking and application-layer security services in ad-hoc networks.

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 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 B O O O O


LATTICE BOLTZMANN SIMULATION OF THE MOTION OF SPHERICAL PARTICLES IN STEADY POISEUILLE FLOW A technique, based on the stress-integration method, for the evaluation of hydrodynamic forces on solid boundaries is proposed to simulate the solid-fluid flow systems in three dimensions in lattice Boltzmann simulations. The accuracy of the scheme is demonstrated by simulating the sphere migrating in a pressure-driven Newtonian fluid flow in a cylindrical tube. The numerical simulation results recover the Segre-Silberberg effect. Using this scheme, we investigate the behavior of a pair of spheres in a tube Poiseuille flow. Oscillatory states are observed for two spheres with different radii placed on opposite sides. The simulation results show that the present model is an effective and efficient direct numerical simulation method for simulating particle motions in fluid flows at finite Reynolds numbers in three dimensions.

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

lattice boltzmann method
force evaluation
stress-integration
spheres behavior


A comparison of Mizar and Isar The mathematical proof checker Mizar by Andrzej Trybulec uses a proof input language that is much more readable than the input languages of most other proof assistants. This system also differs in many other respects from most current systems. John Harrison has shown that one can have a Mizar mode on top of a tactical prover, allowing one to combine a mathematical proof language with other styles of proof checking. Currently the only fully developed Mizar mode in this style is the Isar proof language for the Isabelle theorem prover. In fact the Isar language has become the official input language to the Isabelle system, even though many users still use its low-level tactical part only. In this paper we compare Mizar and Isar. A small example, Euclid's proof of the existence of infinitely many primes, is shown in both systems. We also include slightly higher-level views of formal proof sketches. Moreover, a list of differences between Mizar and Isar is presented, highlighting the strengths of both systems from the perspective of end-users. Finally, we point out some key differences of the internal mechanisms of structured proof processing in either system.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

formalized mathematics
structured proof languages


Scheduling image processing tasks in a multilayer system Multilayer multiprocessor systems are generally employed in real-time applications such as robotics and computer vision. This paper introduces three heuristic algorithms for multiprocessor task scheduling in such systems. In our model, tasks with arbitrary processing times and arbitrary processor requirements are considered. The scheduling aims at minimising completion time of processes in a two-layer system. We employed an effective lower bound (LB) for the problem. Then, we analysed the average performance of the heuristic algorithms by computing the average percentage deviation of each heuristic solution from the LB on a set of randomly generated problems. We have also applied these algorithms for scheduling computer vision tasks running on prototype multilayer architecture. Our computational and empirical results showed that the proposed heuristic algorithms perform well.

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 B I O O O O O O O O O O O O O O O O O O O


Sentence alignment using feed forward neural network Parallel corpora have become an essential resource for work in multi lingual natural language processing. However, sentence aligned parallel corpora are more efficient than non-aligned parallel corpora for cross language information retrieval and machine translation applications. In this paper, we present a new approach to align sentences in bilingual parallel corpora based on feed forward neural network classifier. A feature parameter vector is extracted from the text pair under consideration. This vector contains text features such as length, punctuate score, and cognate score values. A set of manually prepared training data has been assigned to train the feed forward neural network. Another set of data was used for testing. Using this new approach, we could achieve an error reduction of 60% over length based approach when applied on English-Arabic parallel documents. Moreover this new approach is valid for any language pair and it is quite flexible approach since the feature parameter vector may contain more/less or different features than that we used in our system such as lexical match feature.

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 B I O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

sentence alignment
parallel corpora
machine translation


Middleware adaptation with the Delphoi service Grid middleware needs to adapt to changing resources for a large variety of operations. Currently, however, there is only low-level information available about Grid resources, coming from various but functionally isolated monitoring and information systems. In this paper, we present the Delphoi service. It provides a unified interface to the necessary information, and also matches the abstraction level needed by middleware services to adapt their behavior. We describe Delphoi's architecture, the information it provides, and we evaluate the quality of its performance information. Delphoi has been developed as part of the EC-funded GridLab project and is currently being deployed on the project's testbed for adding adaptivity to GridLab's middleware services. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

resource monitoring
prediction
network performance
file transfer
queue waiting time
event logging


Implementation of a locally conservative numerical subgrid upscaling scheme for two-phase Darcy flow We present a locally mass conservative scheme for the approximation of two-phase flow in a porous medium that allows us to obtain detailed fine scale solutions on relatively coarse meshes. The permeability is assumed to be resolvable on a fine numerical grid, but limits on computational power require that computations be performed on a coarse grid. We define a two-scale mixed finite element space and resulting method, and describe in detail the solution algorithm. It involves a coarse scale operator coupled to a subgrid scale operator localized in space to each coarse grid element. An influence function (numerical Greens function) technique allows us to solve these subgrid scale problems independently of the coarse grid approximation. The coarse grid problem is modified to take into account the subgrid scale solution and solved as a large linear system of equations posed over a coarse grid. Finally, the coarse scale solution is corrected on the subgrid scale, providing a fine grid representation of the solution. Numerical examples are presented, which show that near-well behavior and even extremely heterogeneous permeability barriers and streaks are upscaled well by the technique.

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 B 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 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 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

heterogeneity
numerical greens functions
porous media


Adaptive blind source separation using weighted sums of two kinds of nonlinear functions We propose a new intelligent blind source separation algorithm for the mixture of sub-Gaussian and super-Gaussian sources. The algorithm consists of an update equation of the separating matrix and an adjustment equation of nonlinear functions. To verify the validity of the proposed algorithm, we compare the proposed algorithm with extant methods.

O B I I 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

sub-gaussian
super-gaussian
weighted sum of nonlinear functions


information distance and orientation in liquid layout Liquid layout of web browser elements enables enterprise applications to adapt to larger windows on larger displays, but guidelines are needed to define layout rules for widescreen page content. The present study considers the impact of relative portlet distance and orientation in enterprise-type tasks. Eighteen analysts completed tasks in which critical information was located in two portlets separated by defined distances and orientations. Analysis of completion times, assists, errors, and subjective scales revealed a significant advantage for wider, horizontal information layouts over narrower, vertical layouts. The difference persisted, even when accounting for the influence of vertical scrolling. Horizontal layout in these dashboard-style tasks had a 5\%-25\% time savings over vertical layout, as separation distances increased to 2000 pixels. Differences in horizontal and vertical eye movement accuracy and velocity could account for these results. Widescreen design guidelines should include a preference for horizontal layout as horizontal screen distances increase.

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 B I O O O O O O O O O O O O O


a workbench for quality based software re-engineering (poster) This research presents a re-engineering workbench and architecture that allows for legacy systems written in procedural languages to be migrated to new object oriented platforms. This methodology allows for specific design and quality requirements of the target migrant system to be considered during the re-engineering process through an iterative and incremental process. The migration process recovers an object model from the procedural code and incrementally refines it by taking into consideration the design requirements for the migrant system. A case study is presented as a proof of concept.

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

software quality
software migration
software architecture


Fetal Cell-Free Nucleic Acids in the Maternal Circulation: New Clinical Applications Six years after the demonstration of the presence of cell-free fetal nucleic acids in maternal plasma, perinatal clinical applications continue to expand. The focus of this article is on advances that have occurred since the CNAPS II conference held in Hong Kong in 2001. Circulating fetal DNA levels (fDNA) are elevated in pregnancies complicated by fetal trisomies 13 and 21 but not 18. Measurement of fDNA levels improves the performance of the current standard maternal serum screen, by increasing the detection of Down syndrome cases by 5% with no increase in the false-positive rate. fDNA levels are elevated in women who have developed clinical symptoms of preeclampsia, but they are also elevated by the early second trimester in women who will eventually develop preeclampsia. fDNA and mRNA gamma globin measurement may have clinical utility as markers for fetomaternal hemorrhage in the late first trimester. Cell-free fetal DNA levels are quite high in the amniotic fluid, permitting fetal genomic isolation and analysis using comparative genomic hybridization techniques. Fetal DNA crosses the blood-brain barrier and is detectable in maternal cerebrospinal fluid in a subset of pregnant women. The biological implications of this are currently unknown. Review of the literature suggests that the placenta is the predominant source of the circulating fetal nucleic acids. However, detection of gamma globin mRNA sequences in the plasma of pregnant women suggests that fetal blood cells also contribute to the pool of nucleic acids. Widespread incorporation of fetal nucleic acid measurement into routine prenatal care depends on the identification of a readily accessible gender-independent fetal marker.

O 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 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 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 B I 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


acoustic shooter localization with a minimal number of single-channel wireless sensor nodes Acoustic shooter localization systems are being rapidly deployed in the field. However, these are standalone systems---either wearable or vehicle-mounted---that do not have networking capability even though the advantages of widely distributed sensing for locating shooters have been demonstrated before. The reason for this is that certain disadvantages of wireless network-based prototypes made them impractical for the military. The system that utilized stationary single-channel sensors required many sensor nodes, while the multi-channel wearable version needed to track the absolute self-orientation of the nodes continuously, a notoriously hard task. This paper presents an approach that overcomes the shortcomings of past approaches. Specifically, the technique requires as few as five single-channel wireless sensors to provide accurate shooter localization and projectile trajectory estimation. Caliber estimation and weapon classification are also supported. In addition, a single node alone can provide reliable miss distance and range estimates based on a single shot as long as a reasonable assumption holds. The main contribution of the work and the focus of this paper is the novel sensor fusion technique that works well with a limited number of observations. The technique is thoroughly evaluated using an extensive shot library.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O


Single-input three-output electronically tunable universal current-mode filter using current follower transconductance amplifiers In this paper, an electronically tunable universal filter configuration with single input and three outputs (SITO) employing a recently introduced active device namely current follower transconductance amplifier (CFTA) is described. The proposed filter is composed of four CFTAs and two grounded capacitors, and is capable of realizing all the standard functions of the universal filter without requiring any component matching criterions and any extra active components. It exhibits low-input and high-output impedances, which is highly desirable for cascading in current-mode. It also offers the advantage feature of an independent electronic adjustment of the natural angular frequency (?o) and the quality factor (Q) by means of tuning the external bias currents. Moreover, a high Q-value filter can be obtained by simply adjusting the appropriate ratio of bias currents. The analysis of active and passive sensitivities is shown to be low. In order to demonstrate the performance of the proposed circuit, PSPICE simulation results are provided.

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 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

current follower transconductance amplifier (cfta)


Accurate methods for computing inviscid and viscous KelvinHelmholtz instability The KelvinHelmholtz instability is modelled for inviscid and viscous fluids. Here, two bounded fluid layers flow parallel to each other with the interface between them growing in an unstable fashion when subjected to a small perturbation. In the various configurations of this problem, and the related problem of the vortex sheet, there are several phenomena associated with the evolution of the interface; notably the formation of a finite time curvature singularity and the roll-up of the interface. Two contrasting computational schemes will be presented. A spectral method is used to follow the evolution of the interface in the inviscid version of the problem. This allows the interface shape to be computed up to the time that a curvature singularity forms, with several computational difficulties overcome to reach that point. A weakly compressible viscous version of the problem is studied using finite difference techniques and a vorticity-streamfunction formulation. The two versions have comparable, but not identical, initial conditions and so the results exhibit some differences in timing. By including a small amount of viscosity the interface may be followed to the point that it rolls up into a classic cats-eye shape. Particular attention was given to computing a consistent initial condition and solving the continuity equation both accurately and efficiently.

O O O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

kelvinhelmholtz instability
viscous fluids

inviscid fluids
spectral methods
adi methods
vorticity-streamfunction
roll-up


fantasya and sentoy FantasyA is a role-playing game where emotions are part of the game logic. SenToy is a tangible interface device [2], used to influence emotional behaviour in FantasyA. Players in the game FantasyA have to master SenToy and exhibit a particular set of emotions and perform a set of actions in order to evolve in the game [3]. A study was undertaken to gauge the success of the overall gaming experience, as well as the individual components, the FantasyA game with its emotional content and the SenToy control device with its gestural input.

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

affective tangible interaction
computer gaming


A monadic second-order definition of the structure of convex hypergraphs We consider finite hypergraphs with hyperedges defined as sets of vertices of unbounded cardinality. Each such hypergraph has a unique modular decomposition, which is a tree, the nodes of which correspond to certain subhypergraphs (induced by certain sets of vertices called strong modules) of the considered hypergraph. One can define this decomposition by monadic second-order (MS) logical formulas. Such a hypergraph is convex if the vertices are linearly ordered in such a way that the hyperedges form intervals. Our main result says that the unique linear order witnessing the convexity of aprime hypergraph (i.e., of one, the modular decomposition of which is trivial) can be defined in MS logic. As a consequence, we obtain that if a set of bipartite graphs that correspond (in the usual way) to convex hypergraphs has a decidable monadic second-order theory (which means that one can decide whether a given MS formula is satisfied in some graph of the set) then it has bounded clique-Width. This yields a new case of validity of a conjecture which is still open. (C) 2002 Elsevier Science (USA).

O O 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 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 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 B 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

bipartite graph
monadic second-order logic
clique-width


A methodology for selection and evaluation of advanced manufacturing technologies The problem of selection and justification of advanced manufacturing technologies (AMT) is a multi-attribute problem which involves both tangible and intangible factors. To select the best manufacturing technology that achieves most of the company requirements, it is necessary to use an appropriate selection approach that takes into consideration the different quantitative and qualitative factors of company objectives and AMT benefits. In this paper, a methodology for the selection of AMT is presented to assist the decision maker in selecting technologies that meet their needs. The suggested methodology combines two databases for the manufacturing company and AMT information, and multi-criteria decision making (MCDM) tools (analytical hierarchy process and fuzzy analytical hierarchy process). The developed methodology is tested and validated using a real application from Saudi Arabian Industry.

O O O O O O O B I I 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

fuzzy sets and theory
ahp
computer integrated manufacturing
multi-criteria decision making


Evaluating the Benefits of Context-Sensitive Points-to Analysis Using a BDD-Based Implementation We present PADDLE, a framework of BDD-based context-sensitive points-to and call graph analyses for Java, as well as client analyses that use their results. PADDLE supports several variations of context-sensitive analyses, including call site strings and object sensitivity, and context-sensitively specializes both pointer variables and the heap abstraction. We empirically evaluate the precision of these context-sensitive analyses on significant Java programs. We find that that object-sensitive analyses are more precise than comparable variations of the other approaches, and that specializing the heap abstraction improves precision more than extending the length of context strings.

O 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 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

design
experimentation
measurement
interprocedural program analysis
context sensitivity
binary decision diagrams
points-to analysis
call graph construction
cast safety analysis


The new challenges of management in a wired world The old causal models used in decision support systems are not adequate anymore to represent the evolution of systems presenting the high rhythm of interactions of modern organisations. Emergent properites or even chaotic situations are resulting from the non linear dynamic of these systems. The Theory of Complexity of the Santa Fe Institute offers new approaches to these problems.

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


Multiobjective tradeoff analysis of deregulated electricity transactions This paper analyzes the tradeoff relationships between the differing goals of power system operation and the influence of social policies, such as environmental impact minimization, upon deregulated electricity trade. An optimization procedure to reach a coordinated solution between different objectives is presented based on fuzzy interactive multiobjective optimization. Numerical examples are demonstrated on an IEEE 30 bus system. From the simulation, it has been found that the additional goals may reduce the volume of free trade of electricity, but the fuzzy multiobjective optimization can reach a good balance between conflicting goals.

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 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 B I O O O O O O O O

multiobjective optimization
tradeoff
coordinated solution


Bayesian identification of a cracked plate using a population-based Markov Chain Monte Carlo method Estimating damage in structural systems is a challenging problem due to the complexity of the likelihood function describing the observed data. From a Bayesian perspective a complicated likelihood means efficient sampling of the posterior distribution is difficult and standard Markov Chain Monte Carlo samplers may no longer be sufficient. This work describes a population-based Markov Chain Monte Carlo approach for efficient sampling of the damage parameter posterior distributions. The approach is shown to accurately estimate the state of damage in a cracked plate structure using simulated, free-decay response data. The use of this approach in identifying structural damage has not previously been explored.

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

population-based markov chain monte carlo


Design of multiple-level hybrid classifier for intrusion detection system using Bayesian clustering and decision trees With increasing connectivity between computers, the need to keep networks secure progressively becomes more vital. Intrusion detection systems (IDS) have become an essential component of computer security to supplement existing defenses. This paper proposes a multiple-level hybrid classifier, a novel intrusion detection system, which combines the supervised tree classifiers and unsupervised Bayesian clustering to detect intrusions. Performance of this new approach is measured using the KDDCUP99 dataset and is shown to have high detection and low false alarm rates.

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 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

decision tree
false-negative
false-positive
intrusion detection system (ids)


OPTIMAL ADAPTIVE PREDICTION FOR SISO SYSTEMS An adaptive predictor that is optimal in the minimum mean-square error (MMSE) sense at each step is obtained for single-input, single-output (SISO) linear time-invariant discrete-time systems having general delay and white noise perturbation. The adaptive d-step-ahead predictor includes the uncertainty associated with the parameter and state estimates whereas conventional adaptive predictors, that are asymptotically optimal, ignore the uncertainty in the parameter estimates.

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

optimal joint parameter and state estimation


Constrained formulations and algorithms for predicting stock prices by recurrent fir neural networks In this paper, we develop a new constrained artificial-neural-network (ANN) formulation and the associated learning algorithm for predicting stock prices, a difficult time-series prediction problem. We characterize daily stock prices as a noisy non-stationary time series and identify its predictable low-frequency components. Using a recurrent finite-impulse-response ANN, we formulate the learning problem as a constrained optimization problem, develop constraints for incorporating cross validations, and solve the learning problem using algorithms based on the theory of extended saddle points for nonlinear constrained optimization. Finally, we illustrate our prediction results on ten stock-price time series. Our main contributions in this paper are the channel-specific low-pass filtering of noisy time series obtained by wavelet decomposition, the transformation of the low-pass signals to improve their stationarity, and the incorporation of constraints on cross validation that can improve the accuracy of predictions. Our experimental results demonstrate good prediction accuracy and annual returns.

O O O O O O B I 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 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 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 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

nonlinear constrained optimization
recurrent fir neural networks
stock prices
wavelet decomposition

channel-specific low-pass filtering
edge effects
non-stationarity
time-series predictions


Extending the TAM model to explore the factors that affect Intention to Use an Online Learning Community An online learning community enables learners to access up-to-date information via the Internet anytime-anywhere because of the ubiquity of the World Wide Web (WWW). Students can also interact with one another during the learning process. Hence, researchers want to determine whether such interaction produces learning synergy in an online learning community. In this paper, we take the Technology Acceptance Model as a foundation and extend the external variables as well as the Perceived Variables as our model and propose a number of hypotheses. A total of 436 Taiwanese senior high school students participated in this research, and the online learning community focused on learning English. The research results show that all the hypotheses are supported, which indicates that the extended variables can effectively predict whether users will adopt an online learning community. Finally, we discuss the implications of our findings for the future development of online English learning communities. (C) 2009 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 B I O O O O O O O

evaluation methodologies
evaluation of cal systems
interactive learning environments
media in education


a search engine for imaged documents in pdf files Large quantities of documents in the Internet and digital libraries are simply scanned and archived in image format, many of which are packed in PDF files. The word search tool provided by Adobe Reader/Acrobat does not work for these imaged documents. In this paper, we present a search engine to deal with this issue for imaged documents in PDF files. The experimental results show an encouraging performance.

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 O O O O O O O O O B I O O O O O O O


The Role of PET in Localization of Neuroendocrine and Adrenocortical Tumors Positron emission tomography (PET) supplies a range of labeled compounds to be used for the characterization of tumor biochemistry. Some of these have proved to be of value for clinical diagnosis, treatment follow up, and clinical research. The first routinely used PET tracer in oncology, 18F-labeled deoxyglucose (FDG), was successfully used for diagnosis of cancer, reflecting increased expression of glucose transporter in cancerous tissue. This tracer, however, usually does not show sufficient uptake in well-differentiated tumors such as neuroendocrine tumors. We developed a tracer more specific to neuroendocrine tumorsthe serotonin precursor 5-hydroxytryptophan (5-HTP) labeled with 11Cand demonstrated increased uptake and irreversible trapping of this tracer in carcinoid tumors. The uptake was so selective and the resolution was so high that we could detect more liver and lymph node metastases with PET than with CT or octreotide scintigraphy. To further improve the method, especially to reduce the high renal excretion of the tracer producing streaky artifacts in the area of interest, we introduced premedication by the decarboxylase inhibitor carbidopa, leading to a six-fold decreased renal excretion while the tumor uptake increased three-fold, hence improving the visualization of the tumors.

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 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

positron emission tomography
neuroendocrine tumors

5-hydroxytryptophan (5-htp)
l-dihyroxyphenylalanine (l-dopa)
metomidate
whole-body pet


integrating building information modeling & cell-devs simulation We present the development of an Interactive Environment System (IES). The IES is used for simulating Cell-DEVS models built in CD++ that interact with a Building Information Modeling(BIM) system using Autodesk Revit architecture and Autodesk 3ds Max. CD++ is a modeling and simulation tool that was created to study complex systems by using a discrete event cell-based approach. It was successfully employed to define a variety of models for complex applications using a cell-based approach. The system developed has a highly modular collection of software packages designed to facilitate the creation of device independent simulation for BIM. The integration of the proposed system is investigated via the simulation of Diffusion Limited Aggregation (DLA) which represents the growth of mold in a building wall. The results affirmed the potential of the (IES) system for interactive simulation application.

O O O O O O O O O O O O O O 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 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


A socio-technical approach to improving the systems development process Research on improving the systems development processes has primarily focused on mechanisms such as tools, software development methodologies, knowledge sharing and process capabilities. This research has yielded considerable insights into improving the systems development process, but the large majority of information systems development projects still continue to be over budget, late, and ineffective in meeting user needs. Together with the advent of software development moving offshore, or consisting of offshore team members, a more holistic approach is appropriate. Approached from a socio-technical perspective the software development process is viewed as a process embedded in a social and a technical subsystem. Drawing upon socio-technical work design principles, this paper suggests how capabilities of the development process can be improved. Data collected from a survey of software development practices in organizations indicates that organizations at different levels of process capabilities differ in work system characteristics as well as process performance. For example, the use of multi-skilled teams was found to be significantly related to the systems development process maturity level as well as significantly related to all the performance measures studied. This paper provides empirical support for the socio-technical approach and provides a theoretical foundation for designing software process initiatives in organizations.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

socio-technical systems
work systems
cmmi


Impact of the Reduction of Transmitted Information on the Control Quality in a Wireless Feedback Control System This paper discusses the reduction of the amount of transmitted information for the efficient use of frequency resources in wireless feedback control systems, and clarify the effect of the reduction of the amount of transmitted information. As a typical example of the under-actuated controlled object, a rotary inverted pendulum is considered. We propose a reduction method for state information fed back from the controller to the controlled object. It estimates angle or velocity state from the previous state. In addition, we propose a reduction method that temporally omits less important control information and state information. Numerical examples clarify the effect of the reduction methods on the control quality. And we show that the reduction methods achieve large reduction of the amount of transmitted information with small disadvantage of the control quality.

O O O B I I 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 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 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

feedback control
reduction of transmitted information
rotary inverted pendulum


Efficient and secure cryptographic systems based on addition chains: Hardware design vs. software/hardware co-design Most of cryptographic systems are based on modular exponentiation, wherein the operands are considerably large. Generally, modular exponentiation is implemented using a chain of modular multiplications. One way of improving the throughput of a cryptographic system implementation is reducing the number of the required modular multiplications. Given the exponent, finding the minimal number of multiplications that are necessary to reach the exponentiation results is a hard problem. We take advantage of an evolutionary stochastic process, commonly called genetic algorithms, to compute minimal addition chains, allow us to reduce drastically the number of the required modular multiplications. In this paper, we investigate two different ways to implement modular exponentiation based on the evolved addition chain: the first approach consists of implementing all the exponentiation operation on hardware and the second approach combines software and hardware. While the first approach attempts to optimise the encryption/decryption throughput regardless of the cost of system implementation, the second attempts to reach a balance between the throughput and the cost of the implementation.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

cryptography
modular multiplication
co-design


Associative memory of phase-coded spatiotemporal patterns in leaky Integrate and Fire networks We study the collective dynamics of a Leaky Integrate and Fire network in which precise relative phase relationship of spikes among neurons are stored, as attractors of the dynamics, and selectively replayed at different time scales. Using an STDP-based learning process, we store in the connectivity several phase-coded spike patterns, and we find that, depending on the excitability of the network, different working regimes are possible, with transient or persistent replay activity induced by a brief signal. We introduce an order parameter to evaluate the similarity between stored and recalled phase-coded pattern, and measure the storage capacity. Modulation of spiking thresholds during replay changes the frequency of the collective oscillation or the number of spikes per cycle, keeping preserved the phases relationship. This allows a coding scheme in which phase, rate and frequency are dissociable. Robustness with respect to noise and heterogeneity of neurons parameters is studied, showing that, since dynamics is a retrieval process, neurons preserve stable precise phase relationship among units, keeping a unique frequency of oscillation, even in noisy conditions and with heterogeneity of internal parameters of the units.

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 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 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

storage capacity
replay
associative memory

learning and memory
phase-of-spikes coding
noise robustness
stdp


Implementation issues in RFID-based anti-counterfeiting systems RFID has emerged as a potential tool to combat product counterfeiting, which undermines the global economy hugely. Recently, a number of anti-counterfeiting approaches have been proposed for such purpose. This paper presents a track-and-trace system for RFID-based anti-counterfeiting, and addresses possible implementation issues, such as tag selection, product tagging, tag programming and locking. A packaging line for bottled products is developed and integrated with the proposed system for investigation of these issues. Experiments are conducted to determine the critical tag moving speed beyond which the tag programming rate or reliability of tagged products being transferred on a convey drops significantly. The critical tag moving speed is vital not only for determining the maximum production throughput possible, but also for setting up RFID equipment needed to ensure tagged products with erroneous tagging can be sorted out from the packaging line accordingly. (C) 2011 Elsevier B.V. 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 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 B I I I O O O B I 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

product tagging
tag programming
critical tag moving speed


Fabrication and testing analysis of tapered silicon microneedles for drug delivery applications Tapered silicon microneedles are fabricated by an improved cutting method. Force testing about these microneedles indicates that they pierced into skins easily. A 77 microneedles patch is selected to be employed to experiment drug delivery. The permeation of calcein through skins can be obviously improved by this patch.

O O O O O O O B O B I 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 B O O O O O O O O B I O O O O O O O O O O O O O


Dynamic workflow model for complex activity in intensive care unit Co-operation is very important in Medical care, especially in the Intensive Care Unit (ICU) where the difficulties increase which is due to the urgency of the work. Workflow systems are considered as well adapted to modelize productive work in business process. We aim at introducing this approach in the Health Care domain. We have proposed a conversation-based workflow in order to modelize the therapeutics plan in the ICU [1]. But in such a complex field, the flexibility of the workflow system is essential for the system to be usable. We have concentrated on three main points usually proposed in the workflow models, suffering from a lack of dynamicity: static links between roles and actors, global notification of information changes, lack of human control on the system. In this paper, we focus on the main points used to increase the dynamicity. We report on affecting roles, highlighting information, and controlling the system. We propose some solutions and describe our prototype in the ICU.

O B O O O O O 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 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 B 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 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

groupware
activity process
dynamic control


Solution of the simultaneous pose and correspondence problem using Gaussian error model The use of hypothesis verification is recurrent in the model-based recognition literature. Verification consists in measuring how many model features transformed by a pose coincide with some image features. When data involved in the computation of the pose are noisy, the pose is inaccurate and difficult to verify, especially when the objects are partially occluded. To address this problem, the noise in image features is modeled by a Gaussian distribution. A probabilistic framework allows the evaluation of the probability of a matching, knowing that the pose belongs to a rectangular volume of the pose space. It involves quadratic programming, if the transformation is affine. This matching probability is used in an algorithm computing the best pose. It consists in a recursive multiresolution exploration of the pose space, discarding outliers in the match data while the search is progressing. Numerous experimental results are described. They consist of 2D and 3D recognition experiments using the proposed algorithm. (C) 1999 Academic Press.

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

model-based recognition
pose verification


Integrating both Wikis and XML with case bases to facilitate case base development and maintenance Case-based reasoning (CBR), as a promising technology for problem solving and decision support, has drawn considerable attention during the last 20years. As CBR systems become more frequently deployed in real-world situations and as large-scale case-bases become more commonly used in practice, the development and maintenance of the case-base becomes critical to CBR practitioners. In reality, adding cases to a case-base and updating cases in a case-base can be troublesome and time-consuming processes. It has become increasingly important for CBR practitioners to be able to implement an efficient way to develop and maintain the case base. However, techniques for case-base development and maintenance (such as adding cases and updating cases) have not received enough attention and are often neglected by CBR researchers. This paper discusses Wikis and XML (specifically, the Office Open XML format) and proposes an integrated approach to facilitate case-base development and maintenance in adding cases and in updating cases.

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 O O O O O B 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


Solutions for biomedical grid computingCase studies from the D-Grid project Services@MediGRID The project Services@MediGRID consortium established a tool set of grid-based biomedical services since 2008. The services are related to genetic analysis, genome data visualization, and pharmacokinetic modeling. Furthermore, business concepts for these services have been examined which are supported by an accounting and billing service. While the tools cover a whole service chain for biomedicine, the business concepts are rather heterogeneous. However, the overall addressed target market areas show promising potential. In addition, a structured coaching process reduces friction in the technology transfer from grid computing to biomedicine. This should be considered for similar future endeavors.

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

services@medigrid
medigrid
healthgrids
grid-based tool set for genetics
grid business concepts


The systems analysis approach to mechanosensory coding An important problem in neuroscience is to obtain quantitative knowledge of how information is represented, or encoded, in the signals that nerve cells process and transmit. Sensory receptors have provided important models for the study of neural coding because their inputs can often be relatively easily controlled and measured, while the resultant activity is recorded. A variety of engineering concepts have been successfully applied to physiological sciences, particularly those related to control of dynamic systems. Linear systems analysis was one of the earliest methods used to probe sensory coding, and measurements such as step responses and frequency responses have become standard tools for describing sensory functions. Modern systems analysis has evolved to provide accurate and efficient linear identification of encoding in sensory receptors that use either graded potentials or action potentials. It has also led to nonlinear systems analysis, the creation of parametric nonlinear models, and measures of information coding by sensory neurons. These methods promise to provide important new knowledge about sensory systems in the future, especially when complemented with parallel biophysical and molecular studies of sensory neurons. Mechanoreceptors provided some of the earliest preparations for the investigation of neural coding, and both the linear and nonlinear properties of wide variety of vertebrate and invertebrate mechanoreceptors continue to be explored.

O O O O O O O O O O O O O O O O O O O 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 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 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 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 B I O O O B O B O O O O O O O O O O O O O


Deterministic end-to-end delay guarantees with rate controlled EDF scheduling Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (EDF) scheduling, in conjunction with per-hop traffic shaping (jointly called Rate Controlled EDF or RC-EDF) has been recognised as an effective means of end-to-end deterministic delay provisioning. This paper addresses the issue of identifying RC-EDF shaping parameters that realize maximal network utilizations. We first prove that finding optimal shapers is in general infeasible, and then propose a heuristic choice derived from the flows hop-length. Our choice varies gracefully between known optimal settings for the limiting values of the hop-length, and outperforms shaper selections proposed previously in the literature.

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

per-hop traffic shaping
end-to-end delay guarantee


On developmental mental architectures This paper presents a computational theory of developmental mental architectures for artificial and natural systems, motivated by neuroscience. The work is an attempt to approximately model biological mental architectures using mathematical tools. Six types of architecture are presented, beginning with the observation-driven Markov decision process as Type-1. From Type-1 to Type-6, the architecture progressively becomes more complete toward the necessary functions of autonomous mental development. Properties of each type are presented. Experiments are discussed with emphasis on their architectures.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

mental architecture
agent architecture
computational neural science
cognitive development
developmental robots
learning types
developmental vision
speech recognition
language acquisition
thinking
reasoning
autonomous planning


Study of PTPC Composition during Apoptosis for Identification of Viral Protein Target The permeability transition pore complex (PTPC), a mitochondrial polyprotein complex, has been previously described to be involved in the control of mitochondrial membrane permeabilization (MMP) during chemotherapy-induced apoptosis. PTPC may contain proteins from both mitochondrial membranes [e.g., voltage-dependent anion channel (VDAC), PRAX-1, peripheral benzodiazepine receptor (PBR), adenine nucleotide translocator (ANT)], from cytosol (e.g., hexokinase II, glycerol kinase), from matrix [e.g., cyclophilin D (CypD)], and from intermembrane space (e.g., creatine kinase). PTPC may also interact with tumor suppressor proteins (i.e., Bax and Bid), oncoprotein homologues of Bcl-2 and some viral proteins, which can regulate apoptosis induced by pore opening. ANT and VDAC are the target of numerous pro-apoptotic MMP inducers. However, the precise composition of PTPC as well as the respective role of each PTPC component represent major issues in the understanding MMP process. Using several experimental strategiesthat combine co-immunoprecipitation, proteomics, and functional tests with proteoliposomes, we and others have been able to characterize some of the intra/inter-PTPC protein interactions leading to a better understanding of the process of MMP. In addition, this approach could identify new putative members and regulators of PTPC pro-apoptotic function and new targets of viral protein involved in the modulation of apoptosis during infection.

O O O O O O O O O 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 B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mitochondrial membrane permeabilization
tumor suppressor proteins
viral proteins


A Set-Theoretic Method for Parametric Uncertainty Analysis in Markov Reliability and Reward Models This paper proposes a set-theoretic method to capture the effect of parametric uncertainty in reliability and performability indices obtained from Markov reliability and reward models. We assume that model parameters, i.e., component failure and repair rates, are not perfectly known, except for upper and lower bounds obtained from engineering judgment or field data. Thus, the values that these parameters can take are constrained to lie within a set. In our method, we first construct a minimum volume ellipsoid that upper bounds this set, and hence contains all possible values that the parameters can take. This ellipsoid is then propagated via set operations through a second-order Taylor series expansion of the Markov chain stationary distribution, resulting in a set that provides approximate bounds on reliability and performability indices of interest. Case studies pertaining to a two-component shared load system with common-cause failures, and preventative maintenance of an electric-power distribution transformer, are presented.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

markov reliability models
markov reward models
unknown-but-bounded uncertainty models


An inverse Lax-Wendroff method for boundary conditions applied to Boltzmann type models In this paper we present a new algorithm based on Cartesian meshes for the numerical approximation of kinetic models set in an arbitrary geometry. Due to the high dimensional property of kinetic models, numerical algorithms based on unstructured meshes are not really appropriate since most of numerical methods (semi-Lagrangian, spectral methods) are particularly efficient on structured grids. Here we propose to adapt the inverse Lax-Wendroff procedure, which has been recently introduced for conservation laws [21], for kinetic equations. Numerical simulations in 1D x 3D and 2D x 3D based on this approach are proposed for Boltzmann type operators (BGK, ES-BGK models). (C) 2013 Elsevier Inc. All rights reserved.

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


Numerical Algorithms for Polyenergetic Digital Breast Tomosynthesis Reconstruction Digital tomosynthesis imaging is becoming increasingly significant in a variety of medical imaging applications. Tomosynthesis imaging involves the acquisition of a series of projection images over a limited angular range, which, after reconstruction, results in a pseudo-three-dimensional (3D) representation of the imaged object. The partial separation of features in the third dimension improves the visibility of lesions of interest by reducing the effect of the superimposition of tissues. In breast cancer imaging, tomosynthesis is a viable alternative to standard mammography; however, current algorithms for image reconstruction do not take into account the polyenergetic nature of the x-ray source beam entering the object. This results in inaccuracies in the reconstruction, making quantitative analysis challenging and allowing for beam hardening artifacts. In this paper, we develop a mathematical framework based on a polyenergetic model and develop statistically based iterative methods for digital tomosynthesis reconstruction for breast imaging. By applying our algorithms to simulated data, we illustrate the success of our methods in suppressing beam hardening artifacts and improving the overall quality of the reconstruction.

O O O O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O 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 B 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 I O O O O O O O O O O O O O O O O O B I O B I B O B I 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

digital tomosynthesis
iterative methods
beam hardening artifacts
breast imaging
mammography
reconstruction


Efficient representation and compression of multi-view images This Letter proposes a new three dimensional (3D) visual communication approach based on the image-based rendering. We first compactly represent a reference view set by exploiting its geometric correlation and then efficiently compress the representation with appropriate coding schemes. Experimental results demonstrate that our proposed method significantly reduces the required bitrate.

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


A layer-based virtual prototyping system for product development This paper proposes a layer-based virtual prototyping (VP) system, which builds virtual or digital prototypes to facilitate product development. The approach resembles the physical fabrication process of laminated sheet-based rapid prototyping (RP) systems. It simulates such an RP process to create a virtual prototype of a product design. Thus, the designer can perform design validation and accuracy analysis easily in a virtual environment as if using a physical prototype. In addition to numeric quantification of the RP process, the system provides vivid visualizations of the prototype for studying its characteristics. The prototype may also be superimposed on the original model, and the areas with dimensional errors beyond the design limits may be clearly highlighted for subsequent improvement. Hence, the designer can analyze and compare the surface texture point-by-point of the prototype with the product design. Furthermore, the virtual prototypes can also be transmitted via the Internet to customers to facilitate global manufacturing. As a result, both the lead-time and product development cost can be significantly reduced. (C) 2003 Elsevier Science B.V. All rights reserved.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

layer extrusion
simulation and visualization


An Integrated Pseudo-Associativity and Relaxed-Order Approach to Hardware Transactional Memory Our experimental study and analysis reveal that the bottlenecks of existing hardware transactional memory systems are largely rooted in the extra data movements in version management and in the inefficient scheduling of conflicting transactions in conflict management, particularly in the presence of high-contention and coarse-grained applications. In order to address this problem, we propose an integrated Pseudo-Associativity and Relaxed-Order approach to hardware Transactional Memory, called PARO-TM. It exploits the extra pseudo-associative space in the data cache to hold the new value of each transactional modification, and maintains the mappings between the old and new versions via an implicit pseudo-associative hash algorithm (i.e., by inverting the specific bit of the SET index). PARO-TM can branch out the speculative version from the old version upon each transactional modification on demand without a dedicated hardware component to hold the uncommitted data. This means that it is able to automatically access the proper version upon the transaction's commit or abort. Moreover, PARO-TM augments multi-version support in a chained directory to schedule conflicting transactions in a relaxed-order manner to further reduce their overheads. We compare PARO-TM with the state-of-the-art LogTM-SE, TCC, DynTM, and SUV-TM systems and find that PARO-TM consistently outperforms these four representative HTMs. This performance advantage of PARO-TM is far more pronounced under the high-contention and coarse-grained applications in the STAMP benchmark suite, for which PARO-TM is motivated and designed.

O O O O O O O B I I 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 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 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 O O O O O O O O

performance
hardware transactional memory
chained directory

design
chip multi-processor
pseudo-associative cache


Exploring Strategies for Training Deep Neural Networks Deep multi-layer neural networks have many levels of non-linearities allowing them to compactly represent highly non-linear and highly-varying functions. However, until recently it was not clear how to train such deep networks, since gradient-based optimization starting from random initialization often appears to get stuck in poor solutions. Hinton et al. recently proposed a greedy layer-wise unsupervised learning procedure relying on the training algorithm of restricted Boltzmann machines (RBM) to initialize the parameters of a deep belief network (DBN), a generative model with many layers of hidden causal variables. This was followed by the proposal of another greedy layer-wise procedure, relying on the usage of autoassociator networks. In the context of the above optimization problem, we study these algorithms empirically to better understand their success. Our experiments confirm the hypothesis that the greedy layer-wise unsupervised training strategy helps the optimization by initializing weights in a region near a good local minimum, but also implicitly acts as a sort of regularization that brings better generalization and encourages internal distributed representations that are high-level abstractions of the input. We also present a series of experiments aimed at evaluating the link between the performance of deep neural networks and practical aspects of their topology, for example, demonstrating cases where the addition of more depth helps. Finally, we empirically explore simple variants of these training algorithms, such as the use of different RBM input unit distributions, a simple way of combining gradient estimators to improve performance, as well as on-line versions of those algorithms.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

restricted boltzmann machines
unsupervised learning

artificial neural networks
deep belief networks
autoassociators


Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S??(G), if S is a maximum stable set of the subgraph spanned by S?N(S), where N(S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself. Nemhauser and Trotter Jr. (Math. Programming 8(1975) 232248), proved that any S??(G) is a subset of a maximum stable set of G. In Levit and Mandrescu (Discrete Appl. Math., 124 (2002) 91101) we have shown that the family ?(T) of a forest T forms a greedoid on its vertex set. In this paper, we demonstrate that for a bipartite graph G, ?(G) is a greedoid on its vertex set if and only if all its maximum matchings are uniquely restricted.

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


Optical wireless localization In this paper, we explore the possibility of using directionality of free-space-optical (a.k.a. optical wireless) communications for solving the 3-D localization problem in ad-hoc networking environments. Range-based localization methods either require a higher node density (i.e., at least three other localized neighbors must exist) than required for assuring connectedness or a high-accuracy power-intensive ranging device such as a sonar or laser range finder which exceeds the form factor and power capabilities of a typical ad-hoc node. Our approach exploits the readily available directionality information provided by a physical layer using optical wireless and uses a limited number of GPS-enabled nodes, requiring a very low node density (2-connectedness, independent of the dimension of space) and no ranging technique. We investigate the extent and accuracy of localization with respect to varying node designs (e.g., increased number of transceivers with better directionality) and density of GPS-enabled and ordinary nodes as well as messaging overhead per re-localization. Although denser deployments are desirable for higher accuracy, our method still works well with sparse networks with little message overhead and small number of anchor nodes (as little as 2). We also present a proof-of-concept prototype of our FSO-based localization techniques and show the validity of our approach even with three transceivers per node.

O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

free-space-optics
ad-hoc networks
spherical fso structures


ON SECOND-ORDER TAYLOR EXPANSION OF CRITICAL VALUES Studying a critical value function phi in parametric nonlinear programming, we recall conditions guaranteeing that phi is a C(1,1) function and derive second order Taylor expansion formulas including second-order terms in the form of certain generalized derivatives of D phi. Several specializations and applications are discussed. These results are understood as supplements to the well-developed theory of first- and second-order directional differentiability of the optimal value function in parametric optimization.

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 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

taylor expansion
critical value function
generalized derivatives

parametric programs
envelope theorems
lipschitz stability
c(1,1) optimization


AN ANALYSIS OF ELM APPROXIMATE ERROR BASED ON RANDOM WEIGHT MATRIX It is experimentally observed that the approximate errors of extreme learning machine (ELM) are dependent on the uniformity of training samples after the network architecture is fixed, and the uniformity, which is usually measured by the variance of distances among samples, varies with the linear transformation induced by the random weight matrix. By analyzing the dimension increase process in ELM, this paper gives an approximate relation between the uniformities before and after the linear transformation. Furthermore, by restricting ELM with a two-dimensional space, it gives an upper bound of ELM approximate error which is dependent on the distributive uniformity of training samples. The analytic results provide some useful guidelines to make clear the impact of random weights on ELM approximate ability and improve ELM prediction accuracy.

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


CRITICAL SUCCESS FACTORS FOR BUSINESS INTELLIGENCE SYSTEMS The implementation of a business intelligence (BI) system is a complex undertaking requiring considerable resources. Yet there is a limited authoritative set of critical success factors (CSFs) for management reference because the BI market has been driven mainly by the IT industry and vendors. This research seeks to bridge the gap that exists between academia and practitioners by investigating the CSFs influencing BI systems success. The study followed a two-stage qualitative approach. Firstly, the authors utilised the Delphi method to conduct three rounds of studies. The study develops a CSFs framework crucial for BI systems implementation. Next, the framework and the associated CSFs are delineated through a series of case studies. The empirical findings substantiate the construct and applicability of the framework. More significantly, the research further reveals that those organisations which address the CSFs from a business orientation approach will be more likely to achieve better results.

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 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 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


Neuroimaging Studies of Amygdala Function in Anxiety Disorders Neuroimaging research has helped to advance neurobiological models of anxiety disorders. The amygdala is known to play an important role in normal fear conditioning and is implicated in the pathophysiology of anxiety disorders. The amygdala may also be a target for the beneficial effects of cognitive-behavioral and medication treatments for anxiety disorders. In the current paper, we review neuroimaging research pertaining to the role of the amygdala in anxiety disorders and their treatment. Moreover, we discuss the development of new neuroimaging paradigms for measuring aspects of amygdala function, as well as the function of related brain regions. We conclude that such tools hold great promise for facilitating progress in relevant basic neuroscience as well as clinical research domains.

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

functional magnetic resonance imaging
positron emission tomography
posttraumatic stress disorder
phobias
obsessive-compulsive disorder
panic disorder


Finite transducers for divisibility monoids Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations. Here, we show that every divisibility monoid admits an explicit finite transducer which allows to compute normal forms in quadratic time. In addition, we prove that every divisibility monoid is biautomatic. (C) 2006 Elsevier B.V. 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 B I O O O O B 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


Clustering the ecological footprint of nations using Kohonen's self-organizing maps Per capita ecological footprint (EF) is one of the most widely recognized measures of environmental sustainability. It seeks to quantify the Earth's biological capacity required to support human activity. Self-organizing maps (SOM) is a machine learning method that can be used to explore patterns in large and complex datasets for linear and non-linear patterns. This study uses SOM to model and cluster the EF of 140 nations. The results show that major variables affecting a nation's EF are related to the nation's world system position (WSP), GDP, urbanization level, export as a percent of the GDP, services intensity, and literacy rate. The study also shows that SOM models are capable of improving clustering quality while extracting valuable information from multidimensional environmental data. (C) 2009 Elsevier Ltd. All rights reserved.

O O B I 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

environmental degradation
self-organizing maps
cluster analysis


visual specification and analysis of use cases Unified Modelling Language (UML) is popular mainly due to the various visual notations it provides for specifying large systems. In UML the details of a use case are specified in natural language using standard templates [Cockburn 2000]. This is a critical gap leading to detailed requirements of an application being specified in natural language. As a result, inadequate analysis of business requirements is a source of many defects in software application development. Here we propose to bridge this gap by extending the set of UML diagrams with three new diagrams that enable rigorous specification, analysis and simulation of requirements.The above is achieved by modelling business policies as global invariants and operational tasks as user interactions. We propose visual notations to specify both the global invariants as well as the user interactions. The two specifications are checked for consistency using the model checker, SAL. Inconsistencies detected by the model checker are then presented back to the analyst in the form of easy to understand diagrams. These inconsistencies help detect incompleteness in the functional specification of an application as well as help in making the functional specifications rigorous and detailed. This simplifies the task of the designers and implementers. SAL is also used to simulate the system and generate some sample runs. These sample runs are presented back to the developer in visual form enabling better understanding of the behaviour of the system. The advantages of this approach are demonstrated through our experiences with a case study as well as a project executed at Tata Consultancy Services(TCS).

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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Hyperspectral imagery: Clutter adaptation in anomaly detection Hyperspectral sensors are passive sensors that simultaneously record images for hundreds of contiguous and narrowly spaced regions of the electromagnetic spectrum. Each image corresponds to the same ground scene, thus creating a cube of images that contain both spatial acid spectral information about the objects and backgrounds in the scene. In this paper, we present an adaptive anomaly detector designed assuming that the background clutter in the hyperspectral imagery is a three-dimensional Gauss-Markov random field. This model leads to an efficient and effective algorithm for discriminating man-made objects (the anomalies) in real hyperspectral imagery. The major focus of the paper is on the adaptive stage of the detector, i.e., the estimation of the Gauss-Markov random field parameters. We develop three methods: maximum-likelihood; least squares; and approximate maximum-likelihood. We study these approaches along three directions: estimation error performance, computational cost, and detection performance. In terms of estimation error, we derive the Cramer-Rao bounds and carry out Monte Carlo simulation studies that show that the three estimation procedures have similar performance when the fields are highly correlated, as is often the case with real hyperspectral imagery. The approximate maximum-likelihood method has a clear advantage from the computational point of view. Finally, we test extensively with real hyperspectral imagery the adaptive anomaly detector incorporating either the least squares or the approximate maximum-likelihood estimators. Its performance compares very favorably with that of the RX algorithm, an alternative detector commonly used with multispectral data, while reducing by up to an order of magnitude the associated computational cost.

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 O O O O O O O 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 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 B 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 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

anomaly detection
hyperspectral imagery
least squares

cramer-rao bounds
gauss-markov random field
maximum likelihood
multispectral imagery
ultraspectral imagery


Analysis of Calcium Changes in Endoplasmic Reticulum during Apoptosis by the Fluorescent Indicator Chlortetracycline Many studies suggest that endoplasmic reticulum (ER) Ca2+ pool rather than cytosolic Ca2+ may play a crucial role in triggering apoptosis. In this study, we performed an image analysis of cells loaded with the fluorescent dye chlortetracycline (CTC) to in situ analyze Ca2+ changes within the ER in apoptosing promonocytic U937 cells. The results, validated through the use of thapsigargin (THG) as ER Ca2+ depletor, confirm the findings that apoptotic cells have a Ca2+-depleted ER, in contrast with treated but still viable cells

O O B O O B I O B O O O O B O O O 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 B 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

apoptosis
endoplasmic reticulum
calcium
thapsigargin
chlortetracycline


YinYangZhong grid: An overset grid system for a sphere For numerical simulations inside a sphere, an overset grid system, YinYangZhong grid, is proposed. The YinYangZhong grid is an extension of the YinYang grid, which is widely used in various simulations in spherical shell geometry. The YinYang grid is itself an overset grid system with two component grids, and a new component grid called Zhong is placed at the center of the YinYang grid. The Zhong grid component is constructed on Cartesian coordinates. Parallelization is intrinsically embedded in the YinYangZhong grid system because the Zhong grid points are defined with cuboid blocks that are decomposed domains for parallelization. The computational efficiency approaches the optimum as the process number increases. Quantitative test simulations are performed for a diffusion problem in a sphere with the YinYangZhong grid. Correct decay rates are obtained by the simulations. Two other tests in magnetohydrodynamics (MHD) in a sphere are also performed. One is an MHD dynamo simulation, and the other is an MHD relaxation simulation in a sphere.

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 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 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 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 O O O O O O O B

sphere
magnetohydrodynamics
yinyang grid


BusSEngine: a business search engine With the emergence of World Wide Web, business' databases are increasingly being queried directly by customers. The customers may not be aware of the underlying data and its structure, and might have never learned a query language that enables them to issue structured queries. Some of the business' employees who query the databases may also not be aware of the structure of the data, but they are likely to be aware of some labels of elements containing data. We propose in this article: (1) an XML Keyword-Based search engine for answering business' customers called BusSEngine-K, and (2) an XML loosely Structured-Based search engine for answering business' employees called BusSEngine-L. The two engines employ novel context-driven search techniques and are built on top of XQuery search engine. The two engines were evaluated experimentally and compared with three recently proposed XML search engines. The results showed marked improvement.

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 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 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

xml search engine
keyword search
keyword query
loosely structured query


Learning to select distinctive landmarks for mobile robot navigation In landmark-based navigation systems for mobile robots, sensory perceptions (e.g., laser or sonar scans) are used to identify the robots current location or to construct internal representations, maps, of the robots environment. Being based on an external frame of reference (which is not subject to incorrigible drift errors such as those occurring in odometry-based systems), landmark-based robot navigation systems are now widely used in mobile robot applications. The problem that has attracted most attention to date in landmark-based navigation research is the question of how to deal with perceptual aliasing, i.e., perceptual ambiguities. In contrast, what constitutes a good landmark, or how to select landmarks for mapping, is still an open research topic. The usual method of landmark selection is to map perceptions at regular intervals, which has the drawback of being inefficient and possibly missing good landmarks that lie between sampling points. In this paper, we present an automatic landmark selection algorithm that allows a mobile robot to select conspicuous landmarks from a continuous stream of sensory perceptions, without any pre-installed knowledge or human intervention during the selection process. This algorithm can be used to make mapping mechanisms more efficient and reliable. Experimental results obtained with two different mobile robots in a range of environments are presented and analysed.

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 B I O O O O O O O O O

landmark-based navigation
kalman filter
automated landmark selection