Transition to postmodern science-related scientometric data A change in scientific developments in recent decades is widely proclaimed which may be associated with terms like postmodern science or steady state science. This change is usually discussed from a more epistemological viewpoint. In order to enhance the understanding of the underlying key factors, bibliometric, demographic and Nobel Prize recipient data spanning of the last hundred years are considered and analyzed. It is found that in general the considered data point to a quasi-steady state in bibliometric developments of highly developed countries. For emerging countries, such a steady state is not yet attained; therefore, the research output in scientific journal articles is still expected to rise considerably. Consequences and interpretations of an ever growing research output in relation to the increasing age of Nobel Prize recipients are discussed and conclusions are drawn from the considered data.

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


development of virtual training simulators with modelica Virtual training simulators, frequently called virtual-labs, are effective educational tools. Virtual-labs used in engineering education are frequently based on the interactive simulation of DAE-hybrid models, i. e., models composed of algebraic and differential equations, and discrete-time events. Modelica is an object-oriented modeling language intended to describe this type of models. A methodology and a new software tool for developing virtual-labs based on DAE-hybrid models using Modelica are presented. The methodology allows to adapt any Modelica model for use in interactive simulations. The software tool is a Modelica library, named Interactive , that facilitates the description of the virtual-lab view (i.e., the graphic user-to-model interactive interface) and the model-to-view communication. Interactive contains a set of ready-to-use Modelica models of visual interactive elements, including containers, animated 3D geometric shapes and interactive controls. The virtual-lab, which is completely described in Modelica language, is translated into executable code using the Dymola modeling environment. Interactive's components are C++ code generators that, when the virtual-lab is executed, automatically generate the C++ code describing the virtual-lab view and the bidirectional model-to-view communication. This generated C++ code uses the VTK and Qt libraries. The proposed approach is illustrated by means of an example: the development of the virtual-lab of a double-pipe heat exchanger with manual and PID control.

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

training simulator
virtual laboratory
object-oriented modeling
control education


A dimensional decomposition approach to identifying efficient units in large-scale DEA models In this paper, we propose the use of a dimensional decomposition procedure together with lexicographic parametric programming to reduce computational burden when identifying the efficient decision making units in data envelopment analysis (DEA). The use of lexicographic parametric programming makes it possible to develop an efficient algorithm for the problems with few inputs and Outputs. Based on this we propose the procedure which first partitions the original problem dimensionally into sub-problems and then identifies the efficient units of the sub-problems. Since those units are a subset of the weakly efficient solutions of the original problem, they are used as an initial approximation for the efficient units of the original problem. The efficiency of the approach is illustrated by numerical results. (C) 2007 Published by Elsevier Ltd.

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

efficiency analysis
computational aspects


Study on stand-alone power supply options for an isolated community Eight power supply options including renewable and diesel generation are examined. Techno-economic analyses are performed to achieve an optimal system configuration. The hybrid solarwinddieselbattery is discussed with an elaborate analysis.

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

remote area
power generation options
energy systems
techno-economic study


A look at the past and present of optimization An editorial This special issue of the European Journal of Operational Research is devoted to the EURO XXIV Conference, that was held at the facilities of the University of Lisbon (Portugal) from July 11 to July 14, 2010. With over 700 sessions for a total of approximately 2350 presentations, and with 2700 participants (delegates and accompanying persons) coming from 69 countries, this was the largest EURO conference ever. After presenting the Programme Committee and the Organizing Committee of the conference, we introduce nine keynote tutorials and one paper awarded with the Management Science Strategic Innovation Prize 2010, which constitute this special issue. They give an exciting overview of the history and the state-of-the-art of optimization.

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 B


A fully data-dependent criterion for free angles selection in spatial PH cubic biarc Hermite interpolation Cubic biarcs are the natural counterpart, in the context of the PH spatial Hermite interpolation, of piecewise quadratics for Hermite interpolation of standard parametric curves. Recently, it has been shown that, spatial Hermite interpolation can be always treated with PH cubic biarcs, providing an interesting alternative to the use of higher degrees, see Bastl et al. (2014). Beside the parameter value at the joint of the two arcs, which is typically free in any scheme of this kind, two free angular parameters remain. They should be automatically fixed by some suitable criterion in order to ensure the generation of interpolants with a reasonable shape. In this paper, an alternative to the constant choice of free parameters presented in Bastl et al. (2014) is proposed. It consists of an extension of the so called CC selection strategy introduced in Farouki et al. (2008) to the biarc setting. Such strategy is fully data-dependent, does not require any special configuration of the coordinate system and it guarantees the PH cubic reproduction when such kind of the interpolant exists. Moreover, the obtained scheme possesses other two important features, i.e. it is third order accurate and gives the possibility to control the torsion sign of the produced interpolant, in case with the introduction of an additional tension parameter relaxing the smoothness from C1 C 1 to G1 G 1 . The numerical results, based also on the straightforward spline extension of the scheme, confirm the developed theoretical analysis.

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

pythagoreanhodograph curves
shape preserving


On average edge length of minimum spanning trees This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on n + 1 vertices is less than or equal to the average edge length of all the n + 1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with results given by Frieze and Steele. (C) 1999 Elsevier Science B.V. All rights reserved.

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

minimum spanning tree
complete graph
average edge length


A Robust Building Energy Management Algorithm Validated in a Smart House Environment A building energy management (BEM) system is a core hardware/software platform that enables demand response applications for building operators in the smart grid environment. This paper presents the BEM algorithm that is designed to be robust against communication failures and data errors. It has been implemented in the smart building located at Yildiz Technical University in Istanbul, Turkey, and results are reported herein. Appliance usage profiles and customer preferences used in the BEM demonstration were derived from a survey of Turkish customers. Both summer and winter usage profiles were used to validate the efficacy of the proposed algorithm in a real-world smart building environment. The paper also discusses lessons learned from field implementation.

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

automated demand response (adr)
building energy management (bem)
smart house implementation


Implementation of an automated system for monitoring adherence to hemodialysis treatment: A report of seven years of experience In this paper we present the clinical deployment and evaluation of a computerized system, EMOSTAT, aimed at improving the quality of hemodialysis sessions. EMOSTAT automatically imports data from the hemodialysis monitoring software tools and analyzes the delivered treatment looking at six clinically relevant parameters. Failures-to-adhere (FtAs) to the planned treatment are detected and reported to the care-givers. EMOSTAT has been used for more than seven years in the management of a dialysis service located in Mede, Italy. A total of 72 patients were monitored and 21251 dialyses were collected. Data analysis is performed on the periods 20022005 and 20052008, corresponding to two different software releases. The system had been exploited into everyday clinical practice for the entire considered period. The number of FtAs significantly decreased along the first period: the bulk blood flow FtAs decreased after the introduction of the system. Hemodialysis sessions lasted longer in the second period. Co-occurring FtAs, highlighting the presence of complex FtAs patterns, were also detected. EMOSTAT provides an effective way to re-focus the attention of the dialysis department on the treatment plan and on its implementation. The automatic data collection and the design philosophy of EMOSTAT allowed the routine use of the system.

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

quality assessment
failure to adhere
data mining
it solutions
telemedicine


A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection Many applications, such as telecommunication and commercial video broadcasting systems, computer and networks, and Web mining, require modeling data streams that exhibit context dependency. Context dependency refers to the fact that the statistical distribution of a new sample is heavily conditioned by a set of the most recent samples that precedes it. However, statistical models such as context trees (CTs) that capture context dependency tend to be poorly scalable. This paper proposes a solution to the scalability problem of these models by transforming a data stream into high-level aggregates of clusters instead of modeling the original data stream. Using an information-theoretical approach, we leverage existing clustering techniques for static categorical data sets to capture dynamic data streams based on the CT models. Because the proposed approach can be applied repeatedly on different levels of a clustering hierarchy, it is suitable for predicting trends and detecting anomalies at any aggregate (or detail) level required. Experimental results, including video stream modeling, network intrusion detection, and Monte Carlo simulations, show that the proposed method is efficient in capturing high-level aggregates of large-scale dynamic systems and very effective for trend prediction and anomaly detection.

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

artificial intelligence
data mining
forecasting
markov chains
trend analysis
variable-length markov models (vlmm)


Aspect-oriented development of cluster computing software In complex software systems, modularity and readability tend to be degraded owing to inseparable interactions between concerns that are distinct features in a program. Such interactions result in tangled code that is hard to develop and maintain. Aspect-Oriented Programming (AOP) is a powerful method for modularizing source code and for decoupling cross-cutting concerns. A decade of growing research on AOP has brought the paradigm into many exciting areas. However, pioneering work on AOP has not flourished enough to enrich the design of distributed systems using the refined AOP paradigm. This article investigates three case studies that cover time-honored issues such as fault-tolerant computing, network heterogeneity, and object replication in the cluster computing community using the AOP paradigm. The aspects that we define here are simple, intuitive, and reusable. Our intensive experiences show that (i) AOP can improve the modularity of cluster computing software by separating the source code into base and instrumented parts, and (ii) AOP helps developers to deploy additional features to legacy cluster computing software without harming code modularity and system performance.

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

aspect-oriented programming
fault tolerance
message-passing interface
key-value storage


Small-vocabulary speech recognition using a silent speech interface based on magnetic sensing ? This paper reports on word recognition experiments using a silent speech interface based on magnetic sensing of articulator movements. A magnetic field was generated by permanent magnet pellets fixed to relevant speech articulators. Magnetic field sensors mounted on a wearable frame measured the fluctuations of the magnetic field during speech articulation. These sensor data were used in place of conventional acoustic features for the training of hidden Markov models. Both small vocabulary isolated word recognition and connected digit recognition experiments are presented. Their results demonstrate the ability of the system to capture phonetic detail at a level that is surprising for a device without any direct access to voicing information.

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

silent speech interfaces
clinical speech technology
articulography
multi-modal speech recognition


100G optical transport based on polarization and/or subcarrier multiplexed modulation formats Future optical transport systems at 100G and beyond will inevitably make use of advanced modulation formats and digital signal processing techniques. In this contribution, we discuss 100G techniques based on the combination of subcarrier multiplexing, and/or polarization multiplexing with various phase shifted keyed (xPSK) modulation formats. Experimental results from a series of lab verifications and field trials demonstrate that these techniques, together with coherent detection and advanced DSP, are critical for high performance 100G transponder development.

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

modulation formats
coherent detection
digital signal processing


Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks This paper presents and analyzes a three-tier architecture for collecting sensor data in sparse sensor networks. Our approach exploits the presence of mobile entities (called MULEs) present in the environment. When in close range, MULEs pick up data from the sensors, buffer it, and deliver it to wired access points. This can lead to substantial power savings at the sensors as they only have to transmit over a short-range. This paper focuses on a simple analytical model for understanding performance as system parameters are scaled. Our model assumes a two-dimensional random walk for mobility and incorporates key system variables such as number of MULEs, sensors and access points. The performance metrics observed are the data success rate (the fraction of generated data that reaches the access points), latency and the required buffer capacities on the sensors and the MULEs. The modeling and simulation results can be used for further analysis and provide certain guidelines for deployment of such systems.

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


Admissible regions for rational cubic spirals matching G2 G 2 Hermite data ? This paper finds reachable regions for a single segment of parametric rational cubic Bzier spiral matching G2 G 2 Hermite data. First we derive spiral conditions for rational cubics and then we use a free parameter to find the admissible region for a spiral segment with respect to the curvatures at its endpoints under the fixed positional and tangential end conditions. Spirals are curves of constant sign monotone curvature and therefore have the advantage that the minimum and maximum curvatures are at their endpoints only.

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

path planning
g2 g 2 hermite g2 g 2 g2 g 2 g 2
computer-aided design (cad)
computer graphics


can program profiling support value prediction? This paper explores the possibility of using program profiling to enhance the efficiency of value prediction. Value prediction attempts to eliminate true-data dependencies by predicting the outcome values of instructions at run-time and executing true-data dependent instructions based on that prediction. So far, all published papers in this area have examined hardware-only value prediction mechanisms. In order to enhance the efficiency of value prediction, it is proposed to employ program profiling to collect information that describes the tendency of instructions in a program to be value-predictable. The compiler that acts as a mediator can pass this information to the value-prediction hardware mechanisms. Such information can be exploited by the hardware in order to reduce mispredictions, better utilize the prediction table resources, distinguish between different value predictability patterns and still benefit from the advantages of value prediction to increase instruction-level parallelism. We show that our new method outperforms the hardware-only mechanisms in most of the examined benchmarks.

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

value order dependencies method efficiency values collect mediator support hardware paper

speculative execution
benchmark
instruction-level parallelism
data dependence
instruction
data
compilation
timing
value-prediction
profiles
informal
resource
predict
pattern


Capacitance Reduction Technique for Switched-Capacitor Circuits Based on Charge Distribution and Partial Charge Transfer This paper proposes a technique to reduce the capacitance spread in switched-capacitor (SC) filters. The proposed technique is based on a simple charge distribution and partial charge transfer which is applicable to various integrator topologies. An implementation example on an existing integrator topology and a design example of a 2nd-order SC low-pass filter are given to demonstrate the performance of the proposed technique. A design example of an SC filter show that the filter designed using the proposed technique has an approximately 23% less total capacitance than the one of SC low-pass filter with conventional capacitance spread reduction technique.

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


"I know what you need to buy": context-aware multimedia-based recommendation system Many people spend significant amounts of time navigating the worldwide web to see hypermedia, including online shopping. Multimedia shown in a web browser is one of the main sources of information for online shopping. In many cases, users are motivated to purchase a specific item by the impressions they receive when they are looking at related hypermedia: e.g. they may gain motivation to purchase a car after seeing a transportation item on a news website, especially when the users are looking at the images contained in the hypermedia. This leads to the motivation to build an intelligent system that is aware of what users are thinking when they are navigating hypermedia. This paper proposes an agent-based methodology that can first identify semantics of hypermedia images in order to derive contextual information, then recommends specific web services by anticipating needs or products in which the user may be interested. To identify and interpret the images, we propose extended ARG, which integrates ARG image content and semantics in the corresponding ontology. To show the feasibility of the idea, we developed CAMA (Context-Aware Multimedia Agent), a prototype agent-based system. (C) 2003 Elsevier Ltd. All rights reserved.

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

ontology
recommendation system
multimedia
arg
online shopping

semantic web
agent technology
context-awareness


Modeling of p38 mitogen-activated protein kinase inhibitors using the Catalyst (TM) HypoGen and k-nearest neighbor QSAR methods We have employed in parallel the Catalyst HypoGen pharmacophore modeling approach and the variable selection k-nearest neighbor quantitative structure-activity relationship (kNN QSAR) method to model a diverse data set of p38 mitogen-activated protein (MAP) kinase inhibitors. The HypoGen pharmacophore model, developed from a novel automated training set selection protocol, identified chemical functional features that were characteristic of the active compounds and differentiated the active from the inactive inhibitors. The kNN QSAR modeling employed topological descriptors and afforded predictive QSAR models with consistently high values of both leave-one-out cross-validated R-2 for the training set and predictive R-2 for the test set. The results of both modeling approaches were sensitive to the selection of the training and test sets used for model development and validation. The resulting Catalyst pharmacophore and kNN QSAR models can be used concurrently for rapid virtual screening of chemical databases to identify novel p38 MAP kinase inhibitors. (C) 2004 Elsevier Inc. All rights reserved.

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

p38 map kinase inhibitors
hypogen
knn qsar

rational selection of training and test sets


e-Learning continuance: the impact of interactivity and the mediating role of imagery, presence and flow A comprehensive model of the direct and indirect effects of interactivity is proposed and validated. Interactivity influences the e-learners responses through the intervening effects of imagery, spatial and copresence, and flow. Imagery processes influence spatial and copresence feelings, and flow. Behavioural intention is determined by both attitude and copresence, and prompts actual e-learning continuance.

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


Multidimensional least-squares fitting with a fuzzy model The aim of this paper is to deal with the question of fuzzy multivariable linear regression by least squares. Similar to the traditional least-squares method, we develop a fuzzy analogue by a distance defined on a fuzzy number space, and propose a fuzzy multivariable linear regression model. It iis shown that the model has a unique solution and the solution can be given in an analytic expression. In this paper, we also give an index to evaluate the goodness of fit between the observed value and the estimated value. (C) 2001 Elsevier Science B.V. All rights reserved.

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

multivariable regression analysis
fuzzy least squares


A sparse mesh for Compact Finite DifferenceFourier solvers with radius-dependent spectral resolution in circular domains This paper presents a new method for the resolution of elliptic and parabolic equations in circular domains. It can be trivially extended to cylindrical domains. The algorithm uses a mixed Fourier-Compact Finite Difference method. The main advantage of the method is achieved by a new concept of mesh. The topology of the new grid keeps constant the aspect ratio of the cells, avoiding the typical clustering for radial structured meshes at the center. The reduction of the number of nodes has as a consequence the reduction in memory consumption. In the case of fluid mechanics problems, this technique also increases the time step for a constant Courant number. Several examples are given in the paper which show the potential of the 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

direct numerical simulation
parabolic equation
radial mesh
compact finite differences
cfl condition


A constraint solver and its application to path feasibility analysis Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

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

constraint solving
test data generation
infeasible paths


Image-based memory for robot navigation using properties of omnidirectional images This paper proposes a new technique for vision-based robot navigation. The basic framework is to localise the robot by comparing images taken at its current location with reference images stored in its memory. In this work, the only sensor mounted on the robot is an omnidirectional camera. The Fourier components of the omnidirectional image provide a signature for the views acquired by the robot and can be used to simplify the solution to the robot navigation problem. The proposed system can calculate the robot position with variable accuracy (hierarchical localisation) saving computational time when the robot does not need a precise localisation (e.g. when it is travelling through a clear space). In addition, the system is able to self-organise its visual memory of the environment. The self-organisation of visual memory is essential to realise a fully autonomous robot that is able to navigate in an unexplored environment. Experimental evidence of the robustness of this system is given in unmodified office environments.

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

omnidirectional vision
image-based navigation
fourier transform
mobile robot


A first-order epistemic quantum computational semantics with relativistic-like epistemic effects Quantum computation has suggested new forms of quantum logic, called quantum computational logics. In these logics well-formed formulas are supposed to denote pieces of quantum information: possible pure states of quantum systems that can store the information in question. At the same time, the logical connectives are interpreted as quantum logical gates: unitary operators that process quantum information in a reversible way, giving rise to quantum circuits. Quantum computational logics have been mainly studied as sentential logics (whose alphabet consists of atomic sentences and of logical connectives). In this article we propose a semantic characterization for a first-order epistemic quantum computational logic, whose language can express sentences like Alice knows that everybody knows that she is pretty. One can prove that (unlike the case of logical connectives) both quantifiers and epistemic operators cannot be generally represented as (reversible) quantum logical gates. The act of knowing and the use of universal (or existential) assertions seem to involve some irreversible theoretic jumps, which are similar to quantum measurements. Since all epistemic agents are characterized by specific epistemic domains (which contain all pieces of information accessible to them), the unrealistic phenomenon of logical omniscience is here avoided: knowing a given sentence does not imply knowing all its logical consequences.

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

quantum computation
quantum computational logics
epistemic operators


Vulnerability aware graphs for RFID protocol security benchmarking Security and privacy issues in Radio Frequency Identification (RFID) systems mainly result from limited storage and computation resources of RFID tags and unpredictable communication environment. Although many security protocols for RFID system have been proposed, most of them have various flaws. We propose a random graph-based methodology enabling automated benchmarking of RFID security. First, we formalize the capability of adversaries by a set of atomic actions. Second, Vulnerability Aware Graphs (VAGs) were developed to elaborate the interactions between adversaries and RFID systems, which are used to discover the potential attacks of adversaries via some paths on the graphs. The quantitative analysis on VAGs can predict the probability that the adversary leverages the potential flaws to perform attacks. Moreover, a joint entropy-based method is provided to measure the indistinguishability of RFID tags under passive attacks. Analysis and simulation were conducted to show the validity and effectiveness of VAGs.

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

rfid
vulnerability aware graphs
benchmarking


Virtual Mirror Rendering With Stationary RGB-D Cameras and Stored 3-D Background Mirrors are indispensable objects in our lives. The capability of simulating a mirror on a computer display, augmented with virtual scenes and objects, opens the door to many interesting and useful applications from fashion design to medical interventions. Realistic simulation of a mirror is challenging as it requires accurate viewpoint tracking and rendering, wide-angle viewing of the environment, as well as real-time performance to provide immediate visual feedback. In this paper, we propose a virtual mirror rendering system using a network of commodity structured-light RGB-D cameras. The depth information provided by the RGB-D cameras can be used to track the viewpoint and render the scene from different prospectives. Missing and erroneous depth measurements are common problems with structured-light cameras. A novel depth denoising and completion algorithm is proposed in which the noise removal and interpolation procedures are guided by the foreground/background label at each pixel. The foreground/background label is estimated using a probabilistic graphical model that considers color, depth, background modeling, depth noise modeling, and spatial constraints. The wide viewing angle of the mirror system is realized by combining the dynamic scene, captured by the static camera network with a 3-D background model created off-line, using a color-depth sequence captured by a movable RGB-D camera. To ensure a real-time response, a scalable client-and-server architecture is used with the 3-D point cloud processing, the viewpoint estimate, and the mirror image rendering are all done on the client side. The mirror image and the viewpoint estimate are then sent to the server for final mirror view synthesis and viewpoint refinement. Experimental results are presented to show the accuracy and effectiveness of each component and the entire system.

O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 denoising
image reconstruction
client-server systems
markov random field
rgb-d system
depth image denoising
3-d scene scanning


Predicting groundwater level fluctuations with meteorological effect implicationsA comparative study among soft computing techniques The knowledge of groundwater table fluctuations is important in agricultural lands as well as in the studies related to groundwater utilization and management levels. This paper investigates the abilities of Gene Expression Programming (GEP), Adaptive Neuro-Fuzzy Inference System (ANFIS), Artificial Neural Networks (ANN) and Support Vector Machine (SVM) techniques for groundwater level forecasting in following day up to 7-day prediction intervals. Several input combinations comprising water table level, rainfall and evapotranspiration values from Hongcheon Well station (South Korea), covering a period of eight years (20012008) were used to develop and test the applied models. The data from the first six years were used for developing (training) the applied models and the last two years data were reserved for testing. A comparison was also made between the forecasts provided by these models and the Auto-Regressive Moving Average (ARMA) technique. Based on the comparisons, it was found that the GEP models could be employed successfully in forecasting water table level fluctuations up to 7 days beyond data records.

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

groundwater level fluctuations
prediction
arma


Use of visual simulation in construction technology education Construction technology education aims to provide students with factual and procedural knowledge about how plant and equipment and operations are sequenced in construction. Visual simulation is a powerful tool which can be used as a platform for delivering construction technology material for educational purposes. It can used to enhance the visual presentation of construction technologies, especially in the classroom environment. This article describes the authors' experiences of using visual simulation as a tool in facilitating different learning models. Future plans for research and developments in the use of visual simulation are presented. (C) 1999 John Wiley & Sons, Inc.

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


A Strategy to Reduce the Control Packet Load of AODV Using Weighted Rough Set Model for MANET A mobile Ad-hoc networks consists of wireless hosts that may move often, movement of host results changes in path. The well known Ad-Hoc On-demand distance vector routing protocol determines a route when no route exists or route breaks. To establish new path from source to destination, it broadcast control packets (route request pockets), which increases the network bandwidth consumption. As mobile Ad-hoc networks have limited bandwidth, it is important to reduce the control packets. We propose a protocol which uses the weighted Rough set model to control the route request packets in the existing Ad-hoc on-demand distance vector routing protocol. Weighted Rough set theory is a mathematical tool to deal with vagueness, uncertainty and it also considers the importance of the objects.

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


PEAKS A system for the automatic evaluation of voice and speech disorders We present a novel system for the automatic evaluation of speech and voice disorders. The system can be accessed via the internet platform-independently. The patient reads a text or names pictures. His or her speech is then analyzed by automatic speech recognition and prosodic analysis. For patients who had their larynx removed due to cancer and for children with cleft lip and palate we show that we can achieve significant correlations between the automatic analysis and the judgment of human experts in a leave-one-out experiment (p<.001). A correlation of .90 for the evaluation of the laryngectomees and .87 for the evaluation of the childrens data was obtained. This is comparable to human inter-rater correlations.

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

automatic evaluation of speech and voice pathologies


Correlation optimized warping and dynamic time warping as preprocessing methods for chromatographic data Two different algorithms for time-alignment as a preprocessing step in linear factor models are studied. Correlation optimized warping and dynamic time warping are both presented in the literature as methods that can eliminate shift-related artifacts from measurements by correcting a sample vector towards a reference. In this study both the theoretical properties and the practical implications of using signal warping as preprocessing for chromatographic data are investigated. The connection between the two algorithms is also discussed. The findings are illustrated by means of a case study of principal component analysis on a real data set, including manifest retention time artifacts, of extracts from coffee samples stored under different packaging conditions for varying storage times. We concluded that for the data presented here dynamic time warping with rigid slope constraints and correlation optimized warping are superior to unconstrained dynamic time warping; both considerably simplify interpretation of the factor model results. Unconstrained dynamic time warping was found to be too flexible for this chromatographic data set, resulting in an overcompensation of the observed shifts and suggesting the unsuitability of this preprocessing method for this type of signals. Copyright (C) 2004 John Wiley Sons, Ltd.

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


Host-to-Host Congestion Control for TCP The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works. Performance characteristics of a particular version of TCP are defined by the congestion control algorithm it employs. This paper presents a survey of various congestion control proposals that preserve the original host-to-host idea of TCP-namely, that neither sender nor receiver relies on any explicit notification from the network. The proposed solutions focus on a variety of problems, starting with the basic problem of eliminating the phenomenon of congestion collapse, and also include the problems of effectively using the available network resources in different types of environments (wired, wireless, high-speed, long-delay, etc.). In a shared, highly distributed, and heterogeneous environment such as the Internet, effective network use depends not only on how well a single TCP-based application can utilize the network capacity, but also on how well it cooperates with other applications transmitting data through the same network. Our survey shows that over the last 20 years many host-to-host techniques have been developed that address several problems with different levels of reliability and precision. There have been enhancements allowing senders to detect fast packet losses and route changes. Other techniques have the ability to estimate the loss rate, the bottleneck buffer size, and level of congestion. The survey describes each congestion control alternative, its strengths and its weaknesses. Additionally, techniques that are in common use or available for testing are described.

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

tcp
congestion control
congestion collapse

packet reordering in tcp
wireless tcp
high-speed tcp


exploiting contextual information in recommender systems Recommender Systems help an on-line user to tame information overload and are being used now in complex domains where it could be beneficial to exploit context-awareness, e.g., in travel recommendation. Technically, in Recommender Systems we can interpret context as a set of constraints or preferences over the usage of items determined by the contextual conditions (e.g., today it is raining or the user is in a particular location). In fact, there is a lack of approaches to deal effectively with contextual data. This thesis investigates some approaches to exploit context in Recommender Systems. It provides a general architecture of context-aware Recommender Systems and analyzes separate components of this model. The main focus is to investigate new approaches that can bring a real added value to users. In this paper I also describe my initial results on item selection and item weighting for context-dependent Collaborative Filtering (CF). Moreover, I shall present my ongoing research on CF hybridization using context.

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


model-based concerns mashups for mobile hypermedia Mobile (or Physical) Hypermedia combines the navigational style typical of Web applications with the functionality of location and context-aware software. Users explore digital and physical relationships while accessing to information about their actual location, e.g. the object in front of them. Similar to "conventional" Web applications one might suffer usability problems when dealing with multiple informational concerns, but the situation gets worse because of screen size issues, the need to avoid user distraction, etc. In this paper we outline our model-based approach for building mobile hypermedia applications by combining ("mashing up") information corresponding to multiple concerns in a modular, usable way. Architectural issues are discussed and a simple example is presented together with its implementation.

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

context-aware applications
mobile computing
architectures


an experiment in integrated multimedia conferencing This paper deals with the integration of multimedia conferencing facilities into an existing software environment. We assume that the "semantics" of the conferencing facilities have already been defined and address only the issue of how to implement those semantics in such a way as to minimize the impact on existing software. In particular, users should be able to invoke any application from within the framework of a conference, and programmers should be able to develop new applications without having to deal explicitly with conferencing issues. We present the basic architectural approachs to this problem and discuss an early experiment with one of them.

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

multimedia framework software applications paper users

addressing experience environments semantic architecture programmer integrability


Chimerism in Black Southern African Patients with True Hermaphroditism 46,XX/47XY,+21 and 46,XX/46,XY True hermaphroditism is defined by the presence of both testicular and ovarian tissue in an individual. True hermaphrodites usually present at birth with ambiguous genitalia, and subsequent invasive investigations are needed to confirm the diagnosis. Several large cohorts of black South Africans with true hermaphroditism have been described, and by far the majority of those investigated had a 46,XX karyotype, with absence of the SRY sequence. This paper represents the first report of the molecular investigation of mosiacism/chimerism as the cause of hermaphroditism in black southern African patients. It is the second report worldwide of a 46,XX/47,XY,+21 chimera, with the first described in a Japanese infant in 1994. Case 1 in the present study is a child who is a 46,XX/47,XY,+21 tetragametic chimera. Molecular studies revealed two paternal and two maternal alleles at four of ten STR loci investigated and three alleles at four of these loci. The young boy exhibited no features of Down syndrome, other than a unilateral single palmar crease. Cases 2 and 3 both have a 46,XX/46,XY karyotype. Chimerism is supported by molecular analysis in Case 2, and molecular studies were not done for Case 3.

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


Efficient identifications of structural similarities for graphs Measuring and detecting graph similarities is an important topic with numerous applications. Early algorithms often incur quadratic time or higher, making them unsuitable for graphs of very large scales. Motivated by the cooling process of an object in a thermodynamic system, we devise a new method for measuring graph similarities that can be carried out in linear time. Our algorithm, called Random Walker Termination (RWT), employs a large number of random walkers to capture the structure of a given graph using termination rates in a time sequence. To verify the effectiveness of the RWT algorithm, we use three major graph models, namely, the Erd?s-Rnyi random graphs, the Watts-Strogatz small-world graphs, and the Barabsi-Albert preferential-attachment graphs, to generate graphs of different sizes. We show that the RWT algorithm performs well for graphs generated by these models. Our experiment results agree with the actual similarities of generated graphs. Using self-similarity tests, we show that RWT is sufficiently stable to generate consistent results. We use the graph edge rerouting test and the cross model test to demonstrate that RWT can effectively identify structural similarities between graphs.

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

graph similarity
large-scale graphs
linear-time algorithm


Destruction of normal distribution in small samples by centering and scaling It is less emphasized in scientific literature that centering and scaling of data may drastically change the original distribution of the data for small samples. The destruction of the original distribution depends on the source of the estimation of the mean (centering) and the divisor (scaling) where the latter is connected to the spread of data. In our comparative study we focus on cases, where the sample is taken from normally distributed data; the means and the standard deviations are population or sample based. We discuss six cases in transforming the data or the sample means. Most of them are studied previously, but some of them have not been theoretically investigated. The transformed data follow normal distribution in three cases, if the scaling is performed with population standard deviation. In one case, the final distribution is related to beta-distribution with astonishing density functions for N = 2 Dirac-delta, N - 3 Viking helmet like and N - 4 uniform distributions. Another case is the well-known t-distribution. For one of the transformed data, we were not able to identify the general form. Here we obtained only numerical results for 3 <= N. The effect of the transformations was tested on experimental data representing more or less normally distributed variables. We found that transformations using the sample standard deviation were significantly less normally distributed-like than the original data for small samples, but the other transformations enhanced the normal distribution-like feature. The results point out that centering and especially scaling require consideration for small samples up to questioning the reality of subsequent data evaluation processes where normal distribution is assumed. Copyright (C) 2011 John Wiley & Sons, Ltd.

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


Nonmonotonic proof systems: Algebraic foundations A general framework for the algebraization of a category of nonmonotonic logics has been suggested. This method has been applied to the systems of Gabbay, and to Cumulative, Preferential and Ranked systems. The minimal logics required to serve as the base logics for the above systems are investigated. MAK triples and KLM triples are formed in ways similar to MAK models and KLM models but now on the algebraic structures for the nonmonotonic systems, thereby a new type of semantics is given to these systems.

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

nonmonotonic logic
algebraic semantics
cumulative system
preferential system
ranked system


On the Diversity-Multiplexing Tradeoff in MIMO Wireless Channels at Finite SNRs In this paper a new framework to characterize the trade off between diversity and multiplexing gains of Multi Input Multi Output (MIMO) wireless systems at finite Signal to Noise Ratios (SNRs) is presented By suitable definitions of non asymptotic diversity and multiplexing gains we extract a useful tool to investigate the performance of space time schemes at finite SNRs Exact results on the diversity multiplexing tradeoff (DMT) are derived for Multi Input Single Output (MISO) Single Input Multi Output (SIMO) and 2 x 2 MIMO channels We show that our outcomes coincide with the Zheng and Tse s results at high SNRs When the new definitions of non asymptotic diversity and multiplexing gains are used the resulted DMT converges to its asymptotic value at realistic SNRs Furthermore using these definitions enables the diversity gain to represent the outage probability with reasonable accuracy

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

diversity multiplexing tradeoff (dmt)
multi input multi output (mimo)


Effects of perceptual experience on children's and adults perception of unfamiliar rhythms Rhythm and meter are fundamental components of music that are universal yet also culture specific. Although simple, isochronous meters are preferred and more readily discriminated than highly complex, nonisochronous meters, moderately complex nonisochronous meters do not pose a problem for listeners who are exposed to them from a young age. The present work uses a behavioral task to examine the ease with which listeners of various ages acquire knowledge of unfamiliar metrical structures from passive exposure. We examined perception of familiar (Western) rhythms with an isochronous meter and unfamiliar (Balkan) rhythms with a nonisochronous meter. We compared discrimination by American children (5 to 11 years) and adults before and after a 2-week period of at-home listening to nonisochronous meter music from Bulgaria. During the first session, listeners of all ages exhibited superior discrimination of isochronous than in nonisochronous melodies. Across sessions, this asymmetry declined for young children but not for older children and adults.

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

perceptual learning
rhythm perception
development
enculturation


An empirical study on the implementation and evaluation of a goal-driven software development risk management model Building a quality software product in the shortest possible time to satisfy the global market demand gives an enterprise a competitive advantage. However, uncertainties and risks exist at every stage of a software development project. These can have an extremely high influence on the success of the final software product. Early risk management practice is effective to manage such risks and contributes effectively towards the project success. Despite risk management approaches, a detailed guideline that explains where to integrate risk management activities into the project is still missing. Little effort has been directed towards the evaluation of the overall impact of a risk management method. We present a Goal-driven Software Development Risk Management Model (GSRM) and its explicit integration into the requirements engineering phase and an empirical investigation result of applying GSRM into a project. We combine the case study method with action research so that the results from the case study directly contribute to manage the studied project risks and to identify ways to improve the proposed methodology. The data is collected from multiple sources and analysed both in a qualitative and quantitative way. When risk factors are beyond the control of the project manager and project environment, it is difficult to control these risks. The project scope affects all the dimensions of risk. GSRM is a reasonable risk management method that can be employed in an industrial context. The study results have been compared against other study results in order to generalise findings and identify contextual factors. A formal early stage risk management practice provides early warning related to the problems that exists in a project, and it contributes to the overall project success. It is not necessary to always consider budget and schedule constraints as top priority. There exist issues such as requirements, change management, and user satisfaction which can influence these constraints.

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

requirements engineering
empirical study

software risk management
goal modelling language
goal-risk model


Molecular dynamics and free energy studies of chirality specificity effects on aminobenzo[a]quinolizine inhibitors binding to DPP-IV The aminobenzo[a]quinolizines were investigated as a novel class of DPP-IV inhibitors. The stereochemistry of this class plays an important role in the bioactivity. In this study, the mechanisms of how different configuration of three chiral centers of this class influences the binding affinity were investigated by molecular dynamics simulations, free energy decomposition analysis. The S configuration for chiral center 3* is decisive for isomers to maintain high bioactivity; the chirality effect of chiral center 2* on the binding affinity is largely dependent, while the S configuration for chiral center 2* is preferable to R configuration for the bioactivity gain; the effect of chiral center 11b* on the binding affinity is insignificant. The chirality specificity for three chiral centers is responsible for distinction of two van der Waals contacts with Tyr547 and Phe357, and of H-bonding interactions with Arg125 and Glu206. Particularly, the Arg125 to act as a bridge in the H-bonding network contributes to stable H-bonding interactions of isomer in DPP-IV active site.

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

chirality specificity
molecular dynamics simulations

aminobenzo[a]quinolizine inhibitors
dpp-iv
mm/gbsa


automatic extraction of pepa performance models from uml activity diagrams annotated with the marte profile Recent trends in software engineering lean towards modelcentric development methodologies, a context in which the UML plays a crucial role. To provide modellers with quantitative insights into their artifacts, the UML benefits from a framework for software performance evaluation provided by MARTE, the UML profile for model-driven development of Real Time and Embedded Systems. MARTE offers a rich semantics which is general enough to allow different quantitative analysis techniques to act as underlying performance engines. In the present paper we explore the use of the stochastic process algebra PEPA as one such engine, providing a procedure to systematically map activity diagrams onto PEPA models. Independent activity flows are translated into sequential automata which co-ordinate at the synchronisation points expressed by fork and join nodes of the activity. The PEPA performance model is interpreted against a Markovian semantics which allows the calculation of performance indices such as throughput and utilisation. We also discuss the implementation of a new software tool powered by the popular Eclipse platform which implements the fully automatic translation from MARTE-annotated UML activity diagrams to PEPA models.

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


An enhanced bridging domain method for linking atomistic and continuum domains The performance of bridging domain method is numerically verified. A technique is developed to enhance the performance of bridging domain method. The total displacement field is decomposing into fine and coarse scale fields. The equations of motion of fine scale oscillations are derived. The fine scales are removed by inserting a damping term in their equations of motion.

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

concurrent multiscale methods
molecular dynamics
continuum mechanics
spurious wave reflections


Toward a search architecture for software components The Grid and its related technologies enable large-scale sharing of resources of various types. We envision that in the near future applications will be completely built in a bottom-up fashion using software components deployed on various locations and interconnected to form a workflow graph. In this paper, we make some proposals on the design of a component search service, enabling users to locate the components they need to deploy an application. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

grid computing
workflows
component rank
pagerank


A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks ? In mobile ad hoc networks (MANETs), the mobility of the nodes is a complicating factor that significantly affects the effectiveness and performance of the routing protocols. Our work builds upon recent results on the effect of node mobility on the performance of available routing strategies (i.e., path-based, using support) and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution. We introduce a metric for the relative mobility of the nodes, according to which the nodes are classified into mobility classes. These mobility classes determine, for any pair of origin and destination, the routing technique that best corresponds to their mobility properties. Moreover, special care is taken for nodes remaining almost stationary or moving with high (relative) speeds. Our key design goal is to limit the necessary implementation changes required to incorporate existing routing protocols into our framework. We provide extensive evaluation of the proposed framework, using a well-known simulator (NS2). Our first findings demonstrate that the proposed framework improves, in certain cases, the performance of existing routing protocols.

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

wireless ad hoc
mobility classification
algorithmic design
simulation
performance evaluation


Association of individual and work-related risk factors with musculoskeletal symptoms among Iranian sewing machine operators Prevalence and severity of musculoskeletal symptoms (MSDs) was high among operators. The relatively high RULA scores highlighted a poor sewing workstation design. Both physical and psychosocial job factors were associated with MSDs.

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


The optimal retrofit of multiproduct batch plants This paper presents new alternatives in the retrofit model of multiproduct batch plants. Besides the duplication of the batch units implemented in previous works, the model considers the inclusion of intermediate storage tanks. These tanks can be plainly added or replace existing units that can be sold. The allocation of intermediate storage tanks is not considered in the previous retrofit works, even if this alternative is not new in the design of multiproduct batch plants. This option allows getting more efficient and real world solutions, although it requires working with a more complex model. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

retrofit
multiproduct batch plants
storage tanks


tpc-ds, taking decision support benchmarking to the next level TPC-DS is a new decision support benchmark currently under development by the Transaction Processing Performance Council (TPC). This paper provides a brief overview of the new benchmark. The benchmark models the decision support functions of a retail product supplier, including data loading, multiple types of queries and data maintenance. The database consists of multiple snowflake schemas with shared dimension tables; data is skewed; and the query set is large. Overall, the benchmark is considerably more realistic than previous decision support benchmarks.

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


A Stochastic Model of Multivirus Dynamics Understanding the spreading dynamics of computer viruses (worms, attacks) is an important research problem, and has received much attention from the communities of both computer security and statistical physics. However, previous studies have mainly focused on single-virus spreading dynamics. In this paper, we study multivirus spreading dynamics, where multiple viruses attempt to infect computers while possibly combating against each other because, for example, they are controlled by multiple botmasters. Specifically, we propose and analyze a general model (and its two special cases) of multivirus spreading dynamics in arbitrary networks (i.e., we do not make any restriction on network topologies), where the viruses may or may not coreside on computers. Our model offers analytical results for addressing questions such as: What are the sufficient conditions (also known as epidemic thresholds) under which the multiple viruses will die out? What if some viruses can "rob" others? What characteristics does the multivirus epidemic dynamics exhibit when the viruses are (approximately) equally powerful? The analytical results make a fundamental connection between two types of factors: defense capability and network connectivity. This allows us to draw various insights that can be used to guide security defense.

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

multiple virus dynamics
epidemic threshold
complex networks
complex systems
cyber warfare model


Secured flipped scan-chain model for crypto-architecture Scan chains are exploited to develop attacks on cryptographic hardware and steal intellectual properties from the chip. This paper proposes a secured strategy to test designs by inserting a certain number of inverters between randomly selected scan cells. The security of the scheme has been analyzed. Two detailed case studies of RC4 stream cipher and AES block cipher have been presented to show that the proposed strategy prevents existing scan-based attacks in the literature. The elegance of the, scheme lies in its less hardware overhead.

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

index terms-block ciphers
design_for_testability
scan_based_test
scan-chain-based attacks
security margin
ciphers.


Iterative water-filling algorithms for power efficiency optimization in the MIMO downlink ? In this paper we present algorithms to minimize transmit power consumption in the multi-antenna downlink under quality of service (QoS) constraints in terms of (sum) rate. This fundamental problem arises frequently in dynamic resource allocation. It occurs, for example, if a certain throughput has to be guaranteed due to stability issues or QoS reasons while interference to adjacent cells should be as small as possible. This perspective is in contrast to the traditional viewpoint of weighted rate sum maximization or throughput maximization, where the power budget is fixed but no rate can be guaranteed. Our algorithms exploit the specific structure of an equivalent optimization problem and are based on iterative water-filling techniques. They are very fast even for demanding scenarios (such as 100 users with multiple antennas each) and provably converge to the global optimum.

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

power allocation
spatial filtering
convex optimization
iterative water-filling


Unidentifiable divergence times in rates-across-sites models The rates-across-sites assumption in phylogenetic inference posits that the rate matrix governing the Markovian evolution of a character on an edge of the putative phylogenetic tree is the product of a character-specific scale factor and a rate matrix that is particular to that edge. Thus, evolution follows basically the same process for all characters, except that it occurs faster for some characters than others. To allow estimation of tree topologies and edge lengths for such models, it is commonly assumed that the scale factors are not arbitrary unknown constants, but rather unobserved, independent, identically distributed draws from a member of some parametric family of distributions. A popular choice is the gamma family. We consider an example of a clock-like tree with three taxa, one unknown edge length, a known root state, and a parametric family of scale factor distributions that contains the gamma family. This model has the property that, for a generic choice of unknown edge length and scale factor distribution, there is another edge length and scale factor distribution which generates data with exactly the same distribution, so that even with infinitely many data it will be typically impossible to make correct inferences about the unknown edge length.

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

random effects
gamma distribution
identifiability


Assessment of acrosome state in boar spermatozoa heads using n-contours descriptor and RLVQ This paper proposes a method for assessing the acrosome state of boar spermatozoa heads using digital image processing. We use gray level images in which spermatozoa have been labeled as acrosome-intact or acrosome damaged using the information of a coupled fluorescent image. The heads are segmented obtaining the outer head contour. A set of n inner contours separated by a logarithmic distance function is calculated later. For each point of the, in this case, seven contours a number of local texture features are computed. We have compared the classification performance of Relevance Learning Vector Quantization, class conditional means and KNN, employing cross-validation for the evaluation. Gradient magnitude data offer the best result with an overall test error of only 1%. This result outperforms previously applied methods and suggests this approach as an interesting automatized approach to this veterinarian problem.

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

acrosome assessment
image description
texture descriptor


Toward a theoretical framework for understanding the relationship between situated action and planned action models of behavior in information retrieval contexts: contributions from phenomenology In humancomputer interaction (HCI), a successful interaction sequence can take its own momentum and drift away from what the user has originally planned. However, this does not mean that planned actions play no important role in the overall performance. In this paper, the author tries to construct a line of argument to demonstrate that it is impossible to consider an action without an a priori plan, even according to the phenomenological position taken for granted by the situated action theory. Based on the phenomenological analysis of problematic situations and typification the author argues that, just like situated-ness, planned-ness of an action should also be understood in the context of the situation. Successful plan can be developed and executed for familiar context. The first part of the paper treats information seeking behavior as a special type of social action and applies Alfred Schutz's phenomenology of sociology to understand the importance and necessity of plan. The second part reports results of a quasi-experiment focusing on plan deviation within an information seeking context. It was found that when the searcher's situation changed from problematic to non-problematic, the degree of plan deviation decreased significantly. These results support the argument proposed in the first part of the paper.

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

situated action theory
planned action
context


Adaptive neuro-fuzzy estimation of conductive silicone rubber mechanical properties Conductive silicone rubber has great advantages for tactile sensing applications. The electrical behavior of the elastomeric material is rate-dependent and exhibit hysteresis upon cyclic loading. Several constitutive models were developed for mechanical simulation of this material upon loading and unloading. One of the successful approaches to model the time-dependent behavior of elastomers is Bergstrom-Boyce model. An adaptive neuro-fuzzy inference system (ANFIS) model will be established in this study to predict the stress-strain changing of conductive silicone rubber during compression tests. Various compression tests were performed on the produced specimens. An ANFIS is used to approximate correlation between measured features of the material and to predict its unknown future behavior for stress changing. ANFIS has unlimited approximation power to match any nonlinear functions well and to predict a chaotic time series. (C) 2012 Elsevier Ltd. All rights reserved.

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

adaptive neuro-fuzzy
constitutive model
strain-stress


A triparametric family of cardinality-based fuzzy similarity measures Previously, we introduced a biparametric family of cardinality-based fuzzy similarity measures. In this paper, we generalize this family by adding a third parameter. We also study the generalized family for specific values of the third parameter. More precisely, we show that for particular values of this parameter, certain properties can be ensured by imposing constraints on the two remaining parameters. To conclude, we examine some members of the presented family of fuzzy similarity measures. (C) 2007 Elsevier B.V. All rights reserved.

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


The quality of evidence in knowledge management research: practitioner versus scholarly literature The viability of KM partly rests on how researchers garner empirical support for their purported theories. One aspect of this would involve the evaluation of the evidence provided in KM research. This paper presents a comparative study of the evidence that is presented in scholarly and professional literature on KM. For this purpose, the paper introduces a typology of evidence to analyze the data obtained from the survey of the literature. The classification based on this typology reveals quantitative differences between the types of evidence put forth in the scholarly and practitioner literature. More interestingly, however, our analysis reveals differences in terms of the questions they ask, the perspective they adopt, and the methods they follow to convince others of the validity of their claims. We explain these differences in terms of the notions of 'blackboxing' and 'performance' borrowed from actor-network theory.

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


Introducing ODA1 The paper gives an introduction guide to the international standard ISO 8613, `Office Document Architecture (ODA) and Interchange Format'. The aims, general concepts and key principles of this standard are described. There is also a note on future extensions.

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

open document architecture
document logical structure
document layout structure
document application profile


customer satisfaction and service system based on motive - hygiene theory Critically inheriting traditional customer satisfaction theory, we advance the new customer satisfaction theory based on Motive-Hygiene Theory, point out that providing necessary hygiene is the prerequisite, while providing motivators is the key to achieve real customer satisfaction. We also discuss the characteristics of the motivators and hygiene in the field of customer satisfaction as well as the laws they obey; analyze the principles and ways of new service system design according to this new customer satisfaction theory based on Motive-Hygiene Theory.

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


Probabilistic abduction without priors This paper considers the simple problem of abduction in the framework of Bayes theorem, when the prior probability of the hypothesis is not available, either because there are no statistical data to rely on, or simply because a human expert is reluctant to provide a subjective assessment of this prior probability. This abduction problem remains an open issue since a simple sensitivity analysis on the value of the unknown prior yields empty results. This paper tries to propose some criteria a solution to this problem should satisfy. It then surveys and comments on various existing or new solutions to this problem: the use of likelihood functions (as in classical statistics), the use of information principles like maximum entropy, Shapley value, maximum likelihood. Finally, we present a novel maximum likelihood solution by making use of conditional event theory. The formal setting includes de Finetti's coherence approach, which does not exclude conditioning on contingent events with zero probability. (C) 2007 Elsevier Inc. All rights reserved.

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

bayes theorem
prior probability
maximum likelihood
shapley value
entropy
coherence


Inverse and direct magnetic shaping problems In this work, we study the direct and inverse problems arising from electromagnetic shaping in applications such as continuous casting processes. The magnetic field produces a surface pressure which forces a molten metal to change its shape until it reaches an equilibrium state between the magnetic pressure and the surface tension. The arising direct problem is a free boundary problem which is to determine the shape of molten metals for a given magnetic field. On the other hand, the inverse problem is to seek a configuration of electromagnetic field generators (i.e. inductors) in order that molten metals have prescribed shapes. A level set method will be presented to determine an equilibrium shape formed by a given configuration of magnetic fields. Also a computational method as well as uniqueness results for the inverse problem will be introduced and illustrated with examples.

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

inverse shaping problem
electromagnetic casting
inverse source problem


Approach to designing bribery-free and coercion-free electronic voting scheme Electronic voting has been in development for more than 20years, during which it has produced outstanding results both in theory and in practice. However, bribery and coercion remain an open problem, as there is still no suitable manner to prevent or fight them. Publications emphasizing practicality has not been able to achieve effective protection, probably due to their overtly simple protection method, while publications emphasizing theories are difficult to put into practice due to the complicated protection method devised by them. Thus, how to design a scheme that can flawlessly prevent problems of bribery and coercion as well as put into practice easily becomes a significant issue. In this paper, we suggest that designers apply two indispensable design components, invisible channel and biometrics receipts, to design a prevention e-voting scheme, and also to introduce several feasible technology to help with its implementation. Followingly, a prevention electronic voting scheme that matches our ideal is proposed. We expect this study to arouse the interest of more researchers regarding the subject.

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

bribery
coercion
invisible channel
biometrics receipts


A taxonomy of 3D occlusion management for visualization While an important factor in depth perception, the occlusion effect in 3D environments also has a detrimental impact on tasks involving discovery, access, and spatial relation of objects in a 3D visualization. A number of interactive techniques have been developed in recent years to directly or indirectly deal with this problem using a wide range of different approaches. In this paper, we build on previous work on mapping out the problem space of 3D occlusion by defining a taxonomy of the design space of occlusion management techniques in an effort to formalize a common terminology and theoretical framework for this class of interactions. We classify a total of 50 different techniques for occlusion management using our taxonomy and then go on to analyze the results, deriving a set of five orthogonal design patterns for effective reduction of 3D occlusion. We also discuss the "gaps" in the design space, areas of the taxonomy not yet populated with existing techniques, and use these to suggest future research directions into occlusion management.

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

3d visualization
taxonomy
design patterns
depth perception


practical voltage scaling for mobile multimedia devices This paper presents the design, implementation, and evaluation of a practical voltage scaling (PDVS) algorithm for mobile devices primarily running multimedia applications. PDVS seeks to minimize the total energy of the whole device while meeting multimedia timing requirements. To do this, PDVS extends traditional real-time scheduling by deciding what execution speed in addition to when to execute what applications. PDVS makes these decisions based on the discrete speed levels of the CPU, the total power of the device at different speeds, and the probability distribution of CPU demand of multimedia applications. We have implemented PDVS in the Linux kernel and evaluated it on an HP laptop. Our experimental results show that PDVS saves energy substantially without affecting multimedia performance. It saves energy by 14.4\% to 37.2\% compared to scheduling algorithms without voltage scaling and by up to 10.4\% compared to previous voltage scaling algorithms that assume an ideal CPU with continuous speeds and cubic power-speed relationship.

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

requirements
applications
performance
design
probability
timing
paper
practical
evaluation
mobile multimedia
multimedia
meeting
laptop
device
energy
implementation
power
algorithm

mobile computing
voltage-scaling
relationships
experimentation
mobile device
power management
scheduling algorithm
real-time schedulability
distributed
continuation
multimedia application


The (related-key) impossible boomerang attack and its application to the AES block cipher The Advanced Encryption Standard (AES) is a 128-bit block cipher with a user key of 128, 192 or 256 bits, released by NIST in 2001 as the next-generation data encryption standard for use in the USA. It was adopted as an ISO international standard in 2005. Impossible differential cryptanalysis and the boomerang attack are powerful variants of differential cryptanalysis for analysing the security of a block cipher. In this paper, building on the notions of impossible differential cryptanalysis and the boomerang attack, we propose a new cryptanalytic technique, which we call the impossible boomerang attack, and then describe an extension of this attack which applies in a related-key attack scenario. Finally, we apply the impossible boomerang attack to break 6-round AES with 128 key bits and 7-round AES with 192/256 key bits, and using two related keys we apply the related-key impossible boomerang attack to break 8-round AES with 192 key bits and 9-round AES with 256 key bits. In the two-key related-key attack scenario, our results, which were the first to achieve this amount of attacked rounds, match the best currently known results for AES with 192/256 key bits in terms of the numbers of attacked rounds. The (related-key) impossible boomerang attack is a general cryptanalytic technique, and can potentially be used to cryptanalyse other block ciphers.

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

block cipher
aes
differential cryptanalysis
boomerang attack


BDDC and FETI-DP preconditioners for spectral element discretizations ? Two of the most recent and important nonoverlapping domain decomposition methods, the BDDC method (Balancing Domain Decomposition by Constraints) and the FETI-DP method (DualPrimal Finite Element Tearing and Interconnecting) are here extended to spectral element discretizations of second-order elliptic problems. In spite of the more severe ill-conditioning of the spectral element discrete systems, compared with low-order finite elements and finite differences, these methods retain their good properties of scalability, quasi-optimality and independence on the discontinuities of the elliptic operator coefficients across subdomain interfaces.

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


Novel Closed-Form Expressions for Ergodic Capacity of MIMO-OSFBC-OFDM Systems Over Channel Adaptation Policies In this work, closed-form expressions for capacities per unit bandwidth for MIMO-OFDM systems employing Orthogonal Space-Frequency Block Coding over multipath frequency-selective fading channels are derived for adaptation policies like optimal power and rate adaptation, optimal rate adaptation with constant transmit power, channel inversion with fixed rate, and truncated channel inversion polices. A Signal-to-Noise Ratio based user selection scheme is considered. Optimal power and rate adaptation policy provides the highest capacity over other adaptation policies. Capacity penalty is the highest for optimal rate adaptation with constant transmit power policy, while the performance of channel inversion with fixed rate policy and truncated channel inversion policy lie between that of OPRA and ORA policies.

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

orthogonal space-frequency block coding
outage probability


Polynomial regression interval-valued fuzzy systems In recent years, the type-2 fuzzy sets theory has been used to model and minimize the effects of uncertainties in rule-base fuzzy logic system (FLS). In order to make the type-2 FLS reasonable and reliable, a new simple and novel statistical method to decide interval-valued fuzzy membership functions and probability type reduce reasoning method for the interval-valued FLS are developed. We have implemented the proposed non-linear (polynomial regression) statistical interval-valued type-2 FLS to perform smart washing machine control. The results show that our quadratic statistical method is more robust to design a reliable type-2 FLS and also can be extend to polynomial model.

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

statistical interval-valued fuzzy reasoning