Discovering associations between news and contents in social network sites with the D-Miner service framework Very often, correlation analysis of behavioral patterns between social network sites and the society suggests that people's behaviors in social network sites are independent from external influences. Recently, some research works have demonstrated that the assumptions are not always true. The work presented in this paper shows an approach to identify the possible associations between social network sites and the society. It utilized the D-Miner service framework in which different social network analysis tools can be plugged-in and used. The framework is supported by multi-agents, which include crawlers for different social network sites, schedulers to dispatch user requests, and analysis engines with different analytical algorithms. Two new agents have been developed for the association identification. A crawler agent is to collect incidents in the society and an association agent is to identify which social media messages are correlated to corresponding incidents. These identified associations can be applied to the evaluation of correlation analysis such as tracing the information propagation between social network sites and the society; and indentifying whether the correlations of behavioral patterns between social network sites and the society have been dominated by those incidents or not. The new agents have been tested with satisfactory results in identifying the number of connections which support the association between social network sites and the society.

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

social media network
text mining
software as a service
cloud architecture
online news


VaccImm: simulating peptide vaccination in cancer therapy Despite progress in conventional cancer therapies, cancer is still one of the leading causes of death in industrial nations. Therefore, an urgent need of progress in fighting cancer remains. A promising alternative to conventional methods is immune therapy. This relies on the fact that low-immunogenic tumours can be eradicated if an immune response against them is induced. Peptide vaccination is carried out by injecting tumour peptides into a patient to trigger a specific immune response against the tumour in its entirety. However, peptide vaccination is a highly complicated treatment and currently many factors like the optimal number of epitopes are not known precisely. Therefore, it is necessary to evaluate how certain parameters influence the therapy.

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

systems biology
immunoinformatics
modelling
proteins
protein interaction


Knowledge acquisition: Past, present and future As we celebrate the 50th knowledge acquisition conference this year it is appropriate to review progress in knowledge acquisition techniques not only over the quarter century since the conference series began but backwards through the millennia to the beginnings of knowledge capture and forwards through the foreseeable future to speculate on reasonable expectations, appropriate targets and potential surprises in the next quarter century. "Time present and time past are both perhaps present in time future, and time future contained in time past. What might have been is an abstraction remaining a perpetual possibility only in world of speculation." (T.S. Eliot, Four Quartets). (C) 2012 Elsevier Ltd. All rights reserved.

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

human evolution
information technology evolution
propagation scholarly errors
information overload
world wide web
semantic web
technological forecasting


Shadow pricing of undesirable outputs in nonparametric analysis We contribute to a methodological debate in the nonparametric literature. Way of modeling undesirables as inputs or outputs, or by transformation functions. We point out a current error in the modeling of weak disposability under VRS. We introduce a new hybrid model with an economically meaningful interpretation. We introduce a Law of One Price rule for shadow prices of undesirable outputs.

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

undesirable outputs
weak disposability
shadow prices


Validation and simulations of a quasi-steady state heat balance model of residential walls This paper discusses the validation of the model presented in a companion paper [1]. A test house was built, instrumented, and monitored. The results suggested that the model predicted reasonable well with a 9.6% difference when cumulative heat flows were compared. Because of the steady state principles used to construct the model, the measured data and model prediction showed a lag of approximately one hour. In all cases, the model underpredicted the peak heat fluxes by an average of 17%. Simulations were run to estimate total heat transfer in walls as a function of wall orientation and insulation level. (C) 1999 Elsevier Science 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

building energy modeling
validation and simulation
space cooling loads


Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations This paper addresses the relaxations in alternative models for disjunctions, big-M and convex hull model, in order to develop guidelines and insights when formulating Mixed-Integer Non-Linear Programming (MINLP), Generalized Disjunctive Programming (GDP), or hybrid models. Characterization and properties are presented for various types of disjunctions. An interesting result is presented for improper disjunctions where results in the continuous space differ from the ones in the mixed-integer space. A cutting plane method is also proposed that avoids the explicit generation of equations and variables of the convex hull. Several examples are presented throughout the paper, as well as a small process synthesis problem, which is solved with the proposed cutting plane method. (C) 2002 Elsevier Science 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 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

discrete-continuous optimization
mixed-integer nonlinear programming
big-m relaxation
convex hull relaxation


Fabrication of multiple large arrays of split ring resonators by X-ray lithographic process for sensing purposes We develop a X-ray lithography based fabrication process. We fabricate multiple large chips of split ring resonators on transparent substrate. The optical response of the structure has been measured by ellipsometry. A detection test of a monolayer of thiols has been performed. The SRR geometry is a promising sensing structure.

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

nanofabrication
x-ray lithography
plasmonics


using rules for creativity in visual composition This article describes a computational system based on rules for generating visual patterns. The rules, usually referred to as shape grammar rules, similar to the rules of an expert system and can take given geometric shapes to produce new shapes. Shape grammar rules can be designed and grouped to emulate styles of visual composition, and different groups of rules, or styles, can be used to simulate different artistic intelligent agents with different styles. The idea is to have a system that, by making use of the shape grammar formalism, can support visual composition synthesis activities, with each intervening agent giving its creative contribution through a style of its own.

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


Multiplicative algorithm for computing D-optimum designs for pVT measurements Multifactor models are present in industry and in biological experiments: therefore optimum designs are a valuable tool for experimenters, leading to estimators of the parameters with minimum variance. A generalization of the Multiplicative algorithm to find locally D-optimum designs for multifactor models as Tait-like equations is here proposed. The method consists of transforming a conceived set of design points over a finite interval into proportions of the design interval defined by the sub-intervals between successive points. Examples for different modifications of the Tait equation are here presented: a three parameter model under isothermal conditions with pressure as the independent variable and two different modifications of an eight parameter model (Rackett equation) with pressure and temperature as design variables. Optimum design for the first example is equally supported at three points while the two-factor modifications of the Tait equation show designs with more support points than unknown parameters and different weights for each point Efficiencies of real experimental designs are computed and suitable more efficient experimental designs, satisfying experimental demands are also proposed. (C) 2011 Elsevier B.V. All rights reserved.

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


A G(1) connection around complicated curve meshes using C-1 NURBS boundary gregory patches A method to design complicated free-form surfaces using a curve mesh is a very effective way to design a shape intuitively. When a user designs a curve mesh, it is important that the user can concentrate on shape modeling without considering the type of curves and the equations of surfaces interpolate an area of the curve mesh. One of the merits of using a NURBS curve is that various shapes such as arcs and free-form curves can be represented by the same equation. Therefore, a user can design curve meshes without taking type of curves and/or special features into consideration. However, it is difficult to interpolate the area of curve meshes with NURBS surfaces smoothly. In this paper, we propose a method to interpolate and connect complicated curve meshes with G(1) continuity by using C-1 continuous NURBS Boundary Gregory patch representation. (C) 2001 Elsevier Science 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 B I I I O O O O O O O O O


a novel method for reducing road traffic congestion using vehicular communication Thanks to the advances in wireless technologies, mobile vehicular networks are likely to become the most relevant form of mobile ad hoc networks (MANET). Vehicular communication which facilitates the exchange of information between vehicles is the prerequisite not only for extending the access to the Internet while on the road, but also to cater for special applications such as of road traffic and travel management. However despite the increasing number of studies on vehicular routing protocols, the support for applications other than the access to the internet remains limited. In this paper we propose a novel vehicular communication system for road congestion detection and avoidance by disseminating and exploiting road information. The system is an integrated solution for sharing congestion information using a simple geocast protocol and dynamic Dijkstra algorithm for planning and computing least congested travel itineraries. In this paper, we show, through simulation results, that the proposed solution not only allows vehicles to detect road congestion ahead of time, but also contributes to reducing the congestion level on the roads by allowing vehicles to avoid congestion points.

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

road traffic congestion
geocast protocol


A large scale, corpus-based approach for automatically disambiguating biomedical abbreviations Abbreviations and acronyms are widely used in the biomedical literature and many of them represent important biomedical concepts. Because many abbreviations are ambiguous (e.g., CAT denotes both chloramphenicol acetyl transferase and computed axial tomography, depending on the context), recognizing the full form associated with each abbreviation is in most cases equivalent to identifying the meaning of the abbreviation. This, in turn, allows us to perform more accurate natural language processing, information extraction, and retrieval. In this study, we have developed supervised approaches to identifying the full forms of ambiguous abbreviations within the context they appear. We first automatically assigned multiple possible full forms for each abbreviation; we then treated the in-context full-form prediction for each specific abbreviation occurrence as a case of word-sense disambiguation. We generated automatically a dictionary of all possible full forms for each abbreviation. We applied supervised machine-learning algorithms for disambiguation. Because some of the links between abbreviations and their corresponding full forms are explicitly given in the text and can be recovered automatically, we can use these explicit links to automatically provide training data for disambiguating the abbreviations that are not linked to a full form within a text. We evaluated our methods on over 150 thousand abstracts and obtain for coverage and precision results of 82% and 92%, respectively, when performed as tenfold cross-validation, and 79% and 80%, respectively, when evaluated against an external set of abstracts in which the abbreviations are not defined.

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

languages
word-sense disambiguation
machine learning
data mining
information retrieval


Over-parameterized variational optical flow A novel optical flow estimation process based on a spatio-temporal model with varying coefficients multiplying a set of basis functions at each pixel is introduced. Previous optical flow estimation methodologies did not use such an over parameterized representation of the flow field as the problem is ill-posed even without introducing any additional parameters: Neighborhood based methods of the Lucas-Kanade type determine the flow at each pixel by constraining the flow to be described by a few parameters in small neighborhoods. Modern variational methods represent the optic flow directly via the flow field components at each pixel. The benefit of over-parametrization becomes evident in the smoothness term, which instead of directly penalizing for changes in the optic flow, accumulates a cost of deviating from the assumed optic flow model. Our proposed method is very general and the classical variational optical flow techniques are special cases of it, when used in conjunction with constant basis functions. Experimental results with the novel flow estimation process yield significant improvements with respect to the best results published so far.

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


experimental evaluation of temporal and energy characteristics of an outdoor sensor network This paper revisits the link quality issue in Wireless Sensor Networks (WSN) by studying the temporal and energy characteristics of a 2, 4Ghz sensor network in an outdoor environment. Using different values of output power and sampling period, we analyze battery behavior in motes placed at different distances and show that farther motes have a shorter battery life. Our experimental results suggest that when deployed in real world deployments, the sampling periods of sensor networks be adjusted according to distance to normalize battery lifetime and a more accurate energy-aware routing protocol be developed.

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


a visual test development environment for gui systems We have implemented an experimental test development environment (TDE) intended to raise the effectiveness of tests produced for GUI systems, and raise the productivity of the GUI system tester.The environment links a test designer, a test design library, and a test generation engine with a standard commercial capture/replay tool. These components provide a human tester the capabilities to capture sequences of interactions with the system under test (SUT), to visually manipulate and modify the sequences, and to create test designs that represent multiple individual test sequences. Test development is done using a high-level model of the SUT's GUI, and graphical representations of test designs. TDE performs certain test maintenance tasks automatically, permitting previously written test scripts to run on a revised version of the SUT.

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

engine
design
human
tool
links
model
development environment
capabilities
systems
test designer
test generation
maintenance
version

developer
standardization
graphics
libraries
replay
component
interaction
product
gui-based system
script
visualization
experimentation
environments
capture/reply
test coverage
testing
visual editor
test maintenance
test scenario
effect
sequence


The effect of health information technology implementation in Veterans Health Administration hospitals on patient outcomes The impact of health information technology (HIT) in hospitals is dependent in large part on how it is used by nurses. This study examines the impact of HIT on the quality of care in hospitals in the Veterans Health Administration (VA), focusing on nurse-sensitive outcomes from 1995 to 2005. Data were obtained from VA databases and original data collection. Fixed-effects Poisson regression was used, with the dependent variables measured using the Agency for Healthcare Research and Quality Inpatient Quality Indicators and Patient Safety Indicators software. Dummy variables indicated when each facility began and completed implementation of each type of HIT. Other explanatory variables included hospital volume, patient characteristics, nurse characteristics, and a quadratic time trend. The start of computerized patient record implementation was associated with significantly lower mortality for two diagnoses but significantly higher pressure ulcer rates, and full implementation was associated with significantly more hospital-acquired infections. The start of bar-code medication administration implementation was linked to significantly lower mortality for one diagnosis, but full implementation was not linked to any change in patient outcomes. The commencement of HIT implementation had mixed effects on patient outcomes, and the completion of implementation had little or no effect on outcomes. This longitudinal study provides little support for the perception of VA staff and leaders that HIT has improved mortality rates or nurse-sensitive patient outcomes. Future research should examine patient outcomes associated with specific care processes affected by HIT.

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

health information technology
hospitals
patient outcomes


Performance analyses of fast frequency hopping spread spectrum and jamming systems As technology becomes increasingly able. to meet the requirements, interest in faster, noncoherent, frequency hopping rates to reduce the jamming of communication has heightened The focus of this paper is on the performance of the fast frequency hopping spread spectrum system operating in the presence of partial band noise jamming. In this paper we consider a communication system that transmits binary data sequence or M frequency shaft keying over a channel. With noncoherent detection, the MFSK tones on a given hop must be separated in frequency by an integer multiple of chip rate to provide orthogonality. The worst case partial-band noise jammer chooses ftaction (rho) to maximize the bit error probability (P-h) for a given M and signal to noise ratio. It has been observed from the simulation results that increases with K illustrating the effectiveness of worst-case jamming (rho(wc)) against FH/MFSK signals at typical operating points. It may be noted that rho(wc) decreases as E-b/N-j gets larger.

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

frequency hopping spread spectrum
partial band noise jamming


Delineation of management zones with soil apparent electrical conductivity to improve nutrient management ? The apparent electrical conductivity (ECa) was measured in excessively drained to imperfect soils. The ECa was a potential estimator of soil properties and nutrients. The ECa measurements successfully delimited two homogeneous soil zones. The ECa maps have the potential to design sampling zones to implement site-specific management.

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

precision agriculture
spatial variability
nutrient concentrations


Fuzzy logic-based induction motor protection system The protection is very important to detect abnormal motor running conditions such as over current, over voltage, overload, over temperature, and so on. When a failure is sensed by the protection system, a time delay should be specified to trip the motor. In the classical systems, motors are stopped with the time delay, which is adjusted constantly without considering the fault level. This paper presents a fuzzy logic-based protection system covering six different fault parameters for induction motors. This paper focuses on a new time-delay calculation for stopping induction motor and improves the overall detection performance. The time delay is computed by fuzzy logic method according to various fault parameters when one of the failures occurs on the motor. This system is successfully tested in real-time faults on the motor, and it shows that it provides sensitive protection by fuzzy rules.

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


Adaptive recurrent cerebellar model articulation controller for linear ultrasonic motor with optimal learning rates In this study, an adaptive recurrent cerebellar model articulation controller (ARCMAC) is investigated for the motion control of linear ultrasonic motor (LUSM). The proposed ARCMAC has superior capability to the conventional cerebellar model articulation controller in efficient learning mechanism and dynamic response. The dynamic gradient descent method is adopted to online adjust the ARCMAC parameters. Moreover, the analytical method based on a Lyapunov function is proposed to determine the learning-rates of ARCMAC so that the stability of the system can be guaranteed. Furthermore, the variable optimal learning-rates are derived to achieve the fastest convergence of tracking error. Finally, the effectiveness of the proposed control system is verified by the experiments of LUSM motion control. Experimental results show that high-precision tracking response can be achieved by using the proposed ARCMAC.

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


TM01 Mode Transducer Using Circular and Rectangular Waveguides This article presents a modal based analysis technique to excite TM01 mode in circular waveguide from a rectangular waveguide propagating the dominant TE10 mode. This mode transducer includes rectangular waveguide to coaxial line transition through a door-knob probe and coaxial to circular waveguide transition. Modal analysis has been carried out considering oversized circular waveguide supporting higher-order modes like TE21. TE01 and TM11 modes apart from the desired mode TM01. Simulated and experimental data are presented. (C) 2010 Wiley Periodicals, Inc Int J RF and Microwave CAE 20 259-263, 2010

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


Comment on "realization of series and parallel R-L and C-D impedances using single differential voltage current conveyor" The comment is related to the recently published paper given in [ 1] dealing with the implementation of series and parallel R-L and C-D impedances using a single differential voltage current conveyor (DVCC). Nevertheless, straightforward analysis of the circuit in Fig. 3(b) of [ 1] and also given in Fig. 1 shows that it has a problem because it makes its input voltage V-in = 0. Therefore, it can not realize parallel (-L) -(-R) simulator as claimed in [ 1]. Alternatively, a circuit given in Fig. 2 for realizing parallel (- L) -(- R) simulator employing a single minus-type DVCC (DVCC-) and a minimum number of passive components is proposed. The introduced circuit employs a grounded capacitor, and requires no critical component matching constraints thus it is suitable for fully integrated circuit technology. If plus-type DVCC (DVCC+) is replaced instead of the DVCC-, this proposed simulator can realize parallel ( L) -( R) simulator.

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


Mining Low-Support Discriminative Patterns from Dense and High-Dimensional Data Discriminative patterns can provide valuable insights into data sets with class labels, that may not be available from the individual features or the predictive models built using them. Most existing approaches work efficiently for sparse or low-dimensional data sets. However, for dense and high-dimensional data sets, they have to use high thresholds to produce the complete results within limited time, and thus, may miss interesting low-support patterns. In this paper, we address the necessity of trading off the completeness of discriminative pattern discovery with the efficient discovery of low-support discriminative patterns from such data sets. We propose a family of antimonotonic measures named SupMaxK that organize the set of discriminative patterns into nested layers of subsets, which are progressively more complete in their coverage, but require increasingly more computation. In particular, the member of SupMaxK with K = 2, named SupMaxPair, is suitable for dense and high-dimensional data sets. Experiments on both synthetic data sets and a cancer gene expression data set demonstrate that there are low-support patterns that can be discovered using SupMaxPair but not by existing approaches. Furthermore, we show that the low-support discriminative patterns that are only discovered using SupMaxPair from the cancer gene expression data set are statistically significant and biologically relevant. This illustrates the complementarity of SupMaxPair to existing approaches for discriminative pattern discovery. The codes and data set for this paper are available at http://vk.cs.umn.edu/SMP/.

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

association analysis
discriminative pattern mining
biomarker discovery
permutation test


Sector modeling for the prediction and evaluation of Cretan olive oil Greece is a major international olive oil producer. Olive oil varieties constitute the major crops for Greek farmers growing certain oriental olive oil varieties. Currently, the olive oil sector in Greece is undergoing substantial changes and the response of farmers and consumers to this will be a vital factor in its success. Throughout the application of the common agriculture policy (CAP), mechanisms, such as production aid, subsidies and marketing orders, were employed to support both producers and consumers. A possible reform of CAP aimed at eliminating or reducing production aid or any kind of subsidies could have a considerable effect on producer and consumer marketing behaviour. In this study a formulated mathematical problem for the olive oil sector on the island of Crete based on the welfare concept and the simulation of the olive oil market equilibrium, subject to specified policy interventions and circumstances was adopted. According to the results obtained, it was concluded that future olive oil policies should not impinge on mechanisms that influence olive oil farmers and consumer behaviour but should emphasize the greater cost effectiveness of production and marketing policies.

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

mathematical programming
common agricultural policy
marketing policy
welfare modeling


discretization of functionally based heterogeneous objects The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for example, finite element analysis (FEA). Such applications impose specific constraints upon the resulting surface and volume meshes in terms of their topology and metric characteristics, exactness of the geometry approximation, and conformity with initial attributes. The function representation of the initial object is converted into the resulting cellular representation described by a simplicial complex. We consider in detail all phases of the discretization algorithm from initial surface polygonization to final tetrahedral mesh generation and its adaptation to special FEA needs. The initial object attributes are used at all steps both for controlling geometry and topology of the resulting object and for calculating new attributes for the resulting cellular representation.

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

cellular representation
attributes
mesh
heterogeneous objects
finite element analysis
function representation

volume modeling
constructive hypervolume


Reality mining: sensing complex social systems We introduce a system for sensing complex social systems with data collected from 100 mobile phones over the course of 9months. We demonstrate the ability to use standard Bluetooth-enabled mobile telephones to measure information access and use in different contexts, recognize social patterns in daily user activity, infer relationships, identify socially significant locations, and model organizational rhythms.

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

bluetooth
wearable computing
user modeling


Optimal s(n) factorial designs when observations within-blocks are correlated In this article. we characterize D-optimal designs for s(n) symmetric factorial experiments when observations within blocks are correlated. The motivation to this problem lies in a pharmaceutical experiment where the experimenter needed to develop a once-daily tablet using a factorial design. These experiments are usually conducted in healthy human volunteers and the bioavailability is estimated. Since each subject is administered more than one formulation, the observations within subjects are correlated. We provide an explicit construction of D-optimal designs for s(n) factorial experiment with blocks of size s or multiples of s, where observations within blocks are correlated. We discuss in detail the construction of optimal designs for 2(n) factorial experiments. We also provide an analytical proof of the D-optimality when there exist a pair of blocks of odd size and remaining blocks are of even size. (C) 2005 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 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

correlated data
optimal design
intraclass correlation


Robust digital motion controllers for mechanical systems This paper describes several methodologies for the design of robust digital motion controllers. While key ideas are given either in the continuous time domain (Laplace domain) or in the discrete time domain, all the methodologies are suited for digital implementation. Application examples will be mentioned.

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

motion control
digital control
robust control
tracking systems


Differential quadrature Trefftz method for irregular plate problems Differential quadrature Trefftz method (DQTM) is developed to deal with plate problems defined in irregular domains. DQTM divides the solution into two parts, a particular solution for inhomogeneous biharmonic equation and the general solution for homogeneous biharmonic equation. For the former, differential quadrature method based on the interpolation of the highest derivative (DQIHD) is involved. For the latter, polynomial basis functions are adopted instead of fundamental solutions. We will show that DQTM not only keeps the advantages of traditional differential quadrature method (DQM), high efficiency and accuracy, but also has no difficulties to deal with geometrically irregular domains.

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

dqtm
dqihd
polynomial basis functions
particular solution
general solution


Grammar resources for modelling dialogue dynamically This paper argues that by analysing language as a mechanism for growth of information (Cann etal. in The Dynamics of Language, Elsevier, Oxford, 2005; Kempson etal. in Dynamic Syntax, Blackwell, Oxford, 2001), not only does a unitary basis for ellipsis become possible, otherwise thought to be irredeemably heterogeneous, but also a whole range of sub-types of ellipsis, otherwise thought to be unique to dialogue, emerge as natural consequences of use of language in context. Dialogue fragment types modelled include reformulations, clarification requests, extensions, and acknowledgements. Buttressing this analysis, we show how incremental use of fragments serves to progressively narrow down the otherwise mushrooming interpretational alternatives in language use, and hence is central to fluent conversational interaction. We conclude that, by its ability to reflect dialogue dynamics as a core phenomenon of language use, a grammar with inbuilt parsing dynamics opens up the potential for analysing language as a mechanism for communicative interaction.

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

natural language processing
incrementality
semantics
pragmatics
dialogue modelling


Addendum to On the consistency of MPS [Comput. Phys. Comm. 184 (3) (2013) 732745] The analogies between the Moving Particle Semi-implicit method (MPS) and Incompressible Smoothed Particle Hydrodynamics method (ISPH) are established in this note, as an extension of the MPS consistency analysis conducted in Souto-Iglesias etal. (2013).

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

mps
isph
smoothed particle hydrodynamics

sph
moving particle semi-implicit
incompressible sph
projection methods


Proactive defense mechanism against IP spoofing traffic on a NEMO environment The boundary of a distributed denial of service (DDoS) attack, one of the most threatening attacks in a wired network, now extends to wireless mobile networks, following the appearance of a DDoS attack tool targeted at mobile phones. However, the existing defense mechanisms against such attacks in a wired network are not effective in a wireless mobile network, because of differences in their characteristics such as the mobile possibility of attack agents. In this paper, we propose a proactive defense mechanism against IP spoofing traffic for mobile networks. IP spoofing is one of the features of a DDoS attack against which it is most difficult to defend. Among the various mobile networks, we focus on the Network Mobility standard that is being established by the NEMO Working Group in the IETF. Our defense consists of following five processes: speedy detection, filtering of attack packets, identification of attack agents. isolation of attack agents, and notification to neighboring routers. We simulated and analyzed the effects on normal traffic of moving attack agents. and the results of applying our defense to a mobile network. Our simulation results show that our mechanism provides a robust defense.

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

mobile network
ip spoofing traffic
defense mechanism


Development of a new predictive modelling technique to find with confidence equivalence zone and design space of chromatographic analytical methods A new method for modelling chromatographic responses is presented as a critical piece for the achievement of automated development of analytical methods. This methodology is based on four parts. First, we propose to use a very little set of statistical equations to create predictive models for retention time-based responses as the apex, the width and the asymmetry of peaks. Second, an experimental design is set up to realize experiments. Third, using grid search over the domain, multi-criteria decision is taken with respect to different local or global optimization criteria, used as desirability functions. This allows finding an optimal chromatogram. Fourth, we advice to investigate how the predictive error of the models propagates around optimal solution. This allows to give confidence in the optimal solution, in finding a set of zones that presumably will give an acceptable solution. Design spaces can be derived with a similar technique. The approach is exemplified with a real case and predictions of models at optimal analytical conditions are validated through new experiments. Flexibility is left over all the presented methodology. (C) 2007 Elsevier B.V. All rights reserved.

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

hplc
chromatography
design of experiments
multi-criteria optimization
statistical models
error propagation


The top-cited research works in the Science Citation Index Expanded This study aimed to identify and analyze the characteristics of the top-cited articles published in the Science Citation Index Expanded from 1991 to 2010. Articles that have been cited more than 1,000 times since publication to 2010 were assessed regarding their distribution in indexed journals and categories of the Web of Science. Five bibliometric indicators were used to evaluate source institutions and countries. A new indicator, the Y-index, is proposed to assess publication quantity and the character of contribution to articles. We identify 3,652 top-cited articles with 71% originating from US. The fourteen most productive institutions were all located in US. Science, Nature, New England Journal of Medicine, and Cell hosted the most cited publications. In addition, the Y-index was successfully applied to evaluate the publication character of authors, institutions, and countries.

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

sci-expanded
most cited publication
y-index


Design procedure for two-stage CMOS transconductance operational amplifiers: A tutorial This paper deals with well-defined design criteria for two-stage CMOS transconductance operational amplifiers. A novel and simple design procedure is presented, which allows electrical parameters to be univocally related to the value of each circuit element and biasing value. Unlike previous methods, the proposed one is suited for a pencil-and-paper design and yields accurate performance optimization without introducing unnecessary circuit constraints. Bandwidth optimization strategies are also discussed. SPICE simulations based on the proposed procedures are given which closely agree the expected results.

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

otas
analog design
frequency compensation


PAC analogues of perceptron and winnow via boosting the margin We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit sample complexity bounds remarkably similar to those of known online algorithms such as Perceptron and Winnow, thus suggesting that these well-studied online algorithms in some sense correspond to instances of boosting. We show that the new algorithms can be viewed as natural PAC analogues of the online p-norm algorithms which have recently been studied by Grove, Littlestone, and Schuurmans (1997, Proceedings of the Tenth Annual Conference on Computational Learning Theory (pp. 171-183) and Gentile and Littlestone (1999, Proceedings of the Twelfth Annual Conference on Computational Learning Theory (pp. 1-11). As special cases of the algorithm, by taking p = 2 and p = infinity we obtain natural boosting-based PAC analogues of Perceptron and Winnow respectively. The p = infinity case of our algorithm can also be viewed as a generalization (with an improved sample complexity bound) of Jackson and Craven's PAC-model boosting-based algorithm for learning "sparse perceptrons" (Jackson & Craven, 1996, Advances in neural information processing systems 8, MIT Press). The analysis of the generalization error of the new algorithms relies on techniques from the theory of large margin classification.

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


A kind of approximations of generalized rough set model In this paper, we investigate the approximation problem of generalized rough set model. In generalized rough sets, the binary relation on one universe is always unknown and needed to be induced by the other already-known relation. In order to evaluate the induced binary relation, we propose a pair of generalized approximations called generalized lower and upper approximations by which the induced binary relation and the already-known binary relation can be connected. We also assert that the pair of generalized approximations are related to the definitions of approximations of classical rough sets. Their algebraic properties and topology structures are first studied. More important, we both give some comparisons of the relations in the same generalized rough set model and the approximations among different generalized rough set models. In the end, some applications of the proposed approximations in covering based rough sets are presented.

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

generalized rough set
generalized approximation


Matching of medical images by self-organizing neural networks A general approach to the problem of image matching which exploits a multi-scale representation of local image structure and the principles of self-organizing neural networks is introduced. The problem considered is relevant in many imaging applications and has been largely investigated in medical imagery, especially as regards the integration of different imaging procedures. A given pair of images to be matched, named target and stimulus respectively, are represented by Gabor Wavelets. Correspondence is computed by exploiting the learning procedure of a neural network derived from Kohonen's SOM. The SOM units coincide with the pixels of the target image and their weight are pointers to those of the stimulus images. The standard SOM rule is modified so as to account for image features. The properties of our method are tested by experiments performed on synthetic images. The considered implementation has shown that is able to recover a wide range of transformations including global affine transformations and local distortions. Tests in the presence of additive noise indicate considerable robustness against statistical variability. Applications to clinical images are presented. (C) 2003 Elsevier B.V. All rights reserved.

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


Ontology-based semantic matchmaking approach As a greater number of Web Services are made available, support for service discovery mechanisms become essential. Services can have quite different Quality of Service characteristics (such as their response time when given a particular set of data). A service requestor therefore requires more sophisticated approaches to find a service that meets a particular behavior, because supporting matching between a service request and properties is not straightforward. Matchmaking plays a vital role in this discovery process. We propose a novel matchmaking algorithm to effectively compute the semantic distance of concepts in an ontology. It is based on description logic formalization and reasoning, extends simple subsumption matching found in other approaches and allows match ranking. We have implemented the proposed approach and used the developed prototype in the context of service discovery in the visualization domain.

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


A medical cost estimation with fuzzy neural network of acute hepatitis patients in emergency room FNN is employed to develop the cost forecasting model for acute hepatitis patients in emergency room. The FNN model can provide more accurate forecast than SVR and ANN. Unlike SVR and ANN, FNN can also provide fuzzy IFTHEN rules for interpretation.

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


Computation of three stochastic modifications of Stokes's formula for regional geoid determination ? In the regional geoid studies, the modified Stokes formula is often used nowadays. This method combines local terrestrial data with an appropriate global geopotential model in a truncated form of Stokes's integral. This paper is devoted to three stochastic least-squares (LS) modifications, which were originally proposed by Sjberg (Least squares modification of Stokes and VeningMeinesz formulas by accounting for errors of truncation, potential coefficients and gravity data. Report No. 27, Department of Geodesy, University of Uppsala, 16pp.) in 1984 (with later developments). The main principles of the LS modifications and some spectral models of the gravity field characteristics are reviewed. Certain difficulties may be encountered when computing the modification parameters from a system of linear equations. In particular, the design matrices of the unbiased and optimum LS modifications suffer from numerical ill-conditioning. Two mathematical regularization strategies are selected in order to find a practical solution for the sought modification parameters. Typical numerical outcome of the regularization and the applicability of the obtained LS parameters are discussed. The present contribution tackles the LS modification-related problems in the context of a specially designed Matlab software package. The core quantities of the stochastic LS modifications can be computed by this software, which is made available on the Computers & Geosciences server.

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

gravimetric geoid
least-squares parameter estimation
singular value decomposition


Integrated optimal reliable design, production, and maintenance planning for multipurpose process plants In multipurpose process plants, which are characterized by sharing different resources (equipment, manpower etc.) for production, unplanned equipment shutdown could affect the timely production of products and hence process profitability. Many approaches have been proposed to ensure high equipment availability by combining design, production, and scheduling frameworks with a maintenance optimization framework. In these approaches, the initial reliability characteristics of equipment, which also determine equipment availability, are considered fixed by problem definition. In this work, a combined design, production and maintenance planning formulation for multipurpose process plants is extended to incorporate the reliability allocation problem at the design stage. A simultaneous optimization framework is presented that addresses the problem of optimal allocation of reliability among equipment simultaneously with the selection of process configuration, production and maintenance planning for multipurpose process plants at the design stage. This framework provides the designer with the opportunity to select the initial reliability of equipment at the design stage by balancing the associated costs with its impact on the design and the availability in the operational stage. The overall problem is formulated as a mixed integer linear programming (MILP) model, and its applicability is demonstrated using a number of examples. (C) 2003 Elsevier Science 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 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 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 B O O O O O O O O O O O O O O O O O O O

reliability allocation
maintenance optimization
milp


Dangerous and Cancer-Causing Properties of Products and Chemicals in the Oil Refining and Petrochemical Industries. Part XXX Benzene and benzene-containing products and solvents have long been associated with bone marrow toxicity. Both animal studies and human epidemiological studies have shown statistically significant increases of leukemia and other lymphohematopoietic cancers in workers exposed to benzene. The most common leukemia that has been associated with benzene exposure, also called benzene poisoning, is acute myelocytic leukemia (AML). A review of the epidemiological literature on workers exposed to benzene or benzene-containing solvents and products shows, without question, that this exposure is significantly related to other types of leukemia and lymphoma. In this article, we review the literature on the relationship between benzene exposure and chronic myelogenous leukemia (CML) and find that benzene and benzene-containing products are significantly related to morbidity and mortality from CML

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


Extending cubic uniform B-splines by unified trigonometric and hyperbolic basis In this paper, the trigonometric basis {sin t, cos t, t, 1} and the hyperbolic basis {sinh t, cosh t, t, 1} are unified by a shape parameter C (0 less than or equal to C < infinity). It yields the Functional B-splines (FB-splines) and its corresponding Subdivision B-splines (SB-splines). As well, a geometric proof of curvature continuity for SB-splines is provided. FB-splines and SB-splines inherited nearly all properties of B-splines, including the C continuity, and can represent elliptic and hyperbolic arcs exactly. They are adjustable, and each control point b(i) can have its unique shape parameter C-i. As C-i increases from 0 to proportional to, the corresponding breakpoint of bi on the curve is moved to the location of b(i), and the curvature of this breakpoint is increased from 0 to proportional to too. For a set of control points and their shape parameters, SB-spline and FB-spline have the same position, tangent, and curvature on each breakpoint. If two adjacent control points in the set have identical parameters, their SB-spline and FB-spline segments overlap. However, in general cases, FB-splines have no simple subdivision equation, and SB-splines have no common evaluation function. Furthermore, FB-splines and SB-splines can generate shape adjustable surfaces. They can represent the quadric surfaces precisely for engineering applications. However, the exact proof of C-2 continuity for the general SB-spline surfaces has not been obtained yet. (C) 2004 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 b-splines
subdivision b-splines
cb-splines
b-splines
tensor product surfaces
subdivision surfaces
surface modeling
cagd
cad/cam


Comparison of two designs for the multifunction vehicle bus In this paper, two designs for the decoder of the multifunction vehicle bus (MVB) are compared. The first one follows a bottom-up methodology and the second one has been created in a top-down style. Although this latter methodology is more systematic and easy to automate, it results in a lower performance. In the case of the MVB decoder, the ratio of bottom-up performance to the top-down one ranges from 1.90 to 4.12, depending on the synthesis tool and the device. Selecting as reference the tool and field-programmable gate array (FPGA) that use the fewest logical elements, the bottom-up design can work 2.3 times faster than the top-down one, after two and three iterations for the physical implementation, respectively. In both cases, the circuit has been synthesized on a Virtex-E XCV3200E of Xilinx by Xilinx Synthesis Tool (XST), so that there has been no shortage of physical resources. Therefore, for a particular pair of synthesis too] and device, the final implementation is determined by the design style and not by a hard placement and routing in a hostile fabric. After synthesis, the top-down design was 23.37% larger than the bottom-up design, so the results are not as poor as expected from a nonstructured design; however, this percentage, which is always positive, depends very strongly upon the particular synthesis tool and FPGA. In addition, both descriptions have been completely implemented in a similar CPU time (even the top-down one slightly more quickly, at the first attempt). So the top-down design style is a good candidate to produce circuits in a short time to market (in this case 28% lower), although synthesis tools must be improved in order to increase the performance.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 methodology
logic design
rail transportation electronics
train communication network (tcn)


All digital skew tolerant synchronous interfacing methods for high-performance point-to-point communications in deep sub-micron SoCs High-performance clocking of intellectual property (IP) modules, within a skew budget, is becoming difficult in deep sub-micron technologies. In this work, we propose a novel and all-digital synchronous design method for point-to-point communications, using two stages of interfacing registers and locally delayed clock with phase adjustments. This design is free from synchronizers and clock-data mismatch problems. Moreover, communicating modules run at frequencies which are virtually independent of the clock skew. We also provide a comprehensive case-wise mathematical analysis to facilitate design automation for synthesizing such designs as standard cells. An overall improvement in skew tolerance of up to n times (where n is the number of registers used), when compared to conventional designs, is achieved when the skew orientation is known and n/2 times if the skew orientation is unknown. Improvement in skew tolerance is validated using gate level simulations with the 0.18?m TSMC CMOS technology. A prototype implementation of the proposed design using a Virtex-II Pro FPGA from Xilinx validates the claim that such designs allow a fast module to communicate with a slow module without constraining their frequencies.

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

soc
multiple clock domains
gals
inter-module communications


Recalling temporal sequences of patterns using neurons with hysteretic property Further development of a network based on the Inverse Function Delayed (I D) model which can recall temporal sequences of patterns, is proposed. Additional advantage is taken of the negative resistance region of the ID model and its hysteretic properties by widening the negative resistance region and letting the output of the ID neuron be almost instant. Calling this neuron limit ID neuron, a model with limit ID neurons connected pairwise with conventional neurons enlarges the storage capacity and increases it even further by using a weightmatrix that is calculated to guarantee the storage after transforming the sequence of patterns into a linear separation problem. The network's tolerance, or the model's ability to recall a sequence, starting in a pattern with initial distortion is also investigated and by choosing a suitable value for the output delay of the conventional neuron, the distortion is gradually reduced and finally vanishes.

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

temporal sequences of patterns
negative resistance


BIOMODULE: a Java program to help model and interpret the stratigraphic record ? A combination of a stratigraphic simulation package (STRATA) and an evolutionary-ecological model (BIOSTRAT) can be used to simulate the distribution of species within a sequence stratigraphic framework. BIOMODULE is an extension of this model approach in that it facilitates the visualization and interpretation of those simulations and their input data. Environmental factors (e.g., sea-level changes or sedimentation rates) and ecological factors (preferred water depth, depth tolerance, abundance) that determine the spatial and temporal distribution of species are easily and quickly investigated. In addition, BIOMODULE can be used to compile the stratigraphic first and last appearances of those species and export them into available graphic correlation software packages (Conop9 and GraphCor). This can be used to test the graphic correlation technique and investigate its accuracy and precision under a range of different conditions (e.g., different stratigraphic architectures and sampling densities) since the true correlation of the different sections is already known.

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

biostratigraphy
stratigraphy
computer simulation


A metasynthetic approach for segmenting handwritten Chinese character strings In this paper, a metasynthetic method is proposed to segment handwritten Chinese character strings. The Viterbi algorithm is firstly applied to search segmentation paths and several rules are used to remove redundant paths. Then a background-thinning method is further adopted to obtain non-linear segmentation paths. If there are not touching characters, a dynamic programming algorithm is applied to merge components. For touching characters, we apply background and foreground information to obtain candidate segmentation paths and the feature vectors are constructed in terms of peripheral features. Then the mixture probabilistic density function whose parameters are obtained by the EM algorithm is used to choose the best segmentation path. Experimental results demonstrate that the proposed scheme effectively segments handwritten Chinese characters and achieves an improvement over previous methods.

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

chinese characters
viterbi algorithm
dynamic programming
touching characters

off-line handwritten
thinning
mixture density function


Image classification using boosted local features with random orientation and location selection We propose an image classification method using boosted randomly selected local features. We jointly consider local feature extraction, codebook generation and classifier training. The proposed method trains a series of classifiers using the boosting strategy. Experimental results demonstrate effectiveness and efficiency of the proposed method.

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

image classification
random orientation
boosting


deadlock removal using partial rollback in database systems The problem of removing deadlocks from concurrent database systems using the two-phase locking protocol is considered. In particular, for systems which use no a priori information about transaction behavior in order to avoid deadlocks, it has generally been assumed necessary to totally remove and restart some transaction involved in a deadlock in order to relieve the situation. In this paper, a new approach to deadlock removal in such systems based on partial rollbacks is introduced. This approach does not in general require the total removal of a transaction to eliminate a deadlock. The task of optimizing deadlock removal using this method is discussed for systems allowing both exclusive and shared locking. A method is given for implementing this approach with no more storage overhead than that required for total removal and restart.

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

deadlock task order method use systems behavior storage general paper transaction locking

sharing
situated
optimality
database system
concurrency
informal


Experimental design for regression analysis when the responses are subject to censoring Experimental design issues are investigated for regression models with possibly censored responses, arising typically from pharmacokinetic or virus dynamic experiments. Examples are provided for both locally and Bayesian optimal designs. A case study in pharmacokinetics is provided.

O O O O O O O O O O O O O O O O O O O O O O O O O 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 design
ds-optimality
nonlinear regression
tobit model


ai techniques for modelling legal negotiation Negotiation is a process of cooperative decision-making between parties concerning the resolution of a common dispute. The goal of negotiation is to develop a settlement that is acceptable to both parties. One way to achieve this is to ensure disputants take responsibility for their outcomes and control the disputation process. Most current systems have chosen to model the negotiation process by representing progress made within a negotiation. In this paper we focus on modelling the trade-offs and compromises to made by parties to a legal dispute. A system we have built to model disputes in Australian Family Law uses fuzzy networks, numerical allocation procedures and decomposition hierarchies.

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

negotiation support system
bidirectional fuzzy cognitive maps


Bringing PageRank to the citation analysis The paper attempts to provide an alternative method for measuring the importance of scientific papers based on the Googles PageRank. The method is a meaningful extension of the common integer counting of citations and is then experimented for bringing PageRank to the citation analysis in a large citation network. It offers a more integrated picture of the publications influence in a specific field. We firstly calculate the PageRanks of scientific papers. The distributional characteristics and comparison with the traditionally used number of citations are then analyzed in detail. Furthermore, the PageRank is implemented in the evaluation of research influence for several countries in the field of Biochemistry and Molecular Biology during the time period of 20002005. Finally, some advantages of bringing PageRank to the citation analysis are concluded.

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

citation analysis
citation network
pagerank


a method for describing information required by the database design process Current research in the area of database design has been directed towards the development of structured or automated database design techniques. The first phase of the database design process, information requirements specification and analysis, is unfortunately ignored. The lack of concern for whether or not the input to the design techniques can be collected in the real world and for wheather or not the input is an adequate and complete representation can only result in an inadequate and possible useless database design.Most database models and design techniques utilize only process-oriented information. Other techniques utilize non process-oriented information whose foundation may not be clearly identifiable. The use of only process-oriented information may result in a narrowly defined unimaginative database design which may be unresponsive to the changing needs of the organization. To overcome the shortcomings of this traditional approach, it is necessary to complement it with an additional approach.This can be accomplished in three steps. First, the description and use of the information required for the database design process must be clearly stated. Second, two independent perspectives for viewing the required information must be considered: the information structure perspective and the usage perspective. The information perspective depicts the natural characteristics of data, inherent groupings and relationships. This perspective is not bound to existing or future applications; hence it is a more general and flexible view of information than one which is process oriented. The usage perspective describes how data items are utilized by the system in order to accomplish its processing requirements. Third, a vehicle for aiding the specification itegration of these two independent perspectives must be considered.

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

requirements
design techniques
organization
order
research
relationships
use
method
structure
database design
input
analysis
data
process
general
representation
future
database

systems
developer
requirements specification
direct
flexibility
model
informal
automation
completeness


Scalability of optical networks: Crosstalk limitations Optical networks represent a promising solution for the future high capacity and flexible transport network. This paper presents a model for the performance evaluation of optical networks with respect to linear crosstalk and accumulated spontaneous emission noise. The proposed model is intended for the evaluation of the crosstalk requirements on the devices needed to support an optical network with a certain number of nodes and with a given level of bit-error rate.

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

wavelength division multiplexing networks


Calibration of real scenes for the reconstruction of dynamic light fields The classic light field and lumigraph are two well-known approaches to image-based rendering, and subsequently many new rendering techniques and representations have been proposed based on them. Nevertheless the main limitation remains that in almost all of them only static scenes are considered. In this contribution we describe a method for calibrating a scene which includes moving or deforming objects from multiple image sequences taken with a hand-held camera. For each image sequence the scene is assumed to be static, which allows the reconstruction of a conventional static light field. The dynamic light field is thus composed of multiple static light fields, each of which describes the state of the scene at a certain point in time. This allows not only the modeling of rigid moving objects, but any kind of motion including deformations. In order to facilitate the automatic calibration, some assumptions are made for the scene and input data, such as that the image sequences for each respective time step share one common camera pose and that only the minor part of the scene is actually in motion.

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

camera calibration
structure from motion
image-based rendering


Wavelet domain residual redundancy-based descriptions This paper presents a new multiple description (MD) method for wavelet transform (WT) coded images. This method combines partitioning with concealment to produce descriptions. An optimal concealment method for wavelet transform coded images for a given partitioning is derived based on the statistical characteristics in wavelet domain. Concealment in LL subband is treated differently and is based on its smoothness property. An optimal partitioning method is derived corresponding to the concealment. We have designed a coder for wireless image transmission which emphasizes the need for source and channel coding interaction based on residual redundancy. Optimal channel rate allocation is derived depending upon source significance and channel status information. The method is computationally inexpensive and does not sacrifice compression efficiency. Simulations for wireless image transmission have shown promising results.

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

wavelet transform
multiple description
concealment
partitioning


Image decomposition using adaptive second-order total generalized variation This paper proposes a new model for image decomposition which separates an image into a cartoon, consisting only of geometric objects, and an oscillatory component, consisting of textures or noise. The proposed model is given in a variational formulation with adaptive second-order total generalized variation (TGV). The adaptive behavior preserves the key features such as object boundaries and textures while avoiding staircasing effect. To speed up the computation, the split Bregman method is used to solve the proposed model. Experimental results and comparisons demonstrate the proposed model is more effective for image decomposition than the methods of the state-of-the-art image decomposition models.

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

image decomposition
cartoon
tgv
split bregman
staircasing effect


Classification of edge-transitive rose window graphs Given natural numbers n?3 and 1?a, r?n?1, the rose window graph Rn(a, r) is a quartic graph with vertex set and edge set . In this article a complete classification of edge-transitive rose window graphs is given, thus solving one of the three open problems about these graphs posed by Steve Wilson in 2001. 2010 Wiley Periodicals, Inc. J Graph Theory 65: 216231, 2010

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

group vertex-transitive edge-transitive arc-transitive


Increment formulations for rounding error reduction in the numerical solution of structured differential systems Strategies for reducing the effect of cumulative rounding errors in geometric numerical integration are outlined. The focus is, in particular, on the solution of separable Hamiltonian systems using explicit symplectic integration methods and on solving orthogonal matrix differential systems using projection. Examples are given that demonstrate the advantages of an increment formulation over the standard implementation of conventional integrators. We describe how the aforementioned special purpose integration methods have been set up in a uniform, modular and extensible framework being developed in the problem solving environment Mathematica. (C) 2002 Elsevier Science 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 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

separable hamiltonian differential equations


Orthogonal distance fitting of implicit curves and surfaces Dimensional model fitting finds its applications in various fields of science and engineering and is a relevant subject in computer/machine vision and coordinate metrology. In this paper, we present two new fitting algorithms, distance-based and coordinate-based algorithm, for implicit surfaces and plane curves, which minimize the square sum of the orthogonal error distances between the model feature and the given data points. Each of the two algorithms has its own advantages and is to be purposefully applied to a specific fitting task, considering the implementation and memory space cost, and possibilities of observation weighting. By the new algorithms, the model feature parameters are grouped and simultaneously estimated in terms of form, position, and rotation parameters. The form parameters determine the shape of the model feature and the position/rotation parameters describe the rigid body motion of the model feature. The proposed algorithms are applicable to any kind of implicit surface and plane curve. In this paper, we also describe algorithm implementation and show various examples of orthogonal distance fit.

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

implicit surface
orthogonal distance fitting

implicit curve
curve fitting
surface fitting
geometric distance
orthogonal contacting
nonlinear least squares
parameter estimation
gauss-newton method
parameter constraint
parametric model recovery
object segmentation
object classification
object reconstruction


the performance and energy consumption of three embedded real-time operating systems This paper presents the modeling of embedded systems with SimBed, an execution-driven simulation testbed that measures the execution behavior and power consumption of embedded applications and RTOSs by executing them on an accurate architectural model of a microcontroller with simulated real-time stimuli. We briefly describe the simulation environment and present a study that compares three RTOSs: &mgr;C/OS-II, a popular public-domain embedded real-time operating system; Echidna, a sophisticated, industrial-strength (commercial) RTOS; and NOS, a bare-bones multi-rate task scheduler reminiscent of typical "roll-your-own" RTOSs found in many commercial embedded systems. The microcontroller simulated in this study is the Motorola M-CORE processor: a low-power, 32-bit CPU core with 16-bit instructions, running at 20MHz.

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

task
applications
simulation
performance
model
paper
processor
power consumption
energy consumption
behavior
operating system
testbed
core
microcontroller
embedded systems

measurement
scheduling
real-time
environments
public
industrial
architecture
instruction
low power
operability
embedding


RBFs approximation method for Kawahara equation In this paper, we apply radial basis function (RBF) method for the numerical solution of Kawahara equation. Derivatives of interpolation are used to approximate the spatial derivatives and the temporal derivative approximated by a low order forward difference scheme. Computational experiments are performed for single soliton, two solitons, and three solitons interaction to examine accuracy of the method. The results obtained by the present method are in good agreement with exact solutions and some earlier work in literature. Accuracy of the method is estimated in terms of the error norms L2, L? L ? , the three invariants, number of nodes in the domain of influence, time step size, parameter dependent, and parameter independent RBFs.

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

rbfs
kawahara equation
single soliton
solitons interaction


Normal people working in normal organizations with normal equipment: System safety and cognition in a mid-air collision A fundamental challenge in improving the safety of complex systems is to understand how accidents emerge in normal working situations, with equipment functioning normally in normally structured organizations. We present a field study of the en route mid-air collision between a commercial carrier and an executive jet, in the clear afternoon Amazon sky in which 154 people lost their lives, that illustrates one response to this challenge. Our focus was on how and why the several safety barriers of a well structured air traffic system melted down enabling the occurrence of this tragedy, without any catastrophic component failure, and in a situation where everything was functioning normally. We identify strong consistencies and feedbacks regarding factors of system day-to-day functioning that made monitoring and awareness difficult, and the cognitive strategies that operators have developed to deal with overall system behavior. These findings emphasize the active problem-solving behavior needed in air traffic control work, and highlight how the day-to-day functioning of the system can jeopardize such behavior. An immediate consequence is that safety managers and engineers should review their traditional safety approach and accident models based on equipment failure probability, linear combinations of failures, rules and procedures, and human errors, to deal with complex patterns of coincidence possibilities, unexpected links, resonance among system functions and activities, and system cognition.

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

mid-air collision
air traffic management system


Low-complexity distributed multi-view video coding for wireless video sensor networks based on compressive sensing theory ? Sparsity is an attractive feature of images. Images can be efficiently represented using a few significant coefficients and sparse reconstructed from a small set of random linear measurements by utilizing the sparse feature in compressive sensing theory. Storage and transmission of multi-view video sequences involve large volumes of redundant data. These data can be efficiently compressed with techniques which encode the signals independently and decode them jointly. By integrating the respective characteristics of compressive sensing and distributed source coding, we propose a novel multi-view video coding approach for use in resource limited devices such as wireless video sensor networks. The proposed approach can explore the sparsity of video images, allow for low complexity encoder and the exploitation of inter-camera correlation without communications among cameras. Simulation results show the proposed framework outperforms the baseline compressive sensing-based scheme of intra frame coding by 35dB. Compared with conventional H.264 or DVC scheme, the proposed frameworks simple while the quality of reconstructed image and compressibility are kept.

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

sparsity
compressive sensing
wireless video sensor networks
distributed source coding


Lightweight Distance Bounding Protocol against Relay Attacks Traditional authentication protocols are based on cryptographic techniques to achieve identity verification. Distance bounding protocols are an enhanced type of authentication protocol built upon both signal traversal time measurement and cryptographic techniques to accomplish distance verification as well as identity verification. A distance bounding protocol is usually designed to defend against the relay attack and the distance fraud attack. As there are applications to which the distance fraud attack is not a serious threat, we propose a streamlined distance bounding protocol that focuses on the relay attack. The proposed protocol is more efficient than previous protocols and has a low false acceptance rate under the relay attack.

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

authentication
relay attack
distance bounding protocol


a different kind of information appliance: fridge companion A prototype device is described that allows a user to understand and contemplate the inner workings of a common home applicance, the refrigerator. The device monitors select physical properties of its host and displays scheduled graphic presentations on the host's principles of operation. Fridge Companion is a device designed to make domestic life not easier but deeper.

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

information utilization
time and duration
contemplation
domain specific design
context-aware computing
information appliances


Incorporation of fuzzy spatial relation in temporal mammogram registration This paper presents a method for incorporating fuzzy sets based spatial relations in registering temporal mammogram pairs. In the proposed method, four spatial relations, to the right of, to the left of, below, and above , are considered. The histogram of all possible angles between all pairs of points in a pair of regions of interest (ROIs) is treated as a fuzzy set and spatial relations between the pair of ROIs are characterized by measuring to what degree this fuzzy set approaches the four spatial relations. Based on the spatial relations, association of ROIs of temporal mammogram pairs is then treated as a graph matching problem and registration of temporal mammogram pairs is realized by finding the common subgraph between two graphs representing a pair of temporal mammograms. 95 pairs of real temporal mammograms are used to test the proposed method. 70.8% of matched ROI pairs are visually identified as good matches. When the registration results are incorporated in a cancer detection scheme, the Az A z score (area under the ROC curve) is improved from 0.846 to 0.852. The results demonstrated that registration of temporal mammograms based on fuzzy spatial relations improves the overall detection efficiency.

O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 spatial relation
temporal mammogram registration


Improving Head Movement Tolerance of Cross-Ratio Based Eye Trackers When first introduced, the cross-ratio (CR) based remote eye tracking method offered many attractive features for natural human gaze-based interaction, such as simple camera setup, no user calibration, and invariance to head motion. However, due to many simplification assumptions, current CR-based methods are still sensitive to head movements. In this paper, we revisit the CR-based method and introduce two new extensions to improve the robustness of the method to head motion. The first method dynamically compensates for scale changes in the corneal reflection pattern, and the second method estimates true coplanar eye features so that the cross-ratio can be applied. We present real-time implementations of both systems, and compare the performance of these new methods using simulations and user experiments. Our results show a significant improvement in robustness to head motion and, for the user experiments in particular, an average reduction of up to 40% in gaze estimation error was observed.

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

gaze tracking
remote eye gaze tracking
free-head motion
cross-ratio
homography


Sedimentationconsolidation of a double porosity material This paper studies the sedimentationconsolidation of a double porosity material, such as lumpy clay. Large displacements and finite strains are accounted for in a multidimensional setting. Fundamental equations are derived using a phenomenological approach and non-equilibrium thermodynamics, as set out by Coussy [Coussy, Poromechanics, Wiley, Chichester, 2004]. These equations particularise to three non-linear partial differential equations in one dimensional context. Numerical implementation in a finite element code is currently being undertaken.

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

sedimentation
consolidation
porous media


Combination multiple focal planes and PSM for sub 120 nm node with KrF lithography: study of the proximity effects In optical lithography, the use of multiple focal planes with different energy and focus improves the photolithography performances like the Depth of Focus (DOF) and the Energy Latitude (EL). We have chosen to use a symmetrical double exposure (symmetrical in focus) with equal energy, an attenuated (6%) phase shift mask and the standard KrF photolithography process in the study of 180 nm holes. The ASM 5500/700 and /900 steppers make this double exposure possible. The study of the process window versus the distance between the two focal planes (?F) shows that the multiple focal planes technique generates proximity effects namely increases the difference between dense holes Critical Dimension (CD) and isolated one for the same parameters (energy, focus and ?F). We study the evolution of these proximity effects for KrF lithography and propose solutions to minimise them.

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

krf
psm
symmetrical double exposure
proximity effects