Graphs and colorings for answer set programming We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ ill graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics.

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

operational semantics
answer set computation
graph-based characterization


Sudden changes in variance and time varying hedge ratios This paper analyzes the influence of sudden changes in the unconditional volatility on the estimation and forecast of volatility and its impact on futures hedging strategies. We employ several multivariate GARCH models to estimate the optimal hedge ratios for the Spanish stock market including in each one some well-known patterns that may affect volatility forecasts (asymmetry and sudden changes). The main empirical results show that more complex models including sudden changes in volatility outperform the simpler models in hedging effectiveness both with in-sample and out-of-sample analysis. However, the evidence is stronger when the loss distribution tail is used as a measure for the effectiveness (Value at Risk (VaR) and Expected Shortfall (ES)) suggesting that traditional measures based on the variance of the hedged portfolio should be used with caution.

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

hedging effectiveness
garch
sudden changes in variance


Longitudinal and cross-sectional study of registered nurses in Sweden who undertake a PhD showing that nurses continue to publish in English after their PhD but male nurses are more productive than female nurses A review of 649 PhDs undertaken by Swedish nurses and midwives found no evidence that they stop publishing in English after their PhD. The proportion of 70% for any publication in English was similar to that of MDs. A higher proportion of male than female nurses were high publishers of six or more (52% vs. 23%) and eight or more papers (44% vs. 14%) in a 5year period. The standard of the PhDs of Swedish nurses was comparable to those of other biomedical PhDs and was consistent in pattern over the past two decades. The gender pattern of external examiners of female nurses evolved in that 199294, 75% were men, during 199697, 54% were men and from 2000 onwards 46% were men. Nurses were examined by foreign examiners in 20% of examinations. They came primarily from Norway and USA.

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

nurses and midwives
phd
external examiners

publication pattern
gender differences
demographics


modeling and predicting personal information dissemination behavior In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal communications. A personal profile, called CommunityNet, is established for each individual based on a novel algorithm incorporating contact, content, and time information simultaneously. It can be used for personal social capital management. Clusters of CommunityNets provide a view of informal networks for organization management. Our new algorithm is developed based on the combination of dynamic algorithms in the social network field and the semantic content classification methods in the natural language processing and machine learning literatures. We tested CommunityNets on the Enron Email corpus and report experimental results including filtering, prediction, and recommendation capabilities. We show that the personal behavior and intention are somewhat predictable based on these models. For instance, "to whom a person is going to send a specific email" can be predicted by one's personal social network and content analysis. Experimental results show the prediction accuracy of the proposed adaptive algorithm is 58\% better than the social network-based predictions, and is 75\% better than an aggregated model based on Latent Dirichlet Allocation with social network enhancement. Two online demo systems we developed that allow interactive exploration of CommunityNet are also discussed.

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

network
latent dirichlet allocation
adaptive algorithm
human
content analysis
paper
model
filtering
email
informal
online
exploration
management
predict
classification
organization
recommendation
systems
accuracy
capabilities
semantic
behavior
dynamic
machine learning
social capital
algorithm
natural language processing
information dissemination

communication
social network
personality
intent
timing
combinational
interaction
contention
method
experimentation
personal information management
user behavior modeling
profiles
cluster


Distributed fault-tolerant ring embedding and reconfiguration in hypercubes To embed a ring in a hypercube is to find a Hamiltonian cycle through every node of the hypercube. It is obvious that no 2(n)-node Hamiltonian cycle exists in an n-dimensional faulty hypercube which has at least one faulty node. However, if a hypercube has faulty links only and the number of faulty links is at most n - 2, at least one 2(n)-node Hamiltonian cycle can be found. In this paper, we propose a distributed ring-embedding algorithm that can find a Hamiltonian cycle in a fault-free or faulty n-dimensional hypercube (Q(n)), and the complexity is O(n) parallel steps. The algorithm is based on the recursion property of the hypercube and the free-link dimension concept. In some cases, even when the number of faulty links is larger than n - 2, Hamiltonian cycles may still exist. We will show that the largest possible number of faulty links that can be tolerated is 2(n-1) - 1. The performance and the constraints of the fault-tolerant algorithm is also analyzed in detail in this paper. Furthermore, a dynamic reconfiguration algorithm for an embedded ring is proposed and discussed. Due to the distributed nature of the algorithms, they are useful for the simulation of ring-based multiprocessors on MIMD hypercube multiprocessors.

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

hamiltonian cycle
hypercube
reconfiguration


Mining asynchronous periodic patterns in time series data Periodicy detection in time series,data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and did not recognize the misaligned presence of a pattern due to the intervention of random noise. In this paper, we propose a more flexible model of asynchronous periodic pattern that may be present only within a subsequence and whose occurrences may be shifted due to disturbance. Two parameters min_rep and max_dis are employed to specify the minimum number of repetitions that is required within each segment of nondisrupted pattern occurrences and the maximum allowed disturbance between any two successive valid segments. Upon satisfying these two requirements, the longest valid subsequence of a pattern is returned. A two-phase algorithm is devised to first generate potential periods by distance-based pruning followed by an iterative procedure to derive and validate candidate patterns and locate the longest valid subsequence. We also show that this algorithm cannot only provide linear time complexity with respect to the length of the sequence but also achieve space efficiency.

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

segment-based approach
partial periodicity


a dynamic load balancer for a parallel branch and bound algorithm This paper presents a load-balancing scheme for a parallel branch and bound (PBB) algorithm utilizing a dynamic load balancer (DLB). The PBB algorithm is used to solve a resource scheduling problem on the Hypercube. The DLB is included in the PBB algorithm and is distributed to each node to balance the workload during run time. The DLB is evaluated by implementing two PBB algorithms, with DLB and without DLB. Results show that the PBB with DLB is 3.14 times faster than the algorithm without DLB.

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

scheduling distributed hypercube paper algorithm workload resource parallel dynamic scheme


interactive moea/d for multi-objective decision making In this paper, an interactive version of the decomposition based multiobjective evolutionary algorithm (iMOEA/D) is proposed for interaction between the decision maker (DM) and the algorithm. In MOEA/D, a multi-objective problem (MOP) can be decomposed into several single-objective sub-problems. Thus, the preference incorporation mechanism in our algorithm is implemented by selecting the preferred sub-problems rather than the preferred region in the objective space. At each interaction, iMOEA/D offers a set of current solutions and asks the DM to choose the most preferred one. Then, the search will be guided to the neighborhood of the selected. iMOEA/D is tested on some benchmark problems, and various utility functions are used to simulate the DM's responses. The experimental studies show that iMOEA/D can handle the preference information very well and successfully converge to the expected preferred regions.

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

preference incorporation
evolutionary algorithm
decision making
decision maker
interaction


Greedy random adaptive memory programming search for the capacitated clustering problem In the capacitated clustering problem (CCP), a given set of n weighted points is to be partitioned into p clusters such that, the total weight of the points in each cluster does not exceed a given cluster capacity. The objective is to find a set of p centers that minimises the total scatter of points allocated to these centers. In this paper, we propose a merger of Greedy Random Adaptive Search Procedure (GRASP) and Adaptive Memory Programming (AMP) into a new GRAMPS framework for the CCP. A learning process is kept in charge of tracking information on the best components in an elite set of GRAMPS solutions. The information are strategically combined with problem-domain data to restart the construction search phase. At early stage of constructions, priorities are given to problem-domain data and progressively shifted towards generated information as the learning increases. GRAMPS is implemented with an efficient local search descent based on a restricted ?-interchange neighbourhood. Extensive experiments are reported on on a standard set of bench-marks from the literature and on a new set of large instances. The results show that GRAMPS has an efficient learning mechanism and is competitive with the existing methods in the literature.

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

capacitated clustering (p-median) problem

greedy randomized adaptive search procedure

guided construction search metaheuristic


A Study on Adaptive Time Token Priority-Based Queuing Scheme Several famous priority-based queuing schemes operated in a gateway to support differentiated services among internet traffic. Examining packet forwarding operations in these queueing schemes, they only support a priority-based service either in a packet enqueuing process or in a packet dequeuing process. If a queuing scheme can support priority-based services in both packet enqueuing/dequeuing processes; it would enhance differentiated service performance for internet traffic. This study proposes a priority-based queuing scheme with an adaptive time token allotment measure to support a differentiated packet forwarding process for different types of IP traffic both in packet enqueuing/dequeuing processes. Depending on packet sizes and packet forwarding priorities of IP traffic, the proposed queuing scheme assigns fix and adaptive time token thresholds dynamically to logical queuing buffers separately. With assigned time tokens, logical queuing buffers allow arrival IP packets to be enqueued in a differentiated way. Moreover, the proposed queuing scheme uses a transferred WRR dequeuing measure to enhance a differentiated packet forwarding process. The simulation results show that the proposed queuing scheme supports a differentiated packet forwarding process for different types of IP traffic. The differentiated packet forwarding performance supported by the proposed scheme is close to the IETF DiffServ scheme; this result shows that the proposed scheme can support differentiated packet forwarding performance for different types of IP traffic with a lower operation cost.

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

adaptive time token
differentiated service
packet forwarding performance


the daylight blocking optical stereo see-through hmd In this paper we present an innovative daylight blocking optical stereo see-through HMD. Its outstanding capability is to pixelwise block incident daylight before super-imposing virtual content on the real scene. By doing so the device allows to seamlessly mix real and virtual content without the well-known effects of other optical see-through displays where real content will always shine through virtual content. To our knowledge related work on daylight blocking displays is very limited and we present the first commercial HMD available.

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

mixed reality
head mounted displays
augmented reality
mobility
virtual reality
interaction


post-game estimation of game client rtt and hop count distributions In first person shooter (FPS) games the round trip time (RTT) between a client and server influences player decisions on which server to join. Game servers do not accurately log the RTT of potential clients who only probed the server. We describe a simple, active method of estimating the RTT and hop-count between server and client when armed only with each client's IP address. For rough approximations this scheme works days or weeks after client IP addresses were collected. We illustrate using data gathered from a Wolfenstein Enemy Territory server operating in Australia, providing after-the-fact comparisons between the RTT and hop-count distributions of clients who probe a server versus clients who actually join a server and play.

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


Response time in data broadcast systems: Mean, variance and tradeoff Data broadcast has been suggested as a promising method of information dissemination [2,33]. In such an environment, the information server cannot afford to serve the requests from a large population of users individually. Instead, the server uses a broadcast channel to deliver information to all users. A single transmission of a data item satisfies all pending requests for that item. The response time of a request depends on the broadcast time of the desired data item, which is scheduled by the server according to the overall demands for various data items. Therefore, the response time may vary in a large range. We argue that, in addition to mean response time, the variance of response time should also be taken into account by the broadcast scheduler. In this paper, we address the issue of variance optimization in regard to response time. Building on our previous research on mean response time optimization, we propose an algorithm which can minimize the variance of response time. Furthermore, we evaluate an algorithm that facilitates a tradeoff between the mean and variance of response time. Numerical examples that illustrate the performance of our algorithms are also presented.

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

mean response time
variance of response time

data broadcasting
broadcast scheduling algorithm
performance evaluation


device hypervisors This paper explores the opportunities and challenges in using virtualization technologies in embedded devices. The uses and requirements that have shaped the current generation of Hypervisors for data centers and server farms are introduced. The paper then explores how Multicore processors and Hypervisors can be used to design embedded devices with more features, higher performance and lower power consumption. However, use in a wide range of embedded devices requires new Hypervisor capabilities. These new requirements are analyzed. Finally, the paper looks into areas of Hypervisor design related to meeting the requirements of embedded devices.

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

general purpose operating system
real-time
real-time operating system
separation
consolidation


a scientific visualization synthesizer We describe methods for displaying scientific data using textures and raster operations rather than geometric techniques. The flexibility and simplicity of raster operations allow a greater choice of visualization techniques with only a small set of basic operations. In addition, texture mapping techniques will be shown that allow the representation of several variables simultaneously, without a high degree of clutter. The combination of traditional geometric techniques, image composition techniques and image rendering techniques can be integrated into a single framework for the display of scientific data. This paper presents a system for generating and operating on textures and images for the purposes of scientific visualization. The advantages of using such a system are demonstrated through the use of examples. In particular, the development of bump maps for vector filters and contour lines is demonstrated.

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

framework
use
examples
maps
flexibility
texture mapping
representation
paper
visualization
rendering
data
image

developer
imaging
filtering
compositing
combinational
variability
method
vectorization
texture
systems
operability
contouring
scientific visualiztion
integrability


Reduced basis decomposition: A certified and fast lossy data compression algorithm Dimension reduction is often needed in the area of data mining. The goal of these methods is to map the given high-dimensional data into a low-dimensional space preserving certain properties of the initial data. There are two kinds of techniques for this purpose. The first, projective methods, builds an explicit linear projection from the high-dimensional space to the low-dimensional one. On the other hand, the nonlinear methods utilizes nonlinear and implicit mapping between the two spaces. In both cases, the methods considered in literature have usually relied on computationally very intensive matrix factorizations, frequently the Singular Value Decomposition (SVD). The computational burden of SVD quickly renders these dimension reduction methods infeasible thanks to the ever-increasing sizes of the practical datasets. In this paper, we present a new decomposition strategy, Reduced Basis Decomposition (RBD), which is inspired by the Reduced Basis Method (RBM). Given X X the high-dimensional data, the method approximates it by Y T ( ? X ) with Y Y being the low-dimensional surrogate and T T the transformation matrix. Y Y is obtained through a greedy algorithm thus extremely efficient. In fact, it is significantly faster than SVD with comparable accuracy. T T can be computed on the fly. Moreover, unlike many compression algorithms, it easily finds the mapping for an arbitrary out-of-sample vector and it comes with an error indicator certifying the accuracy of the compression. Numerical results are shown validating these claims.

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 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 B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
reduced basis method
singular value decomposition
greedy algorithm


An online energy-efficient routing protocol with traffic load prospects in wireless sensor networks In wireless sensor networks, many routing algorithms are designed to implement energy-efficient mechanisms. Among those, some focus on maximising an important performance index called network lifetime, which is the number of messages successfully delivered in the network before a failure. In this paper, we propose a new online algorithm taking the goal of prolonging network lifetime. When making routing decisions, our algorithm, named Traffic-Aware Energy Efficient (TAEE) routing protocol, utilises prospective traffic load information for further load balance, in addition to power-related metrics used in an enhanced cost function in calculating least cost paths. An algorithm for automatic parameter adaption is also described. To better accommodate to large-scale sensor networks, we further introduce a random grouping scheme which enables hierarchical TAEE routing to run within and cross the dynamically formed groups to reduce computation and routing overhead, while maintaining global energy efficiency. Our simulation shows that compared with the leading power-aware Max-min zP(min) protocol, the TAEE protocol generates better performance in terms of network lifetime without jeopardising network capacity.

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

lifetime maximisation
online energy-efficient routing
traffic load awareness


An Authentication Framework for Wireless Sensor Networks Using Identity-Based Signatures: Implementation and Evaluation In Wireless Sensor Networks (WSNs), authentication is a crucial security requirement to avoid attacks against secure communication, and to mitigate against DoS attacks exploiting the limited resources of sensor nodes. Resource constraints of sensor nodes are hurdles in applying strong public key cryptographic based mechanisms in WSNs. To address the problem of authentication in WSNs, we propose an efficient and secure framework for authenticated broadcast/multicast by sensor nodes as well as for outside user authentication, which utilizes identity based cryptography and online/offline signature (OOS) schemes. The primary goals of this framework are to enable all sensor nodes in the network, firstly, to broadcast and/or multicast an authenticated message quickly; secondly, to verify the broadcast/multicast message sender and the message contents; and finally, to verify the legitimacy of an outside user. This paper reports the implementation and experimental evaluation of the previously proposed authenticated broadcast/multicast by sensor nodes scheme using online/offline signature on TinyOS and MICA2 sensor nodes.

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

wireless sensor network
online/offline signatures


addressing problem frame concerns via coloured petri nets and graphical animation To address a frame concern in Jackson's Problem Frames, we must make appropriate descriptions of: (1) the problem domain; (2) the requirements; (3) the specification of the machine. Based on these descriptions, we must give a convincing argument that the given domain properties and the machine specification together entail that the requirements are fulfilled. In this paper, we demonstrate how to address certain frame concerns with the use of the formal modelling language Coloured Petri Nets (CPN). Problem domain description and machine specification are brought together in a CPN model, which is augmented with a graphical animation. The CPN model is executable and we simulate it to address frame concerns. We illustrate the approach on the elevator controller example.

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


Research involving women and health in the Medline database, 1965-2005: co-term analysis and visualization of main lines of research This paper shows the main lines of research concerning health and women, as registered in the Medline database, broken down into four 10-year periods: 1965-1974, 1975-1984, 1985-1994, and 1995-2005. The units of analysis used were the Medline "MeSH'' major terms, processed by means of co-term analysis. For graphic representation, the social network approach was used, with pruning performed by Pathfinder Networks (PFNET), so as to concentrate the displays. Factor analysis was used to group the descriptors and identify the main lines of research involving health and women. The results show that research on Health and Women has increased and undergone significant changes over the past 40 years, yet such studies are not given due importance.

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


An economist's perspective on multi-agent learning We comment on the Shoham, Powers, and Grenager survey of multi-agent learning and game theory, emphasizing that some of their categories are important for economics and others are not. We also try to correct some minor imprecisions in their discussion of the economics literature on learning in games. (c) 2007 Published by Elsevier B.V.

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


Developing a parametric approach for 3D modelling software The creation of 3D models is generally considered by newcomers to be a difficult activity requiring a number of skills and considerable practice. This paper describes work in the INHERIT project which aims to address these issues by providing a 3D modelling tool set which is easy to use, requiring few skills and little practice. This is achieved by the development of software tools which are customised to build particular types of model. The key aspect of these tools is the treatment of the underlying data of the 3D model as a tree structure Of nodes which consist of parameterised representations of the components of the object being modelled The tools then automatically generate the graphics primitives that enable the visualisation and interaction with the object. This paper describes the implementation of the first tool created following this principle which enables schoolchildren to model church structures.

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

information visualization
interactive 3d graphics
vrml
cultural heritage
xml


Extending the understanding of mobile banking adoption: When UTAUT meets TTF and ITM In IT business value literature, mBanking has gained attention by both academia and practice. mBanking adoption presents an increasing trend in Portugal. We propose a framework which integrates UTAUT model with TTF and initial trust. Including TTF and ITM adds a stronger power to predict intention to adopt.

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


Electric-pulse-induced resistive switching and possible superconductivity in the Mott insulator GaTa4Se8 There is accumulated evidence today that an electric pulse can drastically modify the physical properties of correlated materials. An electric pulse was shown for example to induce an insulator-to-metal transition in manganites or in organic Mott insulators. We report here the first experimental evidence of a non-volatile electric pulse-induced insulator-to-metal transition and possible superconductivity in the Mott insulator GaTa4Se8. This resistive switching is concomitant to an electronic phase separation induced by the pulse. This phenomena most probably differs from the thermal, electronic injection or ionic diffusion processes explaining the resistive switching in materials foreseen for non-volatile memory (RRAM) applications.

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

resistive switching
superconductivity
mott insulator


A comparison of line extraction algorithms using 2D range data for indoor mobile robotics This paper presents an experimental evaluation of different line extraction algorithms applied to 2D laser scans for indoor environments. Six popular algorithms in mobile robotics and computer vision are selected and tested. Real scan data collected from two office environments by using different platforms are used in the experiments in order to evaluate the algorithms. Several comparison criteria are proposed and discussed to highlight the advantages and drawbacks of each algorithm, including speed, complexity, correctness and precision. The results of the algorithms are compared with ground truth using standard statistical methods. An extended case study is performed to further evaluate the algorithms in a SLAM application.

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


Nonlinear Multilayered Representation of Graph-Signals We propose a nonlinear multiscale decomposition of signals defined on the vertex set of a general weighted graph. This decomposition is inspired by the hierarchical multiscale (BV,L 2) decomposition of Tadmor, Nezzar, and Vese (Multiscale Model. Simul. 2(4):554579, 2004). We find the decomposition by iterative regularization using a graph variant of the classical total variation regularization (Rudin et al, Physica D 60(14):259268, 1992). Using tools from convex analysis, and in particular Moreaus identity, we carry out the mathematical study of the proposed method, proving the convergence of the representation and providing an energy decomposition result. The choice of the sequence of scales is also addressed. Our study shows that the initial scale can be related to a discrete version of Meyers norm (Meyer, Oscillating Patterns in Image Processing and Nonlinear Evolution Equations, 2001) which we introduce in the present paper. We propose to use the recent primal-dual algorithm of Chambolle and Pock (J. Math. Imaging Vis. 40:120145, 2011) in order to compute both the minimizer of the graph total variation and the corresponding dual norm. By applying the graph model to digital images, we investigate the use of nonlocal methods to the multiscale decomposition task. Since the only assumption needed to apply our method is that the input data is living on a graph, we are also able to tackle the task of adaptive multiscale decomposition of irregularly sampled data sets within the same framework. We provide in particular examples of 3-D irregular meshes and point clouds decompositions.

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

signal decomposition
multiscale representations
nonlocal total variation
weighted graphs
hierarchical models


The trade-off between taxi time and fuel consumption in airport ground movement Environmental issues play an important role across many sectors. This is particularly the case in the air transportation industry. One area which has remained relatively unexplored in this context is the ground movement problem for aircraft on the airports surface. Aircraft have to be routed from a gate to a runway and vice versa and a key area of study is whether fuel burn and environmental impact improvements will best result from purely minimising the taxi times or whether it is also important to avoid multiple acceleration phases. This paper presents a newly developed multi-objective approach for analysing the trade-off between taxi time and fuel consumption during taxiing. The approach consists of a combination of a graph-based routing algorithm and a population adaptive immune algorithm to discover different speed profiles of aircraft. Analysis with data from a European hub airport has highlighted the impressive performance of the new approach. Furthermore, it is shown that the trade-off between taxi time and fuel consumption is very sensitive to the fuel-related objective function which is used.

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

airport operations
graph-based approach
multi-objective routing


Complexity results for the basic residency scheduling problem Upon graduation from medical school, medical students join residency programs to complete their clinical training and fulfill specialty board certification requirements. During residency, they are assigned several years of clinical rotations, where they work under the supervision of physician faculty in a variety of different settings, to ensure that they gain the requisite training prior to beginning independent practice. These rotations typically last a short period of time, and the problem of determining a schedule for all the residents in a program can be quite tedious. In this paper, a basic residency scheduling problem that produces a 1-year schedule is defined, and a proof of NP-completeness is presented. Furthermore, a specific model of the residency scheduling program for the internal medicine residency program at the University of Illinois College of Medicine at Urbana-Champaign is studied. Finally, a method for determining alternate optima is presented.

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

medical school
residency program
alternate optima


Mining customer knowledge for tourism new product development and customer relationship management In recent years tourism has become one of the fastest growing sectors of the world economy and is widely recognized for its contribution to regional and national economic development. Tourism product design and development have become important activities in many areas/countries as a growing source of foreign and domestic earnings. On the other hand, customer relationship management is a competitive strategy that businesses need in order to stay focused on the needs of their customers and to integrate a customer-oriented approach throughout the organization. Thus, this paper uses the Apriori algorithm as a methodology for association rules and clustering analysis for data mining, which is implemented for mining customer knowledge from the case firm, Phoenix Tours International, in Taiwan. Knowledge extraction from data mining results is illustrated as knowledge patterns, rules, and knowledge maps in order to propose suggestions and solutions to the case firm for new product development and customer relationship management.

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

new product development
data mining
customer relationship management
apriori algorithm
clustering analysis


Analytical solution of electrohydrodynamic flow and transport in rectangular channels: inclusion of double layer effects Upscaling electroosmosis in porous media is a challenge due to the complexity and scale-dependent nonlinearities of this coupled phenomenon. "Pore-network modeling" for upscaling electroosmosis from pore scale to Darcy scale can be considered as a promising approach. However, this method requires analytical solutions for flow and transport at pore scale. This study concentrates on the development of analytical solutions of flow and transport in a single rectangular channel under combined effects of electrohydrodynamic forces. These relations will be used in future works for pore-network modeling. The analytical solutions are valid for all regimes of overlapping electrical double layers and have the potential to be extended to nonlinear Boltzmann distribution. The innovative aspects of this study are (a) contribution of overlapping of electrical double layers to the Stokes flow as well as Nernst-Planck transport has been carefully included in the analytical solutions. (b) All important transport mechanisms including advection, diffusion, and electromigration have been included in the analytical solutions. (c) Fully algebraic relations developed in this study can be easily employed to upscale electroosmosis to Darcy scale using pore-network modeling.

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

electroosmosis
rectangular channel
analytical solution


A Lagrangian approach for quantum-mechanical electrostatic analysis of deformable silicon nanostructures Semiconductor mechanical components of nanoelectromechanical systems (NEMS) typically undergo deformations when subjected to electrostatic forces. Computational analysis of electrostatic NEMS requires an electrostatic analysis to compute the electrostatic forces acting on the nanomechanical structures and a mechanical analysis to compute the deformation of the nanomechanical structures. Typically, the mechanical analysis is performed by a Lagrangian approach using the undeformed position of the structures. However, the electrostatic analysis is performed by using the deformed position of the nanostructures. The electrostatic analysis on the deformed position of the nanostructures requires updating the geometry of the structures during each iteration. In this paper, based on a recently proposed hybrid BIE/Poisson/Schrdinger approach, we propose Lagrangian formulations for the BIE/Poisson/Schrdinger equations and solve the coupled Lagrangian BIE/Poisson/Schrdinger's equations self-consistently using the undeformed position of the semiconductors to compute the charge distributions on the deformed semiconductors. The proposed approach eliminates the requirement of updating the geometry and, consequently, significantly simplifies the procedure of coupled electromechanical analysis of NEMS.

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


An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs In this paper, we provide a necessary infrastructure to define an abstract state exploration in the HOL theorem prover. Our infrastructure is based on a deep embedding of the Multiway Decision Graphs (MDGs) theory in HOL. MDGs generalize Reduced Ordered Binary Decision Diagrams (ROBDDs) to represent and manipulate a subset of first-order logic formulae. The MDGs embedding is based on the logical formulation of an MDG as Directed Formulae (DF). Then, the MDGs operations are defined and the correctness proof of each operation is provided. The MDG reachability algorithm is then defined as a conversion that uses our MDG theory within HOL. Finally, a set of experimentations over benchmark circuits has been conducted to ensure the applicability and to measure the performance of our approach.

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

hol theorem prover
multiway decision graphs
correctness


FUME SUPPRESSION AGENTS FOR ENVIRONMENTAL-FRIENDLY ASPHALT PAVEMENT According to the impact of fumes generated by asphalt pavement construction under poor air ventilation conditions on environment and operators at pavement construction and mechanism of asphalt fumes generation this article provides the method of addition of addictives in asphalt to suppress fumes due to asphalt pavement construction. Through in house test the variation law of asphalt fumes with heating temperature and heating time. The result shows that with an increase of heating time, the yield of asphalt fumes appears increasing tendency. During the initial stage, the smoke yielding rate is fast; in later stage the variation slows down; and finally the variation becomes stable. With higher heating temperature, the yield of asphalt fumes is greater. Partial addictives are selected for smoke suppression effect test from flame retardant agent, plastic smoke suppression agent, physical adsorbent, polymer modified agent and aging resistant agent. SBS and nanometer calcium carbonate compound type modifying agent of better smoke suppression effects are selected for test and asphalt fumes is reduced around 29.0% in total.

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


Strategies for the simultaneous optimization of the structure and the process variables of a protein production plant Process performance models for a multiproduct batch protein plant are used to exploit alternative strategies in the optimization of both the process variables and the structure of the plant. Simple process performance models are used to describe the unit operations, which renders explicit expressions for the size and time factor model in the design of batch plants. In the proposed approach the process variables are optimized regardless the plant structure constraints, which are left as a posterior decision. This optimization is done in a single product-free intermediate storage (SP-FIS) scenario, unbiased with any plant structure. The approach is compared to the case of recipe values for the process variables and to the best optimal solution for the nonconvex mixed integer nonlinear program (MINLP), which arises when simultaneously optimizing the structure and the process variables. This last optimization model is hard to solve and its global solution remains as an open problem. The proposed approach generates solutions Very close to the ones obtained from nonconvex MINLP and is quite superior than simply resorting to recipes. We also study the role of process variables in this approach. It is found that they behave as in continuous processes by trading off cost components, with a smooth dependence on the overall cost. Moreover, for feasible designs that include the size and time constraints that correspond to the plant structure, the process variables accommodate the size and time factors to reduce idle rimes and equipment under-occupancy. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

simultaneous optimization
structure
process variables
protein production plant


Classification of complete blood count and haemoglobin typing data by a C4.5 decision tree, a nave Bayes classifier and a multilayer perceptron for thalassaemia screening This article presents the classification of blood characteristics by a C4.5 decision tree, a nave Bayes classifier and a multilayer perceptron for thalassaemia screening. The aim is to classify eighteen classes of thalassaemia abnormality, which have a high prevalence in Thailand, and one control class by inspecting data characterised by a complete blood count (CBC) and haemoglobin typing. Two indices namely a haemoglobin concentration (HB) and a mean corpuscular volume (MCV) are the chosen CBC attributes. On the other hand, known types of haemoglobin from six ranges of retention time identified via high performance liquid chromatography (HPLC) are the chosen haemoglobin typing attributes. The stratified 10-fold cross-validation results indicate that the best classification performance with average accuracy of 93.23% (standard deviation=1.67%) and 92.60% (standard deviation=1.75%) is achieved when the nave Bayes classifier and the multilayer perceptron are respectively applied to samples which have been pre-processed by attribute discretisation. The results also suggest that the HB attribute is redundant. Moreover, the achieved classification performance is significantly higher than that obtained using only haemoglobin typing attributes as classifier inputs. Subsequently, the nave Bayes classifier and the multilayer perceptron are applied to an additional data set in a clinical trial which respectively results in accuracy of 99.39% and 99.71%. These results suggest that a combination of CBC and haemoglobin typing analysis with a nave Bayes classifier or a multilayer perceptron is highly suitable for automatic thalassaemia screening.

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

complete blood count
haemoglobin typing
multilayer perceptron
nave bayes classifier
thalassaemia


A direct simulation method for flows with suspended paramagnetic particles A direct numerical simulation method based on the Maxwell stress tensor and a fictitious domain method has been developed to solve flows with suspended paramagnetic particles. The numerical scheme enables us to take into account both hydrodynamic and magnetic interactions between particles in a fully coupled manner. Particles are assumed to be non-Brownian with negligible inertia. Rigid body motions of particles in 2D are described by a rigid-ring description implemented by Lagrange multipliers. The magnetic force, acting on the particles due to magnetic fields, is represented by the divergence of the Maxwell stress tensor, which acts as a body force added to the momentum balance equation. Focusing on two-dimensional problems, we solve a single-particle problem for verification. With the magnetic force working on the particle, the proper number of collocation points is found to be two points per element. The convergence with mesh refinement is verified by comparing results from regular mesh problems with those from a boundary-fitted mesh problem as references. We apply the developed method to two application problems: two-particle interaction in a uniform magnetic field and the motion of a magnetic chain in a rotating field, demonstrating the capability of the method to tackle general problems. In the motion of a magnetic chain, especially, the deformation pattern at break-up is similar to the experimentally observed one. The present formulation can be extended to three-dimensional and viscoelastic flow problems. (C) 2008 Elsevier Inc. All rights reserved.

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

maxwell stress tensor
fictitious domain method

magnetic particle
finite element method
rotating magnetic field


A comparison of 3D shape retrieval methods based on a large-scale benchmark supporting multimodal queries ? Build a large-scale 3D shape retrieval benchmark that supports multi-modal queries. Evaluate the 26 3D shape retrieval methods using 3 types of metrics. Solicit and identify state-of-the-art methods and promising related techniques. Perform detailed analysis on diverse methods w.r.t accuracy and efficiency. Make benchmark and evaluation tools freely available to the community.

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

large-scale benchmark
unified
performance evaluation
query-by-model
query-by-sketch
shrec


The role of free work identity in viscous compressible flows Some consequences of energy identity are discussed, on assumption that there exists a neighborhood of S-b of radius eta where the total energy is a minimum. For fluid phase transition the neighborhood where the rest state S-b results in isolated minimum for internal energy has finite radius r that will restrict to zero as basic density rho(b) approaches a critical value rho(*). Nonlinear asymptotic stability for barotropic viscous fluids is proved by use of free work identity which enables us to provide a stronger generalized energy inequality. The stability theorem is proved in a class of regular unsteady flows which are supposed to exist. Nonlinear instability for fluid phase change with zero external forces is proved. The goal is reached assuming by absurdum that rho is stable in L-infinity norm. (C) 2006 Elsevier Ltd. All rights reserved.

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

nonlinear stability
compressible fluids
direct methods
parabolic-hyperbolic equations


the quiver system The Quiver (QUIz VERification) System is an Internet server for building, maintaining, and administering programming quizzes. It is similar to the online judges used for programming contests but differs in that it targets the classroom use of programming quizzes as a teaching aid and evaluation tool. It can provide very detailed feedback regarding quiz behavior so that the student can debug her program. This system is developed as part of the grant "Intra-Curriculum Software Engineering Education" funded by the National Science Foundation (DUE 0127439).

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


Utilizing RxNorm to support practical computing applications: Capturing medication history in live electronic health records RxNorm was utilized as the basis for direct-capture of medication history data in a live EHR system deployed in a large, multi-state outpatient behavioral healthcare provider in the United States serving over 75,000 distinct patients each year across 130 clinical locations. This tool incorporated auto-complete search functionality for medications and proper dosage identification assistance. The overarching goal was to understand if and how standardized terminologies like RxNorm can be used to support practical computing applications in live EHR systems. We describe the stages of implementation, approaches used to adapt RxNorms data structure for the intended EHR application, and the challenges faced. We evaluate the implementation using a four-factor framework addressing flexibility, speed, data integrity, and medication coverage. RxNorm proved to be functional for the intended application, given appropriate adaptations to address high-speed input/output (I/O) requirements of a live EHR and the flexibility required for data entry in multiple potential clinical scenarios. Future research around search optimization for medication entry, user profiling, and linking RxNorm to drug classification schemes holds great potential for improving the user experience and utility of medication data in EHRs.

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

rxnorm
medication history
search optimization

electronic health record
interoperability
unified medical language system


Enabling the deployment of mobile services for end-users: the SMS approach Service provision in mobile environments is nowadays moving toward easiness and openness. The end-users role in this procedure can be supported through platforms that encourage users participation. This is critical toward the success of community-oriented service platforms that rely on end-user-generated content. The current paper describes an approach toward the participation of non-expert users in the development, deployment and provision of mobile services referred as Simple Mobile Services. The solution has been developed in the framework of the SMS project. The overall management is supported by the service-oriented structure of the SMS system infrastructure. The service authoring is facilitated through the SMS Authoring Wizard giving users the opportunity to create and deploy services inspecting them instantly on their mobile terminals.

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

service-oriented computing
service creation


DECISION-SUPPORT SYSTEMS - LEARNING FROM VISUAL INTERACTIVE MODELING The two research fields of, in the first instance, Decision Support Systems (DSS) and then secondly, Visual Interactive Modelling (VIM) have developed by mostly independent research. Yet these two fields seek many common goals. The VIM field has been seen as a largely technical development aiding certain Operational Research methods. On the other hand DSS have developed in the wider context of a recognition of a need to provide directed and helpful information to support decision making. In this paper we develop, firstly, an understanding of VIM in the context of current thinking on DSS. Ostensibly, it would seem that VIM is simply a DSS with a sophisticated user interface. However, we argue that VIM is an approach which has at its core an ability to allow decision makers to learn about their own subjective values while modelling technical issues. We suggest that embracing this learning objective at the design stage will enhance the power of Visual Interactive Models in particular and Decision Support Systems in general.

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

decision support systems
visual interactive modeling
learning


Development of aprepitant, the first neurokinin-1 receptor antagonist for the prevention of chemotherapy-induced nausea and vomiting Chemotherapy can be a life-prolonging treatment for many cancer patients, but it is often associated with profound nausea and vomiting that is so distressing that patients may delay or decline treatment to avoid these side effects. EMEND (aprepitant) is the first and only neurokinin-1 (NK-1) receptor antagonist available on the market for the prevention of acute and delayed chemotherapy-induced nausea and vomiting (CINV). Aprepitant acts centrally at NK-1 receptors in vomiting centers within the central nervous system to block their activation by substance P released as an unwanted consequence of chemotherapy. By controlling nausea and vomiting, EMEND helps improve patients daily living and their ability to complete multiple cycles of chemotherapy. The development of aprepitant included a novel nanoparticle formulation to optimize oral absorption and innovative chemistry to discover a prodrug form suitable for intravenous administration to improve compliance and convenience for healthcare professionals and cancer patients.

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


Computing intersection numbers between abelian varieties associated to subspaces of modular forms We derive a formula for the intersection number between abelian varieties associated to complementary subspaces of the space of cuspidal modular forms. This formula can be used for computations using modular symbols, and we describe an implementation.

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

modular forms
abelian varieties
intersection number


A dynamic model selection strategy for support vector machine classifiers The Support Vector Machine (SVM) is a very powerful technique for general pattern recognition purposes but its efficiency in practice relies on the optimal selection of hyper-parameters. A nave or ad hoc choice of values for these can lead to poor performance in terms of generalization error and high complexity of the parameterized models obtained in terms of the number of support vectors identified. The task of searching for optimal hyper-parameters with respect to the aforementioned performance measures is the so-called SVM model selection problem. In this paper we propose a strategy to select optimal SVM models in a dynamic fashion in order to address this problem when knowledge about the environment is updated with new observations and previously parameterized models need to be re-evaluated, and in some cases discarded in favor of revised models. This strategy combines the power of swarm intelligence theory with the conventional grid search method in order to progressively identify and sort out potential solutions using dynamically updated training datasets. Experimental results demonstrate that the proposed method outperforms the traditional approaches tested against it, while saving considerable computational time.

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

support vector machines
particle swarm optimization
dynamic optimization


Analytic real-time analysis and timed automata: a hybrid methodology for the performance analysis of embedded real-time systems This paper presents a compositional and hybrid approach for the performance analysis of distributed real-time systems. The developed methodology abstracts system components by either flow-oriented and purely analytic descriptions or by state-based models in the form of timed automata. The interaction among the heterogeneous components is modeled by streams of discrete events. In total this yields a hybrid framework for the compositional analysis of embedded systems. It supplements contemporary techniques for the following reasons: (a) state space explosion as intrinsic to formal verification is limited to the level of isolated components; (b) computed performance metrics such as buffer sizes, delays and utilization rates are not overly pessimistic, because coarse-grained analytic models are used only for components that conform to the stateless model of computation. For demonstrating the usefulness of the presented ideas, a corresponding tool-chain has been implemented. It is used to investigate the performance of a two-staged computing system, where one stage exhibits state-dependent behavior that is only coarsely coverable by a purely analytic and stateless component abstraction. Finally, experiments are performed to ascertain the scalability and the accuracy of the proposed approach.

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

real-time calculus
hard real-time systems


An interactive fuzzy satisficing method based on fractile criterion optimization for multiobjective stochastic integer programming problems In this paper, we focus on multiobjective integer programming problems involving random variable coefficients in objective functions and constraints. Using the concept of chance constrained conditions, such multiobjective stochastic integer programming problems are transformed into deterministic ones based on the fractile criterion optimization model. As a fusion of stochastic programming and fuzzy one, we introduce fuzzy goals representing the ambiguity of the decision makers judgments into them and define M-? ? -efficiency, a new concept of efficient solution, as a fusion of stochastic approaches and fuzzy ones. Then, we construct an interactive fuzzy satisficing method using genetic algorithms to derive a satisficing solution for the decision maker which is guaranteed to be M-? ? -efficient by updating the reference membership levels. Finally, the efficiency of the proposed method is demonstrated through numerical experiments.

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

stochastic programming
integer programming
fractile criterion optimization
efficient solution

multiobjective programming
fuzzy programming


An empirical study of managers usage intention in BI In a changing business environment, data within and around organizations rapidly accumulate. In recent years, many organizations have implemented business intelligence (BI) to manage and refine the vast stocks of data. The effective use of BI can support managers to make faster and better decisions. The goal of this study is to investigate how to increase a managers intention to read information and to create reports. Based on the technology acceptance model, a research model is developed and tested to assess the factors (i.e., usefulness and ease of use) affecting a managers intention to use BI. In addition, the relationship between the intention to read information and the intention to create reports is linked using Dholakia and Bagozzi (D&B) model. A survey of 271 managers supports the proposed model. The empirical results show that the usefulness of BI directly and indirectly affects the intention to read information. Both the reading and creating interfaces of BI affect the intention to read information and the intention to create reports, respectively. The intention to read information positively and significantly affects the intention to create reports. Given the empirical findings, this study provides theoretical and managerial insights for organizations and managers.

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

business intelligence
technology acceptance model

decision making
d&b model
behavioral intention


Session typing and asynchronous subtyping for the higher-order ?-calculus This paper proposes a session typing system for the higher-order ?-calculus (the HO?-calculus) with asynchronous communication subtyping, which allows partial commutativity of actions in higher-order processes. The system enables two complementary kinds of optimisation, mobile code and asynchronous permutation of session actions, within processes that utilise structured, typed communications. Our first contribution is a session typing system for the HO?-calculus using techniques from the linear ?-calculus. Integration of arbitrary higher-order code mobility and sessions leads to technical difficulties in type soundness, because linear usage of session channels and completion of sessions are required. Our second contribution is to introduce an asynchronous subtyping system which uniformly deals with type-manifested asynchrony and linear functions. The most technical challenge for subtyping is to prove the transitivity of the subtyping relation. We also demonstrate the expressiveness of our typing system with an e-commerce example, where optimised processes can interact respecting the expected sessions.

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

session types
the higher-order ?-calculus
communication optimisation
linear typing


Membership maximization prioritization methods for fuzzy analytic hierarchy process Fuzzy analytic hierarchy process (FAHP) has increasingly been applied in many areas. Extent analysis method is the popular tool for prioritization in FAHP, although significant technical errors are identified in this study. With addressing the errors, this research proposes membership maximization prioritization methods (MMPMs) using different membership functions as the novel solutions. As a lack of research about effectiveness measurement on the crisp/fuzzy prioritization methods, this study proposes membership fitness index to evaluate the effectiveness of the prioritization methods. Comparisons with the other popular fuzzy/crisp prioritization methods including modified fuzzy preference programming, Direct least squares, and Eigen value are conducted and analyses indicate that MMPMs lead to much more reliable result in view of membership fitness index. A numerical example demonstrates the usability of MMPMs for FAHP, and thus MMPMs can effectively be applied to various decision analysis applications.

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

fuzzy analytic hierarchy process
decision analysis

fuzzy pairwise comparison
membership function
fuzzy optimization


A tele-home care system exploiting the DVB-T technology and MHP Objectives: The aim of this research work is the development of a low-cost system for telemedicine based on the DVB-T technology. The diffusion of DVB-T standard and the low cost of DVB-T set-top boxes bring the vision of a capillary distribution of tele-home care monitoring systems with easy-to-use patient's interface. Methods: Exploiting the potentiality of the DVB-T set-top box, we transformed it into an "on-demand tele-home care interface". The Xlet we developed is able to govern the functionality of an external microcontroller-based unit for the acquisition of the bio-signals of interest. The uplink connection is used to send the exam results to a remote care center. Results. The Xlet providing the patient interface on the set-top box is uploaded by a DVB-T broadcaster without any intervention in the patient's home. A prototypal low-cost base station for the acquisition of the patient's signals (1-lead ECG) has been developed. It is able to be connected to the set-top box via an infrared link. A smart-card-based system is in charge for the customization of the Xlet for every patient. Conclusions. The proposed system, based on a currently widespread infrastructure, is able to allow the patients monitoring from home without any installation procedure. Even untrained (or elderly) people can easily use such system due to their practice with the basic DVB-T home-entertainment equipments.

O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 time-varying transformer outage model for on-line operational risk assessment The failure probabilities of system components may vary with changes in the operating conditions. Performing a probabilistic risk assessment in real-time is challenging, since component failure probabilities are difficult to predict. Accordingly, this paper introduces a delayed semi-Markov process that incorporates real-time data from advanced sensors, as a means of efficiently calculating time-varying or condition-based failure probabilities. To demonstrate the feasibility of the procedure, a time-varying transformer outage model with numerical examples is presented. In the proposed technique, an analytic random model is developed to accommodate the impact of real-time dissolved gas analysis data, as well as other conditions pertaining to the failure probabilities of system components.

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

time-varying outage model
delayed semi-markov process
failure rate


Making Diversity Enhancement Based on Multiple Classifier System by Weight Tuning This article presents a new method to construct multiple classifier system by making diverse base classifiers using weight tuning. In the method presented, base classifiers are multilayer perceptions which creates diverse base classifiers using a three-step procedure. In the first step, base classifiers are trained for acceptable accuracy. In the second step, a weight tuning process tunes their weights such that each one can distinguish one class of input data from the others with highest possible accuracy. An evolutionary method is used to optimize efficiency of each base classifier to distinguish one class of input data in this step. In the third step, a new method combines the results of the base classifiers. As diversity is measured and monitored throughout the entire procedure, it is measured using a confusion matrix. Superiority of the proposed method is discussed using several known classifier fusion methods and known benchmark datasets.

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

combining classifiers
classifier diversity
multiple classifier system diversity


Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction The capacitated clustering problem (CCP) has been studied in a wide range of applications. In this study, we investigate a challenging CCP in computational biology, namely, sibling reconstruction problem (SRP). The goal of SRP is to establish the sibling relationship (i.e., groups of siblings) of a population from genetic data. The SRP has gained more and more interests from computational biologists over the past decade as it is an important and necessary keystone for studies in genetic and population biology. We propose a large-scale mixed-integer formulation of the CCP for SRP that is based on both combinatorial and statistical genetic concepts. The objective is not only to find the minimum number of sibling groups, but also to maximize the degree of similarity of individuals in the same sibling groups while each sibling group is subject to genetic constraints derived from Mendel's laws. We develop a new randomized greedy optimization algorithm to effectively and efficiently solve this SRP. The algorithm consists of two key phases: construction and enhancement. In the construction phase, a greedy approach with randomized perturbation is applied to construct multiple sibling groups iteratively. In the enhancement phase, a two-stage local search with a memory function is used to improve the solution quality with respect to the similarity measure. We demonstrate the effectiveness of the proposed algorithm using real biological data sets and compare it with state-of-the-art approaches in the literature. We also test it on larger simulated data sets. The experimental results show that the proposed algorithm provide the best reconstruction solutions.

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

capacitated clustering problem
sibling reconstruction
computational biology

clustering analysis
combinatorial optimization


On the support designs of extremal binary doubly even self-dual codes Let \(D\) be the support design of the minimum weight of an extremal binary doubly even self-dual \([24m,12m,4m+4]\) code. In this note, we consider the case when \(D\) becomes a \(t\)-design with \(t \ge 6\).

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

\(t\)-designs
assmusmattson theorem
primary 94b05
secondary 05b05


Interlaminar short circuit detection: modeling and measurement Purpose - Interlaminar short circuits in turbo generator stators can lead to local damage of the iron core. The purpose of this paper is to model an interlaminar short circuit diagnosis test on an existing structure. Design/methodology/approach - This work presents the modeling of short-circuited laminations in a stator yoke of a turbo-generator. A 3D finite element model, associated to a homogenization technique, is used to calculate the short-circuit current. The diagnosis test known as El Cid has been modelled as well. Findings - Calculation results are compared with the experiment. The same tendency has been observed both in experimental and numerical results. Research limitations/implications - Additional calculations may be performed (parametric studies) in order to investigate El Cid measuring under different conditions (different material properties, fault position, size), which may lead to a better interpretation of the results. Practical implications - Modelling of short circuit diagnosis tests under different conditions may help with the interpretation of measuring results, predicting the fault size/seriousness and location. So, only the concerned parts of the stator have to be disassembled and repaired/rebuilt. Originality/value - It is not easy to model numerically a structure with a short circuit inside, since different dimensions are involved: the fault and the varnish between laminations are much smaller than the stator itself. Thus, homogenization techniques have been used to model the lamination stack region. The combination of this technique with the modelling of the El Cid test constitutes a tool to study this kind of fault and calculate its severity and location in a stator.

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

turbines
generators
diagnostic testing
electrical faults
laminates
fault diagnosis
turbogenerators
finite element models
magnetic materials


understanding collective play in an urban screen game In recent years there has been a growing interest in Urban Screen applications. While there have been several deployments of these technologies in our urban environments, surprisingly little research effort has aimed to explore the detailed material practice of people's engagement and interaction with these urban screen applications. In this paper, we present a study of collaborative game play on large urban displays situated in three city locations in the UK. The study highlights ways in which collaborative play is initiated and coordinated within the context of an urban environment. These experiences are related to physical characteristics of the architectural spaces, the people populating these spaces and the interactive properties of the game itself. The study moves on to discuss issues relating to audience and spectatorship, an inherent feature of interaction in urban environments. The issues of audience and spectatorship are discussed in their own right but also in terms of their relationship to the playing experience. Finally the study considers these interactive experiences in the contexts of being hosted by a professional compere and also with no host present. Through the study we highlight factors to consider in the design of collaborative urban screen 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 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


BAYESIAN NETWORK WITH INTERVAL PROBABILITY PARAMETER Interval data are widely used in real applications to represent the values of quantities in uncertain situations. However, the implied probabilistic causal relationships among interval-valued variables with interval data cannot be represented and inferred by general Bayesian networks with point-based probability parameters. Thus, it is desired to extend the general Bayesian network with effective mechanisms of representation, learning and inference of probabilistic causal relationship simplied in interval data. In this paper, we define the interval probabilities, the bound-limited weak conditional interval probabilities and the probabilistic description, as well as the multiplication rules. Furthermore, we propose the method for learning the Bayesian network structure from interval data and the algorithm for corresponding approximate inferences. Experimental results show that our methods are feasible, and we conclude that the Bayesian network with interval probability parameters is the expansion of the general Bayesian network

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

bayesian network
interval data
interval probability

structure learning
approximate inference


Trust, power and interorganizational information systems: the case of the electronic trading community TransLease This paper focuses on Cap Geminis electronic commerce system, TransLease. TransLease is an interorganizational information system (IOS), which facilitates electronic commerce between motor vehicle leasing and repair companies. During our investigation, the system was used by approximately 1000 repair agents working for seven of the UKs leading vehicle leasing and contract hire companies. This system was originally developed by AT&T and acquired by Cap Gemini in July 1998. At the time of acquisition, the system was seen as being of high strategic value, although it was also seen as underperforming. This paper reports the results of an action research project, which formed one element of the process by which Cap Gemini investigated the former problem. In the paper, TransLease is described as a complex electronic community, dependent upon the existence of symbiotic relationships. As such, the problems that the system users and developers experienced can be attributed to factors that impeded the mutual benefit accruing from participation in the system. The efficacy of the terms of exchange and the degree to which participants mutually benefit through electronic interaction is determined by the complex interplay of a number of relational and organizational factors. The research therefore illustrates the importance of the soft organizational issues in IOS management and development, and suggests a conceptual model of the factors relevant in this case. At the time of this study, TransLease was still in the early stages of its life cycle, having only been available in the marketplace for approximately 18 months. During this time, through recognizing the complex problems and issues detailed in this paper, Cap Gemini accordingly redressed the way in which the system was managed and maintained. TransLease is now seen as having matured into a highly successful example of an IOS a view reflected by its position as market leader in the industry. As this paper will show, the key to improving the existing service has been the emphasis Cap Gemini now places on managing the soft aspects of the electronic community.

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


A simulation-based method to evaluate the impact of product architecture on product evolvability Products evolve over time via the continual redesigns of interdependent components. Product architecture, which is embodied in the structure of interactions among components, influences the ability for the product to be subsequently evolved. Despite extensive studies of change propagation via inter-component connections, little is known about the specific influences of product architecture on product evolvability. Related metrics and methods to assess the evolvability of products with given architectures are also under-developed. This paper proposes a simulation-based method to assess the isolated effect of product architecture on product evolvability by analyzing a design structure matrix. We define product evolvability as the ability of the products design to subsequently generate heritable performance-improving variations, and propose a quantitative measure for it. We demonstrate the proposed method by using it to investigate a wide spectrum of model-generated DSMs representing products with varied architectures, and show that modularity and inter-component influence cycles promote product evolvability. Our primary contribution is a repeatable method to assess and compare alternative product architectures for architecture selection or redesign for evolvability. A second contribution is the simulation-based evidence about the impacts of two particular product architectural patterns on product evolvability. Both contributions aim to aid in designing for evolvability.

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

product architecture
product evolvability
design structure matrix


A novel learning algorithm which improves the partial fault tolerance of multilayer neural networks The paper deals with the problem of fault tolerance in a multilayer perceptron network. Although it already possesses a reasonable fault tolerance capability, it may be insufficient in particularly critical applications. Studies carried out by the authors have shown that the traditional backpropagation learning algorithm may entail the presence of a certain number of weights with a much higher absolute value than the others. Further studies have shown that faults in these weights is the main cause of deterioration in the performance of the neural network. In other words, the main cause of incorrect network functioning on the occurrence of a fault is the non-uniform distribution of absolute values of weights in each layer. The paper proposes a learning algorithm which updates the weights, distributing their absolute values as uniformly as possible in each layer. Tests performed on benchmark test sets have shown the considerable increase in fault tolerance obtainable with the proposed approach as compared with the traditional backpropagation algorithm and with some of the most efficient fault tolerance approaches to be found in literature.

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

partial fault tolerance
learning algorithm

multilayer perceptron neural network
classification problems
mapping problems


Numerical modeling of DC discharges in air flows This paper deals with the numerical modeling of plasma flow interactions at atmospheric pressure and their application to aerodynamic. A two-dimensional air plasma modeling including complex air kinetic and flow motion is proposed to describe the plasma creation. The net force exerted by the plasma on the flow is introduced in a NavierStokes solver to evaluate the modifications of the flow. This model is able to compute pin plate coronas discharges as well as wire to wire.

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

plasma flow interaction
corona discharge
drift diffusion model


Virtual organization security policies: An ontology-based integration approach This paper addresses the specification of a security policy ontology framework to mediate security policies between virtual organizations (VO) and real organizations (RO). The goal is to develop a common domain model for security policy via semantic mapping. This mitigates interoperability problems that exist due to heterogeneity in security policy data among various (VO) and (RO) in the semantic web. We propose to carry out integration or mapping for only one aspect of security policy, which is authorization policy. Other aspects such as integrity, repudiation and confidentiality will be addressed in future work. We employ various tools such as Protege, RacerPro and PROMPT to show proof of concept.

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

semantic mapping
security policy ontology

ontology mapping
security policy domain model


Thermal lattice-Boltzmann models (TLBM) for compressible flows The progress and challenges in thermal lattice-Boltzmann modeling are discussed. In particular, momentum and energy closures schemes are contrasted. Higher order symmetric (but no longer space filling) velocity lattices are constructed for both 2D and 3D flows and shown to have superior stability properties to the standard (but lower) symmetry lattices. While this decouples the velocity lattice from the spatial grid, the interpolation required following free-streaming is just 1D. The connection between fixed lattice vectors and temperature-dependent lattice vectors (obtained in the Gauss-Hermite quadrature approach) is discussed. Some (compressible) Rayleigh-Benard simulations on the 2D octagonal lattice are presented for extended BGK collision operators that allow for arbitrary Prandtl numbers.

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

lattice symmetries
linear stability
rayleigh-bernard


Application of General Orthogonal Polynomials to Fast Simulation of Nonlinear Descriptor Systems Through Piecewise-Linear Approximation In this letter, we report an approach combining piecewise-linear (PWL) approximation with general orthogonal polynomials to efficiently simulate large nonlinear descriptor systems in time-domain. The main idea of this approach is first to approximate a nonlinear function by a piecewise-linear representation. Then, using the recursive formulae of general orthogonal polynomials, orthonormal bases can be produced for fast simulation of the PWL model. The effectiveness of our approach is demonstrated on two nonlinear circuit models.

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

fast simulation
general orthogonal polynomials
nonlinear circuit models