On tractable cases of Target Set Selection We study the NP-hard Target Set Selection (TSS) problem occurring in social network analysis. Roughly speaking, given a graph where each vertex is associated with a threshold, in TSS the task is to select a minimum-size target set such that all vertices of the graph get activated. Activation is a dynamic process. First, only the vertices in the target set are active. Then, a vertex becomes active if the number of its active neighbors exceeds its threshold, and so on. TSS models the spread of information, infections, and influence in networks. Complementing results on its polynomial-time approximability and extending results for its restriction to trees and bounded treewidth graphs, we classify the influence of the parameters diameter, cluster editing number, vertex cover number, and feedback edge set number of the underlying graph on the problems computational complexity, revealing both tractable and intractable cases. For instance, even for diameter-two split graphs TSS remains W[2]-hard with respect to the parameter size of the target set. TSS can be efficiently solved on graphs with small feedback edge set number and also turns out to be fixed-parameter tractable when parameterized by the vertex cover number. Both results contrast known parameterized intractability results for the parameter treewidth. While these tractability results are relevant for sparse networks, we also show efficient fixed-parameter algorithms for the parameter cluster editing number, yielding tractability for certain dense networks.

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

dynamic monopolies
influence spreading
viral marketing
algorithms and complexity
parameterized computational complexity
fixed-parameter tractability
data reduction


A time cost optimization for similar scenarios mobile GIS queries Query optimization strategies have been recently employed for various types of queries such as Geographic Information Systems (GIS) in particular Location Based Services and proximity analysis. This work proposes a new decision making mechanism called Time Cost Optimizer (TCOP) which aims to effectively reduce the cost of execution for multiple mobile GIS queries. TCOP is implemented in order to employ the new paradigm Sharing Global Execution Plans (GEP) where multiple users share the previously melted templates. It is integrated as a new component of the Query Melting Processor (QMP) that has been developed for processing multiple dynamic complex queries based on the Query Melting (QM) paradigm which consists of the sharing paradigm and the push-down strategy. An experimental evaluation has been conducted using a case study based on the map of Paris. The results analysis proved that significant saving in time can be achieved by employing the newly developed strategy. (C) 2012 Elsevier Ltd. All rights reserved.

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

mobile visual query languages
dynamic queries


high-speed cmos analog-to-digital converter for front-end receiver applications Modern front-end receivers perform direct conversion of an analog signal to digital form at intermediate frequencies (IF), simplifying the overall system design and alleviating the problems associated with IF mixers. The final aspiration is to directly digitize the RF signal and hence eliminate any RF/analog mixers. In order to direct digitize the analog input signal, a high dynamic-range and high-speed ADC is needed. Continuous-Time Bandpass Delta-Sigma Modulator can meet these specifications, using high-performance multi-bit quantizers. This article presents the design of a high-speed CMOS Analog-to-Digital Converter (ADC) to be used as a quantizer in modern digital receivers. It is designed in a 130 nm CMOS technology from STMicroelectronics. The main features of the ADC are 3-bit resolution with 4 GHz sample rate in a 0.8-2GHz bandwidth.

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

analog-to-digital converter
flash structure
data-conversion


A Robust O(n) Solution to the Perspective-n-Point Problem We propose a noniterative solution for the Perspective-n-Point (PnP) problem, which can robustly retrieve the optimum by solving a seventh order polynomial. The central idea consists of three steps: 1) to divide the reference points into 3-point subsets in order to achieve a series of fourth order polynomials, 2) to compute the sum of the square of the polynomials so as to form a cost function, and 3) to find the roots of the derivative of the cost function in order to determine the optimum. The advantages of the proposed method are as follows: First, it can stably deal with the planar case, ordinary 3D case, and quasi-singular case, and it is as accurate as the state-of-the-art iterative algorithms with much less computational time. Second, it is the first noniterative PnP solution that can achieve more accurate results than the iterative algorithms when no redundant reference points can be used (n <= 5). Third, large-size point sets can be handled efficiently because its computational complexity is O(n).

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

perspective-n-point problem
camera pose estimation
augmented reality


Probabilistic modeling of uncertainties in earthquake-induced landslide hazard assessment ? Probabilistic analysis is gaining more attention in the field of landslide hazard assessment, due to the possibility of taking into account estimation uncertainties and spatial variability of geological, geotechnical, geomorphological and seismological parameters. In this paper, an implementation of a simple approach to derive probabilistic earthquake triggered landslide hazard maps is described. The method is based on the simplified Newmark slope stability model, applied on a pixel-by-pixel basis, which fully integrates into current GIS computational environments. Uncertainties and fluctuations in input parameters are considered by treating these quantities as statistical distributions. Various probability density functions can be simulated through Monte Carlo techniques on a pixel-by-pixel basis, and the simulated samples are retained through all the computing steps. This allows the resulting quantities to be cast into probabilistic hazard maps, without restrictions about the symmetry or the mathematical complexity of the underlying distributions. First results on a test landslide site in Southern Italy show good performances for realistic landslide hazard zonation. The simplicity of the adopted framework allows the current approach to be easily expanded and improved the current approach.

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

probabilistic methods
newmark model
earthquake-triggered landslides
monte carlo simulation
asymmetric pdf


learning from inconsistency This position paper argues that inconsistencies that occur during the development of a software specification offer an excellent way of learning more about the development process. We base this argument on our work on inconsistency management. Much attention has been devoted recently to the need to allow inconsistencies to occur during software development, to facilitate flexible development strategies, especially for collaborative work. Recent work has concentrated on reasoning in the presence of inconsistency, tracing inconsistencies with "pollution markers", and supporting resolution. We argue here that one of the most important aspects of inconsistency is the learning opportunity it provides. We are therefore concerned with how to capture this learning outcome so that its significance is not lost. We present a small example of how apprentice software engineers learn from their mistakes, and outline how an inconsistency management tool could support this learning. We then argue that the approach can be used more generally as part of continuous process improvement.

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

process improvement
attention
development process
reasoning
strategies
software development
tool
presence
support
learning
paper
argument
collaborative work
software specification
management

aspect
traces
examples
developer
flexibility
continuation
software engineering
posit


Reliable impurity trap memory with high charge trap efficiency using ultrathin SiO2 impurity host layer for nonvolatile memory application We demonstrated reliable impurity trap memory (ITM) with high charge trap efficiency by incorporating only 1nm-SiO2 impurity host layer (IHL) between Al2O3 diffusion barrier layer and blocking oxide. While the ITM without IHL showed significant retention degradation as the amount of Ti impurity increased from 0.7 to 3 for enlarging memory window, the ITM with IHL showed stable retention characteristic which is charge loss less than 1V after 104s at 85C. We postulated that the chemical reaction between Ti and SiO2 induced three dimensionally-distributed impurity traps in IHL, which could result in the well-discrete stored charges in program mode.

O B I I O O O O O O O O O O O O B I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 GENETIC APPROACH FOR LONG TERM VIRTUAL ORGANIZATION DISTRIBUTION An agent-based Virtual Organization is a complex entity where dynamic collections of agents agree to share resources in order to accomplish a global goal or offer a comp lex service. An important problem for the performance of the Virtual Organization is the distribution of the agents across the computational resources. The final distribution should provide a good load balancing for the organization. In this article, a genetic algorithm is applied to calculate a proper distribution across hosts in an agent-based Virtual Organization. Additionally ,an abstract multi-agent system architecture which provides infrastructure for Virtual Organization distribution is introduced. The developed genetic solution employs an elitist crossover operator where one of the children inherits the most promising genetic material from the parents with higher probability. In order to validate the genetic proposal, the designed genetic algorithm has been successfully compared to several heuristics in different scenarios.

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

virtual organizations
genetic algorithms
multi-agent systems


Face

Photo-Sketch

Synthesis

and

Recognition

In

this

paper,

we

propose

a

novel

face

photo-sketch

synthesis

and

recognition

method

using

a

multiscale

Markov

Random

Fields

(MRF)

model.

Our

system

has

three

components:

given

a

face

photo,

synthesizing

a

sketch

drawing;

given

a

face

sketch

drawing,

synthesizing

a

photo;

and

searching

for

face

photos

in

the

database

based

on

a

query

sketch

drawn

by

an

artist.

It

has

useful

applications

for

both

digital

entertainment

and

law

enforcement.

We

assume

that

faces

to

be

studied

are

in

a

frontal

pose,

with

normal

lighting

and

neutral

expression,

and

have

no

occlusions.

To

synthesize

sketch/photo

images,

the

face

region

is

divided

into

overlapping

patches

for

learning.

The

size

of

the

patches

decides

the

scale

of

local

face

structures

to

be

learned.

From

a

training

set

which

contains

photo-sketch

pairs,

the

joint

photo-sketch

model

is

learned

at

multiple

scales

using

a

multiscale

MRF

model.

By

transforming

a

face

photo

to

a

sketch

(or

transforming

a

sketch

to

a

photo),

the

difference

between

photos

and

sketches

is

significantly

reduced,

thus

allowing

effective

matching

between

the

two

in

face

sketch

recognition.

After

the

photo-sketch

transformation,

in

principle,

most

of

the

proposed

face

photo

recognition

approaches

can

be

applied

to

face

sketch

recognition

in

a

straightforward

way.

Extensive

experiments

are

conducted

on

a

face

sketch

database

including

faces,

which

can

be

downloaded

from

our

Web

site

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

face recognition
face sketch synthesis
multiscale markov random field


Medical informatics: Searching for underlying components Objective: To discuss unifying principles that can provide a theory for the diverse aspects of work in medical informatics. If medical informatics is to have academic credibility, it must articulate a clear theory that is distinct from that of computer science or of other related areas of study. Results: The notions of reusable domain ontologies and problem-solving methods provide the foundation for current work on second-generation knowledge-based systems. These abstractions are also attractive for defining the core contributions of basic research in informatics. We can understand many central activities within informatics in terms defining, refining, applying, and evaluating domain ontologies and problem-solving methods. Conclusion: Construing work in medical informatics in terms of actions involving ontologies and problem-solving methods may move us closer to a theoretical basis for our field.

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

computing methodologies
artificial intelligence
academic training
professional training


Structure and energetics of a turbulent trailing edge flow Results from a direct numerical simulation (DNS) of turbulent flow over a rectangular trailing edge geometry are used to study energy transfers in detail. The numerical procedure employs a separate boundary layer simulation which is used to generate inflow turbulence and provide the inflow boundary condition data for the trailing edge flow simulation. The calculations are performed at a Reynolds number of 1000 based on the trailing edge thickness and free stream velocity. Characteristics of the vortex shedding are identified from instantaneous flow visualizations, two-point time correlations, and spectra. Turbulence kinetic energy production is found to be negative in the region behind the trailing edge, in agreement with simple analysis. The topology of the turbulence kinetic energy flux field is studied in conjunction with the production and dissipation, revealing pathways by which turbulence energy is transported from zones of creation to zones of destruction. (C) 2003 Elsevier Ltd. All rights reserved.

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

turbulent flow
trailing edge
vortex shedding
direct numerical simulation


Ticks and Tick-Borne Rickettsiae Surveillance in Montesinho Natural Park, Portugal This study constitutes the first contribution to the knowledge of tick dynamics and its implication in the epidemiology of rickettsial diseases in Montesinho Natural Park (MNP), Bragana district of Portugal. Of 76 ticks collected, 12 (15.8%) were Dermacentor (D.) marginatus, 36 (47.4%) D. reticulatus, and 28 (36.8%) Rhipicephalus (R.) sanguineus. Isolation assays were performed by shell-vial technique on 41 ticks. Israeli spotted fever strain was an isolate from R. sanguineus, and three isolates of Rickettsia slovaca were obtained from D. reticulatus. All 76 ticks were screened by PCR for Rickettsia sp., Ehrlichia (E.) chaffeensis, and Anaplasma (A.) phagocytophilum. Rickettsia RpA4 strain DNA was detected in 10 D. marginatus and 2 D. reticulatus, and Israeli spotted fever strain in 1 R. sanguineus. No E. chaffeensis or A. phagocytophilum infection was detected. New host records are provided for D. reticulatus. Also described for the first time in Portugal is the isolation of R. slovaca from D. reticulatus and the isolation of Israeli spotted fever strain from R. sanguineus. This confirms the association of the last rickettsiae strain with the same vector tick as previously described in Israel and Sicily

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

ticks
rickettsiae
rickettsia slovaca
israeli spotted fever
rpa4
portugal

dermacentor marginatus
dermacentor reticulatus
rhipicephalus sanguineus


Comparative exploration of whole-body MR through locally rigid transforms PurposeWhole-body MRI is seeing increasing use in the study and diagnosis of disease progression. In this, a central task is the visual assessment of the progressive changes that occur between two whole-body MRI datasets, taken at baseline and follow-up. Current radiological workflow for this consists in manual search of each organ of interest on both scans, usually on multiple data channels, for further visual comparison. Large size of datasets, significant posture differences, and changes in patient anatomy turn manual matching in an extremely labor-intensive task that requires from radiologists high concentration for long period of time. This strongly limits the productivity and increases risk of underdiagnosis.

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

whole-body imaging
registration
comparative visualization


Coordinating for flexibility in e-business supply chains The widespread use of information technology (IT) to create electronic linkages among supply chain partners with the objective of reducing transaction costs may have unintended adverse effects on supply chain flexibility. Increasing business dynamics, changing customer preferences, and disruptive technological shifts pose the need for two kinds of flexibility that interenterprise information systems must address-the ability of interenterprise linkages to support changes in offering characteristics (offering flexibility) and the ability to alter linkages to partner with different supply chain players (partnering flexibility). This study explores how enterprises in supply chains may forge supply chain linkages that enable both types of flexibility jointly, and allow them to deal with ubiquitous change. Drawing on March and Simon's coordination theory, we propose two design principles: (1) advance structuring of interorganizational processes and information exchange that allows partnering organizations to be loosely coupled, and (2) IT-supported dynamic adjustment that allows enterprises to quickly sense change and adapt their supply chain linkages. This study reports on a survey of 41 supply chain relationships in the IT industry. For design principle, our empirical investigation of factors shows (1) that modular design of interconnected processes and structured data connectivity are associated with higher supply chain flexibility, and (2) that deep coordination-related knowledge is critical for supply chain flexibility. Also, sharing a broad range of information with partners is detrimental to supply chain flexibility, and organizations should instead focus on improving the quality of information shared. For industry managers, the study provides clear insights for information infrastructure design. To manage their interdependencies, enterprises need to encapsulate their interconnected processes in modular chunks, and support these with IT platforms for information exchange in structured formats. Enterprises also need to nurture their execution capabilities by putting in place the information systems to process information exchanged with partners, augmenting their understanding of factors such as how partner actions need to trigger adaptive responses. For researchers, the study initiates a new stream of theorizing that focuses on the role of the information infrastructure in managing the tension between competing goals of offering flexibility and partnering flexibility.

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

coordination theory
supply chain flexibility

information technology infrastructure
interorganizational systems


Learning and control of exploration primitives Animals explore novel environments in a cautious manner, exhibiting alternation between curiosity-driven behavior and retreats. We present a detailed formal framework for exploration behavior, which generates behavior that maintains a constant level of novelty. Similar to other types of complex behaviors, the resulting exploratory behavior is composed of exploration motor primitives. These primitives can be learned during a developmental period, wherein the agent experiences repeated interactions with environments that share common traits, thus allowing transference of motor learning to novel environments. The emergence of exploration motor primitives is the result of reinforcement learning in which information gain serves as intrinsic reward. Furthermore, actors and critics are local and ego-centric, thus enabling transference to other environments. Novelty control, i.e. the principle which governs the maintenance of constant novelty, is implemented by a central action-selection mechanism, which switches between the emergent exploration primitives and a retreat policy, based on the currently-experienced novelty. The framework has only a few parameters, wherein time-scales, learning rates and thresholds are adaptive, and can thus be easily applied to many scenarios. We implement it by modeling the rodents whisking system and show that it can explain characteristic observed behaviors. A detailed discussion of the frameworks merits and flaws, as compared to other related models, concludes the paper.

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

reinforcement learning
intrinsic reward
information gain
motor primitives


metamodel evolution through metamodel inference Serving as the schema of models, a metamodel defines the abstract syntax of models and the interrelationships between model elements. Model instances are often inaccessible due to metamodel evolution or the metamodel becoming lost. This poster describes our research recovering a metamodel from model instances to support metamodel driven evolution.

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

grammar inference
domain-specific modeling
model-driven engineering


implicit linear interval estimations Visualization and collision detection are two of the most important problems connected with implicit objects. Enumeration algorithms can be used either directly or as preprocessing step for many algorithms solving these problems. In general, enumeration algorithms based on recursive space subdivision are reliable tools to encounter those parts in space, where the object might be located. But the bad performance and the huge number of computed enclosing cells, if high precision is required, are grave drawbacks. Implicit Linear Interval Estimations (ILIEs) introduced in this paper are implicit interval (hyper-)planes providing oriented tight bounds of the object within given cells. It turns out that the use of ILIEs highly improves the performance of the classical enumeration algorithm and the quality of the results. The theoretical background as well as a fast and simple technique to compute ILIEs are presented. The applicability of ILIEs is demonstrated by means of a modified enumeration algorithm that has been implemented and tested for implicit surfaces.

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

collision detection
enumeration
implicit surfaces

affine arithmetic
rendering
linear interval estimation
implicit curves
interval arithmetic


Balanced branchings in digraphs We study out-branchings rooted at a given vertex s with the extra requirement that these satisfy certain balance conditions, such as balancing the number of arcs out of s, the number of vertices in each subtree of the branching etc. We obtain polynomial algorithms for several of the problems and study the borderline between polynomial and NP-complete special cases of the problems.

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

out-trees
balancing degrees
balancing vertices
np-complete
polynomial algorithm


a mobile ip based wlan security management framework with reconfigurable hardware acceleration The increasing use of wireless technologies in enterprise networks demands strong security management and policy enforcement mechanisms. The conventional security management frameworks used in wired LAN do not suit in wireless domain due to dynamic topology and mobility of hosts. The enforcement of organizational security policies in wireless LAN requires appropriate access control models as well as correct distribution of access control rules in the network access points. In this paper, we propose a WLAN security management framework supported by a spatio-temporal RBAC (STRBAC) model. The concept of mobile IP has been used to ensure a fixed layer 3 address of a mobile host. Each wireless policy zone consists of a Policy Zone Controller that coordinates with a dedicated Local Role Server to extract the low level access configurations corresponding to the zone access routers. The system can be mapped into a reconfigurable hardware to exploit the parallelism in computing. We also propose a formal STRBAC model to represent the global security policies formally and a SAT based decision procedure to verify the access configurations

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

security policy
wireless network security


A note on a nilpotent lower bound of nilpotent triangular norms Lower bounds of finite systems of nilpotent triangular norms are discussed. By duality, upper bounds of finite systems of nilpotent t-conorms are found. Some applications are sketched. (C) 1999 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 O O O O O O O O O O O O O O O O O O O O O O

additive generator
nilpotent t-norm
ordering of t-norms


Enhancing ?1 ? 1 -minimization estimates of polynomial chaos expansions using basis selection In this paper we present a basis selection method that can be used with ?1 ? 1 -minimization to adaptively determine the large coefficients of polynomial chaos expansions (PCE). The adaptive construction produces anisotropic basis sets that have more terms in important dimensions and limits the number of unimportant terms that increase mutual coherence and thus degrade the performance of ?1 ? 1 -minimization. The important features and the accuracy of basis selection are demonstrated with a number of numerical examples. Specifically, we show that for a given computational budget, basis selection produces a more accurate PCE than would be obtained if the basis were fixed a priori. We also demonstrate that basis selection can be applied with non-uniform random variables and can leverage gradient information.

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

uncertainty quantification
stochastic collocation
?1 ? 1 -minimization ?1 ? 1 ?1 ? 1 ? 1
sparsity
adaptivity


Implicit enumeration of strongly connected components and an application to formal verification This paper first presents a binary decision diagram-based implicit algorithm to compute all maximal strongly connected components (SCCs) of directed graphs. The algorithm iteratively applies reachability analysis and sequentially identifies SCCs. Experimental results suggest that the algorithm dramatically outperforms the only existing implicit method which must compute the transitive closure of the adjacency-matrix of the graphs. This paper then applies this SCC algorithm to solve the bad cycle detection problem encountered in formal verification. Experimental results show that our new bad cycle detection algorithm is typically significantly faster than the state-of-the-art [1], sometimes by more than a factor of ten.

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

bad cycle detection
formal verification
strongly connected components

binary decision diagrams
symbolic methods


Molecular Survey of Ehrlichia canis and Anaplasma phagocytophilum from Blood of Dogs in Italy We investigated the prevalence of Ehrlichia canis (E. canis) (n= 601) and Anaplasma phagocytophilum (A. phagocytophilum) (n= 460) infection by means of real-time PCR from blood of Italian dogs. The prevalence of E. canis in northern, central, and southern Italy was 2.9%, 8%, and 9.7%, respectively. The prevalence of A. phagocytophilum was 0%

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

ehrlichia canis
anaplasma phagocytophilum


An optimization approach for decentralized QoS-based scheduling based on utility and pricing in Grid computing This paper presents an optimization approach for decentralized Quality of Service (QoS)-based scheduling based on utility and pricing in Grid computing. The paper assumes that the quality dimensions can be easily formulated as utility functions to express quality preferences for each task agent. The utility values are calculated by the user-supplied utility function that can be formulated with the task parameters. The QoS constraint Grid resource scheduling problem is formulated into a utility optimization problem. The QoS-based Grid resource scheduling optimization is decomposed into two subproblems by applying the Lagrangian method. In the Grid, a Grid task agent acts as a consumer paying for the Grid resource and the resource providers receive profits from task agents. A pricing-based QoS scheduling algorithm is used to perform optimally decentralized QoS-based resource scheduling. The experiments investigate the effect of the QoS metrics on the global utility and compare the performance of the proposed algorithm with other economical Grid resource scheduling algorithms. Copyright (c) 2006 John Wiley & Sons, Ltd.

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


big fast crowds on ps3 Crowds and other flock-like group motion are often modeled as interacting particle systems . These multi-agent simulations are computationally expensive because each agent must consider all of the others, if only to identify its neighbors. For large crowds, simple implementations are too slow since computation grows as the square of agent population. Faster approaches often rely on spatial hashing where a partitioning of space is used to accelerate crowd simulation. This same partitioning can form the basis of a scalable multi-processor approach to large, fast crowd simulations, as in [Quinn et al. 2003]. This paper describes an implementation of that approach for PLAYSTATION3 which supports simulation and display of simple crowds of up to 15,000 individuals at 60 frames per second.

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

interacting particle systems
crowd simulation

parallel processing
distributed processing
multi-processor
multi-agent simulation
behavioral animation
boids
flocking


Simultaneous Dual Level Creation for Games Recent research has shown that it is possible to design fitness functions, based on dynamic programming, that allow evolutionary computation to automatically generate level maps for games. In this study levels with multiple types of barriers are automatically designed. The levels are designed under the assumption that there are two agent types and that at least one agent type may ignore one type of barrier. A specification of multiple types of barriers thus creates two mazes, one for each agent type, that coexist in the same space. The design of these dual mazes is accomplished using different fitness functions for two mazes simultaneously. For example, this permits a level with a single long winding path for and agent that cannot walk through one type of barrier coexisting with a low-diameter maze with more complex connectivity for an agent that cannot cross another type of barrier. This study explores two representations for game levels with multiple barrier types using four different pairs of fitness functions. The system is shown to be able to design dual mazes whose properties depend substantially on both the choice of fitness function and representation used.

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

evolutionary computation
dynamic programming

search based procedural content generation


Calculation of the pH and the titratable acidity in clinically used infusion solutions Clinically used infusion solutions are complex aqueous mixtures composed of a variety of different salts, acids, and non-electrolytes, and are characterized by composition, initial pH, and titratable acidity (TA). By rigorous treatment as a multi-composed acidbase system, pH and TA were calculated from proton dissociation equilibria, mass balance equations and electroneutrality condition. Nine were arbitrarily chosen as model solutions in which pH and TA were experimentally determined. From composition, and based on a set of apparent acidity constants (pK values) at 37C and total ionic strength 0.155mol/l, pH was calculated by iteration. In the model solutions, measured pH was in the range 57, and the difference between calculated and experimental values was0.064. Good agreement was also found between calculated and measured TA: in the range 055mmol/l the mean difference was2.07 mmol/l, if calculated from measured pH, and 0.95mmol/l, if calculated from calculated pH.

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

clinical infusion solutions
acidbase equilibria
apparent pk


An asset residual life prediction model based on expert judgments An appropriate and accurate residual life prediction for an asset is essential for cost effective and timely maintenance planning and scheduling. The paper reports the use of expert judgments as the additional information to predict a regularly monitored assets residual life. The expert judgment is made on the basis of measured condition monitoring parameters, and is treated as a random variable, which may be described by a probability distribution due to the uncertainty involved. Since most expert judgments are in the form of a set of integer numbers, we can either directly use a discrete distribution or use a continuous distribution after some transformation. A key concept used in this paper is condition residual life where the residual life at the point of checking is conditional on, among others, the past expert judgments made on the same asset to date. Stochastic filtering theory is used to predict the residual life given available expert judgments. Artificial, simulated and real data are used for validating and testing the model developed.

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

condition based maintenance
conditional residual life


Characterization of Fashion Themes Using Fuzzy Techniques for Designing New Human Centered Products Fabric selection plays an important role in fashion garment design. Designers often use both physical and normalized linguistic criteria for fabric selection. Perception and preference of consumers in their specific sociocultural context, expressed by fashion themes or emotional linguistic criteria, affect greatly new fashion product design. Modeling the relationship between linguistic design criteria and fashion themes of a brand image perceived by consumers becomes thus significant. For setting up this model, we first use fuzzy relations and correlation techniques to select the most relevant linguistic design criteria of fabric hand for each specific fashion theme. The selected criteria can then effectively reduce the complexity of the model and interpret consumer perception of fabrics. Finally, we use a weighted aggregation operator to predict the similarity degree between any new product and fashion themes. Compared with other models, the proposed method is more robust and easier to be interpreted with real data collected for design of senior T-shirt fabrics.

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

fabric selection
fashion garment design
similarity degree


Practical scheduling of bag-of-tasks applications on grids with dynamic resilience Over the past decade, the grid has emerged as an attractive platform to tackle various large-scale problems, especially in science and engineering. One primary issue associated with the efficient and effective utilization of heterogeneous resources in a grid is scheduling. Grid scheduling involves a number of challenging issues, mainly due to the dynamic nature of the grid. There are only a handful of scheduling schemes for grid environments that realistically deal with this dynamic nature that have been proposed in the literature. In this paper, two novel scheduling algorithms, called the Shared-Input-data-based Listing (SIL) algorithm and the Multiple Queues with Duplication (MQD) algorithm for bag-of-tasks (BoT) applications in grid environments are proposed. The SIL algorithm targets scheduling data-intensive BoT (DBoT) applications, whereas the MOD algorithm deals with scheduling computationally intensive BoT (CBoT) applications. Their common and primary forte is that they make scheduling decisions without fully accurate performance prediction information. Another point to note is that both scheduling algorithms adopt task duplication as an attempt to reduce serious schedule increases. Our evaluation study employs a number of experiments with various simulation settings. The results show the practicability and competitiveness of our algorithms when compared to existing methods.

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

grid computing
parallel computing
bag-of-tasks applications


efficient pattern matching over event streams Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electronic health systems. While regular expression matching is well studied, pattern matching over streams presents two new challenges: Languages for pattern matching over streams are significantly richer than languages for regular expression matching. Furthermore, efficient evaluation of these pattern queries over streams requires new algorithms and optimizations: the conventional wisdom for stream query processing (i.e., using selection-join-aggregation) is inadequate. In this paper, we present a formal evaluation model that offers precise semantics for this new class of queries and a query evaluation framework permitting optimizations in a principled way. We further analyze the runtime complexity of query evaluation using this model and develop a suite of techniques that improve runtime efficiency by exploiting sharing in storage and processing. Our experimental results provide insights into the various factors on runtime performance and demonstrate the significant performance gains of our sharing techniques.

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


Impact of time and carrier frequency offsets on the FBMC/OQAM modulation scheme We propose an analysis of the impact of time (TO) and carrier frequency (CFO) offsets for the FBMC/OQAM modulation. We get simple closed-form exact expressions of the interference power and signal to interference ratio (SIR). We prove that, when using an orthogonality assumption, these expressions boil down to even simpler (but unused) expressions. All our theoretical models for TO, CFO and TO plus CFO are validated by simulations. A comparative analysis of different types of prototype filters is also provided together with a comparison to the OFDM scheme.

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

carrier frequency offset
filter bank multicarrier
offset quadrature amplitude modulation
synchronization
timing offset


incremental pattern matching in the viatra model transformation system Incremental pattern matching is a key challenge for many tool integration, model synchronization and (discrete-event) model simulation tasks. An incremental pattern matching engine explicitly stores existing matches, while these matches are maintained incrementally with respect to the changes of the underlying model. In the current paper, we present an adaptation of RETE networks [6] in order to provide incremental support for the transformation language of the VIATRA2 framework. We evaluate the performance of the incremental engine on a benchmark problem assessing the speedup of incremental processing in the case of as-long-as-possible type of rule applications.

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

incremental model transformation
incremental graph pattern matching
domain-specific languages


Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes It is known that in the Minkowski sum of r polytopes in dimension d, with r = d. Finally, we present a construction for any given number of vertices in summands and show that no other sum can achieve more vertices, establishing a precise tight bound.

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


Optimal polygonal approximation of digitized curves using the sum of square deviations criterion We address the problem of finding an optimal polygonal approximation of digitized curves. Several optimal algorithms have already been proposed to determine the minimum number of points that define a polygonal approximation of the curve, with respect to a criterion error. We present a new algorithm with reasonable complexity to determine the optimal polygonal approximation using the mean square error norm. The idea is to estimate the remaining number of segments and to integrate the cost in the A* algorithm. The solution is optimal in the minimum number of segments.

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


on the expressive power of temporal concurrent constraint programming languages The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that: (1) recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and viceversa. (2) replication can be encoded into parameterless recursive procedures with static scoping, and viceversa. (3) the languages from (1) are strictly more expressive than the languages from (2). Furthermore, we show that behavioral equivalence is undecidable for the languages from (1), but decidable for the languages from (2). The undecidability result holds even if the process variables take values from a fixed finite domain.

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


ON LIU'S INFERENCE RULE FOR UNCERTAIN SYSTEMS Liu's inference is a process of deriving consequences from uncertain knowledge or evidence via the tool of conditional uncertainty. Using membership functions, this paper derives some expressions of Liu's inference rule for uncertain systems. This paper also discusses Liu's inference rule with multiple antecedents and with multiple if-then rules.

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


AN ID-BASED PARTIALLY BLIND SIGNATURE SCHEME WITH ADAPTIVE DELEGATION FOR NETWORKED EMBEDDED SYSTEMS With the rapid evolution of intelligent computing and networking technology, security support is a must for the emerging networked embedded systems. As a key building block of the security infrastructure for the networked embedded systems. the design of signature schemes is one of the most critical aspects in the research field of secure networked embedded systems. In this paper. we propose a novel identity-based partially blind signature scheme with adaptive delegation. which is cost-efficient and very suitable under several constraints of networked embedded systems. We analyze the security. efficiency of our scheme. and conduct experiments on a typical networked embedded platform. The experimental results show that our technique can perform better compared with the previous work.

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

networked embedded system
identity-based


Comparing error minimized extreme learning machines and support vector sequential feed-forward neural networks Recently, error minimized extreme learning machines (EM-ELMs) have been proposed as a simple and efficient approach to build single-hidden-layer feed-forward networks (SLFNs) sequentially. They add random hidden nodes one by one (or group by group) and update the output weights incrementally to minimize the sum-of-squares error in the training set. Other very similar methods that also construct SLFNs sequentially had been reported earlier with the main difference that their hidden-layer weights are a subset of the data instead of being random. These approaches are referred to as support vector sequential feed-forward neural networks (SV-SFNNs), and they are a particular case of the sequential approximation with optimal coefficients and interacting frequencies (SAOCIF) method. In this paper, it is firstly shown that EM-ELMs can also be cast as a particular case of SAOCIF. In particular, EM-ELMs can easily be extended to test some number of random candidates at each step and select the best of them, as SAOCIF does. Moreover, it is demonstrated that the cost of the computation of the optimal output-layer weights in the originally proposed EM-ELMs can be improved if it is replaced by the one included in SAOCIF. Secondly, we present the results of an experimental study on 10 benchmark classification and 10 benchmark regression data sets, comparing EM-ELMs and SV-SFNNs, that was carried out under the same conditions for the two models. Although both models have the same (efficient) computational cost, a statistically significant improvement in generalization performance of SV-SFNNs vs. EM-ELMs was found in 12 out of the 20 benchmark problems. (C) 2011 Elsevier Ltd. All rights reserved.

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


Federation solutions for inter- and intradomain security in next-generation mobile service platforms A federation approach for security in future distributed service delivery platforms for mobile users offers some key advantages over an integrated solution relying on a common choice of a standardized authentication technology. By agreeing on an exchange protocol for security assertions rather than on the detailed security mechanisms, Service Aggregators and Access Network Operators will be able to federate their customer offerings flexibly and jointly offer services. The consumer will find formerly separate offerings combined, and Service Operators will enjoy open interfaces towards the network's service delivery platform. Through the use of Security Assertion Markup Language (SAML), standardized assertion statements can be made not only for the user's identity, but also on attributes and authorizations associated with it. This will allow a seamless personalized service experience offering single sign-on across separate operational domains. An example from automobile telematics is used to illustrate the concepts.

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

single sign-on
open service provisioning
automotive


RMAIN: Association rules maintenance without reruns through data Association rules are well recognised as a data mining tool for analysis of transactional data, currently going far beyond the early basket-based applications. A wide spectrum of methods for mining associations have been proposed up to date, including batch and incremental approaches. Most of the accurate incremental methods minimise, but do not completely eliminate reruns through processed data. In this paper we propose a new approximate algorithm RMAIN for incremental maintenance of association rules, which works repeatedly on subsequent portions of new transactions. After a portion has been analysed, the new rules are combined with the old ones, so that no reruns through the processed transactions are performed in the future. The resulting set of rules is kept similar to the one that would be achieved in a batch manner. Unlike other incremental methods, RMAIN is fully separated from a rule mining algorithm and this independence makes it highly general and flexible. Moreover, it operates on rules in their final form, ready for decision support, and not on intermediate representation (frequent itemsets), which requires further processing. These features make the RMAIN algorithm well suited for rule maintenance within knowledge bases of autonomous systems with strongly bounded resources and time for decision making. We evaluated the algorithm on synthetic and real datasets, achieving promising results with respect to either performance or quality of output rules.

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

data mining
association rules
incremental maintenance

approximate methods
knowledge-based systems


Multi-appliance recognition system with hybrid SVM/GMM classifier in ubiquitous smart home Ubiquitous computing provides convenient and fast information distribution service by using sensor nodes and wireless network, and a good household appliance recognition system will allow users to effectively understand the household appliance usage and develop habits of power preservation. At present, smart meters convert the information of traditional electric meters to easily accessible digital information, based on which, the household appliance recognition service can be carried out. However, it is different from video or audio recognition service, when a variety of electrical appliances run, they will all have individual impact on power consumption, thereby resulting in the difficulties in recognition. Presently, the complex current information arising from many household appliances also increases the difficulty in extracting power features. For addressing the challenge, this study proposes a set of multi-appliance recognition system, which designs a single smart meter using a current sensor and a voltage sensor in combination with a microprocessor to meter multi-appliances. After fuzzy processing of the power information are read through the smart meter and extraction of the power features, electric appliances are classified using the hybrid Support Vector Machine/Gaussian Mixture Model (SVM/GMM) classification model. GMM is mainly used describe the wave distribution situation according to the current information, so as to find the power similarity; while SVM is used to classify the power features of different electric appliances, so as to summarize the classification properties of different electric appliances and establish a classification model. Finally, the household appliances that are in use can be recognized with the household power supply terminal, and their information can be reported to users through wired or wireless network to achieve ubiquitous recognition service. This study has developed and implemented this system prototype, and is used to prove its design theory.

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

ubiquitous computing
smart meter
appliance recognition


Strategic innovation through outsourcing: The role of relational and contractual governance There is growing evidence that client firms expect outsourcing suppliers to transform their business. Indeed, most outsourcing suppliers have delivered IT operational and business process innovation to client firms; however, achieving strategic innovation through outsourcing has been perceived to be far more challenging. Building on the growing interest in the IS outsourcing literature, this paper seeks to advance our understanding of the role that relational and contractual governance plays in achieving strategic innovation through outsourcing. We hypothesized and tested empirically the relationship between the quality of clientsupplier relationships and the likelihood of achieving strategic innovation, and the interaction effect of different contract types, such as fixed-price, time and materials, partnership and their combinations. Results from a pan-European survey of 248 large firms suggest that high-quality relationships between clients and suppliers may indeed help achieve strategic innovation through outsourcing. However, within the spectrum of various outsourcing contracts, only the partnership contract, when included in the client contract portfolio alongside either fixed-price, time and materials or their combination, presents a significant positive effect on relational governance and is likely to strengthen the positive effect of the quality of clientsupplier relationships on strategic innovation.

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

quality of clientsupplier relationship
fixed-price contract
time and materials contract
joint venture contract


Local doping of silicon by a point-contact microwave applicator The feasibility of local doping in silicon by an open-end coaxial applicator with a tip made of the doping material, e.g. aluminum or silver, is studied in this paper. In these experiments, localized microwave power of 100350W at 2.45GHz was applied for ?1min to obtain doped regions of ?1-mm width and ?0.3-?m depth. Independent measurements of secondary ion mass spectroscopy (SIMS) and junction built-in potential measured by atomic-force microscopy (AFM) were used to estimate the activated doping concentrations in the order of 1019 and 1022cm?3 for aluminum and silver doping, respectively. Potential barriers (pn junctions) of 0.50.7V were measured across the aluminum-doped regions, and IV characteristics were observed. The doping experiments were conducted in air atmosphere, hence oxidation effects were observed as well. The localized-microwave doping concept presented here could be useful in small-scale semiconductor processes, integrated optics, and MEMS applications.

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

silicon thermal processing
thermal-runaway
silicon doping
microwaves


literature mining of blood flow regulatory mechanisms for finding cross context relations In this paper we present an approach for finding relations between two concepts in existing literature. Relations can be manifested as simple causal relations, when one concept influences the other, or as more complex mutual relations that involve identifying common factors between the concepts. The presented approach is based on literature mining methods like document similarity clustering, keyword extraction and concept visualization. Using these methods, relations between literature dealing with thermoregulation and literature dealing with endothelium were found and papers that can be used for better understanding of temperature control mechanisms within the human blood flow control were identified.

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

literature mining
cross context relations


On technology for functional requirement-based reference design retrieval in engineering knowledge management Engineering design is a knowledge-intensive process, and includes conceptual design, detailed design, engineering analysis, assembly design, process design, and performance evaluation. Each of these tasks involves various aspects of technical knowledge and experience. Whether this technical knowledge and experience can be effectively shared is key to increasing product development capability and quality, and also to reducing the duration and cost of the development cycle. Consequently, providing engineering designers various query methods for retrieving engineering knowledge is one of the most important tasks in engineering knowledge management. The study develops a technology for functional requirement-based reference design retrieval as a decision support mechanism, which can assist engineering designers to retrieve relevant design and associated knowledge for reference in conducting functional requirements of a product. This study involves the following tasks: (i) designing a functional requirement-based reference design retrieval process, (ii) developing techniques related to the technology for functional requirement-based reference design retrieval, and (iii) implementing a functional requirement-based reference design retrieval mechanism. The retrieval process includes the steps of functional requirement-based query, case searching and matching, and case ranking. The technology involves (i) a structured query model for functional requirements, (ii) an index structures for historical design cases, (iii) functional requirement-based case searching and matching mechanisms, (iv) a functional requirement-based case ranking mechanism, and (v) a case-based representation of designed entities. Finally, the experimental example with indexing and retrieving similar designed entities is conducted to demonstrate the proposed techniques worked efficiently.

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


Design iterations for a location-aware event planner We present the user-centered design and testing process of a mobile, location-aware event planner. Using questionnaires, interviews, and discussions with potential users, we investigated the ways individuals plan social events, such as business meetings, dinners and gatherings, and perform the attendant communication tasks. We catalogued the contextually dependent ways in which people plan their meetings and informal social events and devised a wide range of conceptual sketches to address our potential users professed needs. We developed a preliminary PDA-based prototype based on clear conceptual entities (people, places, locations and events) and designed to support short interaction sequences and large maps. Its evaluation with a group of nine participants provided qualitative feedback and prompted an interface redesign. This development process taught us a number of interesting lessons applicable to this category of location-aware applications, which we report at the end of the article. The set of design recommendations can assist designers in the development of location aware systems.

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

spontaneous events
planning
location-awareness
cell phone
mobile calendar
personal information management


Constrained Dimensionality Reduction Using a Mixed-Norm Penalty Function with Neural Networks Reducing the dimensionality of a classification problem produces a more computationally-efficient system. Since the dimensionality of a classification problem is equivalent to the number of neurons in the first hidden layer of a network, this work shows how to eliminate neurons on that layer and simplify the problem. In the cases where the dimensionality cannot be reduced without some degradation in classification performance, we formulate and solve a constrained optimization problem that allows a trade-off between dimensionality and performance. We introduce a novel penalty function and combine it with bilevel optimization to solve the constrained problem. The performance of our method on synthetic and applied problems is superior to other known penalty functions such as weight decay, weight elimination, and Hoyer's function. An example of dimensionality reduction for hyperspectral image classification demonstrates the practicality of the new method. Finally, we show how the method can be extended to multilayer and multiclass neural network problems.

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


String edit distance, random walks and graph matching This paper shows how the eigenstructure of the adjacency matrix can be used for the purposes of robust graph matching. We commence from the observation that the leading eigenvector of a transition probability matrix is the steady state of the associated Markov chain. When the transition matrix is the normalized adjacency matrix of a graph, then the leading eigenvector gives the sequence of nodes of the steady state random walk on the graph. We use this property to convert the nodes in a graph into a string where the node-order is given by the sequence of nodes visited in the random walk. We match graphs represented in this way, by finding the sequence of string edit operations which minimize edit distance.

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

markov chains
graph seriation
graph-spectral methods


Modeling web site design across cultures: Relationships to trust, satisfaction, and e-loyalty Despite rapidly increasing numbers of diverse online shoppers, the relationship of Web site design to trust, satisfaction, and loyalty has not previously been modeled across cultures. In the current investigation, three components of Web site design (information design, navigation design, and visual design) are considered for their impact on trust and satisfaction. In turn, relationships of trust and satisfaction to online loyalty are evaluated. Utilizing data collected from 571 participants in Canada, Germany, and China, various relationships in the research model are tested using partial least squares analysis for each country separately. In addition, the overall model is tested for all countries combined as a control and verification of earlier research findings, although this time with a mixed country sample. All paths in the overall model are confirmed. Differences are determined for separate country samples concerning whether navigation design, visual design, and information design result in trust, satisfaction, and ultimately loyalty-suggesting design characteristics should be a central consideration in Web site design across cultures.

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


exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, including the assumption that the particles are deterministic. This has prevented the exact characterisation of the sampling distribution of the PSO. In this paper we introduce a novel method, which allows one to exactly determine all the characteristics of a PSO's sampling distribution and explain how they change over any number of generations, in the presence stochasticity. The only assumption we make is stagnation, i.e., we study the sampling distribution produced by particles in search for a better personal best. We apply the analysis to the PSO with inertia weight, but the analysis is also valid for the PSO with constriction.

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


Deciding the isomorphism problem in classes of unary automatic structures We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic equivalence relations, unary automatic linear orders, and unary automatic trees. That is, we provide algorithms which decide whether two given elements of these classes are isomorphic. In doing so, we define new finite representations for these structures which give normal forms.(1) (C) 2010 Elsevier B.V. All rights reserved.

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

unary automatic structures
the isomorphism problem


Multiply balanced edge colorings of multigraphs In this article, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair with respect to several notions of balance (such as between pairs of vertices, degrees of vertices in both the graph and in each color class, etc.). The connectivity of color classes is also addressed. Most results in the literature on amalgamations focus on the disentangling of amalgamated complete graphs and complete multipartite graphs. Many such results follow as immediate corollaries to the main result in this article, which addresses amalgamations of graphs in general, allowing for example the final graph to have multiple edges. A new corollary of the main theorem is the settling of the existence of Hamilton decompositions of the family of graphs K(a1, , ap; ?1, ?2); such graphs arise naturally in statistical settings. 2011 Wiley Periodicals, Inc. J Graph Theory 70: 297317, 2012

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

detachment
hamiltonian decomposition
edge-coloring
hamiltonian cycles


Toward a spatial 3D cadastre in Israel This paper presents results of research dealing with geodetic and cadastral aspects of utilizing space above and below the surface. The research is being conducted at the Geodetic Engineering Division of the TechnionIsrael Institute of Technology, as part of the doctoral studies of the first author. The principal objectives of the research are to find a cadastralgeodetic solution for utilizing above and below surface space and for defining the characteristics of the future analytical, three-dimensional and spatial cadastre that will replace the existing two-dimensional graphical surface cadastre in Israel. The research objectives are being realized by attaining the secondary research objectives: defining the future cadastral reality and developing a spatial cadastral model; defining guidelines for transition from the surface cadastre to the spatial cadastre; developing a model for registering property rights in all three spaces; developing models for managing spatial cadastre information and creating the geodeticcadastral background for a legal solution of utilizing all land space.

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

geospatial object
spatial cadastral reality
3d cadastral data models
spatial property rights registration


SEMI-CONTINUOUS SIZED TYPES AND TERMINATION Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls occur just at a smaller size. This approach is only sound if the type of the recursive function is admissible, i.e., depends on the size index in a certain way. To explore the space of admissible functions in the presence of higher-kinded data types and impredicative polymorphism, a semantics is developed where sized types are interpreted as functions from ordinals into sets of strongly normalizing terms. It is shown that upper semi-continuity of such functions is a sufficient semantic criterion for admissibility. To provide a syntactical criterion, a calculus for semi-continuous functions is developed.

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

type-based termination
inductive types
semi-continuity
strong normalization


Highway Vehicular Delay Tolerant Networks: Information Propagation Speed Properties In this paper, we provide a full analysis of the information propagation speed in bidirectional vehicular delay tolerant networks such as roads or highways. The provided analysis shows that a phase transition occurs concerning the information propagation speed, with respect to the vehicle densities in each direction of the highway. We prove that under a certain threshold, information propagates on average at vehicle speed, while above this threshold, information propagates dramatically faster at a speed that increases quasi-exponentially when the vehicle density increases. We provide the exact expressions of the threshold and of the average information propagation speed near the threshold, in case of finite or infinite radio propagation speed. Furthermore, we investigate in detail the way information propagates under the threshold, and we prove that delay tolerant routing using cars moving on both directions provides a gain in propagation distance, which is bounded by a sublinear power law with respect to the elapsed time, in the referential of the moving cars. Combining these results, we thus obtain a complete picture of the way information propagates in vehicular networks on roads and highways, which may help designing and evaluating appropriate vehicular ad hoc networks routing protocols. We confirm our analytical results using simulations carried out in several environments (The One and Maple).

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

disruption tolerant networking
vehicular and wireless technologies


A hybrid neural network system for pattern classification tasks with missing features A hybrid neural network comprising Fuzzy ARTMAP and Fuzzy C-Means Clustering is proposed for pattern classification with incomplete training and test data. Two benchmark problems and a real medical pattern classification task are employed to evaluate the effectiveness of the hybrid network. The results are analyzed and compared with those from other methods.

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


Multi-objective GA with fuzzy decision making for security enhancement in power system Power system security enhancement is a major concern in the operation of power system. In this paper, the task of security enhancement is formulated as a multi-objective optimization problem with minimization of fuel cost and minimization of FACTS device investment cost as objectives. Generator active power, generator bus voltage magnitude and the reactance of Thyristor Controlled Series Capacitors (TCSC) are taken as the decision variables. The probable locations of TCSC are pre-selected based on the values of Line Overload Sensitivity Index (LOSI) calculated for each branch in the system. Multi-objective genetic algorithm (MOGA) is applied to solve this security optimization problem. In the proposed GA, the decision variables are represented as floating point numbers in the GA population. The MOGA emphasize non-dominated solutions and simultaneously maintains diversity in the non-dominated solutions. A fuzzy set theory-based approach is employed to obtain the best compromise solution over the trade-off curve. The proposed approach has been evaluated on the IEEE 30-bus and IEEE 118-bus test systems. Simulation results show the effectiveness of the proposed approach for solving the multi-objective security enhancement problem.

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

flexible ac transmission system (facts) devices

thyristor controlled series capacitors (tcsc)


Fusion of visible and thermal imagery improves situational awareness A new color image fusion scheme is applied to visible and thermal images of military relevant scenarios. An observer experiment is performed to test if the increased amount of detail in the fused images can improve the accuracy of observers performing a detection and localization task. The results show that observers can localize a target in a scene (1) with a significantly higher accuracy, and (2) with a greater amount of confidence when they perform with fused images (either gray or color fused), compared with the individual image modalities (visible and thermal).

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

image fusion
situational awareness
thermal imagery


Land use pattern optimization based on CLUE-S and SWAT models for agricultural non-point source pollution control Improper land use is one major cause of non-point source pollution. Integrated modeling would support the evaluation and optimization of land use for the non-point source pollution control. In this study, the CLUE-S (the Conversion of Land Use and its Effect at Small regional extent) and SWAT (Soil and Water Assessment Tool) models were coupled to simulate pollution loads under different land use scenarios in the upstream watershed of Miyun Reservoir in Beijing, China. The results indicated that changes in land use structure and pattern under different land use scenarios have significantly affected the non-point source pollution load. The increase of orchards and loss of forest cover has led to an increase in the potential pollution loads of nitrogen by 5.27% and phosphorus by 4.03%. However, in the agricultural non-point source pollution control scenario, pollution loads of nitrogen decreased by 13.94% and phosphorus by 9.86%, resulting from the establishment of riparian vegetation buffers and restoring forest on unutilized land and slope arable land. Coupling the hydrological model SWAT and the land use model CLUE-S succeeded in evaluating the land use pattern for agricultural non-point source pollution control. The coupling of two models provides a new approach for land use optimization towards non-point source pollution control. (C) 2011 Elsevier Ltd. All rights reserved.

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

clue-s
model coupling
non-point source pollution control


A practical pattern recovery approach based on both structural, and behavioral analysis While the merit of using design patterns is clear for forward engineering, we could also benefit from design pattern recovery in program understanding and reverse engineering. In this paper, we present a practical approach to enlarge the recoverable scope and improve precision ratio of pattern recovery. To specify both structural aspect and behavioral aspect of design patterns, we introduce traditional predicate logic combined with Allen's interval-based temporal logic as our theory foundation. The formal specifications could be conveniently converted into Prolog representations to support pattern recovery. To illustrate how to specify and recover design patterns in our approach, we take one example for each category of design patterns. Moreover, we give a taxonomy of design patterns based on the analysis in our approach to show its applicable scope. To validate our approach, we have developed a toot named PRAssistor and analyzed two well-known open source frameworks. The experiment results show that most of the patterns addressed in our taxonomy have been recovered. Besides larger recoverable scope, the recovery precision of our approach is much higher than others. Furthermore, we consider that our approach and tool could be promisingly extended to support "Debug at Design Level" and "Pattern-Driven Refactoring". (C) 2003 Published by Elsevier Inc.

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

design pattern
pattern recovery
reverse engineering


Perturbation of solutions of ordinary linear homogeneous differential equations of the second order In this paper we give a method for peturbation of solutions of linear homogeneous differential equation of the second order.

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

intermediate equation
oscillatory solutions


Multi-symplectic RungeKutta methods for nonlinear Dirac equations ? In this paper, we consider the multi-symplectic RungeKutta (MSRK) methods applied to the nonlinear Dirac equation in relativistic quantum physics, based on a discovery of the multi-symplecticity of the equation. In particular, the conservation of energy, momentum and charge under MSRK discretizations is investigated by means of numerical experiments and numerical comparisons with non-MSRK methods. Numerical experiments presented reveal that MSRK methods applied to the nonlinear Dirac equation preserve exactly conservation laws of charge and momentum, and conserve the energy conservation in the corresponding numerical accuracy to the method utilized. It is verified numerically that MSRK methods are stable and convergent with respect to the conservation laws of energy, momentum and charge, and MSRK methods preserve not only the inner geometric structure of the equation, but also some crucial conservative properties in quantum physics. A remarkable advantage of MSRK methods applied to the nonlinear Dirac equation is the precise preservation of charge conservation law.

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

conservation laws
nonlinear dirac equations


A FEM-BEM fast methodology for 3D frictional contact problems This paper presents a new and efficient methodology for 3D frictional contact problems based on the Generalized Newton Method with line search (GNMls). The influence coefficients modeling the behavior of solids are approached by means of the Finite Element Method (FEM) and/or the Boundary Element Method (BEM). The contact problem is based on an Augmented Lagrangian formulation and the use of projection functions to establish the contact restrictions. A new and more simplified projection operator is presented, which makes it possible to obtain a quasi-complementarity of the contact variables. As a consequence, the number of contact problem unknowns is reduced. This, together with the use of iterative resolution techniques for computing the Newton line search, results in a fast and reliable algorithm, as shown in the examples solved in this paper. (C) 2010 Elsevier Ltd. All rights reserved.

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

boundary element method
finite element method


Al2O3 stacks on In0.53Ga0.47As substrates: In situ investigation of the interface In this work we present an in situ investigation of the interface composition between an In0.53Ga0.47As substrate and an Al2O3 oxide grown by molecular beam deposition in ultra high vacuum conditions. In the effort to improve the chemical quality of the interface, reduction of semiconductor-oxygen bonding at the interface can be obtained by growing a few thick pure Al layer before starting exposure of the surface to the atomic oxygen flux. Conversely, when a Ge interface passivation layer is intercalated between the semiconductor and the oxide stack, the interface chemistry is governed by Ge reaction with other species (Al, O), leading only to a partial suppression of the interface oxides.

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

high mobility semiconductors
iiiv semiconductors
molecular beam deposition (mbd)


extensible file systems in spring In this paper we describe an architecture for extensible file systems. The architecture enables the extension of file system functionality by composing (or stacking) new file systems on top of existing file systems. A file system that is stacked on top of an existing file system can access the existing file system's files via a well-defined naming interface and can share the same underlying file data in a coherent manner. We describe extending file systems in the context of the Spring operating system. Composing file systems in Spring is facilitated by basic Spring features such as its virtual memory architecture, its strongly-typed well-defined interfaces, its location-independent object invocation mechanism, and its flexible naming architecture. File systems in Spring can reside in the kernel, in user-mode, or on remote machines, and composing them can be done in a very flexible manner.

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

architecture
operating system
context
object
data
interfaces
paper
access
file systems

sharing locatability stack functional memorialized flexibility extensibility virtualization feature user coherence


MODEL TYPE SELECTION IN AN INTEGRATED DSS ENVIRONMENT Effective computer based support for the use of analytic models in management decision making requires model management systems (MMS) that facilitate all phases of the modeling process. Existing approaches to the design of MMS commonly assume that the type of model needed to solve each problem is predetermined by the decision maker. This is a limited view, since determination of the appropriate model type is a difficult task, and is hampered by the subjective preferences of individuals. In this paper, we describe the model (type) selection process, argue why support for this should be integral to MMS design, and overview an approach to the design of the model selection subsystem in an integrated DSS.

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

decision support systems
knowledge based systems
management science


A robust velocity estimation method by using mixed domain phase signal A robust moving object velocity estimation method in the mixed domain(MixeD) is proposed. By obtaining phase, that is, normalizing the 1-D complex sinusoid signals with their magnitudes, the velocity estimations of moving objects with conditions such as object rotation, shape and graylevel variation have been accomplished. Based on the appropriate spatial frequency selection, which choose the points where the signals are less influenced by the background and noise, the spectra of these 1-D temporal complex signals in selected points are estimated by FFT. The simulation results show that velocity vectors have been correctly estimated.

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


The role of Ir4 cluster in enhancing the adsorption of CO2 on selected zeolites GCMC simulations We simulate adsorption of CO2 on EMT, SAO, SBT, SBS and IWS zeolites containing no, one and two Ir4 clusters per unit cell. Independently from zeolite framework, the interaction of CO2 with the Ir4 cluster is significantly stronger than with the zeolite, thus, the cluster is the most preferable adsorption site. The introduction of the cluster into zeolite framework increases the adsorption capacity. This effect, depending on the zeolite structure, either fades with the pressure or is preserved in the whole pressure range. The presence of the cluster distorts the main type of adsorption in its area, what has a direct correlation with the shape of adsorption isotherms.

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