XML Database Transformations Database transformations provide a unifying umbrella for queries and updates. In general, they can be characterised by five postulates, which constitute the database analogue of Gurevich's sequential ASM thesis. Among these postulates the background postulate supposedly captures the particularities of data models and schemata. For the characterisation of XML database transformations the natural first step is therefore to define the appropriate tree-based backgrounds, which draw on hereditarily finite trees, tree algebra operations, and extended document type definitions. This defines a computational model for XML database transformation using a variant of Abstract State Machines. Then the incorporation of weak monadic second-order logic provides an alternative computational model called XML machines. The main result is that these two computational models for XML database transformations are equivalent.

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

abstract state machine
computation background
extensible markup language
monadic second-order logic


Selecting the best statistical distribution with PROMETHEE and GAIA Three methods have previously been presented in Computer and industrial Engineering for the selection of a statistical distribution to describe a data-set: the weighted sum model, the weighted multiplication model and data envelopment analysis. These are based on distinctive preset of parameters and result in three different rankings. In these approaches there is no interaction with the decision-maker (DM). This leads to the question: which method should a DM choose? In this paper, we adopt another approach where the DM is the central actor. Based on the multi-criteria decision aid methods, PROMETHEE and GAIA, we will show that different preference parameters (given by the DM) lead to different rankings. Finally, a group decision can be reached using its extension: PROMETHEE GDSS. (C) 2011 Elsevier Ltd. All rights reserved.

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

ranking
multi-criteria decision analysis


Privacy-preserving and accountable on-the-road prosecution of invalid vehicular mandatory authorizations Nowadays, improving road safety is one of the major challenges in developed countries and, to this regard, attaining more effectiveness in the enforcement of road safety policies has become a key target. In particular, enforcing the requirements related to the technical and administrative mandatory documentation of on-the-road motor vehicles is one of the critical issues. The use of modern technologies in the context of Intelligent Transportation Systems (ITS) could enable the design of a more convenient, frequent and effective enforcement system compared to the traditional human patrol controls. In this article we propose a novel system for the on-the-fly verification of mandatory technical and administrative documentation of motor vehicles. Vehicles not complying with the required regulations will be identified and sanctioned whereas those vehicles, observant of the mandatory regulations, will maintain anonymity and non-traceability of their whereabouts. The proposed system is based on the use of anonymous credentials which will be loaded onto the vehicle to automatically and on-the-fly prove holdership of required credentials without requiring the vehicle to stop beside the road. We also implement a prototype of the credential system and analyze the feasibility of our solution in terms of computational cost and time to perform such telematic controls.

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

traffic law enforcement
privacy
accountability
vehicular mandatory authorization
anonymous credential
privacy attribute-based credential


The MACODO Organization Model for Context-Driven Dynamic Agent Organizations Today's distributed applications such as sensor networks, mobile multimedia applications, and intelligent transportation systems pose huge engineering challenges. Such systems often comprise different components that interact with each other as peers, as such forming a decentralized system. The system components and collaborations change over time, often in unanticipated ways. Multiagent systems belong to a class of decentralized systems that are known for realizing qualities such as adaptability, robustness, and scalability in such environments. A typical way to structure and manage interactions among agents is by means of organizations. Existing approaches usually endow agents with a dual responsibility: on the one hand agents have to play roles providing the associated functionality in the organization, on the other hand agents are responsible for setting up organizations and managing organization dynamics. Engineering realistic multiagent systems in which agents encapsulate this dual responsibility is a complex task. In this article, we present an organization model for context-driven dynamic agent organizations. The model defines abstractions that support application developers to describe dynamic organizations. The organization model is part of an integrated approach, called MACODO: Middleware Architecture for COntext-driven Dynamic agent Organizations. The complementary part of the MACODO approach is a middleware platform that supports the distributed execution of dynamic organizations specified using the abstractions, as described in Weyns et al. [2009]. In the model, the life-cycle management of dynamic organizations is separated from the agents: organizations are first-class citizens, and their dynamics are governed by laws. The laws specify how changes in the system (e.g., an agent joins an organization) and changes in the context (e.g., information observed in the environment) lead to dynamic reorganizations. As such, the model makes it easier to understand and specify dynamic organizations in multiagent systems, and promotes reusing the life-cycle management of dynamic organizations. The organization model is formally described to specify the semantics of the abstractions, and ensure its type safety. We apply the organization model to specify dynamic organizations for a traffic monitoring application.

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

context
intelligent transportation systems
middleware
organization


dynamic triangulation of variational implicit surfaces using incremental delaunay tetrahedralization In this paper, we present a novel method to triangulate variational implicit surfaces. The core of the algorithm is an incremental Delaunay tetrahedralization of the constraint points defining the surface; it can be refined over time by adding new points around the surface as needed. Each tetrahedron that crosses the surface can then be triangulated to locally approximate the surface. This method allows getting several meshes of the same shape at different resolutions, which can be updated dynamically when adding new constraint points. This level-of-detail property makes variational surfaces more appealing for applications such as interactive modeling.

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

geometric modelling
iso-surface extraction


Programs with lists are counter automata We address the problem of verifying programs manipulating one-selector linked data structures. We propose and study in detail an application of counter automata as an accurate abstract model for this problem. We let control states of the counter automata correspond to abstract heap graphs where list segments without sharing are collapsed, and use counters to keep track of the number of elements in these segments. As a significant theoretical result, we show that the obtained counter automata are bisimilar to the original programs. Moreover, from a practical point of view, our translation allows one to apply efficient automatic analysis techniques and tools developed for counter automata (integer programs) in order to verify both safety as well as termination of list-manipulating programs. As another theoretical contribution, we prove that if the control of the generated counter automata does not contain nested loops (i.e., these automata are flat), both safety and termination are decidable for the original programs. Subsequently, we generalise our counter-automata-based model to keep track of ordering properties over lists storing ordered data. Finally, we show effectiveness of our approach by verifying automatically safety as well as termination of several sorting programs.

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

formal verification
programs with singly-linked lists
bisimulation
lists with ordered data


the application of program verification techniques to hardware verification The growing complexity of machine designs and costs of engineering changes are increasing the demand for tools and methods to detect errors earlier in the hardware development cycle. Because of similar concerns in the development of software there has been a great deal of work on methods for proving that a program satisfies a given specification. This paper examines one such program verification technique, based on the notion of symbolic execution , and then explores its application to the problem of establishing the correct behavior of a piece of hardware.

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

verification software complexity hardware paper errors behavior tools

applications
program verification
method
engine
developer
change
design


Power performance and scalability study of AlGaAs/GaAs double-recessed pseudomorphic high electron mobility transistors on unthinned substrate for coplanar waveguide circuit applications We have investigated the power performance and scalability of AlGaAs/GaAs Double-Recessed Pseudomorphic High Electron Mobility Transistors (DR-PHEMTs) at 10GHz on an unthinned GaAs substrate for CoPlanar Waveguide (CPW) circuit applications. It was found that the output power varied linearly with the logarithm of the devices gate width ranging from 200 to 1000?m. It increased at a rate of 0.01dB/?m. That worked out to a doubling of output power (or 3dB) for every 300?m increase in the gate width. Gain decreased at a rate of about 0.005dB/?m while PAE generally improved when the gate width was increased. As for DC measurement, the maximum transconductance of the device was about 375mS/mm at VG=?0.5V and VDS=3V. The gate-drain breakdown voltage (BVGD) measured was ?20V, defined at IG=?1mA/mm. The microwave performance of the devices was measured on-wafer using a load-pull system at a bias of VG=?0.5V and VDS=8V. For a device with a gate width of 1mm, its saturated CW output power, gain and PAE value at 10GHz was 27.5dBm (0.55W), 8dB and 48%, respectively. At this same set of bias conditions, the value of ft and fmax was 40 and 80GHz, respectively.

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

power scalability
algaas/gaas phemts
double recess


Kernel Search: An application to the index tracking problem In this paper we study the problem of replicating the performances of a stock market index, i.e. the so-called index tracking problem, and the problem of out-performing a market index, i.e. the so-called enhanced index tracking problem. We introduce mixed-integer linear programming (MILP) formulations for these two problems. Furthermore, we present a heuristic framework called Kernel Search. We analyze and evaluate the behavior of several implementations of the Kernel Search framework to the solution of the index tracking problem. We show the effectiveness and efficiency of the framework comparing the performances of these heuristics with those of a general-purpose solver. The computational experiments are carried out using benchmark and newly created instances.

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

enhanced index tracking
mixed-integer linear programming


afterParty: turning raw transcriptomes into permanent resources Next-generation DNA sequencing technologies have made it possible to generate transcriptome data for novel organisms quickly and cheaply, to the extent that the effort required to annotate and publish a new transcriptome is greater than the effort required to sequence it. Often, following publication, details of the annotation effort are only available in summary form, hindering subsequent exploitation of the data. To promote best-practice in annotation and to ensure that data remain accessible, we have written afterParty, a web application that allows users to assemble, annotate and publish novel transcriptomes using only a web browser.

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


A precise ranking method for outlier detection Recent research studies on outlier detection have focused on examining the nearest neighbor structure of a data object to measure its outlierness degree. This leads to two weaknesses: the size of nearest neighborhood, which should be predetermined, greatly affects the final detection results, and the outlierness scores produced by existing methods are not sufficiently diverse to allow precise ranking of outliers. To overcome these problems, in this research paper, a novel outlier detection method involving an iterative random sampling procedure is proposed. The proposed method is inspired by the simple notion that outlying objects are less easily selected than inlying objects in blind random sampling, and therefore, more inlierness scores are given to selected objects. We develop a new measure called the observability factor (OF) by utilizing this idea. In order to offer a heuristic guideline to determine the best size of nearest neighborhood, we additionally propose using the entropy of OF scores. An intensive numerical evaluation based on various synthetic and real-world datasets shows the superiority and effectiveness of the proposed method.

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

outlier detection
observability factor
random sampling


An illumination problem: optimal apex and optimal orientation for a cone of light Let \(\{a_i:i\in I\}\) be a finite set in \(\mathbb R ^n\). The illumination problem addressed in this work is about selecting an apex \(z\) in a prescribed set \(Z\subseteq \mathbb R ^n\) and a unit vector \(y\in \mathbb R ^n\) so that the conic light beam $$\begin{aligned} C(z,y,s):= \{x \in \mathbb R ^n : s\,\Vert x-z\Vert - \langle y, x-z\rangle \le 0\} \end{aligned}$$captures every \(a_i\) and, at the same time, it has a sharpness coefficient \( s\in [0,1]\) as large as possible.

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

illumination problem
sharpness coefficient

revolution cone
aperture angle
maxmin problem
90c26


On a coreflective hull in L-TOP In this paper, we determine the coreflective hull of the L-Sierpinski space in the category L-TOP of L-topological spaces. (C) 2008 Elsevier B.V. All rights reserved.

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

l-sierpinski space
coreflective subcategory


Cloud Data Management for Online Games: Potentials and Open Issues The number of players, for massively multiplayer online role-playing games (MMORPG), typically reaches millions of people, geographically distributed throughout the world. Worldwide revenues for these games increase by billions of dollars each year. Unfortunately, their complex architecture makes them hard to maintain, resulting in considerable costs and development risks. For normal operation, MMORPGs have to access huge amounts of diverse data. With increasing numbers of players, managing growing volumes of data in a relational database becomes a big challenge, which cannot be overcome by simply adding new servers. Cloud storage systems are emerging solutions focusing on providing scalability and high performance for Cloud applications, social media, etc. However, Cloud storage systems are in general not designed for processing transactions or providing high levels of consistency. In this paper, we present our current work-in-progress by analyzing the existing architecture of MMORPGs and classifying relevant data. Based on this, we highlight the design requirements, identify the major research challenges, and propose a Cloud-based model for MMORPGs that we currently implement as a testbed for further evaluation.

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


A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers. preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schrodinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors. (C) 2009 Elsevier Inc. All rights reserved.

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

polynomial eigenvalue problems
quantum dot simulation

restricted additive schwarz preconditioning


Neurochemistry of drug action Proton magnetic resonance spectroscopy (1H MRS) is a noninvasive imaging technique that permits measurement of particular compounds or metabolites within the tissue of interest. In the brain, 1H MRS provides a snapshot of the neurochemical environment within a defined volume of interest. A search of the literature demonstrates the widespread utility of this technique for characterizing tumors, tracking the progress of neurodegenerative disease, and for understanding the neurobiological basis of psychiatric disorders. As of relatively recently, 1H MRS has found its way into substance abuse research, and it is beginning to become recognized as a valuable complement in the brain imaging toolbox that also contains positron emission tomography, single-photon-emission computed tomography, and functional magnetic resonance imaging. Drug abuse studies using 1H MRS have identified several biochemical changes in the brain. The most consistent alterations across drug class were reductions in N-acetylaspartate and elevations in myo-inositol, whereas changes in choline, creatine, and amino acid transmitters also were abundant. Together, the studies discussed herein provide evidence that drugs of abuse may have a profound effect on neuronal health, energy metabolism and maintenance, inflammatory processes, cell membrane turnover, and neurotransmission, and these biochemical changes may underlie the neuropathology within brain tissue that subsequently gives rise to the cognitive and behavioral impairments associated with drug addiction.

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

proton magnetic resonance spectroscopy
brain imaging
drug abuse


Tracer spectrum: a visualisation method for distributed evolutionary computation We present a novel visualisation method for island-based evolutionary algorithms based on the concept of tracers as adopted in medicine and molecular biology to follow a biochemical process. For example, a radioisotope or dye can be used to replace a stable component of a biological compound, and the signal from the radioisotope can be monitored as it passes through the body to measure the compounds distribution and elimination from the system. In a similar fashion we attach a tracer dye to individuals in each island, where each individual in any one island is marked with the same colour, and each island then has its own unique colour signal. We can then monitor how individuals undergoing migration events are distributed throughout the entire island ecosystem, thereby allowing the user to visually monitor takeover times and the resulting loss of diversity. This is achieved by visualising each island as a spectrum of the tracer dye associated with each individual. Experiments adopting different rates of migration and network connectivity confirm earlier research which predicts that island models are extremely sensitive to the size and frequency of migrations.

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

visualisation
distributed evolutionary computation


Improved approximations for the Erlang loss model Stochastic loss networks are often very effective models for studying the random dynamics of systems requiring simultaneous resource possession. Given a stochastic network and a multi-class customer workload, the classical Erlang model renders the stationary probability that a customer will be lost due to insufficient capacity for at least one required resource type. Recently a novel family of slice methods has been proposed by Jung et al. (Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, pp. 407-418, 2008) to approximate the stationary loss probabilities in the Erlang model, and has been shown to provide better performance than the classical Erlang fixed point approximation in many regimes of interest. In this paper, we propose some new methods for loss probability calculation. We propose a refinement of the 3-point slice method of Jung et al. (Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, pp. 407-418, 2008) which exhibits improved accuracy, especially when heavily loaded networks are considered, at comparable computational cost. Next we exploit the structure of the stationary distribution to propose randomized algorithms to approximate both the stationary distribution and the loss probabilities. Whereas our refined slice method is exact in a certain scaling regime and is therefore ideally suited to the asymptotic analysis of large networks, the latter algorithms borrow from volume computation methods for convex polytopes to provide approximations for the unscaled network with error bounds as a function of the computational costs.

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

multidimensional stochastic processes
stochastic approximations
erlang loss formula
erlang fixed-point approximation


A multi-user virtual laboratory environment for gear train design This paper presents the development of a game-based virtual laboratory environment for gear train design. This virtual laboratory environment goes beyond static demonstrations or conventional computer simulations and provides the students with the flexibility to perform various experiments related to the fundamental law of gearing and the concepts of planetary gear motion. In this virtual laboratory environment, the students, the instructor and the teaching assistant are represented by and interact as virtual characters (avatars). The scripted scenario for the laboratory exercise was first piloted in a junior-level course for mechanical engineering majors. Assessment tools such as pre- and post-experiment tests are an integral part of the laboratory environment and form the basis for providing different levels of support to the students at every step of the laboratory exercises. Furthermore, the laboratory environment can be equipped with functionality for monitoring the students' progress and learning outcomes, thus enabling skill-based assessment. 2013 Wiley Periodicals, Inc. Comput Appl Eng Educ 22:788802, 2014; View this article online at wileyonlinelibrary.com/journal/cae; DOI 10.1002/cae.21573

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

virtual learning
computer games
game-based virtual laboratory


Compact hardware liquid state machines on FPGA for real-time speech recognition Hardware implementations of Spiking Neural Networks are numerous because they are well suited for implementation in digital and analog hardware, and outperform classic neural networks. This work presents an application driven digital hardware exploration where we implement real-time, isolated digit speech recognition using a Liquid State Machine. The Liquid State Machine is a recurrent neural network of spiking neurons where only the output layer is trained. First we test two existing hardware architectures which we improve and extend, but that appears to be too fast and thus area consuming for this application. Next, we present a scalable, serialized architecture that allows a very compact implementation of spiking neural networks that is still fast enough for real-time processing. All architectures Support leaky integrate-and-fire membranes with exponential synaptic models. This work shows that there is actually a large hardware design space of Spiking Neural Network hardware that can be explored. Existing architectures have only spanned part of it. (C) 2007 Elsevier Ltd. All rights reserved.

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

liquid state machine
spiking neural network
fpga
speech recognition


High-level synthesis of recoverable VLSI microarchitectures Two algorithms that combine the operations of scheduling and recovery-point insertion for high-level synthesis of recoverable microarchitectures are presented. The first uses a prioritized cost function in which functional unit (FU) cost is minimized first and register cost second. The second algorithm minimizes a weighted sum of FU and register costs, Both algorithms are optimal according to their respective cost functions and require less than 10 min of central processing unit (CPU) time on widely used high-level synthesis benchmarks. The best previous result reported several hours of CPU time for some of the same benchmarks on a computer of similar computational power.

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

high-level synthesis
micro-rollback
optimization
recovery


Toward integrated production and distribution management in multi-echelon supply chains The effective management of multi-site systems involves the proper coordination of activities performed in multiple factories, distribution centers (DCs), retailers and end-users located in many different cities, countries and/or continents. To optimally manage numerous production and transportation decisions, a novel monolithic continuous-time MILP-based framework is developed to determine the best short-term operational planning to meet all customer requests at minimum total cost. The formulation lies on the unit-specific general precedence concept for the production scheduling problem whereas the immediate precedence notion is used for transportation decisions. To illustrate the applicability and potential benefits of the model, a challenging example corresponding to a supply chain comprising several locations geographically spread in six European countries has been solved to optimality with modest CPU times. Several scenarios with different logistics features were addressed in order to remark the significant advantages of using the integrated approach. (C) 2013 Elsevier Ltd. All rights reserved.

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

milp-based approach
production and distribution scheduling
multi-site system


four-dimensional views of 3d scalar fields Scalar functions of three variables, w = f(x, y, z), are common in many types of scientific and medical applications, Such 3D scalar fields can be understood as elevation maps in four dimensions, with three independent variables (x, y, z) and a fourth, dependent, variable w that corresponds to the elevations. We show how techniques developed originally for the display of 3-manifolds in 4D Euclidean space can be adapted to visualize 3D scalar fields in a variety of ways.

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


SpeedSeg: A technique for segmenting pen strokes using pen speed We present SpeedSeg, a technique for segmenting pen strokes into lines and arcs. The technique uses pen speed information to help infer the segmentation intended by the drawer. To begin, an initial set of candidate segment points is identified. This set includes speed minima below a threshold, and curvature maxima at which the pen speed is also below a threshold. The ink between each pair of consecutive segment points is then classified as either a line or an arc, depending on which fits best. Next, a feedback process is employed, and segments are judiciously merged and split as necessary to improve the quality of the segmentation. In user studies, SpeedSeg performed accurately for new users. The studies also demonstrated that SpeedSeg's accuracy is surprisingly insensitive to the values of many of the empirical parameters used by the technique. However, it is still possible to quickly tune the system to optimize performance for a given user. Finally, SpeedSeg outperformed a state-of-the-art segmentation algorithm.

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

pen stroke segmentation
sketch understanding
pen-based user interfaces


Entanglement in a dimerized antiferromagnetic Heisenberg chain The entanglement properties in an antiferromagnetic dimerized Heisenberg spin-1/2 chain are investigated. The entanglement gap, which is the difference between the ground-state energy and the minimal energy that any separable state can attain, is calculated to detect the entanglement. It is found that the entanglement gap can be increased by varying the alternation parameter. Through thermal energy, the witness of the entanglement can determine a characteristic temperature below which an entangled state can be obtained. The entanglement detected by the energy can provide a lower bound for that determined by the concurrence. If the alternation parameter is smaller than a critical value, there is always no inter-dimer entanglement in the chain.

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

entanglement witness
heisenberg spin chain


Numerical investigation of the thermally and flow induced crystallization behavior of semi-crystalline polymers by using finite element-finite difference method The thermally and flow induced crystallization behavior of semi-crystalline polymer in processing can significantly influence the quality of final products. The investigation of its mechanism has both scientific and industrial interest. A mathematical model in three dimensions for thermally and flow induced crystallization of polymer melts obeying differential Phan-Thien and Tanner (PTT) constitutive model has been developed and solved by using the finite element-finite difference method. A penalty method is introduced to solve the nonlinear governing equations with a decoupled algorithm. The corresponding finite element-finite difference model is derived by using the discrete elastic viscous split stress algorithm incorporating the streamline upwind scheme. A modified Schneider's approach is employed to discriminate the relative roles of the thermal state and the flow state on the crystallization phenomenon. The thermally and flow induced crystallization characteristics of polypropylene is investigated based on the proposed mathematical model and numerical scheme. The half crystallization time of polypropylene in a cooled couette flow configuration obtained by simulation are compared with Koscher's experimental results, which show that they agree well with each other. Two reasons to cause crystallization of polypropylene in pipe extrusion process including the thermal state and the flow state are investigated. Both the crystalline distribution and crystalline size of polypropylene are obtained by using the finite element-finite difference simulation of three-dimensional thermally and flow induced crystallization. The effects of processing conditions including the volume flow rate and the temperature boundary on the crystallization kinetics process are further discussed. (C) 2012 Published by Elsevier Ltd.

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


Neural network model for completing occluded contours When some parts of a pattern are occluded by other objects, the visual system can often estimate the shape of occluded contours from visible parts of the contours. This paper proposes a neural network model capable of such function, which is called amodal completion. The model is a hierarchical multi-layered network that has bottom-up and top-down signal paths. It contains cells of area V1, which respond selectively to edges of a particular orientation, and cells of area V2, which respond selectively to a particular angle of bend. Using the responses of bend-extracting cells, the model predicts the curvature and location of the occluded contours. Missing contours are gradually extrapolated and interpolated from the visible contours. Computer simulation demonstrates that the model performs amodal completion to various stimuli in a similar way as observed by psychological experiments.

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

vision
occlusion
bend-extracting cell
bottom-up and top-down


a natural language processing approach to automatic plagiarism detection The problem of plagiarism has existed for a long time but with the advance of information technology the problem becomes worse. It is because there are many electronic versions of published materials available to everyone. The Web is an important and common source for plagiarism. Some plagiarism detection programs (such as Turnitin) were developed to attempt to deal with this problem. To determine whether an article is copied from the Web or other electronic sources, the plagiarism detection program should calculate the similarity between two articles. However, it is often difficult to detect plagiarism accurately after modification of the copied contents. For example, it is possible to simply replace a word with its synonym (e.g. "program" -- "software ") and change the entire sentence structure. Most plagiarism detection programs can only compare whether two words are the same lexically and count how many matched words are there in a paper. Thus, if the copied materials are modified deliberately, it becomes difficult to detect plagiarism. Application of natural language processing can help to resolve this kind of problem. The underlying syntactic structure and semantic meaning of two sentences can be compared to reveal their similarity. There are several steps in the matching procedure. First, the thesaurus (or the lexical hierarchical structure) is referenced to find out the synonyms, broader terms and narrower terms used in the paper being checked. Then, the paper will be compared with the documents in the database. Wordnet is a typical example of the thesaurus that can be used for this purpose. If it is suspected that the paper contains some contents from the database, the sentences of the paper may be parsed to construct their parsing trees and semantic representations for further detailed comparison. The context free grammar and the case grammar are used to represent the syntactic structure and semantic meaning of sentences in the system. It is found that plagiarism that cannot be detected by the traditional methods can be identified by this new approach.

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

natural language process
syntactic and semantic analysis


Jmax-pruning: A facility for the information theoretic pruning of modular classification rules The Prism family of algorithms induces modular classification rules in contrast to the Top Down Induction of Decision Trees (TDIDT) approach which induces classification rules in the intermediate form of a tree structure. Both approaches achieve a comparable classification accuracy. However in some cases Prism outperforms TDIDT. For both approaches pre-pruning facilities have been developed in order to prevent the induced classifiers from overfitting on noisy datasets, by cutting rule terms or whole rules or by truncating decision trees according to certain metrics. There have been many pre-pruning mechanisms developed for the TDIDT approach, but for the Prism family the only existing pre-pruning facility is J-pruning. J-pruning not only works on Prism algorithms but also on TDIDT. Although it has been shown that J-pruning produces good results, this work points out that J-pruning does not use its full potential. The original J-pruning facility is examined and the use of a new pre-pruning facility, called Jmax-pruning, is proposed and evaluated empirically. A possible pre-pruning facility for TDIDT based on Jmax-pruning is also discussed.

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

j-pruning
jmax-pruning
modular classification rule induction
pre-pruning


Strategies for shape matching using skeletons Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance of such shape matching algorithms. Firstly, it is important that ligature-sensitive information be incorporated into the part decomposition and shape matching processes. Secondly, part decomposition should be treated as a dynamic process in which the selection of the final decomposition of a shape is deferred until the shape matching stage. Thirdly, both local and global measures must be employed when computing shape dissimilarity. Finally, skeletal segments must be weighted by appropriate visual saliency measures during the part matching process. These saliency measures include curvature and ligature-based measures. Experimental results show that the incorporation of these strategies significantly improves shape database retrieval accuracy.

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


On the Diameter of the Generalized Graphs UG(B)(n, m), n(2) < m <= n(3) The generalized de Bruijn digraph G(B)(n, m) is the digraph (V, A) where V = {0, 1, ..., m-1) and (i, j) is an element of A if and only if j equivalent to in + alpha (mod m) for some alpha is an element of {0, 1, 2, ..., n-1}. By replacing each arc of G(B)(n, m) with an undirected edge and eliminating loops and multi-edges, we obtain the generalized undirected de Bruijn graph UG(B)(n, m). In this article, we prove that when 2n(2) <= m <= n(3) the diameter of UG(B)(n, m) is equal to 3. We also show that for pairs (n, m) where n(2) < m < 2n(2) the diameter of UG(B) (n, m) can be 2 or 3. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 52(4), 180-182 2008

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

generalized de bruijn graph
undirected graph


Using wavelet transform and multi-class least square support vector machine in multi-spectral imaging classification of Chinese famous tea This article presented an intelligent method for recognition of different types of Chinese famous tea based on multi-spectral imaging technique. Two kinds of feature extraction methods including gray level co-occurrence matrix and wavelet transform (WT) were adopted for mining characteristic of multi-spectral image. Then multi-class least square support vector machine models were adopted for classification of multi-spectral image, which has little been used in this domain. Meanwhile the receiver operating characteristic (ROC) curve analysis was used to evaluate the performance of multi-spectral imaging classifier. To explore the structure of the wavelet textural features (WTFs), principal component analysis (PCA) was performed based on all the WTFs, and the most important features were detected through loading weight analysis of PCA. In experiments, the potential of WTFs was confirmed for extraction of characteristic from multi-spectral image with high recognition accuracy of 96.82%. And 18 WTFs were detected as the most important features for recognition by PCA. Furthermore, it can be found that the 18 features were the textural features of contrast of wavelet sub-space images. This finding may give great help for later research about multi-spectral image classification. The experimental results indicate that the proposed method is effective for recognition of multi-spectral image of different types of Chinese famous tea, the WT is an effective method for mining knowledge from mass multi-spectral imaging information, and PCA can be used to clear the structure of the WTFs.

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

least square support vector machine
wavelet transform
principal component analysis
chinese famous tea

multi-spectral imaging technique
receiver operating characteristic curve


Electron spin resonance analysis of sputtering-induced defects in advanced low-? insulators (?=2.02.5) We have carried out a low-temperature ESR study of damage induced by RF ion sputtering in dielectrics. The studied materials are three types of low-permittivity insulators grown on (100)Si. This reveals as universal damage pattern the generation of two types of point defects. These include the EX center and a broad signal ascribed to C dangling bonds in carbosilicide clusters.

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


Proximity relations in the fuzzy relational database model The fuzzy relational model of Buckles and Petry is a rigorous scheme for incorporating non-ideal or fuzzy information in a relational database. In addition to providing a consistent scheme for representing fuzzy information in the relational structure, the model possesses two critical properties that hold for classical relational databases. These properties are that no two tuples have identical interpretations and each relational operation has a unique result. The fuzzy relational model relies on similarity relations for each scalar domain in the fuzzy database. These relations are reflexive, symmetric, and max-min transitive. In addition to introducing fuzziness into the relational model, each similarity relation induces equivalence classes in its domain. It is the existence of these equivalence classes that provides the model with the important properties possessed by classical relational databases. In this paper, we extend the fuzzy relational database model of Buckles and Petry to deal with proximity relations for scalar domains. Since reflexivity and symmetry are the only constraints placed on proximity relations, they generalize the notion of similarity relations. We show that it is possible to induce equivalence classes from proximity relations; thus, the 'nice' properties of the fuzzy relational model of Buckles and Petry are preserved. Furthermore, the removal of the max-min transitivity restriction also provides database users with more freedom to express their value structures.

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

proximity relations
similarity relations

information storage and retrieval
fuzzy relational databases
max-min composition
transitive closure


The U.S. National Broadband Map: Data limitations and implications The 2011 release of the National Broadband Map (NBM) has generated significant interest from the telecommunications policy community. The NBM is a multiagency effort, including the National Telecommunications Administration (NTIA), the Federal Communications Commission (FCC), fifty U.S. states and five U.S. territories, to collect and disseminate information on broadband provision and quality of service for the United States. From a geographic perspective, the NBM represents a marked departure from previous broadband data efforts. Specifically, instead of disseminating FCC Form 477 data on providers at the ZIP code or Census tract level, the NBM reports provision information at the Census block levelthe smallest geographic unit in which the Census bureau tabulates survey information. While this increased level of geographic data resolution is a welcome change, there are several notable limitations to these data that are important to consider when conducting spatial econometric analysis for public policy evaluation. With this in mind, the purpose of this paper is twofold. First, this paper explores the salient characteristics of Census block geographic base files, highlighting their strengths and weaknesses as summary units of spatial analysis. This also includes a brief discussion on how the NBM treats geographically large blocks and their use of road segments for aggregating provider data. Second, this paper examines the impacts of empty blocks (i.e. blocks that have no household information associated with them) for the spatial analysis of broadband. Finally, this paper provides a short overview of how these data limitations can impact public policy evaluation and provides a blueprint for improving the National Broadband Map.

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

broadband
spatial analysis
public policy

national broadband map
geographic information systems


peer-to-peer resource discovery in mobile grids Grids are likely to be the mainstay of distributed computing. Grid was firstly applied as a concept for sharing computing resources among wired nodes, but there has been a growing interest in extending this concept to mobile environments. Although significant work has been done towards mobile grids, much of it has followed centralized approaches based on infrastructure wireless networks. We believe that a less restrictive, decentralized approach that supports mobile collaboration in ad-hoc wireless networks can cater for novel grid applications. To address this issue, we propose a middleware architecture called MoGrid . MoGrid orchestrates the distribution of grid tasks among mobile devices in a peer-to-peer (P2P) fashion. In this paper, we focus on the P2P Discovery Protocol (P2PDP), which is a central element of our architecture. P2PDP aids in distributing tasks among the most resourceful devices, while mitigating the overhead of control messages exchanged among them. We describe a prototype implementation of our architecture and discuss some issues related to the adoption of P2PDP as an ad-hoc resource discovery mechanism in mobile grids.

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

middleware
mobile collaboration
mobile grids
resource discovery


On the hardness of approximating spanners A k-spanner of a connected graph G = (V. E) is a subgraph G' consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G' is larger than the distance in G by no more than a factor of k. This paper concerns the hardness of finding spanners with a number of edges close to the optimum. It is proved that for every fixed k, approximating the spanner problem is at least as hard as approximating the set-cover problem. We also consider a weighted version of the spanner problem, and prove an essential difference between the approximability of the case k = 2 and the case k greater than or equal to 5.

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


Extracting the optimal dimensionality for local tensor discriminant analysis Supervised dimensionality reduction with tensor representation has attracted great interest in recent years. It has been successfully applied to problems with tensor data, such as image and video recognition tasks. However, in the tensor-based methods, how to select the suitable dimensions is a very important problem. Since the number of possible dimension combinations exponentially increases with respect to the order of tensor, manually selecting the suitable dimensions becomes an impossible task in the case of high-order tensor. In this paper, we aim at solving this important problem and propose an algorithm to extract the optimal dimensionality for local tensor discriminant analysis. Experimental results on a toy example and real-world data validate the effectiveness of the proposed method.

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

optimal dimensionality
tensor discriminant analysis


Efficient approximation algorithms for the routing open shop problem We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. The jobs are located at nodes of some transportation network, and the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (depot) and must return to the depot after completing all the jobs. It is required to find a non-preemptive schedule with the minimum makespan. The problem is NP-hard even on the two-node network with two machines. We present new polynomial-time approximation algorithms with worst-case performance guarantees.

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

approximation algorithm
worst-case analysis


Triangulations from topologically correct digital Voronoi diagrams We prove that the dual of the digital Voronoi diagram constructed by flooding the plane from the data points gives a geometrically and topologically correct dual triangulation. This provides the proof of correctness for recently developed GPU algorithms that outperform traditional CPU algorithms for constructing two-dimensional Delaunay triangulations.

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

gpgpu
digital geometry
delaunay triangulation


on exploiting diversity and spatial reuse in relay-enabled wireless networks Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next generation wireless networks. The adoption of more sophisticated access technologies such as OFDM (orthogonal frequency division multiplexing) coupled with the relay-induced two-hop nature, provides two key benefits to these networks in the form of diversity and spatial reuse gains. However, leveraging these benefits calls for more sophisticated solutions, among which, user scheduling forms a key component. We consider the specific problem of scheduling users with finite buffers on the multiple OFDM carriers (channels over the two hops of the relay-enabled network. We propose scheduling algorithms that help leverage diversity and spatial reuse gains from these networks. We show that even the scheduling problem to exploit diversity gains alone is NP-hard and provide both theoretically and practically efficient polynomial-time algorithms with approximation guarantees. Building on the diversity solutions, we also propose an efficient polynomial-time scheduling algorithm for exploiting both spatial reuse as well as diversity. The proposed solutions are evaluated to highlight the relative significance of diversity and spatial reuse gains with respect to varying network conditions.

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


search-based query suggestion In this paper, we proposed a unified strategy to combine query log and search results for query suggestion. In this way, we leverage both the users' search intentions for popular queries and the power of search engines for unpopular queries. The suggested queries are also ranked according to their relevance and qualities; and each suggestion is described with a rich snippet including a photo and related description.

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 O


A new algorithm for contact detection between convex polygonal and polyhedral particles in the discrete element method We present an algorithm for contact detection between polygonal (2-D) or polyhedral (3-D) convex particles in the Discrete Element Method (DEM). Noting that the space occupied by a polygon or polyhedron can be defined using a set of linear inequalities, we show that the task of contact detection can be cast as a standard problem in the field of convex optimization, for which there exist established solution procedures. The contact detection algorithm consists of two stages; first to establish intersection and then to calculate the contact point. We can establish intersection between a pair of particles by solving a linear program and, if there is an intersection, use the analytic center of the linear inequalities as the contact point. Once the contact point is obtained, the contact normal can be calculated from the gradient vector of an inner potential particle whose corners are rounded (c.f. [13]). The necessary mathematics is presented. Six examples are included to assess the performance of the algorithm in terms of speed and accuracy.

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

dem
polygonal
polyhedral
particles
contact detection


Tensor Discriminant Color Space for Face Recognition Recent research efforts reveal that color may provide useful information for face recognition. For different visual tasks, the choice of a color space is generally different. How can a color space be sought for the specific face recognition problem? To address this problem, this paper represents a color image as a third-order tensor and presents the tensor discriminant color space (TDCS) model. The model can keep the underlying spatial structure of color images. With the definition of n-mode between-class scatter matrices and within-class scatter matrices, TDCS constructs an iterative procedure to obtain one color space transformation matrix and two discriminant projection matrices by maximizing the ratio of these two scatter matrices. The experiments are conducted on two color face databases, AR and Georgia Tech face databases, and the results show that both the performance and the efficiency of the proposed method are better than those of the state-of-the-art color image discriminant model, which involve one color space transformation matrix and one discriminant projection matrix, specifically in a complicated face database with various pose variations.

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

discriminant information
tensor subspace


Querying molecular biology databases by integration using multiagents In this paper, we propose a method for querying heterogeneous molecular biology databases. Since molecular biology data are distributed into multiple databases that represent different biological domains, it is highly desirable to integrate data together with the correlations between the domains. However, since the total amount of such databases is very large and the data contained are frequently updated, it is difficult to maintain the integration of the entire contents of the databases. Thus, we propose a method for dynamic integration based on user demand, which is expressed with an OQL-based query language. By restricting search space according to user demand, the cost of integration can be reduced considerably. Multiple databases also exhibit much heterogeneity, such as semantic mismatching between the database schemas. For example, many databases employ their own independent terminology. For this reason, it is usually required that the task for integrating data based on a user demand should be carried out transitively; first search each database for data that satisfy the demand, then repeatedly retrieve other data that match the previously found data across every database. To cope with this issue, Eve introduce two types of agents; a database agent and a user agent, which reside at each database and at a user, respectively. The integration task is performed by the agents; user agents generate demands for retrieving data based on the previous search results by database agents, and database agents search their databases for data that satisfy the demands received from the user agents. We have developed a prototype system on a network of workstations. The system integrates four databases; GenBank (a DNA nucleotide database), SWISS-PROT, PIR (protein amino-acid sequence databases), and PDB (a protein three-dimensional structure database). Although the sizes of GenBank and PDB are each over one billion bytes, the system achieved good performance in searching such very large heterogeneous databases.

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

molecular biology database
multiagent
heterogeneous database
object-oriented database


Characterization and Modeling of the Peripheral Cardiac Conduction System The development of biophysical models of the heart has the potential to get insights in the patho-physiology of the heart, which requires to accurately modeling anatomy and function. The electrical activation sequence of the ventricles depends strongly on the cardiac conduction system (CCS). Its morphology and function cannot be observed in vivo, and therefore data available come from histological studies. We present a review on data available of the peripheral CCS including new experiments. In order to build a realistic model of the CCS we designed a procedure to extract morphological characteristics of the CCS from stained calf tissue samples. A CCS model personalized with our measurements has been built using L-systems. The effect of key unknown parameters of the model in the electrical activation of the left ventricle has been analyzed. The CCS models generated share the main characteristics of observed stained Purkinje networks. The timing of the simulated electrical activation sequences were in the physiological range for CCS models that included enough density of PMJs. These results show that this approach is a potential methodology for collecting knowledge-domain data and build improved CCS models of the heart automatically.

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

cardiac electrophysiology
cardiac histology
heart modeling
purkinje system


the term retrieval abstract machine Scans through large collections of complex objects often cannot be avoided. Even if sohphisticated indexing mechanisms are provided, it may be necessary to evaluate simple predicates against data stored on disk for filtering. For traditional record oriented data models i/o and buffer management are the main bottlenecks for this operation, the interpretation of data structures is straightforward and usually not an important cost factor. For heterogeneously shaped complex objects it may become a dominant cost factor. In this paper we demonstrate a technique to make data structure traversal inside of complex objects much cheaper than naive interpretation. We compile navigation necessary to evaluate condition predicates and physical schema information into a program to be executed by a specialized abstract machine. Our approach is demonstrated for the Feature Term Data Model (FTDM), but the technique is applicable to many other complex data models. Main parts of this paper are dedicated to the method we used to design the Term Retrieval Abstract Machine (TRAM) architecture by partial evaluation of a tuned interpreter.

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

design
data structures
schema
paper
filtering
navigation
evaluation
data models
indexing
buffer management
method
factor
interpretation
architecture
retrieval
data
demonstrate
physical
feature
cost

abstract-machine
collect
object
informal
records
partial evaluation
complexity


Simulation of acoustic radiation of an AC servo drive Purpose - Nowadays, the determination of the acoustic radiation of electric machines is of particular interest, because legal regulations restrict the maximum audible noise radiated by technical devices such as electrical machinery. The purpose of this paper is to analyze the electromagnetic excited structure-borne sound and air-borne noise of an AC servo drive. Design/methodology/approach - This paper presents the required steps for the multiphysics acoustic simulation of electrical machines to evaluate its noise behaviour. This numerical approach starts with the electromagnetic force-wave simulation. The computation by a structure dynamic model determines the deformation of the mechanical structure due to the force-waves. The final step of the simulation approach consists of the computation of the acoustic radiation. Findings - For the electromagnetic simulation analytical and numerical methods are combined to gain some acceleration of the entire multiphysics simulation approach. This combination offers additionally a detailed understanding of the noise generation mechanism in electrical machines. Originality/value - Particular attention is paid to the structural-dynamic model. Modelling of microstructures, such as the laminated iron core or insulated coils, is memory and computational expensive. A systematic material homogenisation technique, based on experimental- and numerical modal analyses, yields a higher accuracy at lower computational costs when compared to standard numerical approaches. The presented multiphysics simulation is validated by measurements. The methods are presented by means of a case study.

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

electromagnetism
acoustic properties
amplifiers


Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored ant colony operators for improving solution quality. The method used to tune the system parameters is also described. The algorithm has been tested by using standard benchmarks and problems, properly designed for a typical FMS layout. The effectiveness of the proposed system has been verified in comparison with alternative approaches.

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

job-shop scheduling
flexible manufacturing systems


A model of proactive and reactive cognitive control with anterior cingulate cortex and the neuromodulatory system Proactive and reactive cognitive control are often associated with anterior cingulate cortex (ACC). How ACC affects processing in other brain areas, however, is often not explicitly delineated. In this work, we describe a model of how ACC computes measures of conflict and surprise that are in turn relayed to the basal forebrain (BF) and locus coeruleus (LC) in that order. BF and LC signals then respectively sharpen posterior cortical processing and trigger the reframing of prefrontal cortical decision-making frames. We implemented this theory in a large-scale neurocognitive model that performs simulated geospatial intelligence tasks. Experiments demonstrate improved performance while minimizing additional processing. Alternate interpretations of neuromodulatory signals are also discussed.

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

anterior cingulate cortex (acc)
neuromodulators


A level set technique applied to unsteady free surface flows An unsteady Navier-Stokes solver for incompressible fluid is coupled with a level set approach to describe free surface motions. The two-phase now of air and water is approximated by the flow of a single fluid whose properties, such as density and viscosity, change across the interface. The free surface location is captured as the zero level of a distance function convected by the flow field. To validate the numerical procedure, two classical two-dimensional free surface problems in hydrodynamics, namely the oscillating flow in a tank and the waves generated by the flow over a bottom bump, are studied in non-breaking conditions, and the results are compared with those obtained with other numerical approaches. To check the capability of the method in dealing with complex free surface configurations, the breaking regime produced by the flow over a high bump is analyzed. The analysis covers the successive stages of the breaking phenomenon: the steep wave evolution, the falling jet, the splash-up and the air entrainment. In all phases, numerical results qualitatively agree with the experimental observations. Finally, to investigate a flow in which viscous effects are relevant, the numerical scheme is applied to study the wavy flow past a submerged hydrofoil. Copyright (C) 2001 John Wiley & Sons, Ltd.

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

free surface flow
two-phase flow
wave breaking


Multistage expansion planning of generation and interconnections with sustainable energy development criteria: A multiobjective model A novel multiobjective, multiarea and multistage model to long-term expansion planning of integrated generation and transmission corridors incorporating sustainable energy developing is presented in this paper. The proposed MESEDES model is a bottom-up energy model which considers the electricity generation/transmission value-chain, i.e., power generation alternatives including renewables, nuclear and traditional thermal generation along with transmission corridors. The model decides the optimal location and timing of the electricity generation/transmission abroad the multistage planning horizon. The proposed model considers three objectives belonging to sustainable energy development criteria such as: (a) the minimization of investments and operation costs of power generation, transmission corridors, energy efficiency (demand side management (DSM) programs) considering CO2 capture technologies; (b) minimization of Life-Cycle Greenhouse Gas Emissions (GHG); and (c) maximization of the diversification of electricity generation mix. The proposed model consider aspects of the carbon abatement policy under the CDM Clean Development Mechanism or European Union Greenhouse Gas Emission Trading Scheme. A case study is used to illustrate the proposed framework.

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

sustainable energy development
demand side management

power system expansion planning
multicriteria optimization
greenhouse emission


Enhanced functions of osteoblasts on nanostructured surfaces of carbon and alumina It is of the utmost importance to increase the activity of bone cells on the surface of materials used in the design of orthopaedic implants. Increased activity of such cells can promote either integration of these materials into surrounding bone or complete replacement with naturally produced bone if biodegradable materials are used. Osteoblasts are bone-producing cells and, for that reason, are the cells of interest in initial studies of new orthopaedic implants. If these cells are functioning normally, they lay down bone matrix onto both existing bone and prosthetic materials implanted into the body. It is generally accepted that a successful material should enhance osteoblast function, leading to more bone deposition and, consequently, increased strength of the interface between the material and juxtaposed bone. The present study provided the first evidence of greater osteoblast function on carbon and alumina formulations that mimic the nano-dimensional crystal geometry of hydroxyapatite found in bone.

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


Posterior inference on parameters of stochastic differential equations via non-linear Gaussian filtering and adaptive MCMC This article is concerned with Bayesian estimation of parameters in non-linear multivariate stochastic differential equation (SDE) models occurring, for example, in physics, engineering, and financial applications. In particular, we study the use of adaptive Markov chain Monte Carlo (AMCMC) based numerical integration methods with non-linear Kalman-type approximate Gaussian filters for parameter estimation in non-linear SDEs. We study the accuracy and computational efficiency of gradient-free sigma-point approximations (Gaussian quadratures) in the context of parameter estimation, and compare them with Taylor series and particle MCMC approximations. The results indicate that the sigma-point based Gaussian approximations lead to better approximations of the parameter posterior distribution than the Taylor series, and the accuracy of the approximations is comparable to that of the computationally significantly heavier particle MCMC approximations.

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

stochastic differential equation
parameter estimation
adaptive markov chain monte carlo

gaussian approximation
non-linear kalman filter


Efficient estimation of neural weights by polynomial approximation It has been known for some years that the uniform-density problem for forward neural networks has a positive answer: Any real-valued, continuous function on a compact subset of R-d can be uniformly approximated by a sigmoidal neural network with one hidden layer, We design here algorithms for efficient uniform approximation by a certain class of neural networks with one hidden layer which we call nearly exponential, This class contains, e.g., all networks with the activation functions 1/(1 + e(-t)), tanh (t), or e(t) Lambda 1 in their hidden layers. The algorithms how from a theorem stating that such networks attain the order of approximation O (N-1/d), d being dimension and N the number of hidden neurons. This theorem, in turn, is a consequence of a close relationship between neural networks of nearly exponential type and multivariate algebraic and exponential polynomials, The algorithms need neither a starting point nor learning parameters; they do not get stuck in local minima, and the gain in execution time relative to the backpropagation algorithm is enormous. The size of the hidden layer can be bounded analytically as a function of the precision required.

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

approximation algorithms
complexity problem for neural networks
nearly exponential activation function
order of uniform approximation


Exact and heuristic approaches to the airport stand allocation problem We prove that the stand allocation feasibility problem is NP-complete. We propose a strong mixed integer programming (MIP) for the stand allocation problem. We introduce two heuristic algorithms based on spatial and temporal decompositions. Performances of MIP approaches are significantly better than the state of the art.

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

mixed integer programming
heuristic algorithms


Debugging incoherent terminologies In this paper we study the diagnosis and repair of incoherent terminologies. We define a number of new nonstandard reasoning services to explain incoherence through pinpointing, and we present algorithms for all of these services. For one of the core tasks of debugging, the calculation of minimal unsatisfiability preserving subterminologies, we developed two different algorithms, one implementing a bottom-up approach using support of an external description logic reasoner, the other implementing a specialized tableau-based calculus. Both algorithms have been prototypically implemented. We study the effectiveness of our algorithms in two ways: we present a realistic case study where we diagnose a terminology used in a practical application, and we perform controlled benchmark experiments to get a better understanding of the computational properties of our algorithms in particular and the debugging problem in general.

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


Particle-based parallel fluid simulation in three-dimensional scene with implicit surfaces We propose an algorithm for fluid simulation in three-dimensional scenes with obstacles represented as implicit surfaces. The fluid simulation is performed based on the smoothed particle hydrodynamics method and the behavior of fluid particles in the vicinity of obstacles is defined by introducing a new model of particle motion specific to implicitly representation. For effective parallelization on the graphics processing units, we apply the grid of polynomial method to express the implicitly defined obstacles. The proposed method takes advantage of the properties of implicit representation such as smoothness, shape modelling and the expression of deforming objects.

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

fluid simulation
smoothed particle hydrodynamics
graphics processing units


A study on the influence of molecular properties in the psychoactivity of cannabinoid compounds Several molecular properties are calculated for a set of 26 cannabinoid compounds with the goal of connecting the psychoactivity of the compounds with an appropriate set of calculated properties. For this purpose we used quantum chemical (the AM1 semi-empirical method) and chemometric methods. The AM1 method was employed to calculate the set of quantum chemical molecular properties and the chemometric methods were employed with the aim of selecting the most relevant properties to be correlated with psychoactivity. The chemometric methods used were Principal Component Analysis (PCA), Hierarchical Cluster Analysis (HCA) and the K-Nearest Neighbor (KNN) method. The chemometric analysis showed that an electronic property (energy of LUMO), a hydrophobic property (log P), a steric property (volume of the substituent at the C4 position) and a topological property (Lovasz-Pelikan index) were the most important variables for the separation between the psychoactive and psychoinactive compounds. In order to validate our PCA, HCA and KNN results, eight new cannabinoid compounds (with known psychoactivity) were used in a prediction study and were classified correctly by the methods used in this work, indicating that our PCA, HCA and KNN models are able to predict reliable psychoactivity of cannabinoid compounds.

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

quantum chemical and chemometric methods


Performance of cubic convergent methods for implementing nonlinear constitutive models Performance of six cubic convergent methods are compared. Cubic methods are used to solve nonlinear equations in constitutive models. Some cubic convergent methods are efficient than the NewtonRaphson method. Some cubic convergent methods are also relatively insensitive to initial guess. Hybrid methods are proposed to reduce the sensitivity to initial guess.

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

cubic convergence
root-solvers
material nonlinearity
j2 j 2 plasticity j2 j 2 j2 j 2 j 2
gurson plasticity


Testing, monitoring, and dating structural changes in exchange rate regimes Linear regression models for defacto exchange rate regime classification are complemented by inferential techniques for evaluating the stability of the regimes. To simultaneously assess parameter instabilities in the regression coefficients and the error variance an (approximately) normal regression model is adopted and a unified toolbox for testing, monitoring, and dating structural changes is provided for general (quasi-)likelihood-based regression models. Subsequently, the toolbox is employed for investigating the Chinese exchange rate regime after China gave up on a fixed exchange rate to the US dollar in 2005 and for tracking the evolution of the Indian exchange rate regime from 1993 until 2008.

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

parameter instability
foreign exchange rates
cny
inr


Technostress in the office: a distributed cognition perspective on humantechnology interaction Technology is a mobile and integral part of many work places, and computers and other information and communication technology have made many users work life easier, but technology can also contribute to problems in the cognitive work environment and, over time, create technostress. Much previous research on technostress has focused on the use of digital technology and its effects, measured by questionnaires, but in order to further examine how technostress arises in the modern workplace, a wider perspective on interactions between people and technology is needed. This paper applies a distributed cognition perspective to humantechnology interaction, investigated through an observational field study. Distributed cognition focuses on the organisation of cognitive systems, and technostress in this perspective becomes an emergent phenomenon within a complex and dynamic socio-technical system. A well-established questionnaire was also used (for a limited sample), to gain a frame of reference for the results from the qualitative part of the study. The implications are that common questionnaire-based approaches very well can and should be complemented with a broader perspective to study causes of technostress. Based on the present study, a redefinition of technostress is also proposed.

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

technostress
distributed cognition
cognitive work environment

information and communication technology (ict)


An introduction to inductive programming The research field of inductive programming is concerned with the design of algorithms for learning computer programs with complex flow of control (typically recursive calls) from incomplete specifications such as examples. We introduce a basic algorithmic approach for inductive programming and illustrate it with three systems: dialogs learns logic programs by combining inductive and abductive reasoning; the classical thesys system and its extension igor1 learn functional programs based on a recurrence detection mechanism in traces; igor2 learns functional programs over algebraic data-types making use of constructor-term rewriting systems. Furthermore, we give a short history of inductive programming, discuss related approaches, and give hints about current applications and possible future directions of research.

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


Use of RDF for expertise matching within academia Organisations have realized that effective development and management of their organisational knowledge base is critical to survival in today's competitive business environment. Employees, as a special knowledge asset, also attract the interest of many researchers because only through people communicating with one another can they really share their tacit knowledge and skills, which are often more valuable than sharing explicit documentations. The need to be able to quickly locate experts among the heterogeneous data sources stored in the organisational memory has been recognized by many researchers. This paper examines the advantages of using RDF (resource description framework) for expertise matching-the process of finding an individual with the required knowledge and skills. The major challenge is to semantically integrate multiple expertise indications from heterogeneous data sources stored in the organisational memory in order to facilitate users to locate the right expert(s). To understand the issues, a case study has been performed that involves building a RDF-based expertise broker that helps Ph.D. applicants locate potential supervisors before they formally apply to a university. An evaluation of the brokering system has been conducted through an experiment and the key results are presented. An extended brokering system that would support expertise matching in a multidisciplinary context is also described and further research identified.

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

expertise matching
organisational memory
rdf


Generation of pixel-level resolution lunar DEM based on Chang'E-1 three-line imagery and laser altimeter data We develop a data processing flow based on Chang'E-1 (CE-1) data. We use additional information (LAM data) to generate initial global disparity. We achieve pixel-level resolution corresponding points and high resolution DEM.

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

pixel-level resolution
adaptive support-weight approach


Hyper hamiltonian laceability on edge fault star graph The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n?3)-edge fault tolerant hamiltonian laceable, (n?3)-edge fault tolerant strongly hamiltonian laceable, and (n?4)-edge fault tolerant hyper hamiltonian laceable. All these results are optimal in a sense described in this paper.

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

star graph
hamiltonian laceable
fault tolerant

strongly hamiltonian laceable
hyper hamiltonian laceable