UbiPaPaGo: Context-aware path planning The increased prevalence of digital devices with communication capability heralds the era of ubiquitous computing, as predicted by Mark Weiser. Ubiquitous computing aims to provide users with intelligent human-centric context-aware services at anytime anywhere. Optimal path planning in a ubiquitous network considers the needs of users and the surrounding context. This approach is very different from that applied by existing research on car navigation and mobile robots. This study proposes a context-aware path planning mechanism based on spatial conceptual map (SCM) and genetic algorithm (GA), referred to as UbiPaPaGo. The SCM model is adopted to represent the real map of the surrounding environment. The optimal path is planned using a GA, which is a robust metaheuristic algorithm. UbiPaPaGo attempts to automatically find the best path that satisfies the requirements of an individual user. A prototype of UbiPaPaGo is implemented to demonstrate its feasibility and scalability. Experimental results validate the effectiveness and the efficiency of UbiPaPaGo in finding the optimal path. (C) 2010 Elsevier Ltd. All rights reserved.

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

ubiquitous network
path planning
spatial conceptual map

human-centered computing
context-awareness
genetic algorithm (ga)


Exocytosis: The Chromaffin Cell As a Model System Neurons and neuroendocrine cells release transmitters and hormones by exocytosis of secrctory vesicles or granules. Among the cell models that have provided insight into the molecular machinery underlying the successive steps of exocytosis, adrenal chromaffin cells have taken a prominent place. Thus, most of the molecular players that orchestrate the formation, targeting, docking, and fusion of secrctory granules have been identified in chromaffin cells. By offering the opportunity to combine the use of recent biophysical techniques allowing single-vesicle resolution and specific biochemical modifications in the protein machinery involved in exocytosis, chromaffn cells remain a powerful model to address new and still open questions in the field of secretion.

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


Classification of surgical processes using dynamic time warping In the creation of new computer-assisted intervention systems, Surgical Process Models (SPMs) are an emerging concept used for analyzing and assessing surgical interventions. SPMs represent Surgical Processes (SPs) which are formalized as symbolic structured descriptions of surgical interventions using a pre-defined level of granularity and a dedicated terminology. In this context, one major challenge is the creation of new metrics for the comparison and the evaluation of SPs. Thus, correlations between these metrics and pre-operative data are used to classify surgeries and highlight specific information on the surgery itself and on the surgeon, such as his/her level of expertise. In this paper, we explore the automatic classification of a set of SPs based on the Dynamic Time Warping (DTW) algorithm. DTW is used to compute a similarity measure between two SPs that focuses on the different types of activities performed during surgery and their sequencing, by minimizing time differences. Indeed, it turns out to be a complementary approach to the classical methods that only focus on differences in the time and the number of activities. Experiments were carried out on 24 lumbar disk herniation surgeries to discriminate the surgeons level of expertise according to a prior classification of SPs. Supervised and unsupervised classification experiments have shown that this approach was able to automatically identify groups of surgeons according to their level of expertise (senior and junior), and opens many perspectives for the creation of new metrics for comparing and evaluating surgeries.

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

surgical process models
classification
dynamic time warping


Recent advances in optimization-based simultaneous process and control design In this work, we first discuss recent advances towards the integration of process design, process control and process operability from the open literature and then we focus on techniques towards this endeavor that were developed within our group at Imperial College. While most of the approaches employ controllability measures to achieve this goal, our developments can be classified as a simultaneous process and control design methodology. Based on novel mixed integer dynamic optimization algorithms, our strategy features high fidelity process dynamic models, conventional PI control schemes, explicit consideration of structural process and control design aspects (such as number of trays, pairing of manipulated and controlled variables) through the introduction of 0-1 variables, and explicit consideration of time-varying disturbances and time-invariant uncertainties. The application of this strategy to a typical distillation system is discussed. In the second part of this chapter we present an extension of the process and control design framework that incorporates advanced model-based predictive controllers. Parametric programming is used for the controller derivation giving rise to a closed-form controller structure and removing the need for solving an optimization problem on-line. The resulting parametric controller is readily incorporated in the design optimization framework bringing about significant economic and operability benefits. The key features and advantages of this approach are highlighted via a simple binary distillation example. (C) 2004 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 B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

process design
process operability
parametric programming

model-based control
feasibility analysis


Computing maximum non-crossing matching in convex bipartite graphs We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n n vertices and m m edges, we present an O(nlogn) O ( n log n ) time algorithm for finding a maximum non-crossing matching in the graph. The previous best algorithm takes O(m+nlogn) O ( m + n log n ) time (Malucelli etal., 1993). Since m=?(n2) m = ? ( n 2 ) in the worst case, our result improves the previous work.

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

maximum non-crossing matching
maximum matching
algorithms
data structures


Wavelet leader multifractal analysis of period and amplitude sequences from sustained vowels We study amplitude and period sequences from vowels with multifractal analysis. We show both sequences have a rich scaling and multifractal behavior. We study classification between healthy and nonhealthy voice. We conclude that sequences should be modelled using the multifractal paradigm.

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

multifractal analysis
sustained vowels
amplitude and period sequences


runtime user interface design and adaptation In this paper, a method of generating appropriate user interfaces at runtime is investigated. It is proposed to use the established formalism of Situation Calculus to describe and specify user interfaces. It is shown how specific features of the formalism provide many desirable properties in the design and specification of user interfaces that are adaptable to context and composed at runtime. The formalism provides a provably correct deployment, whilst giving a means of deliberation on the optimum configuration that is directly compiled through a developed Neptune scripting language. The major features of the formalism and programming language are described together with an illustration of how this has been used in an implemented e-health case study for decision support with partner institutions in breast cancer care. It is shown how pluggable decision models may be introduced and system adaptation to clinician context achieved, whilst system integrity is maintained.

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

runtime adaptation
user interface description


'Disruptive technologies', 'pedagogical innovation': What's new? Findings from an in-depth study of students' use and perception of technology The paper describes the findings from a study of students' use and experience of technologies. A series of in-depth case studies were carried out across four subject disciplines, with data collected via survey, audio logs and interviews. The findings suggest that students are immersed in a rich, technology-enhanced learning environment and that they select and appropriate technologies to their own personal learning needs. The findings have profound implications for the way in which educational institutions design and support learning activities. (C) 2007 Elsevier Ltd. All rights reserved.

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

post-secondary education
student experience
evaluation


Release-time-based multi-channel MAC protocol for wireless mesh networks The wireless mesh network (WMN) has been considered one of the most promising techniques for extending broadband access to the last mile. In order to utilize multiple channels to increase the throughput in WMNs, a variety of multi-channel MAC (MMAC) protocols have been proposed in the literature. In particular, the dedicated control channel (DCC) approach can greatly simply many design issues in multi-channel environments by using a common control channel to exchange control signals. On the other hand, it allows each sender-receiver pair to dynamically select a data channel for their data transmission in an on-demand matter. However, the common control channel would become a bottleneck of the overall performance. Besides, the selection of data channels would be highly related to the final throughput. In this paper, we propose a new MMAC protocol, named the release-time-based MMAC (RTBM) to overcome the control channel bottleneck and data channel selection problems in the DCC approach. The RTBM consists of three major components: (1) Control initiation-time predication (CIP); (2) Dynamic data-flow control (DDC); (3) Enhanced channel selection (ECS). The CIP can predict a proper initiation time for each control process to reduce control overhead. The DDC can dynamically adjust the flow of each data transmission to fully exploit the channel bandwidth. The ECS can achieve a higher reusability of data channels to further enhance the throughput. Simulation results show that the RTBM can substantially improve the throughput in both single-hop and multihop networks. (C) 2011 Elsevier B.V. All rights reserved.

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

multi-channel multi-interface
medium access control


Three Types of Muscles Express Three SodiumCalcium Exchanger Isoforms The sodiumcalcium exchanger (NCX) of plasma membrane is expressed in any animal cell. The specific role of its three isoforms (NCX13) is not yet established. Their levels vary considerably during murine postnatal development. In particular, in skeletal muscle, NCX1 expression decreases gradually upon aging while reciprocal changes take place for NCX3. NCX2 expression is restricted to brain and smooth muscles. The data on SDS-gel mobility shifts indicate that all three isoforms undergo Ca2+-dependent conformational changes, and that an exchanger regulatory Ca2+-binding domain interacts directly with mutually exclusive exons A and B inducing two different NCX1 conformations

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


NNSYSID-toolbox for system identification with neural networks The NNSYSID toolset for System Identification has been developed as an add on to MATLAB(R). The NNSYSID toolbox has been designed to assist identification of nonlinear dynamic systems. It contains a number of nonlinear model structures based on neural networks, effective training algorithms and tools for model validation and model structure selection. This paper gives an overview of the design of NNSYSID and demonstrates its features in an example.

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


a technique for correlating images on head mounted displays with virtual background scenery Visual training systems employing high fidelity image generation capabilities have gained immense popularity over the years in a variety of training applications. They offer economy of cost, and precise scenario execution with consistency across unlimited trials. Training systems using head mounted displays (HMD) are a subset of this fast proliferating technology. However, the implementation and use of HMDs poses a number of challenges. A significant one is the problem of correlating the images that are rendered on the HMD's visor in time and space with the background scenery rendered on a projection screen. In this paper we describe a method to solve this problem using Kalman filters, and show the accuracy of its implementation in practice.

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


rapid prototype of a hardware emulator for a simd processor array A custom chip set implementing a Single Instruction Multiple Data (SIMD) architecture has been designed bringing the benefits of massively parallel processing to the embedded systems domain. A scaled, rapid prototype was first implemented providing an exact duplicate of the functionality and interfaces of the custom chips, but using off the shelf technology. This scaled version was specified to allow development and debugging of software, and provide early feedback for verification of the interfaces and instruction operations. The rapid prototype provides full functionality, allowing any design errors or beneficial modifications to the design to be identified.

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

massively parallel processing
custom chip set
simd processor array
rapid prototype
hardware emulator
simd architecture
scaled version
embedded systems

logic partitioning
logic cad
field programmable gate arrays
virtual machines
parallel architectures


Solution of non-convex economic dispatch problem considering valve loading effect by a new Modified Differential Evolution algorithm This paper presents Economic Dispatch (ED) solution considering valve loading effect by a new Modified Differential Evolution (MDE) algorithm. Considering valve loading effect changes ED into a non-convex optimization problem. This non-convexity challenges analytical and heuristic methods in finding optimal solution in reasonable time. Differential Evolution (DE) is one of evolutionary algorithms, which has been used in many optimization problems due to its simplicity and efficiency. The proposed MDE is in the framework of differential evolution owning new mutation operator and selection mechanism inspired from Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA), respectively. In other words, positive characteristics of DE, GA, PSO and SA are combined to create a new efficient stochastic search technique. In the solution of the non-convex ED by the proposed stochastic search technique, an effective constraint handling method is also presented. The proposed MDE is examined on three ED test systems and compared with some of the most recently published ED solution methods. These comparisons reveal the efficiency and robustness of the proposed MDE.

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

valve loading effect
modified differential evolution


detecting anomalous records in categorical datasets We consider the problem of detecting anomalies in high aritycategorical datasets. In most applications, anomalies are defined as datapoints that are "abnormal". Quite often we have access to data which consists mostly of normal records, a long with a small percentage of unlabelled anomalous records. We are interested in the problem of unsupervised anomaly detection , where we use the unlabelled data for training, and detect records that do not follow the definition of normality. A standard approach is to create a model of normal data, and compare test records against it. A probabilistic approach builds a likelihood model from the training data. Records are tested for anomalies based on the complete record likelihood given the probability model. For categorical attributes, bayes nets give a standard representation of the likelihood. While this approach is good at finding outliers in the dataset, it often tends to detect records with attribute values that are rare. Sometimes, just detecting rare values of an attribute is not desired and such outliers are not considered as anomalies in that context. We present an alternative definition of anomalies, and propose an approach of comparing against marginal distribution of attribute subsets. We show that this is a more meaningful way of detecting anomalies, and has a better performance over semi-synthetic as well as real world 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 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


Fuzzy optimal control of reservoir-assisted stormwater treatment areas for aquatic ecosystem restoration Attachment of stormwater treatment areas (STAs) or constructed wetlands to stormwater retention reservoirs can achieve substantial reductions in pollutant loadings if properly operated and maintained. Besides water quality improvement, optimally operated reservoir-assisted STAs provide support for ecosystem remediation, flood control, and supplemental water supply. An adaptive, multiobjective real-time control model is developed for reservoir-assisted STA systems that incorporates fuzzy rule-based operating rules optimized using a genetic algorithm interacting with a simulation model of the system. The model is applied to the North Fork reservoir-assisted STA located in the watershed of the St. Lucie Estuary, Florida. Optimal daily feedback operational policies are developed for managing freshwater discharges to the Estuary for coastal ecosystem restoration, maximizing the natural treatment efficiency and of the STA, and providing supplemental water supply for irrigation. Testing and validation results from application of the fuzzy optimal control model confirm achievement of multiple targets and criteria for the North Fork project, while demonstrating potential for adaptive management of reservoir-assisted STA systems throughout the coastal regions of south Florida.

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

constructed wetlands
stormwater treatment areas

aquatic ecosystems
evolutionary algorithm
fuzzy control
real-time operations
stormwater retention basins


Monitoring historical masonry structures with operational modal analysis: Two case studies The paper addresses two complex case studies of modal and structural identification of monuments in Portugal: the Clock Tower of Mogadouro and the Church of Jernimos Monastery, in Lisbon. These are being monitored by University of Minho with vibration, temperature and relative air humidity sensors. Operational modal analysis is being used to estimate the modal parameters, followed by statistical analysis to evaluate the environmental effects on the dynamic response. The aim is to explore damage assessment in masonry structures at an early stage by vibration signatures, as a part of a health monitoring process that helps in the preservation of historical constructions. The paper presents the necessary preliminary dynamic analysis steps before the monitoring task, which includes installation of the monitoring system, system identification and subsequent FE model updating analysis, automatic modal identification and investigation of the influence of the environment on the identified modal parameters.

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

damage identification
experimental testing


A flocking based method for brain tractography In our knowledge, no method for tractography shares information between particles. We propose a probabilistic tractography method based on the flocking concept. Improvements by using a collective information term on the particle motion are shown. The gravitational force between particles gives that collective information. Our proposal obtains the best performance on the Fiber Cup data.

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

diffusion tensor
stochastic walks
anatomical brain connectivity


Morphological analysis for investigating artistic images ? An approach to analyze alterations of artworks and their reproductions is presented. Point correspondences, point grouping, and transformations are estimated jointly. Finding of initial grouping assignments is phrased as a linear program. A statistical stability analysis yields the complexity of the registration model. An extensive qualitative and quantitative evaluation is performed on challenging images from art history.

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

registration
grouping
stability analysis

shape analysis
model selection
cultural heritage


tractor pulling on data warehouses Robustness of database systems under stress is hard to quantify, because there are many factors involved, most notably the user expectation to perform a job within certain bounds of the user requirements. Nevertheless, robustness of database system is very important to end users. In this paper we develop a database benchmark suite, inspired by tractor pulling, where robustness is measured as a system's ability to process data despite a continuous increase in system load, as defined in terms of data volume, query volume and complexity. A functional evaluation is performed against several systems to highlight the benchmark capabilities.

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


Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines ? In this paper, we address the problem of minimizing expected total weighted tardiness of jobs that have stochastic interruptions and that are processed on a set of parallel machines. Our research generalizes the problem of scheduling parallel machines to minimize total weighted tardiness. The proposed solution method is based on the scatter search methodology and implements an innovative structured combination procedure. Extensive computational testing with more than 400 problem instances shows the merit of the proposed solution method.

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


interconnect characteristics of 2.5-d system integration scheme Growing number of excessively long on-chip wires in modern monolithic ICs is a byproduct of growing chip size. To address this problem instead of placing all systems components in one layer (i.e. in 2-D space) one can use a stack of single layer monolithic ICs (called here a 2.5-D integrated IC). To assess the potential benefits of such a 2.5-D integration schema this paper compares wire length distributions, obtained for 2-D and 2.5-D implementations of benchmark circuits. In the assessment two newly developed floorplanning and placement tools were used. Significant reductions in both total wirelength and worst-case wirelength was observed for the systems implemented as 2.5-D ICs.

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

assessment floorplanning use benchmark schema paper wirelength systems placement space size layer interconnect tools scheme circuits

reduction
addressing
case
partition
component
place
implementation
bounded sliceline grid
2.5-d system integration
distributed
vlsi
integrability


Low-frequency piezoelectric energy harvesting prototype suitable for the MEMS implementation A low-frequency piezoelectric energy harvester based on impact vibration assembled with a compliant driving beam and two rigid generating beams is presented. The ambient low frequency is up-converted to high resonant frequency by the periodic impact between the driving beam and the generating beams. The advantages of the harvester are: restricting the large displacement of the compliant driving beam, improving power density and being especially suitable for a compact MEMS approach. The 1.53mW average power of the macroscale impact vibration harvester is achieved at 20.1Hz under 0.4g acceleration. The power density is 93.2?W/cm3, which is 6.8 times that of conventional counterpart (13.6?W/cm3). The measured results demonstrate the potential of the device applied to portable and implantable electronics benefited from the MEMS batch-fabrication technology.

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


Some aspects of the one-dimensional version of the method of fundamental solutions The method of fundamental solutions (MFS) is a well-established boundary-type numerical method for the solution of certain two- and three-dimensional elliptic boundary value problems [1,2]. The basic ideas were introduced by Kupradze and Alexidze (see, e.g., [3]), whereas the present form of the MFS was proposed by Mathon and Johnston [4]. The aim of this work is to investigate the one-dimensional analogue of the MFS for the solution of certain two-point boundary Value problems. In particular, the one-dimensional MFS is formulated in the case of linear scalar ordinary differential equations of even degree with constant coefficients. A mathematical justification for the method is provided and various aspects related to its applicability from both an analytical and a numerical standpoint are examined. (C) 2001 Elsevier Science Ltd. All rights reserved.

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


Improved FVM for two-layer shallow-water models: Application to the Strait of Gibraltar This paper deals with the numerical simulation of flows of stratified fluids through channels with irregular geometry. Channel cross-sections are supposed to be symmetric but not necessarily rectangular. The fluid is supposed to be composed of two shallow layers of immiscible fluids of constant densities, and the flow is assumed to be one-dimensional. Therefore, the equations to be solved are a coupled system composed of two Shallow Water models with source terms involving depth and breadth functions. Extensions of Roe's Q-scheme are proposed where a suitable treatment of the coupling and source terms is performed by adapting the techniques developed in [Vazquez-Cendon ME. Improved treatment of source terms in upwind schemes for the shallow water equations in channels with irregular geometry. J Comp Phys 1999; 148:497-526; Garcia-Navarro P, Vazquez-Cendon ME. On numerical treatment of the source terms in the shallow water equations. Comput Fluids 2000;29(8):17-45; Castro MJ, Macias J, Pares C. A Q-Scheme for a class of systems of coupled conservation laws with source term. Application to a two-layer I-D shallow water system. Math Model Numer An 2001;35(l):107-27]. Finally we apply the numerical scheme to the simulation of the flow through the Strait of Gibraltar. Real bathymetric and coast-line data are considered to include in the model the main features of the abrupt geometry of this natural strait connecting the Atlantic Ocean and the Mediterranean Sea. A steady state solution is obtained from lock-exchange initial conditions. This solution is then used as initial condition to simulate the main semidiurnal and diurnal tidal waves in the Strait of Gibraltar through the imposition of suitable boundary conditions obtained from observed tidal data. Comparisons between numerical results and observed data and some tests on friction sensitivity are also presented. (c) 2006 Elsevier Ltd. and Civil-Comp Ltd. All rights reserved.

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

coupled conservation laws
source terms
strait of gibraltar

q-schemes
1d shallow water equations
two-layer exchange flows
hyperbolic systems
internal tides
fortnightly and monthly signal
friction effects


seamless user notification in ambient soundscapes We describe a method for notifying users through auditory cues embedded in an ambient soundscape in the environment. It uses pieces of music which are composed in such a way, that particular instruments or motifs can be added or omitted without losing the aesthetic quality of the overall composition. This allows for very subtle modifications in the soundscape which are only noticed by those users who have chosen this particular instrument or motif as "their" notification instrument before. As a side effect, the soundscape itself can be used to subtly influence the mood of users. The method has been implemented in a prototype, which we briefly discuss. The prototype is implemented using a spatial audio framework and can hence notify users from particular directions.

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


Abductive network committees for improved classification of medical data Objectives.-To introduce abductive network classifier committees as an ensemble method for improving classification accuracy in medical diagnosis. While neural networks allow many ways to introduce enough diversity among member models to improve performance when forming a committee, the self-organizing, automatic-stopping nature, and learning approach used by abductive networks are not very conducive for this purpose. We explore ways of overcoming this limitation and demonstrate improved classification on three standard medical datasets. Methods: Two standard 2-class medical datasets (Pima Indians Diabetes and Heart Disease) and a 6-class dataset (Dermatology) were used to investigate ways of training abductive networks with adequate independence, as well as methods of combining their outputs to form a network that improves performance beyond that of single models. Results. Two- or three-member committees of models trained on completely or partially different subsets of training data and using simple output combination methods achieve improvements between 2 and 5 percentage points in the classification accuracy over the best single model developed using the full training set. Conclusions: Varying model complexity alone gives abductive network models that are too correlated to ensure enough diversity for forming a useful committee. Diversity achieved through training member networks on independent subsets of the training data outweighs limitations of the smaller training set for each, resulting in net gain in committee performance. As such models train faster and can be trained in parallel, this can also speed up classifier development.

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

abductive networks
neural networks
classification accuracy
medical diagnosis
diabetes
heart disease
dermatology

ensemble methods
network committee
committee of experts


real-time visualisation and browsing of a distributed video database We present the initial results of a system designed to visualise and browse a distributed database of high definition video. Multiple video clips are taken from the database and streamed as textures within a 3D environment. The rotation, movement, and zoom that this allows enables the clips to be organised, previewed, and selected for further editing. The power of the system lies in the ability to stream multiple clips in real time (including multiple versions of the same clip) and organize the clips according to simple metadata. This latter ability allows a typical user, such as a production director or editor, to rapidly discover relevant or related clips and preview the application of several different post-production filters in real-time, increasing the usability and speed of a typical production workflow.

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


A Synthon Approach to Artificial Chemistry A coevolutionary model is discussed that incorporates the logical structure of constitutional chemistry and its kinetics on the one hand and the topological evolution of the chemical reaction network on the other hand. The motivation for designing this model is twofold. First, experiments that are to provide insight into chemical problems should be expressed in a syntax that remains as close as possible to real chemistry. Second, the study of physical properties of the complex chemical reaction networks requires growing models that incorporate features realistic from a biochemical perspective. In this article the theory and algorithms underlying the coevolutionary model are explained, and two illustrative examples are provided. These examples show that one needs to be careful in making general claims concerning the structure of chemical reaction networks.

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

molecular graphs
reaction generator
complex networks


Exocytosis Studies in a Chromaffin Cell-Free System We have developed a system for the real-time study of regulated exocytosis in living, cultured bovine adrenal chromaffin cells (BCCs). Exocytosis was monitored by the use of total internal reflection fluorescence (TIRF) microscopy to image single large dense-core secretory vesicles (LDCVs). Fluorescent labeling of LDCVs was achieved either with the membrane-permeant weak base, acridine orange (AO), or by transduction of BCCs so as to express a fluorescent chimeric cargo protein that is targeted to LDCVs. In either case, exocytosis is visible by the disappearance of a vesicle accompanied by a bright flash as the fluorescent contents leave the acidic LDCV lumen, move towards the source of the evanescent wave, and disperse into the extracellular medium. Furthermore, for the first time, we have developed a broken-cell system for real-time imaging in BCCs, in which individual plated cells are mechanically unroofed with a jet of intracellular medium, leaving a membrane patch with docked vesicles on the coverslip. In this cell-free system, a subpopulation of docked granules undergoes exocytosis in response to calcium. This approach allows us direct experimental access to membrane-docked LDCVs in order to investigate the dependence of exocytosis on defined protein components and intracellular conditions at the single-vesicle level. In addition, this system can be used for a reconstitution analysis of the exocytosis machinery. Finally, we demonstrate the use of 2D+1 image analysis for visualizing single-vesicle exocytosis. We use this approach for a rapid analysis of larger numbers of imaged vesicles.

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

total internal reflection fluorescence microscopy


an efficient algorithm for the euclidean two-center problem We present a new algorithm for the two-center problem: Given a set S of n points in the real plane, find two closed discs whose union contains all of the points and the radius of the larger disc is minimized. An almost quadratic O ( n 2 log n ) solution is given. The previously best known algorithms for the two-center problem have time complexity O ( n 2 log 3 n ). The solution is based on a new geometric characterization of the optimal discs and on a searching scheme with so-called lazy evaluation. The algorithm is simple and does not assume general position of the input points. The importance of the problem is known in various practical applications including transportation, station placement, and facility location.

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

applications
facility location
characterization
input
placement
general
algorithm
time complexity
practical
evaluation
scheme

point efficiency optimality transport posit


Efficiently querying large XML data repositories: A survey Extensible Markup Language (XML) is emerging as a de facto standard for information exchange among various applications on the World Wide Web. There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently. One important problem in XML query processing is twig pattern matching, that is, finding in an XML data tree D all matches that satisfy a specified twig ( or path) query pattern Q. In this survey, we review, classify, and compare major techniques for twig pattern matching.(1) Specifically, we consider two classes of major XML query processing techniques: the relational approach and the native approach. The relational approach directly utilizes existing relational database systems to store and query XML data, which enables the use of all important techniques that have been developed for relational databases, whereas in the native approach, specialized storage and query processing systems tailored for XML data are developed from scratch to further improve XML query performance. As implied by existing work, XML data querying and management are developing in the direction of integrating the relational approach with the native approach, which could result in higher query processing performance and also significantly reduce system reengineering costs.

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

xml query processing
twig pattern matching


Understanding leaves in natural images A model-based approach for tree species identification ? ?? We use a global shape model to segment leaves in complex natural images. Prior knowledge and shape constraints improve segmentation performance. We designed explicit botany-inspired descriptors for local shapes. Information is combined to classify leaf images into a list of species. Dedicated high-level features prove to perform better than generic statistical ones.

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

plant recognition
tree leaf
image segmentation
natural background
active contours
geometric features
classification


an intelligent contextual support system for intrusion detection tasks The cognitively challenging task of Intrusion Detection, undertaken by Network Security Engineers (NSE) even through a sophisticated Intrusion Detection System (IDS), demands considerable effort and time in figuring out the real intrusion attempts. We believe that a support system providing contextual assistance in the task of Intrusion detection would be of immense help to the Network Security Engineers. In this paper, we discuss about the features and mechanisms of such an intelligent contextual support system, along with the implementation and quantitative evaluation of it by using certain observable parameters of performance. The results indicated improvement in the productivity of the NSE and also the usability of the IDS.

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

intrusion detection system
intrusion detection
contextual support system

network security engineer
network security system
intelligent contextual support systems


Registration-based interpolation A method is presented to interpolate between neighboring slices in a grey-scale tomographic data set. Spatial correspondence between adjacent slices is established using a nonrigid registration algorithm based on B-splines which optimizes the normalized mutual information similarity measure. Linear interpolation of the image intensities is then carried out along the directions calculated by the registration algorithm. The registration-based method is compared to both standard linear interpolation and shape-based interpolation in 20 tomographic data sets. Results show that the proposed method statistically significantly outperforms both linear and shape-based interpolation.

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


Computing the variable coefficient telegraph equation using a discrete eigenfunctions method ? This paper deals with the construction of discrete numerical solutions of mixed problems for the telegraph equation. After discretization, the two-variables partial difference mixed problem is solved by means of a discrete eigenfunctions method that mimics the advantages of the continuous eigenfunction method while eliminating its computational disadvantages. The solution is based on a closed form solution of the inhomogeneous second order difference equation without increasing the problems dimension.

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

telegraph equation
discrete eigenfunctions method

numerical solution
explicit difference scheme


Multiple-antenna signal constellations for fading channels (vol 47, pg 2618, 2001) The authors correct a mathematical equation contained in the correspondence "Multiple-antenna signal constellations for fading channels," previously published in the IEEE TRANSACTIONS ON INFORMATION THEORY.

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

multiple antennas
packings in grassmannian space
rayleigh flat fading


A Variational Bayesian Framework for Clustering with Multiple Graphs Mining patterns in graphs has become an important issue in real applications, such as bioinformatics and web mining. We address a graph clustering problem where a cluster is a set of densely connected nodes, under a practical setting that 1) the input is multiple graphs which share a set of nodes but have different edges and 2) a true cluster cannot be found in all given graphs. For this problem, we propose a probabilistic generative model and a robust learning scheme based on variational Bayesian estimation. A key feature of our probabilistic framework is that not only nodes but also given graphs can be clustered at the same time, allowing our model to capture clusters found in only part of all given graphs. We empirically evaluated the effectiveness of the proposed framework on not only a variety of synthetic graphs but also real gene networks, demonstrating that our proposed approach can improve the clustering performance of competing methods in both synthetic and real data.

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

statistical machine learning
variational bayesian learning
localized clusters


A new method for semi-automatic fuzzy training and its application in environmental modeling A new method for semi-automatic fuzzy training is introduced. This technique combines statistical data analysis with the training of fuzzy rules. The modeler controls the fuzzy training system with easily-understood parameters. An incomplete set of fuzzy rules can be refined by the expert as well as reveal information about the data set. The effectiveness of the new method is demonstrated using two examples. The fuzzy training algorithm was implemented as open source software with a graphical user interface.

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

fuzzy modeling
fuzzy rule generation
statistical analysis
yield modeling
data mining


CONSTRUCTION OF HIGH VANISHING MOMENTS LINEAR PHASE 3-BAND WAVELETS BASED ON LATTICE STRUCTURE The compact supported, linear phase, perfect reconstruction, orthogonal 3-band wavelet with high vanishing moments is very useful in engineering. However, the construction of these systems is not a simple task. In this paper, we construct the 3-band wavelet system with those properties. In this approach, we first designate the scaling filter length which means compact support, then the vanishing moments is set beforehand in spectral factorization formulation. Consequently, the scaling filters with desirable properties are obtained by solving nonlinear equations which implies less parameters. Moreover, we proposed a lattice structure decomposition of polyphase matrix for 3-band wavelet system, which imposed with paraunitary property. With this method, the corresponding wavelet filters are constructed.

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

lattice structure
linear phase
high vanishing moments


Two results on maximum nonlinear functions Maximum nonlinear functions F : F-2m -> F-2m are widely used in cryptography because the coordinate functions F-beta(x) : = tr(beta F(x)), beta epsilon F-2m(*), have large distance to linear functions. Moreover, maximum nonlinear functions have good differential properties, i. e. the equations F(x + a) - F(x) = b, a, b epsilon F-2m, b not equal 0, have 0 or 2 solutions. Two classes of maximum nonlinear functions are the Gold power functions x(2k+ 1), gcd(k, m) = 1, and the Kasami power functions x(22k) (- 2k+ 1), gcd(k, m) = 1. The main results in this paper are: (1) We characterize the Gold power functions in terms of the distance of their coordinate functions to characteristic functions of subspaces of codimension 2 in F-2m. (2) We determine the differential properties of the Kasami power functions if gcd(k, m) not equal 1.

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

gold power function
walsh transform
difference set
finite field
kasami power function
almost perfect nonlinear


Distributed evolutionary multi-objective mesh-partitioning algorithm for parallel finite element computations Majority of the mesh-partitioning algorithms attempt to optimise the interprocessor communications, while balancing the computational load among the processors. However, it is desirable to simultaneously optimise the submesh aspect ratios in order to significantly improve the convergence characteristics of the domain decomposition based Preconditioned-conjugate-gradient algorithms, being used extensively in the state-of-the-art parallel finite element codes. Keeping this in view, a new distributed multi-objective mesh-partitioning algorithm using evolutionary computing techniques is proposed in this paper. Effectiveness of the proposed distributed mesh-partitioning algorithm is demonstrated by solving several unstructured meshes of practical-engineering problems and also benchmark problems.

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

evolutionary computing
unstructured meshes

mesh partitioning
multi-objective optimisation
pareto solutions
aspect ratio


techniques for programmable logic array folding The optimal PLA folding problem is presented and discussed in its different forms. In particular, new algorithms for row folding in unconstrained architectures and in AND-OR-AND architectures are presented and their complexity examined. The problem of finding an optimal row folding after a column folding has been performed, is described and an algorithm for its solution given. Finally, the organization of an APL package for row and column folding of PLA's is introduced and experimental results reported.

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

programmable logic
organization
complexity
algorithm

arrays experimentation optimality packaging architecture


K? K ? -affinity privacy: Releasing infrequent query refinements safely A new affinity-based k-anonymity model that leverages query refinement patterns. A novel notion of generalized graph k-cores. A link between k-anonymity and k-cores. A novel evaluation test based on sensitive and non-sensitive queries. A comparison between k-anonymity under affinity and under WordNet generalization.

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

k? k ? -affinity privacy k? k ? k? k ? k ?


Cross-layer optimization for state update in mobile gaming In a large-scale mobile gaming environment with limited wireless network bandwidth, efficient mechanisms for state update are crucial to allow graceful real-time interaction for a large number of players. By using the state updating threshold as a key parameter that bridges the resulting state distortion and the network traffic, we are able to study the fundamental traffic-distortion tradeoffs via both theoretical modeling and numerical analysis using real game traces. We consider a WiMAX link model, where the bandwidth allocation is driven by the underlying physical layer link quality as well as application layer gaming behaviors. Such a cross-layer optimization problem can be solved using standard convex programming techniques. By exploring the temporal locality of gaming behavior, we also propose a prediction method for on-line bandwidth adaptation. Using real data traces from a multiplayer driving game, TORCS, the proposed network-aware bandwidth allocation method (NABA) is able to achieve significant reduction in state distortion compared to two baselines: uniform and proportional policies.

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

bandwidth allocation
mobile gaming
state update
wimax

lagrangian relaxation
traffic-distortion tradeoffs


In pursuit of moderation: Nine common errors and their solutions One result of the increasing sophistication and complexity of MIS theory and research is the number of studies hypothesizing and testing for moderation effects. A review of the MIS and broader management literatures suggests researchers investigating moderated relationships often commit one or more errors falling into three broad categories: inappropriate use or interpretation of statistics, misalignment of research design with phenomena of interest, and measurement or scaling issues. Examples of nine common errors are presented. Commission of these errors is expected to yield literatures characterized by mixed results at best, and thoroughly erroneous results at worse. Procedures representing examples of best practice and reporting guidelines are provided to help MIS investigators avoid or minimize these errors.

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

tests of moderation
contingency models
pls


Dynamic knowledge patterns to inform design: A field study of knowledge stocks and flows in an extreme organization Knowledge represents a critical resource in the modern enterprise. But it is dynamic and distributed unevenly. Capitalizing on this dynamic resource for enterprise performance depends upon its rapid and reliable flows across people, organizations, locations, and times of application. From a technological perspective, this points immediately to the design of information systems to enhance knowledge flows. The problem is, the design of information systems to enhance knowledge flows requires new understanding. The research described in this paper concentrates on understanding the dynamics of knowledge phenomenologically and on developing and applying techniques for modeling and visualizing dynamic knowledge flows and stocks. We draw key, theoretical concepts from multiple literatures, and we build upon integrative modeling work that composes a parsimonious, multidimensional, analytical framework for representing and visualizing dynamic knowledge. We then conduct field research to learn how this theoretical framework may be used to model knowledge flows in practice. By focusing this empirical work on an extreme organization and processes that involve and rely upon tacit knowledge, we illustrate how dynamic knowledge patterns can inform design in new ways. New chunks of kernel theory deriving from this fieldwork are articulated in terms of a propositional model, which provides a basis for the development of testable design theory hypotheses.

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

case study
knowledge design
knowledge flow
knowledge management
knowledge transfer
military
organizational learning


Comprehensive defect analysis methodology for nano imprint lithography Because of the non traditional elements involved in both the manufacture of nano imprint lithography (NIL) templates [T. DiBiase, J. Maltabes, B. Reese, M. Ahmadian, SPIE 6151 (2006)] and the resulting features printed on substrates, methods and procedures for effectively locating, tracking and identifying defect mechanisms need to be modified and refined from the traditional methods employed by the semiconductor industry [I. Peterson, G. Thompson, T. DiBiase, S. Ashkenaz, R. Pinto, Yield Management Solutions, KLA-Tencor Spring, (2000)]. Since NIL involves pattern structures defined at 1 magnification, there is no defect forgiveness such as with conventional 4 optical reduction lithography. In addition, NIL is performed with the patterning tooling (template) in full contact with the casting material (in this case, UV curable monomer) used to define the final features on the substrate of interest. Surface chemistry and substrate interactions quickly become obvious crucial factors in defect formation mechanisms. This article describes a few non-traditional approaches to working with the extreme dynamic range of defect types found in the step and repeat NIL process.

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


Multi-level graph layout on the GPU This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet Service Provider) networks is presented.

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


event-based approach to money laundering data analysis and visualization Crime specific event patterns are crucial in detecting potential relationships among suspects in criminal networks. However, current link analysis tools commonly used in detection do not utilize such patterns for detecting various types of crimes. These analysis tools usually provide generic functions for all types of crimes and heavily rely on the user's expertise on the domain knowledge of the crime for successful detection. As a result, they are less effective in detecting patterns in certain crimes. In addition, substantial effort is also required for analyzing vast amount of crime data and visualizing the structural views of the entire criminal network. In order to alleviate these problems, an event-based approach to money laundering data analysis and visualization is proposed in this paper. The effectiveness of the proposed method is demonstrated on a money laundering case from Taiwan.

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

crime detection
event-based data analysis


Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming We prove that any iterative sequence generated by the projection decomposition algorithm of Pham Dinh et al. (Optim Methods Softw 23:609629, 2008) in quadratic programming is bounded, provided that the quadratic program in question is two-dimensional and solvable.

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


The impact of gender differences on job satisfaction, job turnover, and career experiences of information systems professionals This research addresses the impact of gender differences upon the career experiences of information systems professionals, including the impact of gender differences on job satisfaction, job tasks, turnover behavior, job search activities, and job transitions. Our findings show that the career experiences of females and males in the IT field are relatively similar. One statistically significant finding was that job satisfaction was higher in current positions, as compared with prior ones but that was true for both genders. With respect to salaries, the mean salaries of male IT professionals in current positions in this sample were greater than the mean salaries of female IT professionals in current positions, but the differences were not statistically significant. In their unfolding model of voluntary turnover, Lee and Mitchell (44) argue that turnover is influenced by a variety of variables, including the occurrence of shocks, following scripts, searching for alternatives, experiencing an image violation, and by lack of job satisfaction. Since a large number of female and male respondents pointed to leaving their positions because of a "shock," this may also point to the fact that external market forces can influence candidates to make career moves because of greater opportunities, salaries, and benefits in the IT field, even when they may have been fairly well-satisfied with their prior positions.

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

diversity
information technology workforce
it turnover
it job satisfaction


performance analysis of the finite source retrial queue with server breakdowns and repairs This paper is concerned with the queueing analysis as well as reliability evaluation of an M/G /1// K retrial queue with a finite number of sources in which the server is subject to breakdowns and repairs. The server has a exponentially distributed life time and a generally distributed repair time. Our analysis extends previous work on this topic and includes the analysis of the arriving customer's distribution, the busy period, and main reliability characteristics. This queueing system and its variants could be used to model magnetic disk memory systems, star-like local area networks and other communication systems with detected or undetected breakdowns.

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

retrial queues
reliability analysis
quasi-random input


Application of the quadrat counts method to the analysis of the spatial breakdown spots pattern in metal gate/MgO/InP structures The breakdown spots spatial distribution in NiSi/MgO/InP structures is analyzed using the quadrat counts method, a classical statistical technique aimed to evaluate the deviation from complete spatial randomness. The spots appear as black dots spread over the gate electrode area and are the result of important local thermal effects occurring during the current runaway associated with the formation of the percolation paths across the dielectric film. Using image analysis techniques and specialized statistical software it is shown that the spots locations follow a homogeneous 2D Poisson distribution, what can be regarded as an indirect indicator of the quality and uniformity of the samples under investigation.

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


Calculation of the probability of correct classification in probabilistic bagged k-Nearest Neighbours This paper presents a new method for computing the probability of correct classification for the k-Nearest Neighbours (kNN) method. The method uses bootstrap to provide the posterior probability which a new object is classified with. This is a measure of the reliability of the classification: it increases as the test object is closer to the training objects of a given class and is more sensitive to the position of the test object in the calibration space than the classical measure of posterior probability in kNN. This reliability of the classification is also used to derive a new rule for classification. (C) 2008 Elsevier B.V. All rights reserved.

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

nearest neighbours
probability of classification


Fluid-structure coupling within a monolithic model involving free surface flows This contribution presents a numerical method for the analysis of fluid-structure interaction problems with free surface flows. In order to achieve high convergence of the coupled solution a consistent space-time finite element discretization for both continua and a strong coupling algorithm is applied to the highly non-linear problem. The formulation also enables the simulation of two-fluid flows. The level set method is applied for capturing complex free surfaces. In order to take discontinuities into account modified ansatz functions are used for finite elements cut by the interface. Two-dimensional examples show the applicability of the developed model. (c) 2005 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 B I O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

space-time finite element method
fluid-structure interaction
incompressible navier-stokes equation
free surface flow
two-fluid flow


Learning from Ideal Edge for Image Restoration Considering the real existent fact of the ideal edge and the learning style of image analogy Without reference parameters, a blind image recovery algorithm using a self-adaptive learning method is proposed in this paper. We show that a specific local image patch with degradation characteristic can be utilized for restoring the whole image. In the training process, a clear counterpart of the local image patch is constructed based on the ideal edge assumption so that identification of the Point Spread Function is no longer needed. Experiments demonstrate the effectiveness of the proposed method on remote sensing images.

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

image restoration
ideal edge
image analogy


One-round multi-party communication complexity of distinguishing sums We consider an instance of the following problem: Parties P1,,Pk P 1 , , P k each receive an input xi x i , and a coordinator (distinct from each of these parties) wishes to compute f(x1,,xk) f ( x 1 , , x k ) for some predicate f. We are interested in one-round protocols where each party sends a single message to the coordinator; there is no communication between the parties themselves. What is the minimum communication complexity needed to compute f, possibly with bounded error? We prove tight bounds on the one-round communication complexity when f corresponds to the promise problem of distinguishing sums (namely, determining which of two possible values the {xi} { x i } sum to) or the problem of determining whether the {xi} { x i } sum to a particular value. Similar problems were studied previously by Nisan and in concurrent work by Viola. Our proofs rely on basic theorems from additive combinatorics, but are otherwise elementary.

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

communication complexity
additive combinatorics


GeoDMAGeographic Data Mining Analyst GeoDMA integrates image processing techniques, feature extraction and data mining. The framework provides spatio-temporal analysis tools to interpret image time series. The simulation module evaluates the accuracy of models using Monte Carlo method. Thematic maps are easily and rapidly created due to integration with TerraView GIS.

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

obia
image segmentation
multitemporal analysis
landscape ecology


A PDA-based record-keeping and decision-support system for traceability in cucumber production For the small-scale and scattered fresh cucumber production in China, the result that production record-keeping and its transfer are inefficient have prevented the wide application of traceability systems in China. With the mobility and computability, Personal Digital Assistant (PDA) provides a new way for agricultural information collection to solve the above problems. Thus a PDA-based Record-keeping and Decision-support System (PRDS) for traceability in cucumber production was developed on Windows Mobile platform invoking a Geographic Information System (GIS) control. For improving the decision making feasibility of PRDS, the fertilization recommendation model and pesticide usage early warning model were developed by using the Technical Specification of Balanced Fertilization by Soil Testing and the Guideline for Safety Application of Pesticides in China. The architecture of PRDS was provided. With Unified Modeling Language (UML), a requirement model including two types of users and 17 use cases was described, and a static class model was also designed, which consisted of table class, table operation class, algorithm class and interface class. Based on these models, the functions of system setup, map management, data management, production record-keeping and decision-support and query, etc., were implemented by adopting Hosting MapInfo MapX Mobile Controls on the .NET Compact Framework 2.0, and the data synchronization was realized by Remote Data Access (RDA). Two agricultural production enterprises were chosen as case study to evaluate the system by questionnaires. The results show that the efficiency of production record-keeping and decision-support is improved by the simple and friendly system.

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


"Keep it secret, keep it safe": Information poverty, information norms, and stigma When information practices are understood to be shaped by social context, privilege and marginalization alternately affect not only access to, but also use of information resources. In the context of information, privilege, and community, politics of marginalization drive stigmatized groups to develop collective norms for locating, sharing, and hiding information. In this paper, we investigate the information practices of a subcultural community whose activities are both stigmatized and of uncertain legal status: the extreme body modification community. We use the construct of information poverty to analyze the experiences of 18 people who had obtained, were interested in obtaining, or had performed extreme body modification procedures. With a holistic understanding of how members of this community use information, we complicate information poverty by working through concepts of stigma and community norms. Our research contributes to human information behavior scholarship on marginalized groups and to Internet studies research on how communities negotiate collective norms of information sharing online.

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


A semantics-based approach for achieving self fault-tolerance of protocols The cooperation of different processes may be lost by mistake when a protocol is executed. The protocol cannot be normally operated under this condition. In this paper, the self fault-tolerance of protocols is discussed, and a semantics-based approach for achieving self fault-tolerance of protocols is presented. Some main characteristics of self fault-tolerance of protocols concerning liveness, nontermination and infinity are also presented. Meanwhile, the sufficient and necessary conditions for achieving self fault-tolerance of protocols are given. Finally, a typical protocol that does not satisfy the self fault-tolerance is investigated, and a new redesign version of this existing protocol using the proposed approach is given.

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

self fault-tolerance
formal method
multimedia communications
protocol engineering
s-t protocol
semantics


Algorithms for analysing related constraint business rules Constraints represent a class of business rules that describe the conditions under which an organisation operates. It is common that organisations implement a large number of constraints in their supporting information systems. To remain competitive in today's ever-changing business environment, organisations are increasingly recognising the ability to evolve the implemented constraints timely and correctly. While many techniques have been proposed to assist constraint specification and enforcement in information systems, little has been done so far to help constraint evolution. In this paper, we introduce a form of constraint analysis that is particularly geared towards constraint evolution. More specifically, we propose several algorithms for determining which constraints collectively restrict a specified set of business objects, and we study their performance. Since the constraints contained in an information system are typically in large quantities and tend to be fragmented during implementation, this type of analysis is desirable and valuable in the process of their evolution.

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

constraints
business rules
constraint analysis


Improved construction for universality of determinant and permanent Valiant [L. Valiant, Completeness classes in algebra, in: Proc. 11th Annual ACM Symposium on the Theory of Computing, Atlanta. GA, 1979, pp. 249-261] proved that every polynomial of formula size e is a projection of the (e + 2) x (e + 2) determinant polynomial. We improve;''e + 2" to "e + I", also for a definition of formula size that does not count multiplications by constants as gates. Our proof imitates the "2e + 2" proof of von zur Gathen [J. von zur Gathen, Feasible arithmetic computations: Valiant's hypothesis, Journal of Symbolic Computation 4 (1987) 137-172], but uses different invariants and a tighter set of base cases. (c) 2006 Elsevier B.V. All rights reserved.

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

computational complexity
algebraic formula size


A new transpose split method for three-dimensional FFTs: performance on an Origin2000 and Alphaserver cluster We discuss a new transpose split method for parallel computations of three-dimensional Fourier transforms. By splitting the data along two dimensions over the processors it allows for a higher degree of parallelization than the original transpose split method. The traditional transpose split method involves one alltoall communication. The new method involves two communication steps in which each processor performs an alltoall communication in groups. The performance of the new method has been evaluated using MPI on an Origin2000 and an Alphaserver cluster and compared with the traditional transpose split method. We found that the extra communication step introduced in the new method only slightly increases communication time. However, an efficient parallelization depends critically on how fast the communications can be performed.

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

pseudospectral direct numerical simulation


A supervised active learning framework for recommender systems based on decision trees A key challenge in recommender systems is how to profile new users. A well-known solution for this problem is to ask new users to rate a few items to reveal their preferences and to use active learning to find optimally informative items. Compared to the application of active learning in classification (regression), active learning in recommender systems presents several differences: although there are no ratings for new users, there is an abundance of available ratingscollectivelyfrom past (existing) users. In this paper, we propose an innovative approach for active learning in recommender systems, which aims at taking advantage of this additional information. The main idea is to consider existing users as (hypothetical) new users and solve an active learning problem for each of them. In the end, we aggregate all solved problems in order to learn how to solve the active learning problem for a real new user. As the ratings of existing users (i.e., labels) are known and are used for active learning purposes, the proposed framework is in fact a supervised active learning framework. Based on this framework, we investigate two different types of models: the first model is based on information about average item ratings and the second on matrix factorization. We present experimental results on the Netflix dataset, which show that the proposed approach significantly outperforms state-of-the-art baselines.

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

active learning
recommender systems
matrix factorization


Social Network Clustering and Visualization using Hierarchical Edge Bundles The hierarchical edge bundle (HEB) method generates useful visualizations of dense graphs, such as social networks, but requires a predefined clustering hierarchy, and does not easily benefit from existing straight-line visualization improvements. This paper proposes a new clustering approach that extracts the community structure of a network and organizes it into a hierarchy that is flatter than existing community-based clustering approaches and maps better to HEB visualization. Our method not only discovers communities and generates clusters with better modularization qualities, but also creates a balanced hierarchy that allows HEB visualization of unstructured social networks without predefined hierarchies. Results on several data sets demonstrate that this approach clarifies real-world communication, collaboration and competition network structure and reveals information missed in previous visualizations. We further implemented our techniques into a social network visualization application on facebook.com and let users explore the visualization and community clustering of their own social networks.

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

visualization
network clustering
edge bundles


A credibility-based fuzzy location model with Hurwicz criteria for the design of distribution systems in B2C e-commerce Facility location problem is one of the most critical elements in the design of distribution systems, and numerous studies have focused on this issue. However, facility location theory and guidelines for N2C firms are sparse. In this paper, with regard to the customer characteristics peculiar to B2C e-commerce and the turbulence of the competitive market, a new fuzzy location model is proposed to optimize the distribution system design in B2C e-commerce. The model adopts a hierarchical agglomerative clustering method to classify customers and estimate the fuzzy delivery cost. At the same time, due to the turbulence of competitive market, both market supply and customer demand are treated as fuzzy variables in the model. Afterward, the credibility measure and Hurwicz criterion are introduced to convert the model into a crisp one which has NP-hard complexity. In order to solve the crisp model, an improved genetic algorithm with particle swarm optimization is developed. Finally, the computational results of some numerical examples are used to illustrate the application and performance of the proposed model and algorithm. (C) 2010 Elsevier Ltd. All rights reserved.

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

fuzzy location model
credibility measure

logistics
b2c e-commerce
fuzzy programming
meta-heuristics


Upper bounds on the statistical distribution of the crest-factor in OFDM transmission This correspondence analyzes the crest-factor behavior of an orthogonal frequency-division multiplexing (OFDM) modem. The behavior is characterized in terms of the complementary distribution function of the crest-factor (CDFC). The CDFC is a key parameter of OFDM systems, for example it provides limits on achievable information rates. Several approximations have been developed in the literature so far, but no true upper bounds dependent on the different constellations that are used in OFDM modulation have been derived. A new approach is given providing upper bounds that substitute for time-consuming simulations.

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

orthogonal frequency-division multiplexing (ofdm)


Coupled effects in stability analysis of pileslope systems A numerical comparison of predictions by limit equilibrium analysis and 3D numerical analysis is presented for a slopepile system. Special attention is given to the coupled analysis based on the explicit-finite-difference code, FLAC 3D. To this end, an internal routine (FISH) was developed to calculate a factor of safety for a pile-reinforced slope according to a shear strength reduction technique. Coupled analyses were performed for stabilizing piles in a slope, in which the pile response and slope stability are considered simultaneously and subsequently the factors of safety are compared to a solution for a homogeneous slope using an uncoupled analysis (limit equilibrium analysis). Based on a limited parametric study, it is shown that the factor of safety for the slope is less conservative for a coupled analysis than for an uncoupled analysis and thus represents a definitely larger safety factor when the piles are installed in the middle of the slopes and the pile heads are restrained.

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

limit equilibrium analysis
3d numerical analysis
shear strength reduction technique
homogeneous slope
factor of safety

pileslope system
coupled/uncoupled analysis


The extension principle and a decomposition of fuzzy sets ? We give an algorithm to decompose a fuzzy interval u. Using this decomposition and the multilinearization of a univariate function f , we obtain an approximation of the fuzzy interval f ( u ) , where f is obtained from f by applying the extension principle. We provide approximation bounds. Some numeric illustration is provided.

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


LTF-C: Architecture, training algorithm and applications of new neural classifier This paper presents a new model of an artificial, neural network solving classification problems, called Local Transfer Function Classifier (LTF-C). Its architecture is very similar to this of the Radial Basis Function neural network (RBF), however it utilizes an entirely different learning algorithm. This algorithm is composed of four main parts: changing positions of reception fields, changing their sizes, insertion of new hidden neurons and removal of unnecessary ones during the training. The paper presents also results of LTF-C application to three real-life tasks: handwritten digit recognition, credit approval and cancer diagnosis. LTF-C was able to solve each of these problems with better accuracy than most popular classification systems. Moreover, LTF-C was relatively small and fast.

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

neural network
classification
recognition
rbf


system for automatic estimation of data sensitivity with applications to access control and other applications The Enterprise Information Security Management (EISM) system aims to semi-automatically estimate the sensitivity of enterprise data through advanced content analysis and business process mining. We demonstrate a proof-of-concept of EISM that crawls all the files in a personal computer and estimates the sensitivity of individual files and the overall sensitivity level of the computer. The system can identify 11 different personally identifiable information (PII) types and 11 sensitive data categories, and estimate data sensitivity based on the identified sensitive information in the data. Furthermore, the tool produces the evidences of the discovered sensitive information including the surrounding context in the document to help users understand what kinds of sensitive information are stored in their computer. The evidences allow users can easily redact the sensitive information or move it to a more secure location. Thus, this system can be used as a privacy enhancing tool as well as a security tool.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 leakage protection
data sensitivity estimation
data-centric security


Cournot games with linear regression expectations in oligopolistic markets In this paper, a Cournot game in an oligopolistic market with incomplete information is considered. The market consists of some producers that compete for getting higher payoffs. For optimal decision making, each player needs to estimate its rivals' behaviors. This estimation is carried out using linear regression and recursive weighted least-squares method. As the information of each player about its rivals increases during the game, its estimation of their reaction functions becomes more accurate. Here, it is shown that by choosing appropriate regressors for estimating the strategies of other players at each time-step of the market and using them for making the next step decision, the game will converge to its Nash equilibrium point. The simulation results for an oligopolistic market show the effectiveness of the proposed method. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

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

cournot game
incomplete information
estimation
nash equilibrium


light-weight context recovery for efficient and accurate program analyses To compute accurate information efficiently for programs that use pointer variables, a program analysis must account for the fact that a procedure may access different sets of memory locations when the procedure is invoked under different callsites. This paper presents light-weight context recovery , a technique that can efficiently determine whether a memory location is accessed by a procedure under a specific callsite. The paper also presents a technique that uses this information to improve the precision and efficiency of program analyses. Our empirical studies show that (1) light-weight context recovery can be quite precise in identifying the memory locations accessed by a procedure under a specific call-site and (2) distinguishing memory locations accessed by a procedure under different callsites can significantly improve the precision and the efficiency of program analyses on programs that use pointer variables.

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

precise
empirical studies
program
recovery
use
efficiency
context
account
paper
access

variability
program analysis
locatability
computation
memorialized
aliasing
pointers
informal
lighting
slicing


Zero-truncated Poisson-Lindley distribution and its application The zero-truncated Poisson-Lindley distribution is introduced and investigated. In particular, the method of moments and maximum likelihood estimators of the distribution's parameter are compared in small and large samples. Application of the model to real data is given. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved.

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

poisson-lindley distribution
zero-truncated distribution
bias