Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue This paper addresses the problem of scheduling a Markovian multiclass queue with a finite dedicated buffer for each class, where class-dependent linear holding and rejection cost rates model differing levels of tolerance to delay and loss. The goal is to design well-grounded and tractable scheduling policies that nearly minimize expected total discounted or long-run average cost. New dynamic index policies are introduced, awarding higher priority to classes with larger index values, where a class' index measures the marginal productivity of work at its current state. The results are obtained by deploying the work-cost analysis approach to marginal productivity indices (MPIs) for restless bandits developed by the author, which is extended to the bias criterion. The MPI furnishes new insights: for a loss-sensitive class, it is a decreasing function of the number of empty buffer spaces, independent of the buffer size; for a delay-sensitive class, it is a decreasing function of the queue length. Such opposite orderings show that preventive work is more valuable than reactive work for the latter classes, whereas the opposite holds for the former. The results of a computational study on two-class instances are reported, shedding light on how the MPI policy's relative performance varies with each parameter. Parameter ranges are thus identified where the MPI policy is near optimal, and substantially outperforms conventional benchmark policies.

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

multiclass queue
scheduling
restless bandits
index policies

multi-queue switch
finite buffers
delay-sensitive
loss-sensitive
conservation laws
work-cost analysis
bias optimality


Modelling a counter-diffusive reactor for methane combustion The counter diffusive reactor containing a catalyst supported on a fibre pad is often used as a radiant heater. Fuel fed from the inlet of the pad is combusted by oxygen diffusing from the reactor exit. This paper describes the development of a two dimensional model of this heater with methane as the fuel. The detailed transport equations are solved using the finite element method. The correct implementation of the boundary conditions is emphasized. The effects of external mass transfer, reaction rate and feed flow rate on the reactor performance are studied. Comparisons are made to experimental results obtained in an earlier investigation. It is shown that the primary limiting step that controls the conversion of fuel is the rate of mass transfer of oxygen through the boundary layer that develops in front of the reactor. Combustion efficiencies approaching 100% can be achieved at sufficiently high rates of reaction. (c) 2011 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Feedback in the Non-Asymptotic Regime Without feedback, the backoff from capacity due to non-asymptotic blocklength can be quite substantial for blocklengths and error probabilities of interest in many practical applications. In this paper, novel achievability bounds are used to demonstrate that in the non-asymptotic regime, the maximal achievable rate improves dramatically thanks to variable-length coding and feedback. For example, for the binary symmetric channel with capacity 1/2 the blocklength required to achieve 90% of the capacity is smaller than 200, compared to at least 3100 for the best fixed-blocklength code (even with noiseless feedback). Virtually all the advantages of noiseless feedback are shown to be achievable, even if the feedback link is used only to send a single signal informing the encoder to terminate the transmission (stop-feedback). It is demonstrated that the non-asymptotic behavior of the fundamental limit depends crucially on the particular model chosen for the "end-of-packet" control signal. Fixed-blocklength codes and related questions concerning communicating with a guaranteed delay are discussed, in which situation feedback is demonstrated to be almost useless even non-asymptotically.

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

channel capacity
converse bounds
memoryless channels
non-asymptotic analysis
shannon theory
stop-feedback


Improving computational trust representation based on Internet auction traces ? Computational trust representations are used by Trust Management (TM) systems to elicit information from users about the behavior of others. In most practically used TM systems, simple computational trust representations dominate, such as the three-valued discrete scale of negative, neutral and positive used in reputation systems of Internet auctions. This paper asks the question: what is the appropriate system for computational representation of human trust? In order to find an answer, we study a large trace of feedbacks and textual comments from a reputation system of an Internet auction. We discover that users systematically try to add information in the textual comments. Text-mining and NLP approaches reveal a taxonomy of non-positive feedbacks and an importance order on the categories of non-positive behavior. This importance order is further supported by survey data. Based on these observations, we propose and evaluate a complete, new computational trust representation system inspired by the work of Yager. This system is complemented by operators that can be used to produce rankings of most trusted agents. The operator used to create rankings selects Pareto-optimal agents with respect to the multiple criteria revealed by our trace analysis. The proposed system takes into account all criteria utilized by auction users to evaluate behavior, and the relative importance of these criteria. The proposed system is compared to the Detailed Seller Rating system introduced by eBay.

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

trust management
reputation system
taxonomy
detailed seller rating

text mining
natural language processing
sentiment analysis
classification
reference point methodology


architecture and preliminary experimental results for emotionally grounded symbol acquisition In this paper, we propose a novel concept, Emotionally Grounded Symbol Acquisition, which is an extended idea of well- studied concept, Physically Grounded Symbol Acquisition. We think it is important for an autonomous robot to ground symbols not only on the physical world but also on its emotions. Based on this concept, we propose an Emotionally Grounded Architecture for behavior control, which enables an autonomous robot such as pet- type robot to respond properly to external stimuli based on its own emotional evaluation.

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

language acquisition
autonomous robots
emotion
ethological model
agent architecture


Justification logics and hybrid logics Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since justification logics are newer and less well known than hybrid logics, we sketch their background, and give pointers to their range of applicability. We conclude with suggestions for future research. Indeed, the main goal of this paper is to encourage others to continue the investigation begun here. (C) 2010 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hybrid logic
justification logic
logic of proofs
nominals


Numerical experiments of some Krylov subspace methods for black oil model This paper discusses preconditioned Krylov subspace methods for solving large scale linear systems that originate from oil reservoir numerical simulations. Two types of preconditioners, one being based on an incomplete LU decomposition and the other being based on iterative algorithms, are used together in a combination strategy in order to achieve an adaptive and efficient preconditioner. Numerical tests show that different Krylov subspace methods combining with appropriate preconditioners are able to achieve optimal performance. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

krylov subspace methods
black oil model
preconditioner

large scale linear system
effective linear solver


Safe Nondeterminism in a Deterministic-by-Default Parallel Language A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound search, remains an open question. We present a language together with a type and effect system that supports nondeterministic computations with a deterministic-by-default guarantee: nondeterminism must be explicitly requested via special parallel constructs (marked nd), and any deterministic construct that does not execute any nd construct has deterministic input-output behavior. Moreover, deterministic parallel constructs are always equivalent to a sequential composition of their constituent tasks, even if they enclose, or are enclosed by, nd constructs. Finally, in the execution of nd constructs, interference may occur only between pairs of accesses guarded by atomic statements, so there are no data races, either between atomic statements and unguarded accesses (strong isolation) or between pairs of unguarded accesses (stronger than strong isolation alone). We enforce the guarantees at compile time with modular checking using novel extensions to a previously described effect system. Our effect system extensions also enable the compiler to remove unnecessary transactional synchronization. We provide a static semantics, dynamic semantics, and a complete proof of soundness for the language, both with and without the barrier removal feature. An experimental evaluation shows that our language can achieve good scalability for realistic parallel algorithms, and that the barrier removal techniques provide significant performance gains.

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


Heuristics for Robust Resource Allocation of Satellite Weather Data Processing on a Heterogeneous Parallel System This work considers the satellite data processing portion of a space-based weather monitoring system. It uses a heterogeneous distributed processing platform. There is uncertainty in the arrival time of new data sets to be processed, and resource allocation must be robust with respect to this uncertainty. The tasks to be executed by the platform are classified into two broad categories: high priority (e.g., telemetry, tracking, and control), and revenue generating (e. g., data processing and data research). In this environment, the resource allocation of the high-priority tasks must be done before the resource allocation of the revenue generating tasks. A two-part allocation scheme is presented in this research. The goal of first part is to find a resource allocation that minimizes makespan of the high-priority tasks. The robustness for the first part of the mapping is defined as the difference between this time and the expected arrival of the next data set. For the second part, the robustness of the mapping is the difference between the expected arrival time and the time at which the revenue earned is equal to the operating cost. Thus, the heuristics for the second part find a mapping that minimizes the time for the revenue (gained by completing revenue generating tasks) to be equal to the cost. Different resource allocation heuristics are designed and evaluated using simulations, and their performance is compared to a mathematical bound.

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

heterogeneous computing
satellite system
two-part resource allocation


Books Versus triangles A book of size b in a graph is an edge that lies in b triangles. Consider a graph G with n vertices and ?n2/4?; + 1 edges. Rademacher proved that G contains at least ?n/2?; triangles, and several authors proved that G contains a book of size at least n/6. We prove the following linear combination of these two results. Suppose that and the maximum size of a book in G is less than ?n/2. Then G contains at least

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


Wave propagation and localisation in a softening two-phase medium Within the framework of the generalised theory of heterogeneous media, the complete set of equations is derived for a three-dimensional fluid-saturated porous medium. Subsequently, stability and dispersion analyses are carried out for an infinite one-dimensional continuum that has been deforming homogeneously prior to the application of the perturbation. For common values of the stiffness, the porosity and the mass densities, the two-phase medium is found to remain stable when the solid is elastic. When an elastoplastic or an elasticity-based damage model is adopted for the solid constituent, loss of stability occurs at the peak in the uniaxial stressstrain relation for the solid constituent, which is identical to a single-phase medium. From the dispersion analysis it appears that a dispersive wave is obtained, but that the internal length scale associated with it vanishes in the short wavelength limit, at least for the assumptions made regarding the constitutive behaviour of the solid and of the fluid. This result leads to the conclusion that, upon the introduction of softening, localisation in a zero width will occur and no regularisation will be present. This conclusion is corroborated by the results of numerical analyses of wave propagation in a finite one-dimensional bar.

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

wave propagation
softening
localisation
stability
dispersion
internal length scale
porous medium


Finding consensus and optimal alignment of circular strings Circular strings are different from linear strings in that the last symbol is considered to precede the first symbol. Even though circular strings are biologically important, only a few efforts have been made to solve computational problems on circular strings. In this paper, we introduce consensus problems for circular strings of length n and present the first non-trivial algorithms to find a consensus and an optimal alignment for circular strings by the Hamming distance. They are O(n(2) log n)-time algorithms for three circular strings and an O(n(3) log n)-time algorithm for four circular strings. Our algorithms are O(n/ log n) times faster than the naive algorithms directly using the solutions for the linear consensus problems, which take O(n(3)) time for three circular strings and O(n(4)) time for four circular strings. This speedup was achieved by reducing the problems into correlations and by formulating and solving systems of linear equations. Moreover, our algorithms use only O(n) space. (C) 2012 Elsevier B.V. All rights reserved.

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


Occurrences of palindromes in characteristic Sturmian words This paper is concerned with palindromes occurring in characteristic Sturmian words c(alpha) of slope alpha, where alpha epsilon (0, 1) is an irrational. As c,, is a uniformly recurrent infinite word, any (palindromic) factor of c, occurs infinitely many times in c(alpha), with bounded gaps. Our aim is to completely describe where palindromes occur in c(alpha), In particular, given any palindromic factor u of c(alpha), we shall establish a decomposition of c(alpha), with respect to the occurrences of u. Such a decomposition shows precisely where u occurs in c(alpha), and this is directly related to the continued fraction expansion of a. (c) 2005 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 O O O O O O O

combinatorics on words
characteristic sturmian word
singular word
palindrome
morphism
return word
overlap


Evolutionary algorithms plus domain knowledge equals Real-world evolutionary computation We discuss implicit and explicit knowledge representation mechanisms for evolutionary algorithms (EAs). We also describe offline and online metabeuristics as examples of explicit methods to leverage this knowledge. We illustrate the benefits of this approach with four real-world applications. The first application is automated insurance underwriting-a discrete classification problem, which requires a careful tradeoff between the percentage of insurance applications handled by the classifier and its classification accuracy. The second application is flexible design and manufacturing-a combinatorial assignment problem, where we optimize design and manufacturing assignments with respect to time and cost of design and manufacturing for a given product. Both problems use metalieuristics as a way to encode domain knowledge. In the first application, the EA is used at the metalevel, while in the second application, the EA is the object-level problem solver. In both cases, the EAs use a single-valued fitness function that represents the required tradeoffs. The third application is a lamp spectrum optimization that is formulated as a multiobjective optimization problem. Using domain customized mutation operators, we obtain a well-sampled Pareto front showing all the nondominated solutions. The fourth application describes a scheduling problem for the maintenance tasks of a constellation of 25 low earth orbit satellites. The domain knowledge in this application is embedded in the design of a structured chromosome, a collection of time-value transformations to reflect static constraints, and a time-dependent penalty function to prevent schedule collisions.

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

knowledge representation
lamp spectrum optimization
multiobjective optimization

automated insurance underwriting
combinatorial optimization
design and manufacturing planning
evolutionary algorithms (eas)
metaheuristics
satellite scheduling
soft computing


robotic wheelchair looking at all people Although several robotic/intelligent wheelchairs have been proposed recently,they consider friendliness only to their users. Machines like wheelchairs interact various people other than their users. They must consider friendliness to all these people. This paper presents a robotic wheelchair that cares for all relevant people: users, pedestrians, and caregivers, by looking at these people. It looks at the user's face, observing its direction. The user can turn it by looking in his/her desired direction. It looks at pedestrians and changes the way of avoidance against them depending on whether or not their noticing it. In addition, it looks at the caregiver when he/she is with it and keeps moving with him/her.

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

collision avoidance
intention understanding
face direction
vision-based interface


Securing on-line credit card payments without disclosing privacy information Two revisions of the original Secure Electronic Transaction (SET) protocol are proposed to conceal cardholders' identities in the electronic marketplace in which cardholders' trust for banks can be reduced to a minimum. Constrained by being extensions of the existing card payment networks to the Internet, most on-line credit card payment schemes in use or proposed in recent papers assume the sensitive card information could be disclosed to all the participating banks. The assumption used to work well in traditional credit card payments before. However, negative impacts such as banking scandals, closure programs due to poor management, and security problems with Internet banking are all undermining cardholders' trust in banks. The issuer is the trusted bank selected by the cardholder, but the acquirer is not. To reveal the cardholder's sensitive card information to every possible acquirer implies potential risk. Based on the need-to-know principle, the two revisions are proposed to relax the assumption mentioned above. In our solutions, the sensitive card information is well protected along the way and can be extracted only by the issuer. A cardholder needs only to select a trustworthy issuer, instead of worrying about the possible breakdowns of every involved acquirer. The cost to achieve our more secure schemes demands only minor information modifications on the legacy system.

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


adaptive 4-8 texture hierarchies We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced based on 4-8 refinement of raster tiles, in which the texture grids in effect rotate 45 degrees for each level of refinement. This hierarchy provides twice as many levels of detail as conventional quadtree-style refinement schemes such as mipmaps, and thus provides per-pixel view-dependent filtering that is twice as close to the ideal cutoff frequency for an average pixel. Because of this more gradual change in low-pass filtering, and due to the more precise emulation of the ideal cutoff frequency, we find in practice that the transitions between texture levels of detail are not perceptible. This allows rendering systems to avoid the complexity and performance costs of per-pixel blending between texture levels of detail. The 4-8 texturing scheme is integrated into a variant of the Real-time Optimally Adapting Meshes (ROAM) algorithm for viewdependent multiresolution mesh generation. Improvements to ROAM included here are: the diamond data structure as a stream-lined replacement for the triangle bintree elements, the use of low-pass- filtered geometry patches in place of individual triangles, integration of 4-8 textures, and a simple out-of-core data access mechanism for texture and geometry tiles.

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

out-of-core algorithms
view-dependent visualization
adaptive textures
large data set visualization
level-of-detail techniques


THESUS, a closer view on Web content management enhanced with link semantics With the unstoppable growth of the World Wide Web, the great success of Web Search Engines, such as Google and Alta-Vista, users now turn to the Web whenever looking for information. However, many users are neophytes when it comes to computer science, yet they are often specialists of a certain domain. These users would like to add more semantics to guide their search through World Wide Web material, whereas currently most search features are based on raw lexical content. We show in this paper how the use of the incoming links of a page can be used efficiently to classify a page in a concise manner. This enhances the browsing and querying of Web pages. In this article, we focus on the tools needed in order to manage the links and their semantics. We further process these links using a hierarchy of concepts, akin to an ontology, and a thesaurus. This work is demonstrated by an prototype system, called THESUS, that organizes thematic Web documents into semantic clusters. Our contributions in this paper are the following: 1) a model and language to exploit link semantics information, 2) the THESUS prototype system, 3) its innovative aspects and algorithms, more specifically, the novel similarity measure between Web documents applied to different clustering schemes (DB-Scan and COBWEB), and 4) a thorough experimental evaluation proving the value of our approach.

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

link analysis and management
semantic web


Determination of the weights for the ultimate cross efficiency using Shapley value in cooperative game This paper firstly revisits the cross efficiency evaluation method which is an extension tool of data envelopment analysis (DEA), then analyzes the potential flaws which happens when the ultimate average cross efficiency scores are used. In this paper, we consider the DMUs as the players in a cooperative game, where the characteristic function values of coalitions are defined to compute the Shapley value of each DMU, and the common weights associate with the imputation of the Shapley values are used to determine the ultimate cross efficiency scores. In the end, an empirical example is illustrated to examine the validity of the proposed method, and we also point out some further research directions in future.

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

cross efficiency
cooperative game
shapley value
common weights


Parallel molecular dynamics simulations for short-ranged many-body potentials A new method is described that permits the efficient execution of parallel molecular dynamics simulations for irregular problems with several thousands of atoms on Single-Instruction Multiple-Data computers. The approach is based on a data-parallel atomic decomposition scheme and has overall time-complexity O(N), where N is the size of the system. The method has been implemented on a MasPar MP-I computer and was found to obey theoretical timing estimates. The methodology has wide applicability and can be ported to other architectures in a straightforward manner. (C) 2000 Elsevier Science B.V. All rights reserved.

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

parallel computing
many-body potentials
clusters
nanotubes


Evaluation of a variable rate controller for aldicarb application around buffer zones in citrus groves Advances in precision farming technologies have facilitated controlled application of agrochemicals and documentation procedures to follow environmental regulations. This paper details evaluation of a commercial variable rate (VR) controller for preventing aldicarb applications in the buffer zones around potable water wells of citrus groves. The controller was coupled to two common drive mechanisms, a ground-driven electric clutch-engaged (GDEC) and pulse-width-modulation motor-driven (PWMM). The evaluation involved determination of dynamic performance of the VR application system through quantification of reaction times and rate transition distances and determination of appropriate look-ahead times for each of the drive mechanisms. Without a look-ahead (zero) setting, the mean midpoint reaction distances were about 1.8 and 3.6m for the GDEC and PWMM mechanisms, respectively, at 7.0-km/h ground speed. For the GDEC, a look-ahead time of 1s gave the mean midpoint reaction distances of ?0.06 and 0.04m during step-up and step-down of the rate, respectively. For PWMM, the best look-ahead times were 1 and 2s during step-up and step-down of the rate, respectively. However, since the prototype unit could not accommodate two look-ahead times, the compromise look-ahead time for both step-up and -down was 2s. Validation in the actual buffer zone showed that, at 95% confidence level, the buffer zone should be increased by 2.5 or 3.3m in commercial applications using GDEC or PWMM systems, respectively.

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

granular applicator
variable rate application
gps/gis
prescription map


Expert Stock Picker: The Wisdom of (Experts in) Crowds The phrase "the wisdom of crowds" suggests that good verdicts can be achieved by averaging the opinions and insights of large, diverse groups of people who possess varied types of information. Online user-generated content enables researchers to view the opinions of large numbers of users publicly. These opinions, in the form of reviews and votes, can be used to automatically generate remarkably accurate verdicts collective estimations of future performance about companies, products, and people on the Web to resolve very tough problems. The wealth and richness of user-generated content may enable firms and individuals to aggregate consumer-think for better business understanding. Our main contribution, here applied to user-generated stock pick votes from a widely used online financial newsletter, is a genetic algorithm approach that can be used to identify the appropriate vote weights for users based on their prior individual voting success. Our method allows us to identify and rank "experts" within the crowd, enabling better stock pick decisions than the S&P 500. We show that the online crowd performs better, on average, than the S&P 500 for two test time periods, 2008 and 2009, in terms of both overall returns and risk-adjusted returns, as measured by the Sharpe ratio. Furthermore, we show that giving more weight to the votes of the experts in the crowds increases the accuracy of the verdicts, yielding an even greater return in the same time periods. We test our approach by utilizing more than three years of publicly available stock pick data. We compare our method to approaches derived from both the computer science and finance literature. We believe that our approach can be generalized to other domains where user opinions are publicly available early and where those opinions can be evaluated. For example, YouTube video ratings may be used to predict downloads, or online reviewer ratings on Digg may be used to predict the success or popularity of a story.

O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
prediction markets
social media
user-generated content


Learning hybrid neuro-fuzzy classifier models from data: to combine or not to combine? To combine or not to combine? This very important question is examined in this paper in the context of a hybrid neuro-fuzzy pattern classifier design process. A general fuzzy min-max neural network with its basic learning procedure is used within five different algorithm-independent learning schemes. Various versions of cross-validation and resampling techniques, leading to generation of a single classifier or a multiple classifier system, are scrutinised and compared. The classification performance on unseen data, commonly used as a criterion for comparing different competing designs, is augmented by further four criteria attempting to capture various additional characteristics of classifier generation schemes. These include: the ability to estimate the true classification error rate, the classifier transparency, the computational complexity of the learning scheme and the potential for adaptation to changing environments and new classes of data. One of the main questions examined is whether and when to use a single classifier or a combination of a number of component classifiers within a multiple classifier system. (C) 2003 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 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

neuro-fuzzy classifier
pattern recognition
ensembles of classifiers
classifier combination
cross-validation


personalization algorithms for portable personality With the advances in ubiquitous computing, there is an increasing focus on personalization of user information especially in web applications. Currently those personalized user profiles are scattered around the Internet, mostly stored for each individual website. Therefore, this prohibits the usage of those profiles in other environments such as shopping in local stores or sharing interests among people. The so-called Portable Personality focuses on the management and distribution of personalized profiles via mobile devices. This paper provides an overview of related factors, which are to be considered in a portable personality environment. We discuss common user profile categorization approaches and their possible representation. Moreover, we mention the current state-of-the-art of profile acquisition and management algorithms to obtain and handle personalized information. This also includes approaches towards portable profiles. At the end, profile merging and personalization algorithms are covered to handle the challenges of aggregate multiple profiles and personalized recommendations based on distributed (portable) profiles.

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

merging
website
ubiquitous computing
personalization
paper
representation
user
management
sharing
environments
aggregate
internet
distributed
profiles
portable

challenge
web application
art
informal
locality
recommendation
mobile device
factor
user profile
categorical
algorithm


Fast multipole method applied to 3-D frequency domain elastodynamics This article is concerned with the formulation and implementation of a fast multipole-accelerated BEM for 3-D elastodynamics in the frequency domain, based on the so-called diagonal form for the expansion of the elastodynamic fundamental solution, a multilevel strategy. As usual with the FM-BEM, the linear system of BEM equations is solved by GMRES, and the matrix is never explicitly formed. The truncation parameter in the multipole expansion is adjusted to the level, a feature known from recently published studies for the Maxwell equations. A preconditioning strategy based on the concept of sparse approximate inverse (SPAI) is presented and implemented. The proposed formulation is assessed on numerical examples involving O(105) O ( 10 5 ) BEM unknowns, which show in particular that, as expected, the proposed FM-BEM is much faster than the BEM traditional, and that the GMRES iteration count is significantly reduced when the SPAI preconditioner is used.

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

boundary element method
3-d elastodynamics


The use of discrete orthogonal projections in boundary element methods In recent papers by Sloan and Wendland (1999), Grigorieff and Sloan (1998) and Grigorieff, Sloan and Brandts (2000), a formalism was developed that serves many important and interesting applications in boundary element methods: the commutator property for splines. Based on superapproximation results, this property is, for example, a tool of central importance in stability and convergence proofs for qualocation methods for boundary integral equations with variable coefficients. Another application is the transfer of superconvergence properties from constant-coefficient boundary integral equations to the variable coefficient case. The heart of the theory is formed by the concept discrete orthogonal projection, that arises when the L2-orthogonal inner product is discretized by possibly non-standard quadrature rules. In this paper, we present an overview of the theory of discrete orthogonal projections, and a new set of numerical experiments that confirm the theory. The main conclusion is that the presence of variable coefficients of a certain smoothness does not influence superconvergence in a negative way, and that henceforth the use of superconvergence-based a posteriori error estimators in this particular case is theoretically justified.

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

orthogonal projection
commutator property


Omnidirectional visual control of mobile robots based on the 1D trifocal tensor The precise positioning of robotic systems is of great interest particularly in mobile robots. In this context, the use of omnidirectional vision provides many advantages thanks to its wide field of view. This paper presents an image-based visual control to drive a mobile robot to a desired location, which is specified by a target image previously acquired. It exploits the properties of omnidirectional images to preserve the bearing information by using a 1D trifocal tensor. The main contribution of the paper is that the elements of the tensor are introduced directly in the control law and neither any a priori knowledge of the scene nor any auxiliary image are required. Our approach can be applied with any visual sensor obeying approximately a central projection model, presents good robustness to image noise, and avoids the problem of a short baseline by exploiting the information of three views. A sliding mode control law in a square system ensures stability and robustness for the closed loop. The good performance of the control system is proven via simulations and real world experiments with a hypercatadioptric imaging system.

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

visual control
omnidirectional images
1d trifocal tensor
mobile robots


Extending twin support vector machine classifier for multi-category classification problems Twin support vector machine classifier (TWSVM) was proposed by Jayadeva et al., which was used for binary classification problems. TWSVM not only overcomes the difficulties in handling the problem of exemplar unbalance in binary classification problems, but also it is four times faster in training a classifier than classical support vector machines. This paper proposes one-versus-all twin support vector machine classifiers (OVA-TWSVM) for multi-category classification problems by utilizing the strengths of TWSVM. OVA-TWSVM extends TWSVM to solve k-category classification problems by developing k TWSVM where in the ith TWSVM, we only solve the Quadratic Programming Problems (QPPs) for the ith class, and get the ith nonparallel hyperplane corresponding to the ith class data. OVA-TWSVM uses the well known one-versus-all (OVA) approach to construct a corresponding twin support vector machine classifier. We analyze the efficiency of the OVA-TWSVM theoretically, and perform experiments to test its efficiency on both synthetic data sets and several benchmark data sets from the UCI machine learning repository. Both the theoretical analysis and experimental results demonstrate that OVA-TWSVM can outperform the traditional OVA-SVMs classifier. Further experimental comparisons with other multiclass classifiers demonstrated that comparable performance could be achieved.

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

support vector machines
machine learning

multicategory twin support machine classifiers


A penalty-based finite element interface technology An effective and robust interface element technology able to connect independently modeled finite element subdomains is presented. This method has been developed using the penalty constraints and allows coupling of finite element models whose nodes do not coincide along their common interface. Additionally, the present formulation leads to a computational approach that is very efficient and completely compatible with existing commercial software. A significant effort has been directed toward identifying those model characteristics (element geometric properties, material properties and loads) that most strongly affect the required penalty parameter, and subsequently to developing simple formulae for automatically calculating the proper penalty parameter for each interface constraint. This task is especially critical in composite materials and structures, where adjacent subregions may be composed of significantly different materials or laminates. This approach has been validated by investigating a variety of two-dimensional problems, including composite laminates.

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

penalty method
lagrange multiplier
global/local analysis
substructure


Using the hyperbolic distribution to estimate the precision of size distribution percentiles of fluvial gravels ? The hyperbolic distribution is fitted to published grain-size data collected from the surface of two gravel-bed rivers (the Fraser and Mamquam River data sets of Rice and Church). Our parametric approach enables calculation of standard errors for estimates of percentiles, as an alternative to the use of the bootstrap for this purpose. For estimation, we have used the statistical package R and the advantages of this software for this type of analysis are highlighted in this paper.

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

grain size percentiles
sediment sampling
r software


data dependence analysis on multi-dimensional array references An efficient and precise data dependence analysis is the key to the success of a parallelizing compiler because it is required in almost all phases of the parallelism detection and enhancement in such compilers. However, existing test algorithms are quite weak in analyzing multi-dimensional array references, which are usually where the parallelism is in most programs. In this paper, a new algorithm, called &lgr;-test, is presented for an efficient and accurate data dependence analysis on multi-dimensional array references. It achieves high efficiency and high accuracy at the same time, which is in general not allowed in previous algorithms. This algorithm has been implemented in Parafrase [Wolf82]. Some experimental results are also presented to show its effectiveness.

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

precise
detection
accuracy
efficiency
test
data dependence
analysis
general
paper
algorithm

program
experimentation
parallel
arrays
parallel compiler
compilation
timing
effect


database research in computer games This tutorial presents an overview of the data management issues faced by computer games today. While many games do not use databases directly, they still have to process large amounts of data, and could benefit from the application of database technology. Other games, such as massively multiplayer online games (MMOs), must communicate with commercial databases and have their own unique challenges. In this tutorial we will present the state-of-the-art of data management in games that we learned from our interaction with various game studios. We will show how the issues involved motivate current research, and illustrate several possibilities for future work. Our tutorial will start with a description of data-driven design, which is the source of many of the data management issues that games face. We will show some of the tools that game developers use to create and manage content. We will discuss how this type of design can affect performance, and the data structures and techniques that developers use to ensure that the game is responsive. We will discuss the problem of consistency in games, and how games ensure that players all share the same view of the world. Finally, we will examine some of the engineering issues that game developers have to deal with when interacting with traditional databases. This tutorial is intended to be self-contained, and provides the background necessary for understanding how databases and database technology are relevant to computer games. This tutorial is accessible to students and researchers who, while perhaps not hardcore gamers themselves, are interested in ways in which they can use their expertise to solve problems in computer games.

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


dynamic hyperparameter optimization for bayesian topical trend analysis This paper presents a new Bayesian topical trend analysis. We regard the parameters of topic Dirichlet priors in latent Dirichlet allocation as a function of document timestamps and optimize the parameters by a gradient-based algorithm. Since our method gives similar hyperparameters to the documents having similar timestamps, topic assignment in collapsed Gibbs sampling is affected by timestamp similarities. We compute TFIDF-based document similarities by using a result of collapsed Gibbs sampling and evaluate our proposal by link detection task of Topic Detection and Tracking.

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


Compactly encoding unstructured inputs with differential compression The subject of this article is differential compression, the algorithmic task of finding common strings between versions of data and using them to encode one version compactly by describing it as a set of changes from its companion. A main goal of this work is to present new differencing algorithms that (i) operate at a fine granularity (the atomic unit of change), (ii) make no assumptions about the format or alignment of input data, and (iii) in practice use linear time, use constant space, and give good compression. We present new algorithms, which do not always compress optimally but use considerably less time or space than existing algorithms. One new algorithm runs in O(n) time and O(1) space in the worst case (where each unit of space contains [log n] bits), as compared to algorithms that run in O(n) time and O(n) space or in O(n(2)) time and O(1) space. We introduce two new techniques for differential compression and apply these to give additional algorithms that improve compression and time performance. We experimentally explore the properties of our algorithms by running them on actual versioned data. Finally, we present theoretical results that limit the compression power of differencing algorithms that are restricted to making only a single pass over the data.

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

algorithms
performance
differencing
differential compression

experimentation
theory
delta compression


Constraint-based software specifications and verification using UML Constraint-based software specifications enable run-time monitoring to detect probable risk events and ensure the desired system behavior. SpecTRM-RL is a well-developed constraint-based specification method for computer-controlled systems. However, it is desirable to express constraints in familiar visual models. To provide better visualization and popularity, we developed methods to represent all the SpecTRM-RL constraint types in UML. We have also extended SpecTRM's constraints by adding relational and global constraints, and then expressed them in OCL. Safety verification of these specifications is also proposed. We developed a systematic way to construct fault trees for safety analysis based on UML diagrams. Due to the generality of UML as well as the defensive manner of constraints and fault tree analysis, our approach can be adapted for both general applications and safety-critical applications.

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


Supply-side collaboration and its value in supply chains Collaboration has been recognized as a significant process that holds the value creation opportunity in supply chain management. Evaluating the value of collaboration is thus necessary for developing the effective collaboration mechanisms. This paper presents the evaluation approach specifically focusing on the supply-side collaboration on inventory decisions between a supplier and a distributor in a two-echelon supply chain. Two scenarios are compared. In the traditional scenario, the distributor is unaware of the suppliers inventory decisions and merely makes its own inventory decisions according to the available information. In the second scenario with supply-side collaboration, the distributor considers the suppliers inventory policy (r,Q) and the planned service level as provided by the supplier. The numerical experiments show that the supply-side collaboration has the ability to improve the supply chain performance in terms of better stabilizing effect and service level.

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

supply-side collaboration
performance evaluation


XML - an opportunity for "meaningful" data standards in the geosciences Extensible markup language (XML) is a recently introduced meta-language standard on the Web. It provides the rules for development of metadata (markup) standards for information transfer in specific fields, XML allows development of markup languages that describe what information is rather than how it should be presented. This allows computer applications to process the information in intelligent ways, In contrast hypertext markup language (HTML). which fuelled the initial growth of the Web, is a metadata standard concerned exclusively with presentation of information. Besides its potential for revolutionizing Web activities, XML provides an opportunity for development of meaningful data standards in specific application fields. The rapid endorsement of XML, by science, industry and e-commerce has already spawned new metadata standards in such fields as mathematics, chemistry, astronomy. multimedia and Web micro-payments. Development of XML-based data standards in the geosciences would significantly reduce the effort currently wasted on manipulating and reformatting data between different computer platforms and applications and would ensure compatibility with the new generation of Web browsers. This paper explores the evolution, benefits and status of XML and related standards in the more general context of Web activities and uses this as a platform for discussion of its potential for development of data standards in the geosciences. Some of the advantages of XML are illustrated by a simple, browser-compatible demonstration of XML functionality applied to a borehole log dataset. The XML dataset and the associated stylesheet and schema declarations are available for FTP download, (C) 2001 Elsevier Science Ltd. All rights reserved.

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


Adaptive FEC-based lightpath routing and wavelength assignment in WDM optical networks ? Forward error correction (FEC) has been widely used in optical communication systems to compensate for the degradation of the received optical signal to noise ratio (OSNR). Current optical networks tend to use the same type of FEC for all the lightpaths even though lightpaths with higher OSNRs can be established by FECs with lower overhead. This paper proposes an adaptive approach to choose the most efficient FECs for different lightpaths based on their individual OSNRs. An Integer Linear Programming (ILP) model and a simple waveplane-based heuristic algorithm considering shuffled lightpath demand sequences are developed to tackle the routing and wavelength assignment (RWA) problem. The simulation results indicate that compared to the non-adaptive case, using the proposed adaptive FEC selection scheme can significantly reduce the required FEC overhead. Apart from being far more tractable, the proposed heuristic approach performs almost as well as the ILP model.

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

adaptive forward error correction (fec)
optical signal to noise ratio (osnr)
shuffled demand sequences
waveplane-based heuristic algorithm


Secure logarithmic audio watermarking scheme based on the human auditory system This paper proposes a high capacity audio watermarking algorithm in the logarithm domain based on the absolute threshold of hearing of the human auditory system (HAS), which makes this scheme a novel technique. When considering the fact that the human ear requires more precise samples at low amplitudes (soft sounds), the use of the logarithm helps us design a logarithmic quantization algorithm. The key idea is to divide the selected frequency band into short frames and quantize the samples based on the HAS. Using frames and the HAS improves the robustness, since embedding a secret bit into a set of samples is more reliable than embedding it into a single sample. In addition, the quantization level is adjusted according to the HAS. Apart from remarkable capacity, transparency and robustness, this scheme provides three parameters (frequency band, scale factor and frame size) which facilitate the regulation of the watermarking properties. The experimental results show that the method has a high capacity (8007,000 bits per second), without significant perceptual distortion (ODG >1) and provides robustness against common audio signal processing such as added noise, filtering and MPEG compression (MP3).

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

multimedia security
digital rights management


Skewed stereo time-of-flight camera for translucent object imaging ? A new skewed stereo ToF camera for detecting and imaging translucent objects under minimal prior of environment Translucent region detection method Translucent region recovery method Extensive analysis and evaluations

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

tof depth camera
three-dimensional image processing


Diagnosis of solitary lung nodules using the local form of Ripleys K function applied to three-dimensional CT data This paper analyzes the application of Ripleys K function to characterize lung nodules as malignant or benign in computerized tomography images. The proposed characterization method is based on a selection of measures from Ripleys K function to discriminate between benign and malignant nodules, using stepwise discriminant analysis. Based on the selected measures, a linear discriminant analysis procedure is performed once again in order to predict the classification of each nodule. To evaluate the ability of these features to discriminate the nodules, a set of tests was carried out using a sample of 39 pulmonary nodules, 29 benign and 10 malignant. A leave-one-out procedure was used to provide a less biased estimate of the linear discriminators performance. The best setting of the analyzed function in the tested sample presented 70.0% of sensitivity but with 100.0% of specificity and 92.3% of accuracy. Thus, preliminary results of this approach are very promising regarding its contribution to the diagnosis of pulmonary nodules, but it still needs to be tested with larger series and associated to other quantitative imaging methods in order to improve global performance.

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

diagnosis of lung nodule
textural characterization


An Ontology-Based Approach to Metaphor Cognitive Computation Language understanding is one of the most important characteristics for human beings. As a pervasive phenomenon in natural language, metaphor is not only an essential thinking approach, but also an ingredient in human conceptual system. Many of our ways of thinking and experiences are virtually represented metaphorically. With the development of the cognitive research on metaphor, it is urgent to formulate a computational model for metaphor understanding based on the cognitive mechanism, especially with the view to promoting natural language understanding. Many works have been done in pragmatics and cognitive linguistics, especially the discussions on metaphor understanding process in pragmatics and metaphor mapping representation in cognitive linguistics. In this paper, a theoretical framework for metaphor understanding based on the embodied mechanism of concept inquiry is proposed. Based on this framework, ontology is introduced as the knowledge representation method in metaphor understanding, and metaphor mapping is formulated as ontology mapping. In line with the conceptual blending theory, a revised conceptual blending framework is presented by adding a lexical ontology and context as the fifth mental space, and a metaphor mapping algorithm is proposed.

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


the competence/performance dichotomy in programming preliminary report We consider the problem of automating some of the duties of programmers. We take as our point of departure the claim that data management has been automated to the point where the programmer concerned only about the correctness (as opposed to the efficiency) of his program need not involve himself in any aspect of the storage allocation problem. We focus on what we feel is a sensible next step, the problem of automating aspects of control. To accomplish this we propose a definition of control based on a fact/heuristic dichotomy, a variation of Chomsky's competence/performance dichotomy. The dichotomy formalizes an idea originating with McCarthy and developed by Green, Hewitt, McDermott, Sussman, Hayes, Kowalski and others. It allows one to operate arbitrarily on the control component of a program without affecting the program's correctness, which is entirely the responsibility of the fact component. The immediate objectives of our research are to learn how to program keeping fact and control separate, and to identify those aspects of control amenable to automation.

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

program
point
research
aspect
efficiency
variation
definition
correctness
data management
automation
storage allocation
control
programmer
component

performance object competence response learning heuristics


Inverse velocity analysis for line guidance five-axis robots In this paper, inverse velocity problem for five-axis robots is investigated. The conventional method for a five-axis robot is to pseudo-inverse the 65 Jacobian matrix. The solution, primarily based on six freedoms inverse velocity analysis, is just an approximation with a least-square error. A five-axis robot can exactly guide an axis-symmetrical tool in 3-D space. Two exact solutions are provided for five-axis robots. One is based on the screw motion of the tool. The other is based on spherical angles of the tool to derive a 55 Jacobian matrix. A new type of singular configuration is discovered and is called the task singularity. The moving path of the line shaped tool is constructed as a ruled surface. Analysis of the angular acceleration shows the surface constructed based on the spherical angle representation has better characteristic. It is concluded that for five-axis robots, the tool position is better represented by five parameters rather than six parameters in order to get better solutions for inverse velocity as well as the motion planning.

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

line guidance
velocity analysis
ruled surface


Binning Optimization for Transparently-Latched Circuits With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transparent latches are widely used. In this paper, we formulate and solve the binning optimization problem that decides the bin boundaries and their testing order to maximize the profit (considering the test cost) for a transparently-latched circuit. The problem is decomposed into four sub-problems. First, to compute the clock period distribution of the transparentlylatched circuit, a sample-based statistical static timing analysis (SSTA) approach is developed which is based on the generalized stochastic collocation method with the sparse grid technique. The minimal clock period on each sample point is found by solving a minimal cycle ratio problem in the constraint graph. Second, a greedy method is proposed to maximize profit considering both the sales revenue and the test cost by iteratively assigning each boundary to its optimal position. Third, an optimal algorithm of O(n log n) runtime is used to generate the optimal testing order to minimize the test cost, based on alphabetic tree. Last, a simple approach is presented to decide the optimal number of bins, which helps to complete the whole binning scheme with maximal profit. Experiments on all the ISCAS' 89 sequential benchmarks with 65 nm technology show 10.68% profit improvement in average. Some comparisons with other methods suggest the advantage of our method. The results also demonstrate that the proposed SSTA method achieves an error of 0.70% and speedup of 110X in average compared with the Monte Carlo simulation. Index Terms-Binning optimization, speed binning, statistical static timing analysis, transparent latches.

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

binning optimization
speed binning
statistical static timing analysis
transparent latches


On the complexity of model checking interval-valued discrete time Markov chains We investigate the complexity of model checking (finite) interval-valued discrete time Markov chains, that is, discrete time Markov chains where each transition is associated with an interval in which the actual transition probability must lie. Two semantics are considered, the uncertain Markov chain (UMC) semantics and the interval Markov decision process (IMDP) semantics. We show that, for reachability, these two semantics coincide and the problem is P-complete. This entails that PCTL model checking problem under the IMDP semantics is also P-complete. We also show that model checking PCTL under the UMC semantics is SQUARE-ROOT-SUM hard, meaning that one can reduce the SQUARE-ROOT-SUM problem to it. (C) 2013 Elsevier B.V. All rights reserved.

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

formal methods
discrete time markov chain
linear programming


PORSCHE: Performance ORiented SCHEma mediation Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping two schemas at a time. In a large-scale scenario, where data sharing involves a large number of data sources, such techniques are not suitable. We present a new robust automatic method which discovers semantic schema matches in a large set of XML schemas, incrementally creates an integrated schema encompassing all schema trees, and defines mappings from the contributing schemas to the integrated schema. Our method, PORSCHE (Performance ORiented SCHEma mediation), utilises a holistic approach which first clusters the nodes based on linguistic label similarity. Then it applies a tree mining technique using node ranks calculated during depth-first traversal. This minimises the target node search space and improves performance, which makes the technique suitable for large-scale data sharing. The PORSCHE framework is hybrid in nature and flexible enough to incorporate more matching techniques or algorithms. We report on experiments with up to 80 schemas containing 83,770 nodes, with our prototype implementation taking 587s on average to match and merge them, resulting in an integrated schema and returning mappings from all input schemas to the integrated schema. The quality of matching in PORSCHE is shown using precision, recall and F-measure on randomly selected pairs of schemas from the same domain. We also discuss the integrity of the mediated schema in the light of completeness and minimality measures.

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

xml schema tree
schema matching
schema mapping
large scale


Is workplace satisfaction associated with self-reported quad bike loss of control events among farm workers in New Zealand? Two independent samples of farmers surveyed. Count data regression techniques used. Aspects of workplace satisfaction related to quad bike loss-of-control events. Psychological demand, employment status and sex linked with quad bike LCEs.

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

quad bike
loss of control events
workplace satisfaction


A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems In this paper, we present an improved version of the infeasible-interior-point method for linear optimization introduced by Roos (SIAM J Optim 16(4):11101136,2006). Each main step of Rooss algorithm is composed of one feasibility step and several centering steps. By using a new search direction, we prove that it is enough to take only one step in order to obtain a polynomial-time method. The iteration bound coincides with the currently best iteration bound for linear optimization problems.

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

infeasible-interior-point method
central path
search directions
full-newton step
perturbed problems
90c05
90c51


Toward a scalable visualization system for network traffic monitoring With the multiplication of attacks against computer networks, system administrators are required to monitor carefully the traffic exchanged by the networks they manage. However, that monitoring task is increasingly laborious because of the augmentation of the amount of data to analyze. And that trend is going to intensify with the explosion of the number of devices connected to computer networks along with the global rise of the available network bandwidth. So system administrators now heavily rely on automated tools to assist them and simplify the analysis of the data. Yet, these tools provide limited support and, most of the time, require highly skilled operators. Recently, some research teams have started to study the application of visualization techniques to the analysis of network traffic data. We believe that this original approach can also allow system administrators to deal with the large amount of data they have to process. in this paper, we introduce a tool for network traffic monitoring using visualization techniques that we developed in order to assist the system administrators of our corporate network. We explain how we designed the tool and some of the choices we made regarding the visualization techniques to use. The resulting tool proposes two linked representations of the network traffic and activity, one in 2D and the other in 3D. As 2D and 3D visualization techniques have different assets, we resulted in combining them in our tool to take advantage of their complementarity. We finally tested our tool in order to evaluate the accuracy of our approach.

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


Simulation studies on scheduling requests for multiple data items in on-demand broadcast environments Data scheduling for on-demand broadcast has been studied extensively in the past few years. Most work has focused on single-item requests in single-channel architectures. However, this model is not practical for emerging mobile applications. This study investigates data scheduling for multi-item requests in multi-channel on-demand broadcast environments. The performance of several well known scheduling algorithms designed for single-item requests in this new environment is comprehensively evaluated. Two problems, namely, request starvation and broadcast mismatch, are identified. The results showed that existing algorithms cannot perform efficiently in this new setting and it is imperative to develop new solutions to overcome the problems.

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

on-demand broadcast
multi-item request
multiple channels
performance evaluation


modeling hidden topics on document manifold Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the joint probability of documents and terms in the corpus. The major disadvantage of PLSI is that it estimates the probability distribution of each document on the hidden topics independently and the number of parameters in the model grows linearly with the size of the corpus, which leads to serious problems with overfitting. Latent Dirichlet Allocation (LDA) is proposed to overcome this problem by treating the probability distribution of each document over topics as a hidden random variable. Both of these two methods discover the hidden topics in the Euclidean space. However, there is no convincing evidence that the document space is Euclidean, or flat. Therefore, it is more natural and reasonable to assume that the document space is a manifold, either linear or nonlinear. In this paper, we consider the problem of topic modeling on intrinsic document manifold. Specifically, we propose a novel algorithm called Laplacian Probabilistic Latent Semantic Indexing (LapPLSI) for topic modeling. LapPLSI models the document space as a submanifold embedded in the ambient space and directly performs the topic modeling on this document manifold in question. We compare the proposed LapPLSI approach with PLSI and LDA on three text data sets. Experimental results show that LapPLSI provides better representation in the sense of semantic structure.

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

manifold regularization
document representation
generative model


Minimizing drop cost for SONET/WDM networks with 1/8 wavelength requirements SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a "grooming," consisting of unions of certain primitive rings, The existence of such decompositions when every pair of sites employs no more than 1/8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techniques developed rely heavily on tools from combinatorial design theory. (C) 2001 John Wiley & Sons, Inc.

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

ring grooming
primitive ring
sonet ring
wavelength minimization


Informed source separation through spectrogram coding and data embedding ? We address the issue of underdetermined source separation in a particular informed configuration where both the sources and the mixtures are known during a so-called encoding stage. This knowledge enables the computation of a side-information which is small enough to be inaudibly embedded into the mixtures. At the decoding stage, the sources are no longer assumed to be known, only the mixtures and the extracted side-information are processed for source separation. The proposed system models the sources as independent and locally stationary Gaussian processes (GP) and the mixing process as a linear filtering. This model allows reliable estimation of the sources through generalized Wiener filtering, provided their spectrograms are known. As these spectrograms are too large to be embedded in the mixtures, we show how they can be efficiently approximated using either Nonnegative Tensor Factorization (NTF) or image compression. A high-capacity embedding method is used by the system to inaudibly embed the separation side-information into the mixtures. This method is an application of the Quantization Index Modulation technique applied to the timefrequency coefficients of the mixtures and permits to reach embedding rates of about 250kbps. Finally, a study of the performance of the full system is presented.

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


Multiple surrogates: how cross-validation errors can help us to obtain the best predictor Surrogate models are commonly used to replace expensive simulations of engineering problems. Frequently, a single surrogate is chosen based on past experience. This approach has generated a collection of papers comparing the performance of individual surrogates. Previous work has also shown that fitting multiple surrogates and picking one based on cross-validation errors (PRESS in particular) is a good strategy, and that cross-validation errors may also be used to create a weighted surrogate. In this paper, we discussed how PRESS (obtained either from the leave-one-out or from the k-fold strategies) is employed to estimate the RMS error, and whether to use the best PRESS solution or a weighted surrogate when a single surrogate is needed. We also studied the minimization of the integrated square error as a way to compute the weights of the weighted average surrogate. We found that it pays to generate a large set of different surrogates and then use PRESS as a criterion for selection. We found that (1) in general, PRESS is good for filtering out inaccurate surrogates; and (2) with sufficient number of points, PRESS may identify the best surrogate of the set. Hence the use of cross-validation errors for choosing a surrogate and for calculating the weights of weighted surrogates becomes more attractive in high dimensions (when a large number of points is naturally required). However, it appears that the potential gains from using weighted surrogates diminish substantially in high dimensions. We also examined the utility of using all the surrogates for forming the weighted surrogates versus using a subset of the most accurate ones. This decision is shown to depend on the weighting scheme. Finally, we also found that PRESS as obtained through the k-fold strategy successfully estimates the RMSE.

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

multiple surrogate models
weighted average surrogates
cross-validation errors
prediction sum of squares


Operations research and data mining With the rapid growth of databases in many modern enterprises data mining has become an increasingly important approach for data analysis. The operations research community has contributed significantly to this field, especially through the formulation and solution of numerous data mining problems as optimization problems, and several operations research applications can also be addressed using data mining methods. This paper provides a survey of the intersection of operations research and data mining. The primary goals of the paper are to illustrate the range of interactions between the two fields, present some detailed examples of important research work, and provide comprehensive references to other important work in the area. The paper thus looks at both the different optimization methods that can be used for data mining, as well as the data mining process itself and how operations research methods can be used in almost every step of this process. Promising directions for future research are also identified throughout the paper. Finally, the paper looks at some applications related to the area of management of electronic services, namely customer relationship management and personalization.

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

classification
clustering
mathematical programming
heuristics


Component mining: a process and its pattern language An important issue in a component-based software development process is the supply source of mature, reliable, adaptable and maintainable components. We define as component mining the deliberate, organised and automated process of extracting reusable components from an existing rich software base and present a pattern language used for mining components from programs that are typically executed as non-interactive autonomous processes. We describe the patterns in terms of intent, motivation, applicability, structure, participants, consequences and implementation. Based on the pattern language, we describe the implementation of a set of COM components that encapsulate the Unix filters and an exemplar application that uses them.

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


Authentication protocol using an identifier in an ad hoc network environment This paper deals with device connections in a trust-based ad hoc network. Because a temporary device frequently joins or leaves a network, the authentication and security technology should be prepared for the malicious devices used in third-party attacks. An authentication scheme with the existing certification and ID, and security technology using symmetric and public keys are used. Therefore, in this paper we propose using two devices that have not shared information for mutual generation of authentication ID. The use of an authentication ID can establish mutual trust and provide security and efficiency for communication and generation of a symmetric key. Our analysis results show that an authentication operation reduction of up to 57%, compared to related work, is achieved by our protocol. (C) 2011 Elsevier Ltd. All rights reserved.

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

ad hoc network
authentication
identifier


Knowledge-collector agents: Applying intelligent agents in marketing decisions with knowledge management approach Marketing plays an essential role in the competitive business environment. Marketing decision makers constantly need to monitor changes in the environment and organization to make necessary changes. Therefore, a knowledge management (KM) system is required to acquire, store, retrieve and use up-to-date knowledge. Corporations also tend to look for systems to assist them in knowledge management. Agent technology looks set for assisting organizations in collecting, processing and using knowledge with high accuracy, speed and efficiency. This paper proposes a knowledge management framework for marketing decision making through using agent technology, fuzzy AHP (Analytical Hierarchy Process) and fuzzy logic. The fuzzy AHP is used for allocating the weight of determinant criteria and fuzzy logic is deployed for determining the final decision in pessimistic, moderate and optimistic satiations. The objectives of this study are as follows: (a) developing a knowledge management framework for capturing, storing, disseminating and utilizing marketing knowledge by using agent system, and (b) helping marketing decision makers to make effective decisions based on useful knowledge, and (c) encouraging marketing decisions towards the intelligence. Implementation of the proposed system in a car factory indicates that it is efficient and effective in supporting and improving marketing decision making.

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

marketing
knowledge management
intelligent agents


Computational analysis of high frequency fluidstructure interactions in constricted flow Constricted flow in a thin cylindrical shell with an idealized blunt constriction is modeled using ADINA. Highly disturbed recirculation region is observed at the constriction exit where pressure fluctuations and consequential vessel wall vibrations display broadband spectral content over a range of several hundred Hz. Maximum dynamic pressure and vibration amplitudes are observed around the reattachment point and they gradually decrease along downstream of flow. Results obtained by numerical simulations are compared with relevant studies in the literature and are in good agreement in terms of general spectral behavior. However, the amplitudes were significantly lower as compared to experimental results.

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

fluid structure interaction
blood flow simulation
stenosis
vessel wall vibration


Real-time particle swarm optimization based current harmonic cancellation As a powerful optimization algorithm, particle swarm optimization (PSO) has been widely applied to power system researches. However, most existing applications of PSO can only be implemented offline. The difficulties of online implementation mainly come from the unavoidable lengthy simulation time to evaluate a candidate solution. Recently, PSO was implemented online that can identify parameters in a motor control systems. In this paper, the real-time PSO (RT-PSO) based identification technique is applied to cancel current harmonics in power systems. By transforming the identification problem to optimization problem, RT-PSO can simultaneously identify four parameters associated with fundamental current from measurement. In this way, there is no need to identify the fundamental frequency separately or construct fundamental signal from identified harmonic information. The identification algorithm can be applied to three-phases independently, even for unbalanced system or single-phase system. The identified fundamental signal is then used as the reference for current harmonics cancellation. The RT-PSO based harmonic cancellation is realized with an active filter and used to compensate harmonic current created by a nonlinear load. Simulation results demonstrate that the RT-PSO algorithm can provide accurate identification of the fundamental current which in turn will result in good harmonic cancellation performance. As a capable online optimization technique, RT-PSO can be extensively applied to many optimization and control problems.

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

active power filter
online parameter identification
harmonic elimination


Online community search using conversational structures Online communities are valuable information sources where knowledge is accumulated by interactions between people. Search services provided by online community sites such as forums are often, however, quite poor. To address this, we investigate retrieval techniques that exploit the hierarchical thread structures in community sites. Since these structures are sometimes not explicit or accurately annotated, we introduce structure discovery techniques that use a variety of features to model relations between posts. We then make use of thread structures in retrieval experiments with two online forums and one email archive. Our results show that using thread structures that have been accurately annotated can lead to significant improvements in retrieval performance compared to strong baselines.

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