regular expression types for xml We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in XML documents using regular expression operators (i.e., *, ?, |, etc.) and supporting a simple but powerful notion of subtyping .The decision problem for the subtype relation is EXPTIME-hard, but it can be checked quite efficiently in many cases of practical interest. The subtyping algorithm developed here is a variant of Aiken and Murphy's set-inclusion constraint solver, to which are added several optimizations and two new properties: (1) our algorithm is provably complete, and (2) it allows a useful "subtagging" relation between nodes with different labels in XML trees.

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

subtyping
constraint
practical
regular expression
types
relation
algorithm
xml

novelty
present
tree
use
examples
inclusion
express
schema
sharing
type systems
program
semantic
exploit
performance measurement
language
correctness proof
implementation
process
complexity
documentation
automata
completeness


personally tailored teaching in whurle using conditional transclusion The emergence of Technology Based Learning has generated a number of pedagogic problems related to learner diversity.. In this paper we present an interim snapshot of a prototype XSLT / XML hypermedia learning environment able to respond adaptively to individual learner profiles using conditional transclusion.

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

transclusion
xslt
learning environment
xml


Shape-based image retrieval using two-level similarity measures In this paper, we present a novel method of using two-level similarity measures for shape-based image retrieval. We first identify the dominant points of a given shape, and then calculate their geometric moments and the distances between two consecutive dominant points. A spectrum representing the normalized geometric moments versus normalized distances is generated, and its area and curve length are computed. We use these two values as similarity features for the indexes in coarse-grained shape retrieval. Furthermore, we use the cross-sectional area and curve length distribution for the indexes in fine-grained shape retrieval. Experimental results show that the proposed method is simple and efficient and can reach the accuracy rate of 95%.

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


Forecasting stock indices with back propagation neural network Stock prices as time series are non-stationary and highly-noisy due to the fact that stock markets are affected by a variety of factors. Predicting stock price or index with the noisy data directly is usually subject to large errors. In this paper, we propose a new approach to forecasting the stock prices via the Wavelet De-noising-based Back Propagation (WDBP) neural network. An effective algorithm for predicting the stock prices is developed. The monthly closing price data with the Shanghai Composite Index from January 1993 to December 2009 are used to illustrate the application of the WDBP neural network based algorithm in predicting the stock index. To show the advantage of this new approach for stock index forecast, the WDBP neural network is compared with the single Back Propagation (BP) neural network using the real data set.

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

bp neural network
wdbp neural network
stock prices


On the Integrated Production and Distribution Problem with Bidirectional Flows The integrated production and distribution problem with bidirectional flows is a complicated optimization problem, usually with large problem sizes when encountered in practice. In this study, we propose a partial linear programming relaxation-based heuristic approach to solve a variation of this problem. The approach is called a partial relaxation in the sense that it relaxes the integer requirements only on selected variables. We also report on the gaps between the optimal solution and the heuristic solution provided by this partial relaxation, including analytical gaps for a special case and empirical gaps for randomly generated test cases. Our study of this problem was motivated by the operational planning problem of a medical equipment leasing network that involves a forward flow for new and refurbished devices and a reverse flow for used devices to be returned to suppliers over a multiple time-period planning horizon.

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

heuristic
integrated production and distribution
bidirectional flows


Granular computing neural-fuzzy modelling: A neutrosophic approach Granular computing is a computational paradigm that mimics human cognition in terms of grouping similar information together. Compatibility operators such as cardinality, orientation, density, and multidimensional length act on both in raw data and information granules which are formed from raw data providing a framework for human-like information processing where information granulation is intrinsic. Granular computing, as a computational concept, is not new, however it is only relatively recent when this concept has been formalised computationally via the use of Computational Intelligence methods such as Fuzzy Logic and Rough Sets. Neutrosophy is a unifying field in logics that extents the concept of fuzzy sets into a three-valued logic that uses an indeterminacy value, and it is the basis of neutrosophic logic, neutrosophic probability, neutrosophic statistics and interval valued neutrosophic theory. In this paper we present a new framework for creating Granular Computing Neural-Fuzzy modelling structures via the use of Neutrosophic Logic to address the issue of uncertainty during the data granulation process. The theoretical and computational aspects of the approach are presented and discussed in this paper, as well as a case study using real industrial data. The case study under investigation is the predictive modelling of the Charpy Toughness of heat-treated steel; a process that exhibits very high uncertainty in the measurements due to the thermomechanical complexity of the Charpy test itself. The results show that the proposed approach leads to more meaningful and simpler granular models, with a better generalisation performance as compared to other recent modelling attempts on the same data set.

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

granular computing
information granulation
neutrosophic logic
charpy toughness


An approach to distribution of object-oriented applications in loosely coupled networks With the move to distributed systems and an increasing emphasis on the use of object-orientation for new system design, effective distribution of object-oriented applications is becoming an important concern for designers. Early research in this area has focused on object-clustering schemes for shared memory configurations that have limited value to business applications, which must be distributed over loosely coupled networks. These applications also exhibit the properties of simpler structural relationships and a large number of instances, demanding approaches closer to fragmentation and allocation instead of clustering. This paper develops an approach to distribution of object-oriented applications over geographically dispersed sites in loosely coupled networks-taking account of concerns such as encapsulation, inheritance, messaging, and implicit joins. The approach consists of two phases. First, we develop a scheme for generating class fragments, which ensures that encapsulation is not violated and inheritance is not stretched across sites. Second, considering the message-intensive operation of object-oriented systems, we devise models for allocation of class fragments to sites that minimize inter-site traffic. A nonarbitrary procedure to compile traffic volume estimates exploiting the notion of implicit joins in object-oriented applications provides the natural linkage between the two phases. A research prototype was implemented to establish feasibility of the proposals. We demonstrate usefulness of the approach by its application for distribution of a real-world information system.

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

allocation models
horizontal fragmentation
object distribution
object-oriented development


Runtime deadlock analysis for system level design In the design of highly complex, heterogeneous and concurrent systems, deadlock detection remains an important issue. In this paper, we systematically analyze the synchronization dependencies in system-level designs. We propose a data structure called the dynamic synchronization dependency graph, which captures the runtime blocking dependencies among concurrent processes. A loop-detection algorithm is then used to detect deadlocks and help designers quickly isolate and identify modeling errors that cause the deadlock problems. We demonstrate our approach through two publicly available system-level modeling languages, SystemC and Metropolis, and two real world design examples, which are complex system-level functional models for video processing.

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


RITAS: Services for Randomized Intrusion Tolerance Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexities, they have remained overlooked by the community-at-large as a valid solution for the deployment of fault-tolerant distributed systems. This paper aims to demonstrate that randomization can be a very competitive approach even in hostile environments where arbitrary faults can occur. A stack of randomized intrusion-tolerant protocols is described and its performance evaluated under several settings in both local-area-network (LAN) and wide-area-network environments. The stack provides a set of relevant services ranging from basic communication primitives up to atomic broadcast. The experimental evaluation shows that the protocols are efficient, especially in LAN environments where no performance reduction is observed under certain Byzantine faults.

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

byzantine agreement
randomized protocols
performance evaluation


A unified approach for shape sensitivity analysis of elastic shells A shape sensitivity analysis is presented of a shell loaded along its boundary, within the framework of a linear elastic approach that takes into account the effect of transverse shear deformation. By making an analogy with continuum mechanics and taking advantage of the concept of the total (time) derivative in its spatial description, an explicit general expression for the shape derivative of the total potential energy is obtained in terms of the strain-stress state and the shell shape change velocity field. For this purpose, a suitable velocity distribution over the middle surface of the shell, decomposed on a local basis given by the unit normal and the tangent plane of the shell, is adopted. This approach and the direct method of shape sensitivity analysis leads to a very useful expression for the shape sensitivity of the total potential energy. This expression is an explicit function of the tangent and normal components of the known velocity field that characterizes the shape change of the shell.

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

shape sensitivity analysis
elastic shells

elastic fracture mechanics
optimal shape design


Markov Automata: Deciding weak bisimulation by means of non-navely vanishing states This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For this purpose, different notions of vanishing states (a concept originating from the area of Generalised Stochastic Petri Nets) are defined. In particular, non-navely vanishing states are shown to be essential for relating the concepts of (state-based) nave weak bisimulation and (distribution-based) weak bisimulation. The bisimulation algorithm presented here follows the partition-refinement scheme and has exponential time complexity.

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


Boundary Search for Constrained Numerical Optimization Problems With an Algorithm Inspired by the Ant Colony Metaphor This paper presents a novel boundary approach that is included as a constraint-handling technique in an algorithm inspired by the ant colony metaphor. The necessity of approaching the boundary between the feasible and infeasible search space for many constrained optimization problems is a paramount challenge for every constraint-handling technique. Our proposed technique precisely focuses the search on the boundary region and can be either used alone or in combination with other constraint-handling techniques depending on the type and number of problem constraints. For validation purposes, an algorithm inspired by the ant colony metaphor is adopted as our search engine that works following one of the principles of the ant colony approach, i.e., a population of agents iteratively, cooperatively, and independently search for a solution. Each ant in the distributed algorithm applies a simple mutation-like operator, which explores the neighborhood region of a particular point in the search space (individual search level). The operator is designed for exploring the boundary between the feasible and infeasible search space. In addition, each ant obtains global information from the colony in order to exploit the most promising regions of the search space (cooperation level). We compare our proposed approach with respect to a well-known constraint-handling technique that is representative of the state-of-the-art in the area, using a set of standard test functions.

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

algorithms
artificial intelligence
optimization methods


design by physical composition for complex tangible user interfaces In this paper, we present a novel approach to create devices with tangible user interfaces by physical com-position. While the separation of the user interface from the application logic has a long tradition in software engineering, for products with tangible user interfaces there is no equivalent approach that realizes a true separation and flexible combination of interface components, underlying technology, and software parts. We propose a novel concept that is based on an inner Core for the basic technical and software platform of a product and an outer Shell that builds a flexible and ex-changeable tangible user interface from passive components. Using vision-based tracking, we can realize a clear separation between the components. No wiring is necessary. This paper introduces our novel approach and presents a first working prototype as well as initial results from its application in a design workshop.

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

physical prototyping
3d printing
evolutionary prototyping
paper prototyping
dialog independence
smart products
physical interfaces


Advanced driver assistance system for AHS over communication links with random packet dropouts In this paper, we propose an advanced driver assist system (ADAS) for platoon based automated highway system (AHS) with packet loss in inter-vehicle communication. Using the concept of rigidity, we first show that vehicles in a platoon tend to fall apart in the event of a packet loss among vehicles. To overcome this, we propose an estimation based dynamic platooning algorithm which employs the state estimate to maintain the platoon. Communication among the vehicle is reduced by using minimum spanning tree (MST) in state estimation algorithm. Effectiveness of the proposed ADAS scheme is illustrated by simulation wherein, dynamic platoons of holonomic vehicles with integrator dynamics are considered. Simulation studies indicate that the proposed algorithm maintains the platoon up to a packet loss rate of 48%. State transmission scheme proposed in our algorithm has three significant advantages, they are: (1) it handles packet loss in inter-vehicle communication, (2) reduces the effect of error in measured output, and (3) reduces the inter-vehicle communication. These advantages significantly increase the reliability and safety of the AHS.

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

advanced driver assistance system (adas)


PETs at CSCL Service: Underutilised Potentials for Privacy Enhancing Distance Education Computer Supported Collaborative Learning (CSCL) support is currently widely accepted to provide reliable and valid formal and informal educational practices as proven to benefit students in onsite as well as distant educational settings. However, some results from case studies indicate that privacy problems could negatively affect CSCL implementation in educational settings. Privacy Enhancing Technologies research (PETs) and the development of multilaterally secure systems are still limited research topics within CSCL due to diverse reasons. Based on deep related literature analysis and previous research results conducted by the authors in building CSCL systems, three main categories were identified for such reasons that have an impact in PETs and multilateral security research: lack of awareness of such PETs' existence; lack of knowledge on ways to efficiently integrate them in CSCL systems and settings; and reluctance to consider their multilaterally secure implementation by CSCL participations due to conflict of interests (e. g. explicit students monitoring requirements, high integration costs, etc.). In this paper, these categories are addressed and the PETs potential is discussed for overcoming the associated emerging drawbacks focused on the distance education CSCL settings in particular. The result of our research is an integrated framework considering multilateral security requirements. Furthermore, proof of concept is provided; enhanced privacy in such settings is applied by demonstrating the fulfilment of selected improvements areas (i.e. mainly network, application anonymity, and process support for resolving potential multilateral security conflicts) in an existing collaborative distance education system.

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

privacy enhancing technologies
multilateral security
distance education

cscl/cscw
social settings
network anonymity
anonymous credential systems


Complementation of rational sets on scattered linear orderings of finite rank In a preceding paper [V. Bruyere, O. Carton, Automata on linear orderings, in: J. Sgall, A. Pultr, R Kolman (Eds.), MFCS'2001, in: Lect. Notes in Comput. Sci., vol. 2136, 2001, pp. 236-247. iGM report 2001-12], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite, and even transfinite words studied by Buchi. Kleene's theorem has been generalized to these words. We show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that rational sets of words of finite ranks are closed under complementation. (c) 2007 Elsevier B.V. All fights reserved.

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

automata
complementation
linear orderings


Semi-Automatic Composition of Situational Methods Situational methods are approaches to the development of software systems that are designed and constructed to fit particular circumstances that often refer to project characteristics. One common way to create situational methods is to reuse method components, which are the building blocks of development methods. For this purpose, method components must be stored in a method base, and then retrieved and composed specifically for the situation in hand. Most approaches in the field of situational method engineering require the expertise of method engineers to support the retrieval and composition of method components. Furthermore, this is usually done in an ad-hoc manner and for pre-defined situations. In this paper, the authors propose an approach, supported by a tool that creates situational methods semi-automatically. This approach refers to structural and behavioral considerations and a wide variety of characteristics when comparing method components and composing them into situational methods. The resultant situational methods are stored in the method base for future usage and composition. Based on an experimental study of the approach, the authors show that it provides correct and suitable draft situational methods, which human evaluators have assessed as relevant for the given situations.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 methods
situational method engineering

iso/iec 24744
metamodeling
semi-automatic composition


Efficient generic on-line/off-line (threshold) signatures without key exposure ? The hashsignswitch paradigm was firstly proposed by Shamir and Tauman with the aim to design an efficient on-line/off-line signature scheme. Nonetheless, all existing on-line/off-line signature schemes based on this paradigm suffer from the key exposure problem of chameleon hashing. To avoid this problem, the signer should pre-compute and store a plenty of different chameleon hash values and the corresponding signatures on the hash values in the off-line phase, and send the collision and the signature for a certain hash value in the on-line phase. Hence, the computation and storage cost for the off-line phase and the communication cost for the on-line phase in ShamirTaumans signature scheme are still a little more overload. In this paper, we first introduce a special double-trapdoor hash family based on the discrete logarithm assumption and then incorporate it to construct a more efficient generic on-line/off-line signature scheme without key exposure. Furthermore, we also present the first key-exposure-free generic on-line/off-line threshold signature scheme without a trusted dealer. Additionally, we prove that the proposed schemes have achieved the desired security requirements.

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

threshold signatures
chameleon hashing
key exposure problem


Fingerprint verification using characteristic vectors based on planar graphics This paper describes a new characteristic vector model for fingerprint representation that uses a planar graph and triangulation algorithms. This new characteristic vector model performed better in a fingerprint identification system than other vector models already proposed in the literature. Minutiae extraction is an essential step in a fingerprint recognition system. This paper presents a new method for minutiae extraction that explores the duality ridge ending/ridge bifurcation that exists when the skeleton image of a fingerprint is inverted. This new extraction method simplifies the computational complexity of a fingerprint identification system.

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

fingerprint
triangulation
minutiae
planar graph


An Evolutionary Approach to Realism-based Adverse Event Representations Background: Part of the ReMINE project involved the creation of an ontology enabling computer-assisted decision support for optimal adverse event management. Objectives: The ontology was required to satisfy the following requirements: 1) to be able to account for the distinct and context-dependent ways in which authoritative sources define the term 'adverse event', 2) to allow the identification of relevant risks against patient safety (RAPS) on the basis of the disease history of a patient as documented in electronic health records, and 3) to be compatible with present and future ontologies developed under the Open Biomedical Ontology (OBO) Foundry framework. Methods: We used as feeder ontologies the Basic Formal Ontology, the Foundational Model of Anatomy, the Ontology for General Medical Science, the Information Artifact Ontology and the Ontology of Mental Health. We further used relations defined according to the pattern set forth in the OBO Relation Ontology. In light of the intended use of the ontology for the representation of adverse events that have actually occurred and therefore are registered in a database, we also applied the principles of referent tracking. Results: We merged the upper portions of the mentioned feeder ontologies and introduced 22 additional representational units of which 13 are generally applicable in biomedicine and nine in the adverse event context. We provided for each representational unit a textual definition that can be translated into equivalent formal definitions. Conclusion: The resulting ontology satisfies all of the requirements set forth. Merging the feeder ontologies, although all designed under the OBO Foundry principles, brought new insight into what the representational units of such ontologies actually denote.

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

ontology
referent tracking
adverse events
patient safety


Effects of time constraints on cliniciancomputer interaction: A study on information synthesis from EHR clinical notes Cognitive pathways of interns EHR note synthesis under timed and untimed conditions. Adjustments of interns information consumption based on awareness of time constraints. Non-significant difference in errors for timed and untimed EHR note synthesis.

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


On codes identifying vertices in the two-dimensional square lattice with diagonals Fault diagnosis of multiprocessor systems motivates the following graph-theoretic definition. A subset C of points in an undirected graph G = (V, E) is called an identifying code if the sets B(upsilon) boolean AND C consisting of all elements of C within distance one from the vertex upsilon are different. We also require that the sets B(upsilon) boolean AND C are all nonempty. We take G to be the infinite square lattice with diagonals and show that the density of the smallest identifying code is at least 2/9 and at most 4/17.

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


momentary content management via general packets radio service (gprs) and flash on wireless communication devices In this paper, we describe the trend of mobile community and its components. The success of the community is heavily dependent on content and adaptation despite the communication speed. The market trend has moved from storage oriented to mobility oriented. Spatial information based on a map that tells the location of places of interest such as restaurants has become more important than ever. Hence, this paper focuses on the content management of spatial information via wireless communication devices in the developing area such as Borneo that has substantially lower bandwidth and less stable GPRS network.

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


A new time marching BE scheme for transient heat transfer with a thermal moving boundary In this article, the BEM solution of the diffusion equation with a moving boundary is discussed. It is shown that the analytical time integration both for the 0- and 1-order modes lead to a special exponentintegral function and the reference time parameter ? will be important to the computational efficiency. In this article, the local time-dependent solution is used so that a series matrix computation can be reduced. Hence a new time marching scheme which is suitable to a moving boundary case is presented with some successful numerical tests.

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

transient heat transfer
thermal moving boundary


personalized retrieval in social bookmarking Users of social bookmarking systems take advantage of pivot browsing, an interaction technique allowing them to easily refine lists of bookmarks through the selection of filter terms. However, social bookmarking systems use one-size-fits-all ranking metrics to order refined lists. These generic rankings ignore past user interactions that may be useful in determining the relevance of bookmarks. In this work we describe a personalized ordering algorithm that leverages the fact that refinding, rather than discovery (finding a bookmark for the first time), makes up the majority of bookmark accesses. The algorithm examines user-access histories and promotes bookmarks that a user has previously visited. We investigate the potential of our algorithm using interaction logs from an enterprise social bookmarking system, the results show that our personalized algorithm would lead to improved bookmark rankings.

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


Generalized HPC method for the Poisson equation An efficient and innovative numerical algorithm based on the use of Harmonic Polynomials on each Cell of the computational domain (HPC method) has been recently proposed by Shao and Faltinsen (2014) [1], to solve Boundary Value Problem governed by the Laplace equation. Here, we extend the HPC method for the solution of non-homogeneous elliptic boundary value problems. The homogeneous solution, i.e. the Laplace equation, is represented through a polynomial function with harmonic polynomials while the particular solution of the Poisson equation is provided by a bi-quadratic function. This scheme has been called generalized HPC method. The present algorithm, accurate up to the 4th order, proved to be efficient, i.e. easy to be implemented and with a low computational effort, for the solution of two-dimensional elliptic boundary value problems. Furthermore, it provides an analytical representation of the solution within each computational stencil, which allows its coupling with existing numerical algorithms within an efficient domain-decomposition strategy or within an adaptive mesh refinement algorithm.

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

harmonic polynomial cell
elliptic boundary value problem
poisson solver
convergence analysis


An efficient e-mail filtering using time priority measurement Although E-mail systems are one of the most useful communication tools for business, education, etc., missing important E-mail messages become a very serious problem. It is very useful filtering supports for users to pick up important messages or to neglect unnecessary messages. This paper presents a method of determining the time priority for E-mail messages. Multi-attribute rules are defined to detect complex time expressions and a set pattern-matching machine is proposed. It enables us to protect missing messages with important time information because the presented method can classify and rank them according to time priority measurement automatically. From the simulation results of determining time priority, the presented pattern-matching method is about 4 times faster than the traditional string pattern-matching method. From the results of filtering 5172 sentences, it is verified that precision and recall of the presented method becomes 95% and 96%, respectively. From the experimental results of determining 10 highest messages among 100 E-mail, it is verified that filtering time by the proposed measurement is from 9.7 to 16.6 faster than a non-filtering method.

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

e-mail systems
multi-attribute rules
pattern-matching machine
filtering method


A hybrid Hermitediscontinuous Galerkin method for hyperbolic systems with application to Maxwell?s equations A high order discretization strategy for solving hyperbolic initialboundary value problems on hybrid structuredunstructured grids is proposed. The method leverages the capabilities of two distinct families of polynomial elements: discontinuous Galerkin discretizations which can be applied on elements of arbitrary shape, and Hermite discretizations which allow highly efficient implementations on staircased Cartesian grids. We demonstrate through numerical experiments in 1+1 1 + 1 and 2+1 2 + 1 dimensions that the hybridized method is stable and efficient.

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


Successive iteration of positive solution for a discontinuous third-order boundary value problem In this paper, we obtain a successively iterative scheme of positive solution for the nonlinear third-order two-point boundary value problem

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

boundary value problem
positive solution

nonlinear ordinary differential equation


A framework for incremental generation of closed itemsets Association rule mining from a transaction database (TDB) requires the detection of frequently occurring patterns, called frequent itemsets (FIs), whereby the number of FIs may be potentially huge. Recent approaches for FI mining use the closed itemset paradigm to limit the mining effort to a subset of the entire FI family, the frequent closed itemsets (FCIs). We show here how FCIs can be mined incrementally yet efficiently whenever a new transaction is added to a database whose mining results are available. Our approach for mining FIs in dynamic databases relies on recent results about lattice incremental restructuring and lattice construction. The fundamentals of the incremental FCI mining task are discussed and its reduction to the problem of lattice update, via the CI family, is made explicit. The related structural results underlie two algorithms for updating the set of FCIs of a given TDB upon the insertion of a new transaction. A straightforward method searches for necessary completions throughout the entire CI family, whereas a second method exploits lattice properties to limit the search to CIs which share at least one item with the new transaction. Efficient implementations of the parsimonious method is discussed in the paper together with a set of results from a preliminary study of the method's practical performances.

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

incremental data mining
galois lattices
formal concept analysis


A study on robust design optimization of layered plate bonding process considering uncertainties Design optimization of layered plate bonding process is conducted by considering uncertainties in a manufacturing process, to reduce the crack failure arising due to the difference of thermal expansion coefficients of the adherents. Robust optimization is performed to minimize the mean and variance of the residual stress, which is the major cause of the failure, while constraining the distortion and the instantaneous maximum stress to the allowable limits. In this optimization, the dimension reduction (DR) method is employed to quantify the uncertainty of the responses in the bonding process. It is expected that the DR method benefits the optimization from the perspectives of efficiency, accuracy, and simplicity. Response surface method (RSM) combined with sequential approximate optimization (SAO) technique is employed as an optimization tool. The obtained robust optimal solution is verified by the Monte Carlo simulation.

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

robust optimization
monte carlo simulation
layered plate bonding

dimension reduction method
reliability analysis


Text- and speech-based phonotactic models for spoken language identification of Basque and Spanish ? This paper presents a series of spoken language identification experiments involving Spanish and Basque. Spanish and Basque are both official languages in the Basque Country, a region located in northern Spain. We focused our research on the study of several phonotactic-based methodologies, analysing at the same time the performance of phonotactic models trained from text and speech samples and the use of phone and phone sequences as decoding units. Although we focus mainly on SpanishBasque identification, the analysis is later extended to English, so that more generic conclusions can be drawn. From the bilingual results, we can conclude that the text-based phonotactic models can perform similarly to the audio-based ones when applied to read speech. Moreover, when using task-specific information it is also possible to achieve a high accuracy. The use of phone sequences as decoding units results, in most of the cases, in a decrease in performance and appears to be useful when constraining the phone decoders to those sequences. Similar conclusions can be drawn from the trilingual experiments.

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


enabling web object orientation with mobile devices We consider in this paper that mobile devices should be seen as active objects communicating through web technologies, in a sense that they can both receive and send information. Therefore, following our introduction motivating our work, we propose a lightweight architecture that enables object orientation through web technologies. This architecture is called Web Object Orientation, and focuses on widely accepted approaches such as REST and WSDL. We show how this architecture is suited for mobile devices platforms that support both HTTP and serialization like JSON or XML.

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


Improving the accuracy of ultrasound-based localisation systems We present an improvement to ultrasound-based indoor location systems like Cricket (Priyantha et al. The Cricket location-support system, 2000). By encoding and modulating the ultrasound pulses, we are able to achieve greater accuracy in distance measurements. Besides improving the distance measurements, we improve the position update rate by synchronising the active beacons. We also propose a method that could further improve the update rate by superimposing encoded ultrasound pulses. Further, an experimental evaluation of our improvements is presented.

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


Robust Visual Tracking via Structured Multi-Task Sparse Learning In this paper, we formulate object tracking in a particle filter framework as a structured multi-task sparse learning problem, which we denote as Structured Multi-Task Tracking (S-MTT). Since we model particles as linear combinations of dictionary templates that are updated dynamically, learning the representation of each particle is considered a single task in Multi-Task Tracking (MTT). By employing popular sparsity-inducing \(\ell _{p,q}\) mixed norms \((\text{ specifically} p\in \{2,\infty \}\) and \(q=1),\) we regularize the representation problem to enforce joint sparsity and learn the particle representations together. As compared to previous methods that handle particles independently, our results demonstrate that mining the interdependencies between particles improves tracking performance and overall computational complexity. Interestingly, we show that the popular \(L_1\) tracker(Mei and Ling, IEEE Trans Pattern Anal Mach Intel 33(11):22592272, 2011) is a special case of our MTT formulation (denoted as the \(L_{11}\) tracker) when \(p=q=1.\) Under the MTT framework, some of the tasks (particle representations) are often more closely related and more likely to share common relevant covariates than other tasks. Therefore, we extend the MTT framework to take into account pairwise structural correlations between particles (e.g. spatial smoothness of representation) and denote the novel framework as S-MTT. The problem of learning the regularized sparse representation in MTT and S-MTT can be solved efficiently using an Accelerated Proximal Gradient (APG) method that yields a sequence of closed form updates. As such, S-MTT and MTT are computationally attractive. We test our proposed approach on challenging sequences involving heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that S-MTT is much better than MTT, and both methods consistently outperform state-of-the-art trackers.

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

visual tracking
particle filter
sparse representation


A simple generalisation of the area under the ROC curve for multiple class classification problems The area under the ROC curve, or the equivalent Gini index, is a widely used measure of performance of supervised classification rules. It has the attractive property that it side-steps the need to specify the costs of the different kinds of misclassification. However, the simple form is only applicable to the case of two classes. We extend the definition to the case of more than two classes by averaging pairwise comparisons. This measure reduces to the standard form in the two class case. We compare its properties with the standard measure of proportion correct and an alternative definition of proportion correct based on pairwise comparison of classes for a simple artificial case and illustrate its application on eight data sets. On the data sets we examined, the measures produced similar, but not identical results, reflecting the different aspects of performance that they were measuring. Like the area under the ROC curve, the measure we propose is useful in those many situations where it is impossible to give costs for the different kinds of misclassification.

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

receiver operating characteristic
auc
error rate


Fast electrostatic force calculation on parallel computer clusters The fast multipole method (FMM) and smooth particle mesh Ewald (SPME) are well known fast algorithms to evaluate long range electrostatic interactions in molecular dynamics and other fields. FMM is a multi-scale method which reduces the computation cost by approximating the potential due to a group of particles at a large distance using few multipole functions. This algorithm scales like O(N) O ( N ) for N particles. SPME algorithm is an O(NlnN) O ( N ln N ) method which is based on an interpolation of the Fourier space part of the Ewald sum and evaluating the resulting convolutions using fast Fourier transform (FFT). Those algorithms suffer from relatively poor efficiency on large parallel machines especially for mid-size problems around hundreds of thousands of atoms. A variation of the FMM, called PWA, based on plane wave expansions is presented in this paper. A new parallelization strategy for PWA, which takes advantage of the specific form of this expansion, is described. Its parallel efficiency is compared with SPME through detail time measurements on two different computer clusters.

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

fast multipole method
particle mesh ewald
plane wave


computer games in the classroom, or, how to get perfect attendance, even at 8 am In this special session, we will compare and contrast several game engines that have been used in game development courses, and describe our experiences teaching such courses.

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


Selective etching of SiO2 over Si3N4 in a C5F8/O2/Ar plasma The self-aligned contact (SAC) oxide etching is a key process in developing the next generation ultra large scale integrated (ULSI) device because transistor gate feature size is scaling down, and aspect ratio is becoming higher and higher. In this study, the SAC etching will be characterized by C5F8/O2/Ar plasmas as a function of C5F8/O2 gas mixing ratio, Ar flow rate, process pressure, and RF power. The oxide etch rate increases when C5F8 fractional flow rate increases from 38% to 62% and then abruptly drops at the C5F8 percentage above 62%. The selectivity of nitride to oxide and fluorocarbon polymer increased under the following conditions: high C5F8 flow rate, low Ar flow rate, high process pressure, and low RF power. However, when the ratio of O2 increases in the C5F8/O2 mixture, the amount of polymer decreases and the ability of contact etching increases. SAC patterned samples were characterized by top-down critical dimension scanning electron microscopy (CD-SEM) and transmission electron microscopy (TEM). To analyze the effect of C5F8/O2 gas mixing ratio, we investigated the chemical species in the gas phase with optical emission spectroscopy (OES). The components and thickness of fluorocarbon polymer on contact surface, bottom and sidewall were investigated with transmission electron microscopy-element mapping system (TEM-EELS) and X-ray photoelectron spectroscopy (XPS).

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

self-aligned contact
global warming potential
low gwp alternative gas
fluorocarbon film


Improved maximum entropy analysis with an extended search space The standard implementation of the Maximum Entropy Method (MEM) follows Bryan [1] and deploys a Singular Value Decomposition (SVD) to limit the dimensionality of the underlying solution space apriori. Here we present arguments based on the shape of the SVD basis functions and numerical evidence from a mock data analysis, which show that the correct Bayesian solution is not in general recovered with this approach. As a remedy we propose to extend the search basis systematically, which will eventually recover the full solution space and the correct solution. In order to adequately approach problems where an exponentially damped kernel is used, we provide an open-source implementation, using the C/C++ language that utilizes high precision arithmetic adjustable at run-time [2]. The LBFGS algorithm is included in the code in order to attack problems without the need to resort to a particular search space restriction.

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

maximum entropy method
basis functions
extended search space


Delay and Capacity Trade-offs in Mobile Wireless Networks with Infrastructure Support In this paper, we investigate the trade-offs between delay and capacity in mobile wireless networks with infrastructure support. We consider three different mobility models, independent and identically distributed (i.i.d) mobility model, random walk mobility model with constant speed and Levy flight mobility model. For i.i.d mobility model and random walk mobility model with the speed e(1/root n), we get the theoretical results of the average packet delay when capacity is e(1),) individually, where n is the number of nodes. We find that the optimal average packet delay is achieved when capacity A(n) 0(n 2 Inn) when K = 0(n) (0 7j < 1). We also prove A(n) that when u.)(\rn) K <n, the critical average delay is e(n 2 " K).

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


Visualizing graphs - A generalized view The visualization of graphs has proven to be very useful for exploring structures in different application domains. However, in certain fields of computer science, graph visualization is understood and focused quite differently. While "graph drawing" focuses on optimized layouts for node-link-representations of networks, "information visualization" prefers to work on hierarchies focusing on very large structures, different views and interactivity. This paper gives a systematic view of the problem of graph visualization by combining both approaches. We will introduce a general view of different visualization methods as well as describe occurring problems and discuss basic constraints. These will be used to propose a visualization framework for graphs, whose development motivated this paper.

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

network visualization
exploratory graph analysis


Thermal modelling and analysis of high-voltage insulated power cables under transient loads This article presents a simple thermal model for transient analysis of high-voltage underground power cables based on proper ladder diagram at MATLABSimulink software under various operating conditions for engineering students. Available commercial programs created with commercial worries are not suitable for students during the learning process, which involve different applications on power cable analysis. The model gives an opportunity for students to solve the often-faced transient problems in utilities. The transient model of the underground power cable system using the analytic procedures based on IEC60853 standards is presented with an example solution of the 154?kV power cable in service in Turkish transmission system in this article. 2010 Wiley Periodicals, Inc. Comput Appl Eng Educ 21: 516529, 2013

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

power cable
thermal model
transient analysis


Cross-terms reduction in the WignerVille distribution using tunable-Q wavelet transform This paper presents a new method based on TQWT for cross terms reduction in WVD. The proposed method has been studied on multi-component non-stationary signals. The simulation results have been compared with the other existing methods. The proposed method works well even in the presence of noise.

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

cross-terms
tunable-q wavelet transform
multi-component non-stationary signals


Mathematical model of blob matching and modified Bhattacharyya coefficient ? A mathematical model of blob matching is developed in this paper. Based on the model, the matching performance of Bhattacharyya coefficient is analyzed and evaluated. The numerical critical conditions of biased matching and mistaken matching for Bhattacharyya coefficient are given. According to the model analysis, a modified version of Bhattacharyya coefficient is proposed, which improves the matching performance relative to the original one. The numerical analysis based on the new model and visual experiments both demonstrate the superior performance of the modified Bhattacharyya coefficient.

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

blob matching
bhattacharyya coefficient
mathematical model


visual interfaces to the social and semantic web (vissw 2010) Recent innovations in the Social and Semantic Web fields have resulted in large amounts of data created, published and consumed by users of the Web. This vast amount of data exists in a variety of formats, from the traditional ones such as text, image, video to the more recent additions such as streams of status information from Twitter and Facebook. The ability to easily integrate such vast amounts of data raises significant and exciting research challenges, not least of which how to provide effective access to and navigation across heterogeneous data sources on different platforms (e.g. computers, mobile devices, set-top boxes). Building on the success of the VISSW2009 workshop, the IUI2010 workshop on Visual Interfaces to the Social and Semantic Web aims to bring together researchers and practitioners from different fields to discuss the latest research results and challenges in designing, implementing, and evaluating intelligent interfaces supporting access, navigation and publishing of different types of contents on the Social and Semantic Web. This paper outlines the context of the workshop and provides an overview of the research to be presented at the event.

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

visual interfaces
social and semantic web


Moving Objects Localization by Local Regions Based Level Set: Application on Urban Traffic In this paper, a novel method for locating multiple moving objects in a video sequences captured by a stationary camera is proposed. In order to determine the precise location of the objects in an image, a new local regions based level set model is carried out. The whole process consists of two main parts: the global detection and the fine localization. During the global detection, the presence or absence of an object in an image is determined by the Mixture of Gaussians method. For the fine localization, we propose to reformulate global energies by utilizing little squared windows centered on each point over a thin band surrounding the zero level set, hence the object contour can be reshaped into small local interior and exterior regions that lead to compute a family of adaptive local energies, which enables us to well localize the moving objects. Moreover, we propose to adapt the smoothness of the contours, and the accuracy of the objects perimeter of different shapes with an automatic stopping criterion. The proposed method has been tested on different real urban traffic videos, and the experiment results demonstrate that our algorithm can locate effectively and accurately the moving objects; optimize the results of the localized objects and also decrease the computations load.

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

objects localization
adaptive local energies
urban traffic

level-set method
adaptive regularization


National health IT services in Finland Objectives: In 2002 a decision was reached to set up a notion-wide electronic health record system in Finland. The legal framework of actors with the necessary mandate was approved in the parliament in December 2006. A set of standards and norms have been selected that all health (are actors need to follow. Functional specifications of the services were completed in 2006. Setting up the centralized health IT services begins in 2007. Centralization of patient record data allows the reorganization of health service providers to take place at local and regional levels according to need. The services allow users to access patient records securely from anywhere with the provision that they have the right to access private patient data. Methods: The functionality of the services and the necessary infrastructure has been agreed to in projects and working groups involving users, experts, key stakeholders and vendors. Results. The legal framework was approved in the parliament in December 2006. The functional specifications of the centralized health IT services were finalized in 2006. Conclusions: The implementation of the services will start in 2007.

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

health information infrastructure
electronic patient record
interoperability
archive
architecture


Constrained evolutionary computing approach to Web service compositions Web services are being adopted as a viable means of accessing Web-based applications. Web services are not only used to exchange information between enterprises but also to help software developers provide value-added services for various demands. Web service compositions are synthesised by researchers from elementary Web services, offering the opportunity for service providers and application developers to create value-added services. However, a problem exists in the current distribution process of Web service compositions: the general analysis and selection of services can be overly complex and are completed manually. Therefore, there is a need to manage composite Web services automatically. But the research related to ranking candidate services and selection of optimisation strategies is sparse. Yet, few have been published that consider the constraints of non-functional properties. In this article, a systemic but autonomous composition process has been proposed. This study proposes an evolutionary approach that applies the characteristics of the object-oriented concept of Web services and the genetic algorithm to effectively manage and optimise the Web service composition. It is capable of escaping not only from local optima due to a population-based approach, but also from unbiased nature, which enables it to perform well in a situation with little domain knowledge. In this article, the related literature is reviewed. Then, the Web service composition model incorporated with a genetic algorithm is proposed. Finally, a practical implementation is illustrated and shows a good result in terms of solution quality.

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

web service composition
genetic algorithm


Contracting with demand uncertainty under supply chain competition We examine supply chain contracts for two competing supply chains selling a substitutable product, each consisting of one manufacturer and one retailer. Both manufacturers are Stackelberg leaders and the retailers are followers. Manufacturers in two competing supply chains may choose different contracts, either a wholesale price contract in which the retailers demand forecasting information is not shared, or a revenue-sharing contract in which the retailers demand forecasting information is shared. Under supply chain competition and demand uncertainty, we identify which contract is more advantageous for each supply chain, and under what circumstances.

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

demand uncertainty
supply chain competition
wholesale price contract

information sharing
revenue-sharing contract


Clinical cognition and biomedical informatics: Issues of patient safety Recent developments in biomedical informatics research have afforded possibilities for great advances in health care delivery. These exciting opportunities also present a number of challenges to the implementation and integration of technologies in the workplace. As in most domains, there is a gulf between technologic artifacts and end users, which compromises the culture of safety in the workplace. Because clinical practice is a human endeavor, there is a need for bridging disciplines to enable clinicians to benefit from rapid technologic advances. This, in turn, necessitates a broadening of disciplinary boundaries to consider cognitive and social factors related to the design and use of technology. The authors argue for a place of prominence for cognitive science in understanding nursing factors associated with patient safety. Cognitive science provides a framework for the analysis and modeling of complex human performance. Studies of clinical cognition can meaningfully inform and shape design, development and assessment of information systems. Furthermore, they have a decisive impact on whether information technology has a positive influence on human performance and are especially important in understanding and promoting safe practices. These issues are discussed in the context of clinical informatics with a focus on nursing practice.

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

clinical cognition
nursing
patient safety
informatics


Low-Voltage-Ride-Through-Assistenzsystem

fr

dezentrale

Erzeugungseinheiten

Whrend

eines

Kurzschlusses

im

Netz

nahe

einem

Synchrongenerator

kommt

es

aufgrund

einer

verminderten

Leistungsabgabe

whrend

des

Fehlers

zu

einer

Beschleunigung

des

Rotors.

Dies

kann

zu

unerwnscht

hohen

Polradpendelungen

bis

hin

zum

Verlust

des

Synchronismus

des

Generators

fhren.

In

diesem

Beitrag

wird

ein

Assistenzsystem

vorgestellt,

welches

die

Beschleunigung

des

Rotors

whrend

eines

Fehlers

verringert

und

damit

einen

Polschlupf

vermeidet.

Des

Weiteren

wird

der

,,Backswing-Effekt

behandelt,

welcher

zu

einer

Bremsung

des

Rotors

in

den

ersten

Millisekunden

eines

Fehlers

fhrt.

Auerdem

wird

der

Einfluss

unterschiedlicher

Simulationsmethoden

aufgezeigt.

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

backswing-effekt
dezentrale energieerzeugung
grid codes
low voltage ride through
transiente simulation
backswing
distributed generation
transient simulation
retardation device


The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems In the last few years, a significant number of multi-objective metaheuristics have been proposed in the literature in order to address real-world problems. Local search methods play a major role in many of these metaheuristic procedures. In this paper, we adapt a recent and popular indicator-based selection method proposed by Zitzler and Kunzli in 2004, in order to define a population-based multi-objective local search. The proposed algorithm is designed in order to be easily adaptable, parameter independent and to have a high convergence rate. In order to evaluate the capacity of our algorithm to reach these goals, a large part of the paper is dedicated to experiments. Three combinatorial optimisation problems are tested: a flow shop problem, a ring star problem and a nurse scheduling problem. The experiments show that our algorithm can be applied with success to different types of multi-objective optimisation problems and that it outperforms some classical metaheuristics. Furthermore, the parameter sensitivity analysis enables us to provide some useful guidelines about how to set the parameters.

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

metaheuristic
local search
ring star problem
nurse scheduling problem

multi-objective optimisation
indicator-based optimisation
flow-shop problem


Detection of recombination in DNA multiple alignments with hidden Markov models Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets from certain bacteria and viruses due to recombination, a process that leads to the creation of mosaic sequences from different strains and, if undetected, causes systematic errors in phylogenetic tree estimation. In the current work, a hidden Markov model (HMM) is employed to detect recombination events in multiple alignments of DNA sequences. The emission probabilities in a given state are determined by the branching order (topology) and the branch lengths of the respective phylogenetic tree, while the transition probabilities depend on the global recombination probability. The present study improves on an earlier heuristic parameter optimization scheme and shows how the branch lengths and the recombination probability can be optimized in a maximum likelihood sense by applying the expectation maximization (EM) algorithm. The novel algorithm is tested on a synthetic benchmark problem and is found to clearly outperform the earlier heuristic approach. The paper concludes with an application of this scheme to a DNA sequence alignment of the argF gene from four Neisseria strains, where a likely recombination event is clearly detected.

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

multiple alignments of dna sequences
recombination
hidden markov models

maximum likelihood and the expectation maximization (em) algorithm


flight size auto tuning for broadband wireless networks The emergency of broadband wireless access technologies enables seamless Internet access in mobile environments. To fully utilize the broadband wireless bandwidth, it is critical to design a congestion control mechanism that can adjust the congestion window size according to the dynamics of the wireless network condition. A congestion window size that does not react properly to the degradation of channel quality injects excessive data segments into the network. This increases round trip time (RTT) and ultimately may cause packet losses. In the reverse setting, when the channel quality improves drastically, the congestion window should react fast enough to take advantage of the available bandwidth. This paper proposes Flight Size Auto Tuning (FS-AT) as a new TCP variant. FS-AT adjusts the transmission rate according to the estimated available throughput and fluctuations in throughput to mitigate the network congestion while maintaining high network utilization. Moreover, FS-AT provides mechanisms to differentiate between the losses caused by channel errors and those by network congestion. Accordingly, the proposed method avoids unnecessary throughput reduction in case of channel errors, a well-known impediment of standard TCP schemes. FS-AT estimates the current available bandwidth from the received acknowledgments without requiring any modification at the receiver. FS-AT is implemented on Linux and the effectiveness of FS-AT is validated by the measured performance of FS-AT over HSDPA and the simulated performance over a fixed network.

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


Automated container transport system between inland port and terminals In this article we propose a new concept called automated container transportation system between inland port and terminals (ACTIPOT) which involves the use of automated trucks to transfer containers between an inland port and container terminals. The inland port is located a few miles away from the terminals and is used for storing and processing import/export containers before distribution to customers or transfer to the terminals. We design and analyze the ACTIPOT system with particular attention paid to the overall supervisory controller that synchronizes all the operations inside the ACTIPOT system. We employ the technique of truck platooning in order to simplify the control of the overall system and to minimize the possibility of deadlocks, congestion, and failures. A microscopic simulation model is developed and used to demonstrate the overall performance of the ACTIPOT system. The contribution of this article is the design, analysis, and evaluation of the new concept ACTIPOT.

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

verification
automated truck
vehicle control
supervisory control
petri nets


an informed convergence accelerator for evolutionary multiobjective optimiser A novel optimisation accelerator deploying neural network predictions and objective space direct manipulation strategies is presented. The concept of directing the search through the use of 'mirage' solutions is introduced and investigated. The accelerator is meant to be a portable component that can be plugged into any stochastic optimisation algorithm, such as genetic algorithms. The purpose of the new component termed as the Informed Convergence Accelerator (ICA) is to enhance the search capability, convergence extent and most especially the speed of convergence of the hosting stochastic global optimisation technique. ICA was hybridized with the Non-Dominated Sorting Genetic Algorithm (NSGA-II). Enhanced results were achieved demonstrating the utility of the introduced component.

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


Structure-based design of inhibitors of the rice blast fungal enzyme trihydroxynaphthalene reductase Rice Blast Disease, caused by the fungus Pyricularia oryzae, is one of the most important diseases of rice. Several enzymes in the melanin biosynthetic pathway have proven to be valuable targets for development of rice blast fungicides. In particular, inhibitors of trihydroxynaphthalene reductase (3HNR), which catalyzes the conversion of trihydroxynaphthalene to vermelone, have yielded commercially useful rice fungicides. The X-ray structure of 3HNR has been published recently, presenting an opportunity to use this information in the de novo design of novel 3HNR inhibitors that may exhibit useful rice blast activity. We used the LeapFrog program to develop a docking model for interaction of ligands with the active site of THNR. The final model gave a good correlation between calculated binding energy and log Ki and was used to design novel ligands and score compounds for synthesis. Using this as a tool, we synthesized inhibitors in the nanomolar range and also developed several inhibitors that did not conform to the properties of the THNR active site. Leapfrog was able to locate a previously unrecognized binding pocket that could accommodate these otherwise anomalous regions of structure.

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

trihydroxynaphthalene reductase
de novo design
leapfrog
rice blast
fungicides


Universal Communication-Part I: Modulo Additive Channels Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a priori model? Following the spirit of the finite-state compressibility of a sequence, defined by Lempel and Ziv, a "capacity" is defined for such a channel as the highest rate achievable by a designer knowing the particular relation that indeed exists between the input and output for all times, yet is constrained to use a fixed finite-length block communication scheme without feedback, i.e., use the same encoder and decoder over each block. In the case of the modulo additive channel, where the output sequence is obtained by modulo addition of an unknown individual sequence to the input sequence, this capacity is upper bounded by a function of the finite state compressibility of the noise sequence. A universal communication scheme with feedback that attains this capacity universally, without prior knowledge of the noise sequence, is presented.

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

arbitrarily varying channels (avcs)
feedback communication
individual sequences
rateless coding
unknown channels


The design of square-root-raised-cosine FIR filters by an iterative technique Using a pair of matched square-root-raised-cosine (SRRC) filters in the transmitter and the receiver in a band-limited digital communication system can theoretically achieve zero inter-symbol interference (ISI). In reality, the ISI cannot be zero when both SRRC filters are approximately implemented because of some numerical precision problems in the design phase as well as in the implementation phase. In this paper, the author proposes an iterative method to design the coefficients of SRRC FIR filters. The required ISI of the system can be specified such that both ISI and frequency domain specifications are monitored in the design phase. Since the ISI can be specified beforehand, the tradeoff between performance and the filter length becomes possible in the proposed design algorithm.

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

square root raised cosine filters
set-membership nlms algorithm
steepest descent method


visualization using timelines A timeline is a linear, graphical visualization of events over time. For example, in concurrent application, events would represent state changes for some system object (such as a task or variable). A timeline display generator creates the graphical visualization from some record of events. This paper reports on a model for timeline display generators based on a formal model of event history and the objectives of timeline visualization. In this model, any timeline display generator is completely described through the definition of a set of mathematical functions. The exact characteristics and flexibility of a particular implementation of a timeline display generator, depends on the way in which these functions have been implemented. The current prototype, xtg, (Timeline Display Generator for X-windows) serves as an example implementation of these ideas. Characteristics of xtg are presented, and its use in the analysis of a real-world client-server application is discussed. Xtg has been applied to several other applications to-date and is being applied by several telecommunications companies to areas ranging from software process analysis to call trace data analysis.

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

task applications use event analysis definition object flexibility paper model visualization timeline prototype implementation

traces
generation
software processes
examples
data analysis
timing
graphics
client-server
change
records
variability
histories
systems
concurrency
formal models
windows
telecommunication


New MDS or near-MDS self-dual codes We construct new MDS or near-MDS self-dual codes over large finite fields. In particular, we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) whenever q = 2(m) (m >= 2) using a Reed-Solomon (RS) code and its extension. It turns out that this multiple description source (MDS) self-dual code is an extended duadic code. We construct Euclidean self-dual near-MDS codes of length n = q-1 over GF(q) from RS codes when q equivalent to 1 (mod 4) and q <= 113. We also construct many new MDS self-dual codes over GF(p) of length 16 for primes 29 <= p <= 113. Finally, we construct Euclidean/Hermitian self-dual MDS codes of lengths up to 14 over GF(q(2)) where q = 19,23,25,27,29.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 description source (mds) codes
reed-solomon (rs) codes
self-dual codes


relationalizing rdf stores for tools reusability The emergence of Semantic Web technologies and standards such as Resource Description Framework (RDF) has introduced novel data storage models such as the RDF Graph Model. In this paper, we present a research effort called R2D, which attempts to bridge the gap between RDF and RDBMS concepts by presenting a relational view of RDF data stores. Thus, R2D is essentially a relational wrapper around RDF stores that aims to make the variety of stable relational tools that are currently in the market available to RDF stores without data duplication and synchronization issues.

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

resource description framework (rdf)
data interoperability
visualization tools
query processing


Study of the linear kink effect in PD SOI nMOSFETs We present in this work a study of the linear kink effect (LKE) occurrence in partially depleted (PD) SOI nMOSFETs with thin gate oxide. The experimental LKE dependence on the channel length, channel width and drain voltage are reported as well as the impact of various parameters on the second peak has been studied by two-dimensional numerical simulations, namely, the gate current level, the carrier lifetime, the increase of the body potential, the threshold voltage variation and AC analysis. Three-dimensional simulations were also performed in order to evaluate the LKE dependence on the channel width.

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

body potential
thin gate oxide
gate current
numerical simulations


Analytical reconstruction formula for n n -dimensional conical Radon transform In recent years, Radon type transforms that integrate functions along families of curves or surfaces, have been intensively studied due to their applications to inverse scattering, synthetic aperture radar (SAR), imaging science, nuclear industry, etc. In this paper, we consider the transform that integrates a function f(x) f ( x ) in Rn R n over a family of cones invariant to translation. A new exact inversion formula is presented in the case of fixed opening angle and vertical central axis. In addition, the results of numerical simulations are presented for the case n=2 n = 2 .

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

integral geometry
conical projections
v-line transform
broken-ray


Constructing topical hierarchies in heterogeneous information networks Many digital documentary data collections (e.g., scientific publications, enterprise reports, news articles, and social media) can be modeled as a heterogeneous information network, linking text with multiple types of entities. Constructing high-quality hierarchies that can represent topics at multiple granularities benefits tasks such as search, information browsing, and pattern mining. In this work, we present an algorithm for recursively constructing multi-typed topical hierarchies. Contrary to traditional text-based topic modeling, our approach handles both textual phrases and multiple types of entities by a newly designed clustering and ranking algorithm for heterogeneous network data, as well as mining and ranking topical patterns of different types. Our experiments on datasets from two different domains demonstrate that our algorithm yields high-quality, multi-typed topical hierarchies.

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


Effective traffic grooming algorithms in SONET/WDM ring networks Much work has focused on traffic grooming in SONET/WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing the number of ADMs, minimizing the number of wavelengths, considering different traffic models, using different network architectures, incorporating switching capability and so on. In this work, we study traffic grooming in unidirectional ring networks with no switching capability under both uniform traffic and non-uniform traffic models to reduce electronic multiplexing costs. Based on the clustering notion, we derive a general and tighter lower bound for the number of ADMs required in traffic grooming under the uniform all-to-all traffic model. This bound reduces to special cases obtained in previous work. We also derive general, tighter, and closed form lower bounds for the number of ADMs required under two non-uniform traffic models: the distance-dependent traffic model and the non-uniform symmetric traffic model. Cost-effective multi-phase algorithms that exploit traffic characteristics are then designed and studied to efficiently groom traffic teams under different traffic models. Our numerical and simulation results show that the proposed multi-phase algorithms outperform existing traffic grooming algorithms by using a fewer number of ADMs. Our algorithms in several cases also achieve the lower bounds derived.

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

sonet/wdm rings
adm lower bounds
distance-dependent traffic
non-uniform traffic


Emerging alternatives to today's advanced service architectures for Internet telephony: IN and beyond Two principal sets of standards are emerging for Internet telephony: H.323 from the ITU-T, and session initiation protocol (SIP) from the IETF. The advanced service architecture that comes with H.323 is rather archaic, and reminiscent of the old days of circuitswitched telephony. The one that comes with SIP is more modern, but has its share of deficiencies. While improvements are being made, alternatives are being sought. Two trends are noticeable in the search for alternatives: the return to the old and well-known intelligent network (IN) architectural framework, and the exploration of more recent approaches, such as mobile agent technology, that go beyond IN. This paper scrutinizes the trends in the search for alternatives to today's ITU-T and IETF advanced service architectures for Internet telephony. We successively review the IN-based architectures that are emerging, and the mobile agent-based architectures that are being explored. Many circuitswitched networks that adhere to the IN architectural framework have been deployed worldwide. The emerging IN-based advanced service architectures may facilitate the reuse of this installed base. They will however fall short when it comes to supporting the wide range of advanced services expected from Internet telephony. Mobile-agent-based advanced services architectures are much more promising, although the technology is not yet mature. Their inherent flexibility can easily help in exploiting to the fullest extent the host of opportunities Internet telephony brings. The return to the IN architectural framework may be economically viable in the short and medium terms. There is however no doubt that it will be imperative to go further in the long term. Mobile agent technology is certainly among the venues worth being explored for going beyond IN.

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

sip
in
mobile agent
service architecture


Financial fraud detection using vocal, linguistic and financial cues We investigate whether a prediction model for corporate financial fraud that jointly considers numeric financial information as well as both linguistic and vocalic aspects of corporate executive speech improves predictive accuracy. Optimization results reveal that only a subset of the complete set of numeric, linguistic and vocalic predictors enhance overall predictive accuracy. These results should assist investors, financial analysts and regulators in identifying the most effective markers of corporate fraud.

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

financial fraud
corporate executive speech


On optimization algorithms for the reservoir oil well placement problem Determining optimal locations and operation parameters for wells in oil and gas reservoirs has a potentially high economic impact. Finding these optima depends on a complex combination of geological, petrophysical, flow regimen, and economical parameters that are hard to grasp intuitively. On the other hand, automatic approaches have in the past been hampered by the overwhelming computational cost of running thousands of potential cases using reservoir simulators, given that each of these runs can take on the order of hours. Therefore, the key issue to such automatic optimization is the development of algorithms that find good solutions with a minimum number of function evaluations. In this work, we compare and analyze the efficiency, effectiveness, and reliability of several optimization algorithms for the well placement problem. In particular, we consider the simultaneous perturbation stochastic approximation (SPSA), finite difference gradient (FDG), and very fast simulated annealing (VFSA) algorithms. None of these algorithms guarantees to find the optimal solution, but we show that both SPSA and VFSA are very efficient in finding nearly optimal solutions with a high probability. We illustrate this with a set of numerical experiments based on real data for single and multiple well placement problems.

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

simulated annealing
spsa
vfsa
well placement

reservoir optimization
reservoir simulation
stochastic optimization