Tight upper bounds on the minimum precision required of the divisor and the partial remainder in high-radix division Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial remainder in redundant form and selecting the quotient digits in a radix higher than 2. Use of a redundant partial remainder replaces the standard addition in each cycle by a carry-free addition, thus making the cycles shorter. Deriving the quotient in high radix reduces the number of cycles (by a factor of about h for radix 2(h)). To make the redundant partial remainder scheme work, quotient digits must be chosen from a redundant set, such as [-2, 2] in radix 4. The redundancy provides some tolerance to imprecision so that the quotient digits can be selected based on examining truncated versions of the partial remainder and divisor. No closed form formula for the required precision in the partial remainder and divisor, as a function of the quotient digit set and the range of the partial remainders is known. In this paper, we establish tight upper bounds on the required precision for the partial remainder and divisor. The bounds are tight in the sense that each is only one bit over a well-known simple lower bound. We also discuss the implications of these bounds for the quotient digit selection process.

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

digit-recurrence division
digit-selector pla
high-radix division
p-d plot
srt division


The effect of viewing angle on wrist posture estimation from photographic images using novice raters Observational assessment of wrist posture using photographic methods is theoretically affected by camera view angle. A study was conducted to investigate whether wrist flexion/extension and radial/ulnar deviation postures were estimated differently by raters depending on the viewing angle and compared to predictions using a quantitative 2D model of parallax. Novice raters (n=26) estimated joint angles from images of wrist postures photographed from ten different viewing angles. Results indicated that ideal views, orthogonal to the plane of motion, produced more accurate estimates of posture compared to non-ideal views. The neutral (0) posture was estimated the most accurately even at different viewing angles. Raters were more accurate than model predictions. Findings demonstrate a need for more systematic methods for collecting and analyzing photographic data for observational studies of posture. Renewed caution in interpreting existing studies of wrist posture where viewing angle was not controlled is advised.

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


New proposals for the design of steel beam-columns in case of fire, including a new approach for the lateraltorsional buckling The possibility of having, in parts 1-1 and 1-2 of Eurocode 3, the same approach for the design of beam-columns and for lateraltorsional buckling, was investigated by the authors in previous papers using a numerical approach, where it was concluded that those assumptions could be made. In the present paper, a new approach for lateraltorsional buckling has been used with the formulae for the design of beam-columns at elevated temperature based on prEN 1993-1-1 combined with the formulae from prEN 1993-1-2. In both cases the results obtained are much better than the current design expressions, when compared with those obtained in the numerical calculations.

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

steel
lateraltorsional buckling
fire
eurocode 3


A note on the article "Fuzzy less strongly semiopen sets and fuzzy less strong semicontinuity" In this note we show that some results in the article by Fang Jing Ming are incorrect. (C) 1999 Elsevier Science B.V. All rights reserved.

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

fuzzy topology
fuzzy strongly semiopen set


Differential fault analysis on Camellia Camellia is a 128-bit block cipher published by NTT and Mitsubishi in 2000. On the basis of the byte-oriented model and the differential analysis principle, we propose a differential fault attack on the Camellia algorithm. Mathematical analysis and simulating experiments show that our attack can recover its 128-bit, 192-bit or 256-bit secret key by introducing 30 faulty ciphertexts. Thus our result in this study describes that Camellia is vulnerable to differential fault analysis. This work provides a new reference to the fault analysis of other block ciphers.

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

differential fault analysis
block ciphers
camellia


The L(2,1) L ( 2 , 1 ) -labeling of unigraphs The L(2,1) L ( 2 , 1 ) -labeling problem consists of assigning colors from the integer set 0,,? 0 , , ? to the nodes of a graph G G in such a way that nodes at a distance of at most two get different colors, while adjacent nodes get colors which are at least two apart. The aim of this problem is to minimize ? ? and it is in general NP-complete. In this paper the problem of L(2,1) L ( 2 , 1 ) -labeling unigraphs, i.e. graphs uniquely determined by their own degree sequence up to isomorphism, is addressed and a 3/2 3 / 2 -approximate algorithm for L(2,1) L ( 2 , 1 ) -labeling unigraphs is designed. This algorithm runs in O(n) O ( n ) time, improving the time of the algorithm based on the greedy technique, requiring O(m) O ( m ) time, that may be near to ?(n2) ? ( n 2 ) for unigraphs.

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

l(2
1) l ( 2
1 ) -labeling l(2
1 ) l(2
1 ) l ( 2
1 )
frequency assignment


Ground Control Station Embedded Mission Planning for UAS As the Unmanned Aerial System (UAS) Level Of Automation increases, Mission Planning relevance raises. A mission plan can be defined as all the information needed to reach the assigned goals, and it is composed by several sub-plans. In particular, the mission plan core is represented by the routes. Since the route creation process is very complex, the introduction of route creation and verification algorithms is required. These algorithms enhance the crew replan performances during the mission execution, and permit to implement autonomous on-board replanning. Furthermore, Planning/replanning processes could also have a key role in the integration of UAS in the civil airspace. According to these considerations, a Mission Planner embedded in the Alenia Aermacchi UAS Ground Control Station (GCS) has been developed, comprised of advanced planning algorithms.

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

route creation/validation algorithms
stanag 4586


Automatic Frechet Differentiation for the Numerical Solution of Boundary-Value Problems A new solver for nonlinear boundary-value problems (BVPs) in MATLAB is presented, based on the Chebfun software system for representing functions and operators automatically as numerical objects. The solver implements Newton's method in function space, where instead of the usual Jacobian matrices, the derivatives involved are Frechet derivatives. A major novelty of this approach is the application of automatic differentiation (AD) techniques to compute the operator-valued Frechet derivatives in the continuous context. Other novelties include the use of anonymous functions and numbering of each variable to enable a recursive, delayed evaluation of derivatives with forward mode AD. The AD techniques are applied within a new Chebfun class called chebop which allows users to set up and solve nonlinear BVPs, both scalar and systems of coupled equations, in a few lines of code, using the "nonlinear backslash" operator (\). This framework enables one to study the behaviour of Newton's method in function space.

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

linearization of boundary-value problems


Asynchronous Parallel Finite Automaton: A New Mechanism for Deep Packet Inspection in Cloud Computing Security is quite an important issue in cloud computing. The general security mechanisms applied in the cloud are always passive defense methods such as encryption. Besides these, it's necessary to utilize real-time active monitoring, detection and defense technologies. According to the published researches, Deep Packets Inspection (DPI) is the most effective technology to realize active inspection and defense. However, most of the works on DPI focus on its performance in general application scenarios and make improvement for space reduction, which could not meet the demands of high speed and stability in the cloud. Therefore it is meaningful to improve the common mechanisms of DPI, making it more suitable for cloud computing. In this paper, an asynchronous parallel finite automaton (FA) is proposed. The applying of asynchronous parallelization and heuristic forecast mechanism decreases the time consumed in matching significantly, while still reduces the memory required. Moreover, it is immune to overlapping problem, also enhancing the stability. The final evaluation results show that asynchronous parallel FA has higher stability, better performance on both time and memory, and is more suitable for cloud computing.

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

cloud computing
deep packet inspection
asynchronous parallel finite automaton


Dynamic of a non-autonomous predatorprey system with infinite delay and diffusion ? In the present paper, a nonlinear non-autonomous predatorprey dispersion model with continuous delay is studied. Sufficient conditions which guarantee the existence of a periodic positive solution are obtained by using Gaines and Mawhins continuation theorem of coincidence degree theory. Moreover, globally asymptotically stability of the system is also obtained by means of a suitable Lyapunov functional. The applications show that these criteria are easily verified.

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

time delay
periodic solution
persistent
globally asymptotically stable


Secure and Lightweight Network Admission and Transmission Protocol for Body Sensor Networks A body sensor network (BSN) is a wireless network of biosensors and a local processing unit, which is commonly referred to as the personal wireless hub (PWH). Personal health information (PHI) is collected by biosensors and delivered to the PWH before it is forwarded to the remote healthcare center for further processing. In a BSN, it is critical to only admit eligible biosensors and PWH into the network. Also, securing the transmission from each biosensor to PWH is essential not only for ensuring safety of PHI delivery, but also for preserving the privacy of PHI. In this paper, we present the design, implementation, and evaluation of a secure network admission and transmission subsystem based on a polynomial-based authentication scheme. The procedures in this subsystem to establish keys for each biosensor are communication efficient and energy efficient. Moreover, based on the observation that an adversary eavesdropping in a BSN faces inevitable channel errors, we propose to exploit the adversary's uncertainty regarding the PHI transmission to update the individual key dynamically and improve key secrecy. In addition to the theoretical analysis that demonstrates the security properties of our system, this paper also reports the experimental results of the proposed protocol on resource-limited sensor platforms, which show the efficiency of our system in practice.

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

efficiency
network admission and transmission
security


Time-Domain Orthogonal Finite-Element Reduction-Recovery Method for Electromagnetics-Based Analysis of Large-Scale Integrated Circuit and Package Problems A time-domain orthogonal finite-element reduction-recovery method is developed to overcome the large problem sizes encountered in the simulation of large-scale integrated-circuit and package problems. In this method, a set of orthogonal prism vector basis functions is developed. Based on this set of bases, an arbitrary 3-D multilayered system such as a combined package and die is reduced to a single-layer system with negligible computational cost. More importantly, the reduced single-layer system is diagonal and, hence, can be solved readily. From the solution of the reduced system, the solution of the other unknowns is recovered in linear complexity. The method entails no theoretical approximation. It applies to any arbitrarily shaped multilayer structure involving inhomogeneous materials or any structure that can be geometrically modeled by triangular prism elements. In addition, it permits nonlinear device modeling and broadband simulation within one run. Numerical and experimental results have demonstrated its accuracy and high capacity in simulating on-chip, package, and die-package interface problems.

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

die-package cosimulation
electromagnetic simulation
finite-element methods
large scale
on-chip
time domain


The Role of Social Network Sites in Romantic Relationships: Effects on Jealousy and Relationship Happiness On social network sites (SNS), information about one's romantic partner is readily available and public for friends. The paper focuses on the negative (SNS jealousy) and positive (SNS relationship happiness) consequences of SNS use for romantic relationships. We examined whether relationship satisfaction, trait jealousy, SNS use and need for popularity predicted these emotional consequences of SNS use and tested the moderating role of self-esteem. For low self-esteem individuals, need for popularity predicted jealousy and relationship happiness. For high-self-esteem individuals, SNS use for grooming was the main predictor. Low-self-esteem individuals try to compensate their low self-esteem by creating an idealized picture. Undesirable information threatens this picture, and especially individuals with a high need for popularity react with SNS jealousy.

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

networks
interpersonal
psychological factors


Nonlinear data projection on non-Euclidean manifolds with controlled trade-off between trustworthiness and continuity This paper presents a framework for nonlinear dimensionality reduction methods aimed at projecting data on a non-Euclidean manifold, when their structure is too complex to be embedded in an Euclidean space. The methodology proposes an optimization procedure on manifolds to minimize a pairwise distance criterion that implements a control of the trade-off between trustworthiness and continuity, two criteria that, respectively, represent the risks of flattening and tearing the projection. The methodology is presented as general as possible and is illustrated in the specific case of the sphere.

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


Quantum computation for action selection using reinforcement learning This paper proposes a novel action selection method based on quantum computation and reinforcement learning (RL). Inspired by the advantages of quantum computation, the state/action in a RL system is represented with quantum superposition state. The probability of action eigenvalue is denoted by probability amplitude, which is updated according to rewards. And the action selection is carried out by observing quantum state according to collapse postulate of quantum measurement. The results of simulated experiments show that quantum computation can be effectively used to action selection and decision making through speeding up learning. This method also makes a good tradeoff between exploration and exploitation for RL using probability characteristics of quantum theory.

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

quantum computation
action selection
reinforcement learning


principal agent theory and its application to analyze outsourcing of software development Much has been written on process models, project management or tool support to increase the return on investment in software through higher quality of the development process and the resulting software or system. Yet, we lack understanding in the underlying economic principles; e.g., an external firm paid to develop software for someone else tries to maximize their own profit instead of the contractor's. These divergences of interests result in projects that consume more time and money and meet fewer requirements than expected. In this paper, we try to fill the gap by providing an insight into the theory and presenting applicable suggestions how to diminish or avoid the problems that arise when selecting the 'best' contractor and during the project. Basic advises on the formulation of contracts can be derived.

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


Saccular Projections in the Human Cerebral Cortex Abstract: The cerebral cortical areas processing saccular information were investigated in human subjects using the fMRI method and loud clicks, which selectively activate the saccule. The results were compared with previous vestibular evoked potential (VEP) studies in anesthetized patients following vestibular nerve stimulation. Nine normal subjects participated in fMRI studies. By comparing the cortical areas activated by a click at 85 dB (auditory activation) with those activated by 102 dB (auditory plus saccular activation), the following cortical areas were selectively activated by saccular stimulation: intraparietal sulcus, frontal eye fields, prefrontal cortex, and postcentral gyrus, in addition to insula, supplementary motor area, and anterior and posterior cingulate cortex. Previous VEP studies also revealed similar activation areas by vestibular nerve stimulation with latencies at 6 ms, suggesting that the shortest pathways for activation of cerebral cortical neurons from the labyrinth are trisynaptic, with a relay in the thalamus. The activated areas are also consistent with results in previous studies using caloric stimulation, which primarily activates horizontal semicircular canals. These results suggest that canal and otolith information is processed largely by similar cortical areas in humans. Multiple cortical areas activated by these studies suggest that these areas are involved in different aspects of processing vestibular information. The saccular projections to the prefrontal and frontal cortex suggest that these areas are involved in planning motor synergies to counteract loss of equilibrium.

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


State-Density Functions over DBM Domains in the Analysis of Non-Markovian Models Quantitative evaluation of models with generally distributed transitions requires the analysis of non-Markovian processes that may be not isomorphic to their underlying untimed models and may include any number of concurrent nonexponential timers. The analysis of stochastic Time Petri Nets (sTPNs) copes with the problem by covering the state space with stochastic classes, which extend the theory of Difference Bounds Matrix (DBM) with a state probability density function. As a core step, the analysis process requires symbolic manipulation of density functions supported over DBM domains. We characterize and engineer the critical steps of this derivation. We first show that the state-density function accepts a continuous piecewise representation over a partition in DBM-shaped subdomains. We then develop a closed-form symbolic calculus of state-density functions under the assumption that transitions in the sTPN model have expolynomial distributions over possibly bounded intervals. The calculus shows that within each subdomain, the state-density function is a multivariate expolynomial function, and it makes explicit the way in which this form evolves and grows in complexity as the state accumulates memory through subsequent transitions. This enables an efficient implementation of the analysis process and provides the formal basis that supports the introduction of an imprecise analysis based on the approximation of state-density functions through Bernstein Polynomials. The approximation attacks practical and theoretical limits in the applicability of stochastic state classes and devises a new approach to the analysis of non-Markovian models, relying on approximations in the state space rather than in the structure of the model.

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

quantitative evaluation
stochastic time petri nets
difference bounds matrix
bernstein polynomials

correctness verification
performance and dependability
dense-time state-space analysis
markov renewal theory
approximate state-space representation
density function approximation


Reanalysis and sensitivity reanalysis by combined approximations One of the main obstacles in the solution of structural optimization problems is the need to repeat solutions of the analysis and sensitivity analysis equations. In large-scale structures, having complex analysis models, the computational effort may become prohibitive. To alleviate this difficulty a general approach for repeated analysis and repeated sensitivity analysis, called combined approximations, was developed during the last 15 years. The solution is based on the integration of several algorithms and methods. As a result, accurate results can be achieved efficiently. In previous studies, solution procedures for various particular problems were developed. This article summarizes the various formulations and solution procedures for reanalysis and sensitivity reanalysis of linear, nonlinear, static and dynamic systems. It is shown that the various solution procedures are based on applications of similar basic algorithms. Numerical examples demonstrate the efficiency of the calculations and the accuracy of the results.

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

approximate reanalysis
combined approximations (ca)
efficient reanalysis


Making on-line logistics training sustainable through e-learning The purpose of this study is to investigate the possibility of using an online logistics certification learning environment as a training tool to equip future logisticians with required logistics skills. This study incorporates an online logistics certification website that was constructed for college students to familiarize themselves with the certification. In addition, this study also performed comparison tests on students before and after their interaction with the web-based learning environment system to ascertain the systems effectiveness. Our findings suggest that such a system might motivate students to familiarize themselves with logistics-related certification information and can enhance students professional capabilities. In addition, the web-based learning environment might possibly motivate students to join logistics related industries in the future.

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

e-learning self-learning capability motivation


Panorama Weaving: Fast and Flexible Seam Processing A fundamental step in stitching several pictures to form a larger mosaic is the computation of boundary seams that minimize the visual artifacts in the transition between images. Current seam computation algorithms use optimization methods that may be slow, sequential, memory intensive, and prone to finding suboptimal solutions related to local minima of the chosen energy function. Moreover, even when these techniques perform well, their solution may not be perceptually ideal (or even good). Such an inflexible approach does not allow the possibility of user-based improvement. This paper introduces the Panorama Weaving technique for seam creation and editing in an image mosaic. First, Panorama Weaving provides a procedure to create boundaries for panoramas that is fast, has low memory requirements and is easy to parallelize. This technique often produces seams with lower energy than the competing global technique. Second, it provides the first interactive technique for the exploration of the seam solution space. This powerful editing capability allows the user to automatically extract energy minimizing seams given a sparse set of constraints. With a variety of empirical results, we show how Panorama Weaving allows the computation and editing of a wide range of digital panoramas including unstructured configurations.

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

panorama editing
panorama seams
interactive image boundaries


mining service abstractions (nier track) Several lines of research rely on the concept of service abstractions to enable the organization, the composition and the adaptation of services. However, what is still missing, is a systematic approach for extracting service abstractions out of the vast amount of services that are available all over the Web. To deal with this issue, we propose an approach for mining service abstractions, based on an agglomerative clustering algorithm. Our experimental findings suggest that the approach is promising and can serve as a basis for future research.

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


Average-voice-based speech synthesis using HSMM-based speaker adaptation and adaptive training In speaker adaptation for speech synthesis, it is desirable to convert both voice characteristics and prosodic features such as F0 and phone duration. For simultaneous adaptation of spectrum, F0 and phone duration within the HMM framework, we need to transform not only the state output distributions corresponding to spectrum and F0 but also the duration distributions corresponding to phone duration. However, it is not straightforward to adapt the state duration because the original HMM does not have explicit duration distributions. Therefore, we utilize the framework of the hidden semi-Markov model (HSMM), which is an HMM having explicit state duration distributions, and we apply an HSMM-based model adaptation algorithm to simultaneously transform both the state output and state duration distributions. Furthermore, we propose an HSMM-based adaptive training algorithm to simultaneously normalize the state output and state duration distributions of the average voice model. We incorporate these techniques into our HSMM-based speech synthesis system, and show their effectiveness from the results of subjective and objective evaluation tests.

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

maximum likelihood linear regression (mllr)


A two-parameter continuation algorithm for vortex pinning in rotating BoseEinstein condensates We describe an efficient two-parameter continuation algorithm combined with spectral collocation methods for computing the ground state and central vortex state solutions of rotating BoseEinstein condensates in optical lattices, where the first kind and second kind Chebyshev polynomials are used as the basis functions for the trial function space. By treating the chemical potential and angular velocity as the continuation parameters simultaneously under the additional constraint of normalization condition, the proposed algorithm can effectively compute numerical solutions for a rich variety of physical phenomena observed in physical experiments with very little cost. Comparisons with various numerical methods on some sample test problems are reported.

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

grosspitaevskii equation
ground state solution


Complexity and endogeneity in economic modeling Purpose - The concepts of complexity, endogeneity and circular causation - Myrdal's term was cumulative causation - are shown to be interrelated ones in configuring an economic model in the framework of systemic embedding and its empirical application. Design/methodology/approach - The ensuing framework of economic modeling with complexity provides a controllable and predictable overarching worldview. Anomie in the economic universe and its embedded world-system are analytically rejected. This consequence is due to the epistemic nature of modeling that combines complexity, endogeneity, and circular causation for attaining predictability and controllability, even in the face of complex systemic perturbations. The epistemology of unity of knowledge contrasted with rationalism is treated as the foundational worldview. An illustrative empirical work is given to convey the conceptual model and its applied viability. Findings - Both the theoretical and empirical results point out how the induced effects of knowledge flows in reference to the epistemology of unity of knowledge continuously improves the complementary relationships of the evolutionary learning fields, and rejects marginalism as being logically non-sequiter in such epistemic systems. Research limitations/implications - More variables and data would increase the explanation of the continuous simulation in the evolutionary learning world-system model. Practical implications - More data would increase the versatility of the empirical exercise. Social implications - The study is based on the idea of social and economic interface in extending the scope of economic modeling. Originality/value - The paper is very original in the area of heterodox economics that questions orthodox economic postulates and presents the complex methodology by circular causation method instead.

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

causality consciousness cybernetics creativity modelling


DYFRAM: dynamic fragmentation and replica management in distributed database systems In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach.

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

distributed dbms
physical database design


The anatomy of decision support during inpatient care provider order entry (CPOE): Empirical observations from a decade of CPOE experience at Vanderbilt The authors describe a pragmatic approach to the introduction of clinical decision support at the point of care, based on a decade of experience in developing and evolving Vanderbilts inpatient WizOrder care provider order entry (CPOE) system. The inpatient care setting provides a unique opportunity to interject CPOE-based decision support features that restructure clinical workflows, deliver focused relevant educational materials, and influence how care is delivered to patients. From their empirical observations, the authors have developed a generic model for decision support within inpatient CPOE systems. They believe that the models utility extends beyond Vanderbilt, because it is based on characteristics of end-user workflows and on decision support considerations that are common to a variety of inpatient settings and CPOE systems. The specific approach to implementing a given clinical decision support feature within a CPOE system should involve evaluation along three axes: what type of intervention to create (for which the authors describe 4 general categories); when to introduce the intervention into the users workflow (for which the authors present 7 categories), and how disruptive, during use of the system, the intervention might be to end-users workflows (for which the authors describe 6 categories). Framing decision support in this manner may help both developers and clinical end-users plan future alterations to their systems when needs for new decision support features arise.

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


The method of approximate fundamental solutions for axisymmetric problems with Laplace operator The paper presents a new numerical technique for solving axisymmetric problems with Laplace operator. It is similar to the method of fundamental solutions but it is based on the use of special basis functions which satisfy the majority of the boundary conditions of the problem considered. This reduces the number of unknowns and the size of the collocation matrix considerably. As it is shown in the paper, this technique can also be applied successfully in the cases when the solution domain has infinite boundaries in z z or r r directions. Numerical examples justifying the method are presented.

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

axisymmetric problems
fundamental solutions


Bayesian ordinal and binary regression models with a parametric family of mixture links An ordinal and binary regression model with parametric link is introduced. The link is a member of a one-parameter family of mixture links, a family that comprises smooth mixtures of the extreme minimum-value, extreme maximum-value, and logistic distributions. A Bayesian version of this flexible model serves as a vehicle for introducing a priori information regarding the choice of link. Owing to non-conjugacy, posterior and predictive distributions are approximated using Markov chain Monte Carlo simulation methods. Link-independent, Bayesian interpretations of covariate effects are described. The method is illustrated through the analyses of several data sets.

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

categorical data
cumulative link model
ld50
logistic regression
mixture distribution
metropolishastings algorithm
ordinal data
predictive posterior distribution
tolerance distribution


A

generic

implementation

of

replica

exchange

with

solute

tempering

algorithm

in

NAMD

for

complex

biophysical

simulations

Replica

Exchange

with

Solute

Tempering

is

a

powerful

sampling

enhancement

algorithm

of

molecular

dynamics

(MD)

in

that

it

needs

significantly

smaller

number

of

replicas

but

achieves

higher

sampling

efficiency

relative

to

standard

temperature

exchange

algorithm.

In

this

paper,

we

extend

the

applicability

of

for

quantitative

biophysical

simulations

through

a

robust

and

generic

implementation

in

greatly

scalable

MD

software

NAMD.

The

rescaling

procedure

of

force

field

parameters

controlling

hot

region

is

implemented

into

NAMD

at

the

source

code

level.

A

user

can

conveniently

select

hot

region

through

VMD

and

write

the

selection

information

into

a

PDB

file.

The

rescaling

keyword/parameter

is

written

in

NAMD

Tcl

script

interface

that

enables

an

on-the-fly

simulation

parameter

change.

Our

implementation

of

is

within

communication-enabled

Tcl

script

built

on

top

of

Charm++,

thus

communication

overhead

of

an

exchange

attempt

is

vanishingly

small.

Such

a

generic

implementation

facilitates

seamless

cooperation

between

and

other

modules

of

NAMD

to

provide

enhanced

sampling

for

complex

biomolecular

simulations.

Three

challenging

applications

including

native

simulation

for

peptide

foldingunfolding

transition,

free

energy

for

absolute

binding

affinity

of

proteinligand

complex

and

umbrella

Hamiltonian

exchange

for

free

energy

landscape

calculation

were

carried

out

on

IBM

Blue

Gene/Q

supercomputer

to

demonstrate

efficacy

of

based

on

the

present

implementation.

Program

title:

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C/C++,

Computer:

Not

computer

specific.

Operating

system:

Any.

Has

the

code

been

vectorized

or

parallelized?:

Yes,

MPI

and/or

PAMI

parallelized

depending

on

machine

system

software;

cores

used

on

IBM

Blue

Gene/Q

Classification:

External

routines:

NAMD

Nature

of

problem:

A

generic

implementation

providing

user-friendly

API

including

input

file

preparation

and

performing

replica

exchange,

and

high

frequency

exchange

attempt

frequency

with

minimal

communication

overhead.

Solution

method:

The

rescaling

procedure

of

force

field

parameters

controlling

is

implemented

into

NAMD

at

the

source

code

level.

A

user

can

conveniently

select

hot

region

through

VMD

and

write

the

selection

information

into

a

PDB

file.

The

rescaling

keyword/parameter

is

written

in

NAMD

Tcl

script

interface

that

enables

an

on-the-fly

simulation

parameter

change.

The

implementation

of

is

within

communication-enabled

Tcl

script

built

on

top

of

Charm++,

thus

communication

overhead

of

an

exchange

attempt

is

vanishingly

small.

Running

time:

min

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


Physically-based modeling, simulation and rendering of fire for computer animation We give an up-to-date survey on techniques and methods for fire simulation in computer graphics. Physically-based method prevails over traditional non-physical methods for realistic visual effect. In this paper, we explore visual simulation of fire-related phenomena in terms of physically modeling, numerical simulation and visual rendering. Firstly, we introduce a physical and chemical coupled mathematical model to explain fire behavior and motion. Several assumptions and constrains are put forward to simplify their implementations in computer graphics. We then give an overview of present methods to solve the most complicated processes in numerical simulation: velocity advection and pressure projection. In addition, comparisons of these methods are also presented respectively. Since fire is a participating medium as well as a visual radiator, we discuss techniques and problems of these issues as well. We conclude by addressing several open challenges and possible future research directions in fire simulation.

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

physically-based simulation
navierstokes equations
chemicalreaction
blackbody radiation
visual adaption


Evaluating the success of an emergency response medical information system STATPack is an information system used to aid in the diagnosis of pathogens in hospitals and state public health laboratories. STATPack is used as a communication and telemedicine diagnosis tool during emergencies. This paper explores the success of this emergency response medical information system (ERMIS) using a well-known framework of information systems success developed by DeLone and McLean. Using an online survey, the entire population of STATPack users evaluated the success of the information system by considering system quality, information quality, system use, intention to use, user satisfaction, individual impact, and organizational impact. The results indicate that the overall quality of this ERMIS (i.e., system quality, information quality, and service quality) has a positive impact on both user satisfaction and intention to use the system. However, given the nature of ERMIS, overall quality does not necessarily predict use of the system. Moreover, the user's satisfaction with the information system positively affected the intention to use the system. User satisfaction, intention to use, and system use had a positive influence on the system's impact on the individual. Finally, the organizational impacts of the system were positively influenced by use of the system and the system's individual impact on the user. The results of the study demonstrate how to evaluate the success of an ERMIS as well as introduce potential changes in how one applies the DeLone and McLean success model in an emergency response medical information system context.

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

clinical laboratory information systems
program evaluation


Easy cases of probabilistic satisfiability The Probabilistic Satisfiability problem (PSAT) can be considered as a probabilistic counterpart of the classical SAT problem. In a PSAT instance, each clause in a CNF formula is assigned a probability of being true; the problem consists in checking the consistency of the assigned probabilities. Actually, PSAT turns out to be computationally much harder than SAT, e.g., it remains difficult for some classes of formulas where SAT can be solved in polynomial time. A column generation approach has been proposed in the literature, where the pricing sub-problem reduces to a Weighted Max-SAT problem on the original formula. Here we consider some easy cases of PSAT, where it is possible to give a compact representation of the set of consistent probability assignments. We follow two different approaches, based on two different representations of CNF formulas. First we consider a representation based on directed hypergraphs. By extending a well-known integer programming formulation of SAT and Max-SAT, we solve the case in which the hypergraph does not contain cycles; a linear time algorithm is provided for this case. Then we consider the co-occurrence graph associated with a formula. We provide a solution method for the case in which the co-occurrence graph is a partial 2-tree, and we show how to extend this result to partial k-trees with k >2.

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

probabilistic satisfiability
cnf formulas
directed hypergraphs


Face description with local binary patterns: Application to face recognition This paper presents a novel and efficient facial image representation based on local binary pattern (LBP) texture features. The face image is divided into several regions from which the LBP feature distributions are extracted and concatenated into an enhanced feature vector to be used as a face descriptor. The performance of the proposed method is assessed in the face recognition problem under different challenges. Other applications and several extensions are also discussed.

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

facial image representation
local binary pattern
texture features

component-based face recognition
face misalignment


Low-complexity adaptive decision-feedback equalization of MIMO channels A new adaptive MIMO channel equalizer is proposed based on adaptive generalized decision-feedback equalization and ordered-successive interference cancellation. The proposed equalizer comprises equal-length subequalizers, enabling any adaptive filtering algorithm to be employed for coefficient updates. A recently proposed computationally efficient recursive least squares algorithm based on dichotomous coordinate descents is utilized to solve the normal equations associated with the adaptation of the new equalizer. Convergence of the proposed algorithm is examined analytically and simulations show that the proposed equalizer is superior to the previously proposed adaptive MIMO channel equalizers by providing both enhanced bit error rate performance and reduced computational complexity. Furthermore, the proposed algorithm exhibits stable numerical behavior and can deliver a trade-off between performance and complexity.

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


Performance of HSR and QPP-based interleavers for turbo coding on power line communication systems In this paper, the performance of different type and length interleavers for turbo codes is analyzed in the context of power line communication systems. This system typically operates in very noisy environments; the noise, in this channel, is a combination of colored, narrow band and impulsive noises; it has also strong amplitude attenuations. The digital modulation frequently employed in power line communication to counteract the channels noise effects is the orthogonal frequency division multiplexing due to its high spectral efficiency and robustness in multipath fading environments; hence, it is also considered in our experimentation. We report the performance of turbo codes with the two types of interleavers: the high-spread random and the based quadratic permutation polynomial. The constituent codes are part of the 3GPP standard. Finally, it is used a punctured matrix in order to achieve a coding rate of 1/2. The performance is evaluated in terms of bit error rate, through the way of simulations.

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

turbo codes
interleavers
punctured matrix


A numerical method for a model of two-phase flow in a coupled free flow and porous media system In this article, we study two-phase fluid flow in coupled free flow and porous media regions. The model consists of coupled CahnHilliard and NavierStokes equations in the free fluid region and the two-phase Darcy law in the porous medium region. We propose a RobinRobin domain decomposition method for the coupled NavierStokes and Darcy system with the generalized BeaversJosephSaffman condition on the interface between the free flow and the porous media regions. Numerical examples are presented to illustrate the effectiveness of this method.

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

porous media
robinrobin domain decomposition


Circular-ELM for the reduced-reference assessment of perceived image quality Providing a satisfactory visual experience is one of the main goals for present-day electronic multimedia devices. All the enabling technologies for storage, transmission, compression, rendering should preserve, and possibly enhance, the quality of the video signal; to do so, quality control mechanisms are required. These mechanisms rely on systems that can assess the visual quality of the incoming signal consistently with human perception. Computational Intelligence (CI) paradigms represent a suitable technology to tackle this challenging problem. The present research introduces an augmented version of the basic Extreme Learning Machine (ELM), the Circular-ELM (C-ELM), which proves effective in addressing the visual quality assessment problem. The C-ELM model derives from the original Circular BackPropagation (CBP) architecture, in which the input vector of a conventional MultiLayer Perceptron (MLP) is augmented by one additional dimension, the circular input; this paper shows that C-ELM can actually benefit from the enhancement provided by the circular input without losing any of the fruitful properties that characterize the basic ELM framework. In the proposed framework, C-ELM handles the actual mapping of visual signals into quality scores, successfully reproducing perceptual mechanisms. Its effectiveness is proved on recognized benchmarks and for four different types of distortions.

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

extreme learning machine
circular backpropagation


Distributed reinforcement learning control for batch sequencing and sizing in Just-In-Time manufacturing systems This paper presents an approach that is suitable for Just-In-Time (JIT) production for multi-objective scheduling problem in dynamically changing shop floor environment. The proposed distributed learning and control (DLC) approach integrates part-driven distributed arrival time control (DATC) and machine-driven distributed reinforcement learning based control. With DATC, part controllers adjust their associated parts' arrival time to minimize due-date deviation. Within the restricted pattern of arrivals, machine controllers are concurrently searching for optimal dispatching policies. The machine control problem is modeled as Semi Markov Decision Process ( SMDP) and solved using Q-learning. The DLC algorithms are evaluated using simulation for two types of manufacturing systems: family scheduling and dynamic batch sizing. Results show that DLC algorithms achieve significant performance improvement over usual dispatching rules in complex real-time shop floor control problems for JIT production.

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

machine learning
just-in-time production


Algorithm for calculating the noncentral chi-square distribution This correspondence presents a new algorithm for evaluating the noncentral chi-square distribution based on Parl's method of Neumann series expansion, It is applicable to both even and odd degrees of freedom, unlike most prior work, which has been directed at the even Eases. Convergence tests and procedures for detection of loss of precision are given. The overall method is extremely simple to program, accurate to many decimal places where applicable, and efficient over a wide range of parameters. The method is reliable provided the proper expansion is chosen based on the parameters.

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


New Hierarchical Architecture for Ubiquitous Wireless Sensing and Access With Improved Coverage Using CWDM-ROF Links A novel hierarchical architecture for hybrid wireless sensor and access networks has been proposed based on cost-effective radio-over-fiber (ROF) links with the coarse wavelength-division-multiplexing (CWDM) technique. Wireless fidelity (WiFi) signals are distributed to the remote radio units transparently over optical fibers in a star-shaped network topology. The wireless access traffic together with the perceiving usage scenarios including video monitoring and temperature sensing has been successfully demonstrated in the hybrid IEEE 802.11 and 802.15.4 networks. The transmission performance of the CWDM-ROF links is evaluated in terms of the error-vector magnitude (EVM) and data throughput for both uplinks and downlinks. The results show that the WiFi signals are successfully delivered through the CWDM-ROF links including a 4.5 km fiber and a 7 m wireless channel with a 3% EVM penalty. This CWDM-ROF technology can expand the application range of wireless sensor networks with the advantages of better capacity, larger coverage area, and lower investment on wired infrastructure.

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

coarse wavelength-division-multiplexing
radio-over-fiber
wireless local area network
wireless sensor network


Bifurcation analysis of an inductorless chaos generator using 1D piecewise smooth map In this work we investigate the dynamics of a one-dimensional piecewise smooth map, which represents the model of a chaos generator circuit. In a particular (symmetric) case analytic results can be given showing that the chaotic region is wide and robust. In the general model only the border collision bifurcation can be analytically determined. However, the dynamics behave in a similar way, leading effectively to robust chaos. (C) 2012 Published by Elsevier B.V. on behalf of IMACS.

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

border-collision
piecewise smooth continuous map


A hierarchical approach for energy-efficient scheduling of large workloads in multicore distributed systems Definition of a novel multi-objective problem for energy-efficient scheduling in distributed data-centers. Design of a hierarchical two-level scheduler that allows dividing the problem into simpler and smaller sub-problems. Evaluation and comparison of 16 different variants of the scheduler on large sets of workflows. Accurate solutions found by the best performing schedulers, achieving important improvements over classical strategies.

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


Collaborative feature-based design via operations with a fine-grain product database This paper reports a collaborative product design framework and a prototype system that Supports multiple CAD systems. The key contribution is an 'operation'-based, multi-application oriented, and near real-time collaboration mechanism which can significantly reduce collaboration communication load over the network. The mechanism is discussed and demonstrated with examples. To support the proposed multi-application collaboration system, a fine-grain feature-oriented product database is used. This research is a continued effort based on a shared common product modeling scheme, which covers fundamental issues of generic feature, feature level interoperability, engineering intent and operation definitions. (C) 2009 Elsevier B.V. All rights reserved.

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

collaborative engineering
feature-based engineering
fine-grain product database


Unified Architecture for Reed-Solomon Decoder Combined With Burst-Error Correction Reed-Solomon (RS) codes are widely used as forward correction codes (FEC) in digital communication and storage systems. Correcting random errors of RS codes have been extensively studied in both academia and industry. However, for burst-error correction, the research is still quite limited due to its ultra high computation complexity. In this brief, starting from a recent theoretical work, a low-complexity reformulated inversionless burst-error correcting (RiBC) algorithm is developed for practical applications. Then, based on the proposed algorithm, a unified VLSI architecture that is capable of correcting burst errors, as well as random errors and erasures, is firstly presented for multi-mode decoding requirements. This new architecture is denoted as unified hybrid decoding (UHD) architecture. It will be shown that, being the first RS decoder owning enhanced burst-error correcting capability, it can achieve significantly improved error correcting capability than traditional hard-decision decoding (HDD) design.

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


Implementation aspects of 3D lattice-BGK: Boundaries, accuracy, and a new fast relaxation method In many realistic fluid-dynamical simulations the specification of the boundary conditions, the error sources, and the number of time steps to reach a steady state are important practical considerations. In this paper we study these issues in the case of the lattice-BGK model. The objective is to present a comprehensive overview of some pitfalls and shortcomings of the lattice-BGK method and to introduce some new ideas useful in practical simulations. We begin with an evaluation of the widely used bounce-back boundary condition in staircase geometries by simulating flow in an inclined tube. It is shown that the bounce-back scheme is first-order accurate in space when the location of the non-slip wall is assumed to be at the boundary nodes. Moreover, for a specific inclination angle of 45 degrees, the scheme is found to be second-order accurate when the location of the non-slip velocity is fitted halfway between the last fluid nodes and the first solid nodes. The error as a function of the relaxation parameter is in that case qualitatively similar to that of flat walls. Next, a comparison of simulations of fluid flow by means of pressure boundaries and by means of body force is presented. A good agreement between these two boundary conditions has been found in the creeping-flow regime. For higher Reynolds numbers differences have been found that are probably caused by problems associated with the pressure boundaries. Furthermore, two widely used 3D models, namely D(3)Q(15) and D(3)Q(19), are analysed. It is shown that the D(3)Q(15) model may induce artificial checkerboard invariants due to the connectivity of the lattice. Finally, a new iterative method, which significantly reduces the saturation time, is presented and validated on different benchmark problems. (C) 1999 Academic Press.

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


Partition refinement of Component Interaction Automata Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchically-structured component-oriented software systems. However, the rules governing composition typically suffer from combinatorial state explosion, an effect that can impede modeling languages, like Component Interaction Automata, from being successful in real-world scenarios. We must, therefore, find some appropriate ways to counteract state explosion, one of which is partition refinement through bisimulation, in particular, weak bisimulation. While this technique can yield the desired state space reduction, it does not consider synchronization cliques, that is, groups of states that are interconnected solely by internal synchronization transitions. Synchronization cliques give rise to action prefixes, local states that encapsulate preconditions for a component's ability to interact with the environment. Furthermore, both the existence and the size of synchronization cliques can be used as an indicator for the success of partition refinement. In particular, the more frequent synchronization cliques are and the more states they entail, the more likely it is that partition refinement can reduce the state space. But, there may be other factors that impact the refinement process. For this reason, we study, in this paper, how partition refinement behaves under weak bisimulation, how synchronization cliques emerge when using weak bisimulation, how we make state space reduction through partition refinement aware of the existence of synchronization cliques, and what other attributes of Component Interaction Automata specifications can provides us with additional cues to forecast the possible outcome of the partition refinement process. (C) 2011 Elsevier B.V. All rights reserved.

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

automata-based specification
emergent properties


An on-line replication strategy to increase availability in Data Grids ? Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, but they typically assume unlimited storage for replicas. In this paper, we address the system-wide data availability problem assuming limited replica storage. We describe two new metrics to evaluate the reliability of the system, and propose an on-line optimizer algorithm that can Minimize the Data Missing Rate (MinDmr) in order to maximize the data availability. Based on MinDmr, we develop four optimizers associated with four different file access prediction functions. Simulation results utilizing the OptorSim show our MinDmr strategies achieve better performance overall than other strategies in terms of the goal of data availability using the two new metrics.

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

data availability
data grid
data missing rate


Power assignment for k-connectivity in wireless ad hoc networks The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the total power is the lowest. In this paper, we present several approximation algorithms for this problem. Specifically, we propose a 3k-approximation algorithm for any k &GE; 3, a ( k + 12H( k))-approximation algorithm for k(2k - 1) &LE; n where n is the network size, a ( k + 2 [( k + 1)/ 2])-approximation algorithm for 2 &LE; k &LE; 7, a 6-approximation algorithm for k = 3, and a 9-approximation algorithm for k = 4.

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

k-connectivity
wireless ad hoc sensor networks


Comparison of ANOVA-F and ANOM tests with regard to type I error rate and test power A Monte Carlo simulation was conducted to compare the type I error rate and test power of the analysis of means (ANOM) test to the one-way analysis of variance F-test (ANOVA-F). Simulation results showed that as long as the homogeneity of the variance assumption was satisfied, regardless of the shape of the distribution, number of group and the combination of observations, both ANOVA-F and ANOM test have displayed similar type I error rates. However, both tests have been negatively affected from the heterogeneity of the variances. This case became more obvious when the variance ratios increased. The test power values of both tests changed with respect to the effect size (), variance ratio and sample size combinations. As long as the variances are homogeneous, ANOVA-F and ANOM test have similar powers except unbalanced cases. Under unbalanced conditions, the ANOVA-F was observed to be powerful than the ANOM-test. On the other hand, an increase in total number of observations caused the power values of ANOVA-F and ANOM test approach to each other. The relations between effect size () and the variance ratios affected the test power, especially when the sample sizes are not equal. As ANOVA-F has become to be superior in some of the experimental conditions being considered, ANOM is superior in the others. However, generally, when the populations with large mean have larger variances as well, ANOM test has been seen to be superior. On the other hand, when the populations with large mean have small variances, generally, ANOVA-F has observed to be superior. The situation became clearer when the number of the groups is 4 or 5.

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

analysis of variance
anom
type i error
test power
simulation


On mining multi-time-interval sequential patterns Sequential pattern mining is essential in many applications, including computational biology, consumer behavior analysis, web log analysis, etc. Although sequential patterns can tell us what items are frequently to be purchased together and in what order, they cannot provide information about the time span between items for decision support. Previous studies dealing with this problem either set time constraints to restrict the patterns discovered or define time-intervals between two successive items to provide time information. Accordingly, the first approach falls short in providing clear time-interval information while the second cannot discover time-interval information between two non-successive items in a sequential pattern. To provide more time-related knowledge, we define a new variant of time-interval sequential patterns, called multi-time-interval sequential patterns, which can reveal the time-intervals between all pairs of items in a pattern. Accordingly, we develop two efficient algorithms, called the MI-Apriori and MI-PrefixSpan algorithms, to solve this problem. The experimental results show that the MI-PrefixSpan algorithm is faster than the MI-Apriori algorithm, but the MI-Apriori algorithm has better scalability in long sequence data.

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

data mining
knowledge discovery
time-interval
multi-time-interval


FPGA implementation of a wavelet neural network with particle swarm optimization learning This paper introduces implementation of a wavelet neural network (WNN) with learning ability on field programmable gate array (FPGA). A learning algorithm using gradient descent method is not easy to implement in an electronic circuit and has local minimum. A more suitable method is the particle swarm optimization (PSO) that is a population-based optimization algorithm. The PSO is similar to the GA, but it has no evolution operators such as crossover and mutation. In the approximation of a nonlinear activation function, we use a Taylor series and a look-up table (LUT) to achieve a more accurate approximation. The results of the two experiments demonstrate the successful hardware implementation of the wavelet neural networks with the PSO algorithm using FPGA. From the results of the experiment, it can be seen that the performance of the PSO is better than that of the simultaneous perturbation algorithm at sufficient particle sizes. (c) 2007 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wavelet neural networks (wnn)
field programmable gate array (fpga)
particle swarm optimization (pso)
prediction
identification


Interface synthesis for heterogeneous multi-core systems from transaction level models This paper presents a tool for automatic synthesis of RTL interfaces for heterogeneous MPSoC from transaction level models (TLMs). The tool captures the communication parameters in the platform and generates interface modules called universal bridges between buses in the design. The design and configuration of the bridges depend on several platform components including heterogeneity of the components, traffic on the bus, size of messages and so on. We define these parameters and show how the synthesizable RTL code for the bridge can be automatically derived based on these parameters. We use industrial strength design drivers such as an MP3 decoder to test our automatically generated bridges for a variety of platforms and compare them to manually designed bridges on different quality metrics. Our experimental results show that performance of automatically generated bridges are within 5% of manual design for simple platforms but surpasses them for more complex platforms. The area and RTL code size is consistently better than manual design while giving 5 orders of improvement in development time.

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

hw-sw co-design
communication synthesis
universal bridge
transaction level model
channel
reliability
experimentation
verification


Efficient implementations of construction heuristics for the rectilinear block packing problem The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container, where a rectilinear block is a polygonal block whose interior angle is either 90 or 270. There exist many applications of this problem, such as VLSI design, timber/glass cutting, and newspaper layout. In this paper, we design efficient implementations of two construction heuristics for rectilinear block packing. The proposed algorithms are tested on a series of instances, which are generated from nine benchmark instances. The computational results show that the proposed algorithms are especially efficient for large instances with repeated shapes.

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

rectilinear blocks
construction heuristics


The effect of finite lattice-size in lattice Boltzmann model In this paper, numerical results on two-dimensional vapor-liquid equilibrium calculated by lattice Boltzmann method have been presented. Artefacts resulted by the finite lattice-size have been reviewed. A set of criteria for minimal lattice-size to avoid lattice artefacts is given.

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


estimating vignetting function from a single image for image authentication Vignetting is the phenomenon of reduced brightness in an image at the peripheral region compared to the central region. As patterns of vignetting are characteristics of lens models, they can be used to authenticate digital images for forensic analysis. In this paper, we describe a new method for model based single image vignetting estimation and correction. We use the statistical properties of natural images in the discrete derivative domains and formulate the vignetting estimation problem as a maximum likelihood estimation. We further provide a simple and efficient procedure for better initialization of the numerical optimization. Empirical evaluations of the proposed method using synthesized and real vignetted images show significant gain in both performance and running efficiency in correcting vignetting from digital images, and the estimated vignetting functions are shown to be effective in classifying different lens models.

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

vignetting function estimation
camera identification


Effective utility mining with the measure of average utility Frequent-itemset mining only considers the frequency of occurrence of the items but does not reflect any other factors, such as price or profit. Utility mining is an extension of frequent-itemset mining, considering cost, profit or other measures from user preference. Traditionally, the utility of an itemset is the summation of the utilities of the itemset in all the transactions regardless of its length. The average utility measure is thus adopted in this paper to reveal a better utility effect of combining several items than the original utility measure. It is defined as the total utility of an itemset divided by its number of items within it. The average-utility itemsets, as well as the original utility itemsets, does not have the "downward-closure" property. A mining algorithm is then proposed to efficiently find the high average-utility itemsets. It uses the summation of the maximal utility among the items in each transaction with the target itemset as the upper bound to overestimate the actual average utilities of the itemset and processes it in two phases. As expected, the mined high average-utility itemsets in the proposed way will be fewer than the high utility itemsets under the same threshold. The proposed approach can thus be executed under a larger threshold than the original, thus with a more significant and relevant criterion. Experimental results also show the performance of the proposed algorithm. (C) 2011 Elsevier Ltd. All rights reserved.

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


Surgical Workflow Management Schemata for Cataract Procedures Process Model-based Design and Validation of Workflow Schemata Objective: Workflow guidance of surgical activities is a challenging task. Because of variations in patient properties and applied surgical techniques, surgical processes have a high variability. The objective of this study was the design and implementation of a surgical workflow management system (SWFMS) that can provide a robust guidance for surgical activities. We investigated how many surgical process models are needed to develop a SWFMS that can guide cataract surgeries robustly. Methods: We used 100 cases of cataract surgeries and acquired patient-individual surgical process models (iSPMs) from them. Of these, randomized subsets iSPMs were selected as learning sets to create a generic surgical process model (gSPM). These gSPMs were mapped onto workflow nets as workflow schemata to define the behavior of the SWFMS. Finally, 10 iSPMs from the disjoint set were simulated to validate the workflow schema for the surgical processes. The measurement was the successful guidance of an iSPM. Results: We demonstrated that a SWFMS with a workflow schema that was generated from a subset of 10 iSPMs is sufficient to guide approximately 65% of all surgical processes in the total set, and that a subset of 50 iSPMs is sufficient to guide approx. 80% of all processes. Conclusion: We designed a SWFMS that is able to guide surgical activities on a detailed level. The study demonstrated that the high inter-patient variability of surgical processes can be considered by our approach.

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

operative surgical procedures
computer-assisted decision making
computer-assisted surgery


TEMSPOL: a MATLAB thermal model for deep subduction zones including major phase transformations ? TEMSPOL is an open MATLAB code suitable for calculating temperature and lateral anomaly of density distributions in deep subduction zones, taking into account the olivine to spinel phase transformation in a self-consistent manner. The code solves, by means of a finite difference scheme, the heat transfer equation including adiabatic heating, radioactive heat generation, latent heat associated with phase changes and frictional heating. We show, with a few simulations, that TEMSPOL can be a useful tool for researchers studying seismic velocity, stress and seismicity distribution in deep subduction zones. Deep earthquakes in subducting slabs are thought to be caused by shear instabilities associated with the olivine to spinel phase transition in metastable olivine wedges. We investigate the kinematic and thermal conditions of the subducting plate that lead to the formation of metastable olivine wedges. Moreover, TEMSPOL calculates lateral anomalies of density within subducting slabs, which can be used to evaluate buoyancy forces that determine the dynamics of subduction and the stress distribution within the slab. We use TEMSPOL to evaluate the effects of heat sources such as shear heating and latent heat release, which are neglected in commonly used thermal models of subduction. We show that neglecting these heat sources can lead to significant overestimation of the depth reached by the metastable olivine wedge.

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


Online Social Advertising via Influential Endorsers In recent years, many Web-based services such as Facebook and MySpace have been making great progress and creating new opportunities. Because online advertising is the main business model for social networking sites, in this paper we propose a social endorser-based advertising system formulated on network influence and user preference analyses. By utilizing the social network and user preference analysis techniques, the theories of dynamic social influence and celebrity endorsement are realized in the proposed advertising approach. Experiments show that our mechanism significantly improves advertising effectiveness and efficiency and outperforms other advertising approaches.

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

endorser advertising
ewom
influence model
word of mouth


Similarity measures between type-2 fuzzy sets In this paper, we give similarity measures between type-2 fuzzy sets and provide the axiom definition and properties of these measures. For practical use, we show how to compute the similarities between Gaussian type-2 fuzzy sets. Yang and Shih's [22] algorithm, a clustering method based on fuzzy relations by beginning with a similarity matrix, is applied to these Gaussian type-2 fuzzy sets by beginning with these similarities. The clustering results are reasonable consisting of a hierarchical tree according to different levels.

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

gaussian type-2 fuzzy sets
hausdorff distance
similarity measure
type-2 fuzzy sets


A mechanization of unity in PC-NQTHM-92 This paper presents in detail how the Unity logic for reasoning about concurrent programs was formalized within the mechanized theorem prover PC-NQTHM-92. Most of Unity's proof rules were formalized in the unquantified logic of NQTHM, and the proof system has been used to mechanically verify several concurrent programs. The mechanized proof system is sound by construction, since Unity's proof rules were proved about an operational semantics of concurrency, also presented here. Skolem functions are used instead of quantifiers, and the paper describes how proof rules containing Skolem function are used instead of Unity's quantified proof rules when verifying concurrent programs. This formalization includes several natural extensions to Unity, including nondeterministic statements. The paper concludes with a discussion of the cost and value of mechanization.

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


reconciling while tolerating disagreement in collaborative data sharing In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty, uncertain, or even controversial. Collaborators are willing to share their data, and in many cases they also want to selectively import data from others --- but must occasionally diverge when they disagree about uncertain or controversial facts or values. For this reason, traditional data sharing and data integration approaches are not applicable, since they require a globally consistent data instance. Additionally, many of these approaches do not allow participants to make updates; if they do, concurrency control algorithms or inconsistency repair techniques must be used to ensure a consistent view of the data for all users.In this paper, we develop and present a fully decentralized model of collaborative data sharing , in which participants publish their data on an ad hoc basis and simultaneously reconcile updates with those published by others. Individual updates are associated with provenance information, and each participant accepts only updates with a sufficient authority ranking, meaning that each participant may have a different (though conceptually overlapping) data instance. We define a consistency semantics for database instances under this model of disagreement, present algorithms that perform reconciliation for distributed clusters of participants, and demonstrate their ability to handle typical update and conflict loads in settings involving the sharing of curated data.

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

updates communities conflict paper model participant sharing values data demonstrate publish consistency distributed database reconciliation ranking global

association
transactions
informal
data sharing
collaboration
author
peer-to-peer
users
semantic
mean
proven
algorithm
collaborative data sharing
decentralization
data integration
ad-hoc
cluster


Application of evolutionary strategies for 3D graphical model categorization and retrieval In multimedia information processing, while the previous focus was on image/video retrieval, content-based categorization and retrieval of 3D computer graphics model is becoming increasingly important. This is due to the increased adoption of 3D graphics representations in multimedia applications and the resulting need for rapid virtual scene assembly from a repository of 3D models. Motivated by these requirements, the main focus of this paper is on the content-based classification and retrieval of 3D computer graphics models based on a histogram feature representation, and the search for an adaptive transformation of this representation such that the resulting classification and retrieval accuracies are optimized. Observing that a histogram is basically an approximation of the probability density function of an underlying random variable, and that a suitable transformation, when applied to the random variable, will allow the classifier to attain better accuracy based on this new representation, we propose an evolutionary optimization approach to search for this set of optimal transformations due to the large size of the search space. In particular, we consider the special class of transformations that take the form of a piecewise continuous mapping. In this case, the transformed variable is a mixed random variable, with both discrete and continuous components, which provides added flexibility for modeling a number of more diverse random variable types. With a suitably defined fitness function for evolutionary strategies (ES) that measures the capability of the transformed histogram representation to induce the correct class structure, our proposed approach is capable of improving the head model classification performance, which in turn allows, in the case of content-based retrieval, the correct preassignment of a query object to its correct class for more efficient search, even in those cases where the query is ambiguous and difficult to characterize.

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

pattern classification
3d head model
evolutionary computation
multiple classifier system