The AMT approach in chemometrics - First forays The 'Angle Measure Technique' (AMT) was introduced in 1994 by Robert Andrle as a new method for characterizing the complexity of geomorphic lines. AMT was proposed as an alternative to fractal analysis (in which the statistical measure of the complexity of a feature, e.g. an angular line, is assumed constant over the range of scales of measurement) for this purpose. Instead, AMT was designed to delineate changes in complexity of a geomorphic feature as a function of scale. In this paper we induct this approach into chemometrics and give several didactic and application examples. Initially it is instructive to view AMT as an analogy to Fourier transformation, but only concerning the way that AMT spectra can be used in further practical data analysis. The AMT approach has profound implications for analysis of both 1D and 2D measurement series in which 'noise' is dominant. AMT characterizes the noise part as well as quasi-periodic phenomena of a measurement series in a novel fashion as a function of a scale factor s. AMT derives complexity spectra which can often be used directly in furthering other specific data analytic objectives, e.g. as X-input for multivariate calibration or for interpretative purposes. AMT in fact creates a new domain of general data analysis, the scale domain, which complements the time and frequency domains of signal analysis. We here develop AMT so as to be able to work on any general 'measurement series', including, but far from restricted to, time series, image analysis and process chemometrics. A software program for generic AMT analysis has been developed, with which we have begun a series of forays into chemometric applications, some of which are delineated here in order to appreciate the potential of AMT. We also illustrate the method with a detailed example from food science, namely AMT spectra derived from textured bread imagery, which can be well calibrated with respect to sensory attributes (product volume, porosity). This type of application will be of great value in product and process optimization (certainly not only in food science). This example serves as an exemplar for direct at-line imaging for general quality or process control and automation, i.e. non-invasive on-line or at-line process analysis. We have further developed the original AMT concept in several ways, notably by a 'mean-difference Y' complexity measure and an augmented standard deviation addition as well as 'automated' X/Y-axis scalings. A central issue in interpretative AMT analysis relates to 'optimal scaling' (Y-axis and/or X-axis scaling). We have only barely begun approaching this complex issue, but AMT analysis would appear not to be fatally hampered even if not optimally scaled. For comparative studies the scaling is irrelevant. (C) 1996 by John Wiley & Son, Ltd.

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

amt (angle measure technique)
complexity characterization
multivariate calibration (input)


Optimal voltage control in distribution systems with coordination of distribution installations In recent years, distributed generations based on natural energy or co-generation systems are increasing due to global warming and reduction of fossil fuels. Many of the distributed generations are set up in the vicinity of customers, with the advantage that this decreases transmission losses and transmission capacity. However, output power generated from renewable energy such as wind power and photovoltaics, is influenced by weather conditions. Therefore if the distributed generation increases with conventional control schemes, the voltage variation in a distribution system becomes a serious problem. In this paper, an optimal control method of distribution voltage with coordination of distributed installations, such as On Load Tap Changer (OLTC), Step Voltage Regulator (SVR), Shunt Capacitor (SC), Shunt Reactor (ShR), and Static Var Compensator (SVC), is proposed. In this research, the communication infrastructure is assumed to be widespread in the distribution network. The proposed technique combines genetic algorithm (GA) and Tabu search (TS) to determine the control operation. In order to confirm the validity of the proposed method, simulation results are presented for a distribution network model with distributed (photovoltaic) generation.

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

distributed generation
distribution system
genetic algorithm
tabu search

distribution voltage/reactive power control


Adaptive fuzzy output feedback control of uncertain nonlinear systems with unknown backlash-like hysteresis In this paper, the problem of adaptive fuzzy output-feedback control is investigated for a class of uncertain nonlinear systems with unknown backlash-like hysteresis and unmeasured states. The fuzzy logic systems are used to approximate the nonlinear system functions, and a fuzzy state observer is designed to estimate the unmeasured states. By utilizing the fuzzy state observer, and combining the adaptive backstepping technique with adaptive fuzzy control design, an observer-based adaptive fuzzy output-feedback control approach is developed. It is proved that the proposed control approach can guarantee that all the signals in the closed-loop system are semi-globally uniformly ultimately bounded (SUUB), and both observer error and tracking error can converge to a small neighborhood of the origin. Two simulations are included to illustrate the effectiveness of the proposed approach.

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

backlash-like hysteresis
backstepping design
stability analysis


Convex linear T-S functions: A generalization of Frank's equation The main purpose of this paper is to solve the functional equation T + lambda S = Min + lambda Max, for 0 <= lambda <= infinity and a pair (T, S) of a t-norm T and a t-conorm S. This equation arises when we consider a convex linear combination of a t-norm and a t-conorm, and set out the problem of finding the intersection of the segments determined by the pairs (Min, Max) and (T, S). (C) 2013 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 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

aggregation function
associativity
frank's equation
copula
dual copula
triangular norm
triangular conorm


TTDD: Two-tier data dissemination in large-scale wireless sensor networks Sink mobility brings new challenges to data dissemination in large sensor networks. It suggests that information about each mobile sink's location be continuously propagated throughout the sensor field in order to keep all sensors informed of the direction of forwarding future data reports. Unfortunately, frequent location updates from multiple sinks can lead to both excessive drain of sensors' limited battery supply and increased collisions in wireless transmissions. In this paper, we describe TTDD, a Two-Tier Data Dissemination approach that provides scalable and efficient data delivery to multiple, mobile sinks. Each data source in TTDD proactively constructs a grid structure, which enables mobile sinks to continuously receive data on the move by flooding queries within a local cell only. TTDD's design exploits the fact that sensors are stationary and location-aware to construct and maintain the grid infrastructure with low overhead. We evaluate TTDD through both analysis and extensive simulations. Our results show that TTDD handles sink mobility effectively with performance comparable with that of stationary sinks.

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

sensor network
mobile sink
two-tier
model


CAD/CAM bilateral ear prostheses construction for Treacher Collins syndrome patients using laser scanning and rapid prototyping Ear defects in patients affected by Treacher Collins syndrome necessitate the replacement of the existing anatomic residuals of the ears with custom-made prostheses. This paper describes a multidisciplinary protocol involving both medicine and computer-aided design/computer-aided manufacturing for manufacturing ear prostheses. Using innovative prototyping technologies together with conventional silicone processing procedures, a step-by-step procedure is presented. The complete workflow includes laser scanning of the defective regions of a patient's face, the use of 3D anatomic models from an ear digital library and rapid prototyping of both substructures for bar anchoring and moulds for silicone processing.

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

treacher collins syndrome
ear prostheses
rapid prototyping

maxillofacial rehabilitation
reverse engineering
computer-aided design


AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING A substring w[i..j] in w is called a repetition of period p if w[k] - w[k + p] for any i <= k <= j - p. Especially, a maximal repetition, which cannot be extended neither to left nor to right, is called a run.The ratio of the length of the run to its period, i.e. j-i+1/p, is called an exponent. The sum of exponents of runs in a string is of interest. The maximal value of the sum is still unknown, and the current upper bound is 2:9n given by Crochemore and Ilie, where n is the length of a string. In this paper we show a closed formula which exactly expresses the average value of it for any n and any alphabet size, and the limit of this value per unit length as n approaches infinity. For binary strings, the limit value is approximately 1.13103. We also show the average number of squares in a string of length n and its limit value.

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


Piecewise constructions of bent and almost optimal Boolean functions The first aim of this work was to generalize the techniques used in MacWilliams' and Sloane's presentation of the Kerdock code and develop a theory of piecewise quadratic Boolean functions. This generalization led us to construct large families of potentially new bent and almost optimal functions from quadratic forms in this piecewise fashion. We show how our motivating example, the Kerdock code, fits into this setting. These constructions were further generalized to non-quadratic bent functions. The resulting constructions design n-variable bent (resp. almost optimal) functions from n-variable bent or almost optimal functions.

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


Paired many-to-many disjoint path covers of hypercubes with faulty edges Let M-k = {u(i), v(i)}(i=1)(k), be a set of k pairs of distinct vertices of the n-dimensional hypercube Q(n) such that it contains k vertices from each class of bipartition of Q(n). Gregor and Dvorak proved that if n > 2k, then there exist k vertex-disjoint paths P-1, P-2,..., P-k. containing all vertices of Q(n), where two end-vertices of P-i are u(i) and v(i) for i = 1, 2,..., k. In this paper we show that the result still holds if removing n - 2k - 1 edges from Q(n). When k = 2, we also show that the result still holds if removing 2n - 7 >= 1 edges from Qn such that every vertex is incident with at least three fault-free edges, and the number 2n - 7 of faulty edges tolerated is sharp. (C) 2011 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 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

hamiltonian path
vertex-disjoint paths
cover
fault tolerance
interconnection networks


Techniques for the segmentation of striation patterns In this contribution, image processing techniques are investigated to robustly segment faint striation patterns from mainly isotropic background areas. Whereas well-known procedures to determine local anisotropy can be applied directly to single images, this paper describes an alternative strategy that uses an illumination series. The series is obtained with a spot illumination whose azimuth is varied systematically. The technique is based on the characteristics of the local contrast with respect to the azimuth of the illumination: Whereas pronounced maxima of the local contrast can be observed when the striae are illuminated perpendicularly, an isotropic background texture shows less distinct maxima for random azimuth angles. The qualification of the approach is demonstrated on the segmentation of faint tool marks in forensic science. Experimental results show that the methodology ensures the correct segmentation of such marks.

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

forensic science
illumination series
striation patterns

anisotropy analysis
image fusion
oriented patterns


An exact algorithm for the capacitated vertex p p -center problem We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the facility to which it is assigned (capacitated p-center). The algorithm iteratively sets a maximum distance value within which it tries to assign all clients, and thus solves bin-packing or capacitated concentrator location subproblems using off-the-shelf optimization software. Computational experiments yield promising results.

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

integer programming
capacitated p-center problem
facility location


A CPUGPU framework for optimizing the quality of large meshes The development of a framework to optimize tetrahedral meshes in parallel. A proposal of a family of local topology operators that improve the mesh quality. An implementation of a non-Laplacian smoothing method on the GPU. A scheduling algorithm for processing and updating mesh structures in parallel.

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


An empirical study on the efficiency of different design pattern representations in UML class diagrams Design patterns are recognized in the software engineering community as useful solutions to recurring design problems that improve the quality of programs. They are more and more used by developers in the design and implementation of their programs. Therefore, the visualization of the design patterns used in a program could be useful to efficiently understand how it works. Currently, a common representation to visualize design patterns is the UML collaboration notation. Previous work noticed some limitations in the UML representation and proposed new representations to tackle these limitations. However, none of these pieces of work conducted empirical studies to compare their new representations with the UML representation. We designed and conducted an empirical study to collect data on the performance of developers on basic tasks related to design pattern comprehension (i.e., identifying composition, role, participation) to evaluate the impact of three visual representations and to compare them with the UML one. We used eye-trackers to measure the developers effort during the execution of the study. Collected data and their analyses show that stereotype-enhanced UML diagrams are more efficient for identifying composition and role than the UML collaboration notation. The UML representation and the pattern-enhanced class diagrams are more efficient for locating the classes participating in a design pattern (i.e., identifying participation).

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

design patterns
visualization
empirical study
uml class diagrams


Hierarchical representation of complex systems for supporting human decision making The work presented in this paper is devoted to intelligent on-line supervision tools. In the proposed approach, the human operator remains in the decision loop, at the highest level, and acts on the process. To help operators make decisions, process knowledge is represented with a model whose complexity can be adapted on line to the operation needs at the request of the operator. The model thus helps to focus only on the phenomena that are relevant at a given time. To give the model explanatory capacity, it is represented as a causal directed graph, and allows the representation of temporal phenomena, which is fundamental for dynamic monitoring. A hierarchical representation of the functional properties of the process is proposed. The conception of a hierarchy of causal models with a top-down analysis is discussed. Path algebra is used to construct a higher-level graph on-line at the request of the operator from the most detailed graph, while conserving the semantics of the latter. No intermediate level is defined a priori; only the highest and lowest level graphs are fixed: the others are constructed dynamically. Finally, a study of how graphs can convey information on the dynamics of the process for approximate temporal reasoning that is largely sufficient for supervision purposes is analyzed. An example of a causal graph hierarchy for a nuclear process illustrates the method. As a final point, the use of such causal graphs in advanced industrial supervision tools is considered.

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

operation support
causal modeling
graph theory
hierarchical modeling


user term feedback in interactive text-based image retrieval To alleviate the vocabulary problem, this paper investigates the role of user term feedback in interactive text-based image retrieval. Term feedback refers to the feedback from a user on specific terms regarding their relevance to a target image. Previous studies have indicated the effectiveness of term feedback in interactive text retrieval [14]. However, the term feedback has not shown to be effective in our experiments on text-based image retrieval. Our results indicate that, although term feedback has a positive effect by allowing users to identify more relevant terms, it also has a strong negative effect by providing more opportunities for users to specify irrelevant terms. To understand these different effects and their implications on the potential of term feedback, this paper further presents analysis of important factors that contribute to the utility of term feedback and discusses the outlook of term feedback in interactive text-based image retrieval.

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

interactive image retrieval
text-based image retrieval


Effect of complexity in an oscillatory neural network - Relation to human-like reasoning Several experimental findings suggest that synchronization or coherence of neuronal firings may play an important role in information processing in the brain. This led to the study of phase and frequency segmentation in ''temporal-coding'' systems including coupled oscillator systems or oscillatory neural networks. Functionally, such systems differ from conventional (non-temporal) neural networks in that, in addition to spatial activation pattern as in conventional neural networks, they provide various temporal patterns which can be considered as additional means to code information. For example, they are expected to have the capacity of performing symbolic inferences. In this paper, spatiotemporal aspect of a class of oscillatory neural networks is examined in relation to graph-theoretic characteristics. It was observed that as the number of oscillators increases, the system provides various types of solutions resembling human response to complex input. For example, the model qualitatively reproduces human response time characteristic in a class of visual search experiment. Application of the phenomena to human-like reasoning is examined.

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

psychology
graph theory
conjunction search
oscillation
attention
clustering
approximate reasoning


Clustering Music Recordings Based on Genres Existing systems for automatic genre classification follows a supervised framework that extracts genre-specific information from manually-labeled music data and then identifies unknown music data. However, such systems may not be suitable for personal music management, because manually labeling music based on individually-defined genres can be labor intensive and subject to inconsistence from time to time. In this paper, we study an unsupervised paradigm for music genre classification. It is aimed to partition a collection of unknown music recordings into several clusters such that each cluster contains recordings in only one genre, and different clusters represent different genres. This enables users to organize their personal music database without needing specific knowledge about genre. This study investigates how to measure the genre similarities between music recordings and estimate the number of genres in a music collection. Our experiment results show the feasibility of clustering music recordings by genre.

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

purity
rand index
supervised classification
unsupervised clustering


Evaluating students' answerscripts using vague values It is obvious that education institutions must provide students with the evaluation reports regarding their test/examination as sufficient as possible and with the unavoidable error as small as possible. In this paper, we present a new method for evaluating students' answerscripts using vague values, where the evaluating marks awarded to the questions in the students' answerscripts are represented by vague values. The vague mark awarded to each question of a student's answerscript can be regarded as a vague set, where each element in the universe of discourse belonging to the vague set is represented by a vague value. An index of optimism lambda determined by the evaluator is used to indicate the degree of optimism of the evaluator, where lambda is an element of [0,1]. The larger the value of lambda, the more optimistic the evaluator. The smaller the value of lambda, the more pessimistic the evaluator. The proposed method can evaluate students' answerscripts in a more flexible and more intelligent manner.

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

vague sets
vague grade sheets
generalized vague grade sheets
letter grades
fuzzy sets


INTERNATIONAL MIGRATION AS A DYNAMIC PROCESS Structures a model of the macrodynamics of international migration using a differential equation to capture the push-pull forces that propel the migratory current. The model's architecture is based on the functioning of information feedback between settled friends and family at the destination (migrant stock) and a pool of potential emigrants created by socioeconomic conditions prevailing at the origin. The intensity of the ensuing migratory flow is determined by a nexus of mediators functioning in either society and comprising: (a) legal imperatives such as migration laws; (b) economic imperatives measured by the ratio of income-per-capita between destination and origin; (c) political imperatives such as war or other forms of compulsion; (d) natural stimulants such as epidemics and climatic extremes; (e) societal conditions such as job-hierarchy differences and migration network characteristics; and (f) causes other than the ones motivating the pool members, such as the reasons of the so called ''brain drain''. The mathematical function representing the collective of these causes is named the mediating factor, and comprises both steady-state and transient components. While the model's architecture is independent of any geographic or temporal specificity, the model is capable of portraying the migration flow between any given origin/destination pair, and over any designated historical period: this through the numerical values of the model parameters derived from the historical, demographic, and economic data of the case. Two specific paradigms serve to demonstrate the model's tenets and pertinence.

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


A secure cryptosystem based on affine transformation In this paper, it is proved that Lin et al.'s scheme that tried to strengthen the Hill cipher against the known-plaintext attack has several security flaws and is vulnerable to the chosen-ciphertext attack. This paper also introduces a secure and efficient symmetric cryptosystem based on affine transformation. The proposed cryptosystem includes an encryption algorithm that is an improved variant of the Affine Hill cipher, and two cryptographic protocols that are introduced for the proposed cryptosystem. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

symmetric cryptosystem
affine hill cipher
cryptographic protocols


Dynamic response and time-frequency analysis for gear tooth crack detection Time-varying gear mesh stiffness was investigated for different crack cases. The frequency response functions of the gear model were derived for healthy and faulty cases. Dynamic simulation was performed to study the dynamic response for all studied cases. A new approach involving a short-time Fourier transform was applied for gear fault detection. The proposed method shows promising results for gear crack detection and size estimation.

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

gear dynamic modelling
vibration analysis
short-time fourier transform


A content search system considering the activity and context of a mobile user People routinely carry mobile devices in their daily lives and obtain a variety of information from the Internet in many different situations. In searching for information (content) with a mobile device, a users activity (e.g., moving or stationary) and context (e.g., commuting in the morning or going downtown in the evening) often change, and such changes can affect the users degree of concentration on his or her mobile devices display and information needs. Therefore, a search system should provide the user with an amount of information suitable for the current activity and a type of information suitable for the current context. In this study, we present the design and implementation of a content search system that considers a mobile users activity and context, with the goal of reducing the users operation load for content search. The proposed system switches between two kinds of content search systems according to the users activity: the location-based content search system is activated when the user is stationary (e.g., standing and sitting), while a menu-based content search system is activated when the user is moving (e.g., walking). Both systems present information according to user context. The location-based system presents detailed information via menus and a map according to location-based categories. The menu-based system presents only a few options to enable users to get content easily. Through user experiments, we confirmed that participants could get desired information more easily with this system than with a commercial search system.

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

context awareness
mobile information access


Geometric modeling of fluted cutters Geometries of cutting tools are usually represented by two-dimensional models. This paper outlines the construction of detailed computer aided design models for a variety of fluted cutters that includes slab mills, end mills, and drills; and establishes a new three-dimensional definition for the geometry of fluted cutters in terms of biparametric surface patches. This work presents unified models of both plain and helical slab mills, end mills (with different end geometries), and drills (with a variety of point styles). The surfaces meant for cutting operations, known as flutes, are modeled as helicoidal surfaces. To model the flutes, sectional geometry of tip-to-tip is developed and then it is swept according to a sweeping rule, determined by the type of the cutter under consideration. The slab mill consists of flutes and two planar end surfaces, while the end mills and drills have shanks and end geometries also (in addition to the flutes). The geometric models of shank and end geometries are separately developed. The transitional surfaces of these cutters are modeled as bicubic Bezier surfaces or biparametric sweep surfaces. The proposed models employ a novel nomenclature that defines the form of cutting tools in terms of three-dimensional rotational angles. The relations required to map the proposed three-dimensional angles to conventional angles (forward mapping) and their reverse relations (inverse mapping) are also developed for all three types of fluted cutters. The new paradigm offers immense technological advantages in terms of numerous downstream applications.

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

geometric modeling
fluted cutters
slab mills
end mills
drills


impediments to general purpose content based image search Challenges faced by prevailing text metadata paradigms for online image search have inspired overwhelming research in Content Based Image Retrieval (CBIR). A multitude of approaches have been introduced within the literature, yet relatively few image search engines have been made publicly available on the web. Aside from challenges facing the user, such as describing a visual query using keywords, or finding an appropriate example image to initiate a visual search, all systems must inevitably grapple with the sensory and semantic gaps [Smeulders et al. 2000], which essentially represent a loss of information in the abstraction process. In this work, we challenge commonly suggested approaches to improving CBIR and illustrate drawbacks of relying on textual data, as well as visual data, in general CBIR search. We provide cogent examples using online visual search engines Behold, Tiltomo Beta, Pixilimar, and Riya Beta. These examples demonstrate the effect of semantic ambiguities in natural language, which extend to search terms and text tags.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 similarity
information retrieval
semantic gap
image processing
computer vision
image analysis


Receiver design for the uplink of base station cooperation systems employing SC-FDE modulations The presented paper considers the uplink transmission in base station (BS) cooperation schemes where mobile terminals (MTs) in adjacent cells share the same physical channel. We consider single-carrier with frequency-domain equalization (SC-FDE) combined with iterative frequency-domain receivers based on the iterative block decision feedback equalization (IB-DFE). We study the quantization requirements when sending the received signals, from different MTs, at different BSs to a central unit that performs the separation of different MTs using iterative frequency-domain receivers. Our performance results show that a relatively coarse quantization, with only 4 bits in the in-phase and quadrature components of the complex envelope already allows close-to-optimum macro-diversity gains, as well as an efficient separation of the transmitted signals associated with each MT.

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


A generalized finite-difference time-domain quantum method for the N N -body interacting Hamiltonian The Quantum Finite-Difference Time-Domain (FDTD-Q) method is a numerical method for solving the time evolution of the Schrdinger equation. It can be applied to systems of interacting particles, allowing for realistic simulations of quantum mechanics of various experimental systems. One of the drawbacks of the method is that divergences in the numerical evolution occur rather easily in the presence of interactions, which necessitates a large number of evolution steps or imaginary time evolution. We present a generalized (GFDTD-Q) method for solving the time-dependent Schrdinger equation including interactions between the particles. The new scheme provides a more relaxed condition for stability when the finite difference approximations for spatial derivatives are employed, as compared with the original FDTD-Q scheme. We demonstrate our scheme by simulating the time evolution of a two-particle interaction Hamiltonian. Our results show that the generalized method allows for stable time evolutions, in contrast to the original FDTD-Q scheme which produces a divergent solution.

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

finite-difference time-domain quantum
time dependent schrdinger equation
mott insulator
hubbard model


Complexity Control of H.264/AVC Based on Mode-Conditional Cost Probability Distributions A computational complexity control algorithm is proposed for an H.264 encoder running on a processor/power constrained platform. This new computational complexity control algorithm is based on a macroblock mode prediction algorithm that employs a Bayesian framework for accurate early skip decision. Complexity control is achieved by relaxing the Bayesian maximum-likelihood (ML) criterion in order to match the mode decision threshold to a target complexity level. A feedback algorithm is used to maintain the performance of the algorithm with respect to achieving an average target complexity level, reducing frame by frame complexity variance and optimizing rate-distortion performance. Experimental results show that this algorithm can effectively, control the encoding computational complexity while maintaining a good rate-distortion performance at a range of target complexity levels.

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


An international health and nursing informatics module for distance education This paper describes why a module about health and nursing informatics is a necessary component for nursing education. Several developments in society and health care force health providers to manage the large amount of health data adequately. A module about health and nursing informatics was developed in international cooperation by three schools of nursing from Germany, The Netherlands and the UK. The content and learning activities of the realized example module for distance learning are described. Future plans include making this course material available in different languages on the World Wide Web.

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

nursing informatics
nursing education
health


A reference model for customer-centric data mining with support vector machines Supervised classification is an important part of corporate data mining to support decision making in customer-centric planning tasks. The paper proposes a hierarchical reference model for support vector machine based classification within this discipline. The approach balances the conflicting goals of transparent yet accurate models and compares favourably to alternative classifiers in a large-scale empirical evaluation in real-world customer relationship management applications. Recent advances in support vector machine oriented research are incorporated to approach feature, instance and model selection in a unified framework.

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

data mining
customer relationship management
support vector machines


DOES INFORMATION TECHNOLOGY INVESTMENT INFLUENCE A FIRM'S MARKET VALUE? A CASE OF NON-PUBLICLY TRADED HEALTHCARE FIRMS Managers make informed information technology investment decisions when they are able to quantify how IT contributes to firm performance. While financial accounting measures inform IT's influence on retrospective firm performance, senior managers expect evidence of how IT influences prospective measures such as the firm's market value. We examine the efficacy of IT's influence on firm value combined with measures of financial performance for non-publicly traded (NPT) hospitals that lack conventional market-based measures. We gathered actual sale transactions for NPT hospitals in the United States to derive the q ratio, a measure of market value. Our findings indicate that the influence of IT investment on the firm is more pronounced and statistically significant on firm value than exclusively on the accounting performance measures. Specifically, we find that the impact of IT investment is not significant on return on assets (ROA) and operating income for the same set of hospitals. This research note contributes to research and practice by demonstrating that the overall impact of IT is better understood when accounting measures are complemented with the firm's market value. Such market valuation is also critical in merger and acquisition decisions, an activity that is likely to accelerate in the healthcare industry. Our findings provide hospitals, as well as other NPT firms, with insights into the impact of IT investment and a pragmatic approach to demonstrating IT's contribution to firm value.

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

it payoff
firm valuation
non-publicly traded hospitals
health care


The school bus routing problem: A review This paper aims to provide a comprehensive review of the school bus routing problem (SBRP). SBRP seeks to plan an efficient schedule for a fleet of school buses where each bus picks up students from various bus stops and delivers them to their designated schools while satisfying various constraints such as the maximum capacity of a bus, the maximum riding time of a student in a bus, and the time window of a school. This class of problem consists of different sub-problems involving data preparation, bus stop selection, bus route generation, school bell time adjustment, and bus scheduling. In this paper, the various assumptions, constraints, and solution methods used in the literature on SBRP are summarized. A list of issues requiring further research is also presented.

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

combinatorial optimization
literature survey
vehicle routing problem


isometric embedding by surface reconstruction from distances To display the intuitive meaning of an abstract metric it is helpful to look on an embedded surface with the same inner geometry as the given metric. The resulting partial differential equations have no standard solution. Only for some special cases satisfactory methods are known. I present a new algorithmic approach which is not based on differential equations. In contrast to other methods this technique also works if the embedding exists only locally. The fundamental idea is to estimate Euclidean distances, from which the surface is built up. In this paper I focus on the reconstruction of a surface from these estimated distances. Particular the influence of a perturbation of the distances on the shape of the resulting surface is investigated.

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


A sample-based hierarchical adaptive K-means clustering method for large-scale video retrieval The multilevel random sampling strategy is employed to handle large datasets. The adaptive K-means algorithm is utilized to improve the quality of clusters. The fast label scheme is used to assign data to the closest cluster efficiently.

O O O O O O O O O O O O O O O O O O O O O O O O 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 clustering
k-means algorithm
pattern recognition
content-based video copy detection
large-scale data


Feature-oriented engineering of PBX software for adaptability and reuseability Incorporating a high level of adaptability and reusability into software is one challenge that all software engineers face. PBX (Private Branch Exchange) is one such system that requires a high level of adaptability and reusability because of rapidly expanding service features, ever changing communication technology, continuously evolving standards and diverse communication laws and standards in different countries. The software engineering community has made various efforts to address the problem of enhancing software adaptability and reusability. As a result, many programming concepts, such as information hiding, encapsulation, object orientation, abstract data type and modularization, have been developed. Although adequate application of these principles requires the domain or program family perspective, most methods, so far, have been oriented toward developing a single application. FORM (Feature-Oriented Reuse Method), the domain-based software reuse method applied in this paper, concentrates on analyzing and modeling commonalities and differences in applications of a given domain and using the analysis results to develop domain-oriented architectures and software components. The model that captures commonalities and differences is called the 'feature model' and it is used for both the engineering of reusable domain artifacts and the development of actual application software with reusable artifacts. We found that FORM facilitates analysis of variability, as well as commonality, of software before the start of engineering and implementation. With this understanding, adaptability and reusability can be built into software. Also, feature modeling has been found to be an effective method for identifying objects. Copyright (C) 1999 John Whey & Sons, Ltd.

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

feature model
adaptability and reusability

feature-orientation
object-orientation
domain engineering
application engineering
reference architecture


efficient state classification of finite state markov chains This paper presents an efficient method for state classification of finite state Markov chains using BDD-based symbolic techniques. The method exploits the fundamental properties of a Markov chain and classifies the state space by iteratively applying reachability analysis. We compare our method with the current state-of-the-art technique which requires the computation of the transitive closure of the transition relation of a Markov chain. Experiments in over a dozen synchronous and asynchronous systems demonstrate that our method dramatically reduces the CPU time needed, and solves much larger problems because of reduced memory requiremen ts.

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

guided search
verification
model checking


Data Aggregation Using Dynamic Selection of Aggregation Points Based on RSSI for Wireless Sensor Networks In wireless sensor networks (WSNs), due to dense deployment, sensory data gathered by sensor nodes in close proximity tend to exhibit high correlation and therefore redundant. Transmitting such redundant data is not practical in the energy-constrained WSNs. Data aggregation offers a key solution to reduce such redundancy by allowing intermediate nodes to aggregate raw data streams before routing them toward a sink node. This in turn reduces transmission energy consumption. Prior work in data aggregation often rely on nodes location for selecting an aggregator node, a fusion point. In this work, we propose two data aggregation mechanisms where aggregator nodes are determined opportunistically without dependency on global knowledge of data flow, network topology and nodes geographical location. These mechanisms aggregate and route data packets based on Received Signal Strength Indicator (RSSI). An aggregation identification (Agg_ID) is associated with each data packet generated by a sensor node. The RSSI and Agg_ID are used in the RSSI-Based Fowarding for favoring nodes closer to sink to be an aggregator and also a relay node. We show via simulation the performance of the proposed mechanisms in terms of normalized number of transmissions, total number of packets transmissions and receptions, average energy consumed per data packet, network lifetime, end-to-end delay and packet loss probability.

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


using bi-modal alignment and clustering techniques for documents and speech thematic segmentations In this paper, we describe a new method for a simultaneous thematic segmentation of the meeting dialogs and the documents discussed or visible throughout the meeting. This bi-modal method is suitable for multimodal applications that are centered on documents, such as meetings and lectures, where documents can be aligned with meeting dialogs. Bringing into play this alignment, our bi-modal segmentation method first transforms its results into a set of nodes in a 2D graph space, where the two axes represent respectively the document units and the meeting dialogs units. Secondly, via a clustering method, the most connected regions in the constituted bi-graph are detected. Finally, the denser clusters are projected on the two axes. The two sequences of segments, obtained on both axes, represent the thematic structure of the document and of the meeting dialogs respectively. We present in this article this bi-modal segmentation technique and its performance compared with two mono-modal segmentation methods.

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


A mathematic model for analyzing the influence of different trade modes to the electricity market Purpose - The purpose of this paper is to study the influence of different trade modes on the electricity market. Design/methodology/approach - A linear model between power units' output and their bidding prices is presented and optimal models to minimize the purchase power cost of power grid companies are presented, applying static games and dynamic games, respectively. Then the relation between power generation amount and units' bidding price is settled by using difference methods. In addition, optimization models are established to optimize profits of units at discriminatory bidding or uniform marginal price applying static game and dynamic game. Finally, the economic benefits and fair competition are compared and analyzed. Findings - If impartiality is emphasized, the detailed history bidding information should not be opened. Also, it is fairer but difficult to control units' speculative behavior at uniform marginal price. Research limitations/implications - A supposition has been made that all participants are rational. Practical implications - The paper presents useful advice for improving the trade mode of the electricity market. Originality/value - Power units' bidding models and strategies are presented at discriminatory bidding price or at uniform marginal price applying non- cooperation static game and dynamic game, respectively.

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

prices
discriminatory bidding price
uniform marginal price

game theory
electricity industry
electricity trade mode
non-cooperation game


an approach to generate test cases from use cases The system testing allows to verify the behaviour of the systemunder test and to guarantee the satisfaction of its requirements.This work describes a complete process to generate test casesfrom use cases for web applications. This process also resolves the lacks detected in existing approaches.

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

generation of text cases
functional testing


Model predictive control for in situ bioremediation system This study describes development of a dynamic predictive control system for the in situ bioremediation process. This automated control system not only balances the complex physical, chemical, and biological processes involved in the remediation process, it also minimizes overall cost of the entire remediation process. The control system is on-line, dynamic, and built based on a predictive model. It includes an optimization tool that consists of a simulation model and an optimization function. The numerical simulation model describes the fate and transport of the subsurface contaminants, while the optimization function is a constrained nonlinear function that has been implemented using genetic algorithms. The system was applied to a lab experiment, and tested with data from a real world site. The results indicated that the dynamic, simulation model-based control system can generate an appropriate control strategy and adjust control actions dynamically. This helps to improve efficiencies of the in situ bioremediation process at petroleum-contaminated groundwater systems.

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

genetic algorithm
nonlinear optimization
objective function


Design of abstract domains using first-order logic In this paper we propose a simple framework based on first-order logic, for the design and decomposition of abstract domains for static analysis. An assertion language is chosen that specifies the properties of interest, and abstract domains on that assertion language are defined to be suitably chosen sets of assertions. Composition and decomposition of abstract domains is facilitated by their specification in assertion form. In particular, the operations of reduced product and disjunctive completion are formalized in this framework. Moreover, the notion of (conjunctive) factorization of sets of assertions is introduced, that allows one to decompose domains into 'disjoint' parts. We illustrate the use of this framework by studying typical abstract domains for ground-dependency and sharing analysis in logic programming. (C) 1999 Elsevier Science B.V. All rights reserved.

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


Slope heuristics: overview and implementation Model selection is a general paradigm which includes many statistical problems. One of the most fruitful and popular approaches to carry it out is the minimization of a penalized criterion. Birg, and Massart (Probab. Theory Relat. Fields 138:33-73, 2006) have proposed a promising data-driven method to calibrate such criteria whose penalties are known up to a multiplicative factor: the "slope heuristics". Theoretical works validate this heuristic method in some situations and several papers report a promising practical behavior in various frameworks. The purpose of this work is twofold. First, an introduction to the slope heuristics and an overview of the theoretical and practical results about it are presented. Second, we focus on the practical difficulties occurring for applying the slope heuristics. A new practical approach is carried out and compared to the standard dimension jump method. All the practical solutions discussed in this paper in different frameworks are implemented and brought together in a Matlab graphical user interface called capushe. Supplemental Materials containing further information and an additional application, the capushe package and the datasets presented in this paper, are available on the journal Web site.

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

dimension jump
model selection
slope heuristics

data-driven slope estimation
penalization


Improved parallelism and scheduling in multi-core software routers Recent technological advances in commodity server architectures, with multiple multi-core CPUs, integrated memory controllers, high-speed interconnects, and enhanced network interface cards, provide substantial computational capacity, and thus an attractive platform for packet forwarding. However, to exploit this available capacity, we need a suitable software platform that allows effective parallel packet processing and resource management. In this paper, we at first introduce an improved forwarding architecture for software routers that enhances parallelism by exploiting hardware classification and multi-queue support, already available in recent commodity network interface cards. After evaluating the original scheduling algorithm of the widely-used Click modular router, we propose solutions for extending this scheduler for improved fairness, throughput, and more precise resource management. To illustrate the potential benefits of our proposal, we implement and evaluate a few key elements of our overall design. Finally, we discuss how our improved forwarding architecture and resource management might be applied in virtualized software routers.

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

software-based router
forwarding architectures
parallel processing


Decentralized Detection in Ad hoc Sensor Networks With Low Data Rate Inter Sensor Communication Decentralized binary detection problem in ad-hoc sensor networks where a link between two sensors is on with a certain probability is considered in this paper. We propose a consensus based detection scheme where sensors exchange their local decisions, update their own decisions based on the exchanges and finally reach a consensus about the state of nature. We analyze the error probability and convergence of this decision consensus scheme. We show that with our scheme, the detection performance in ad-hoc networks is asymptotically equivalent to that of a parallel sensor network where all the local decisions are processed by a central node (fusion center) in the sense that the error exponents are the same. The probability distribution of the consensus time is also studied. Simulation and numerical results are given to verify the theoretical results.

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

ad hoc network
consensus problems
low data rate systems
markov chain


Task recognition and person identification in cyclic dance sequences with Multi Factor Tensor analysis In this paper, we present a novel approach to recognize motion styles and identify people using the Multi Factor Tensor (MFT) model. We apply a musical information analysis method in segmenting the motion sequence relevant to the keyposes and the musical rhythm. We define a task model by considering the repeated motion segments, where the motion is decomposed into a person-invariant factor task and a person-dependent factor style. Given the motion data set, we formulate the MFT model, factorize it efficiently in different modes, and use it in recognizing the tasks and the identities of the persons performing the tasks. We capture the motion data of different people for a few cycles, segment it using the musical analysis approach, normalize the segments using a vectorization method, and realize our MFT model. In our experiments, Japanese traditional dance sequences performed by several people are used. Provided with an unknown motion segment which is to be probed and which was performed at a different time in the time space, we first normalize the motion segment and flatten our MFT model appropriately, then recognize the task and the identity of the person. We follow two approaches in conducting our experiments. In one experiment, we recognize the tasks and the styles by maximizing a function in the tensor subdomain, and in the next experiment, we use a function value in the tensorial subdomain with a threshold for recognition. Interestingly, unlike the first experiment, we are capable of recognizing tasks and human identities that were not known beforehand. We conducted various experiments to evaluate the potential of the recognition ability of our proposed approaches, and the results demonstrate the high accuracy of our model.

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


using ghost edges for classification in sparsely labeled networks We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical relational learning have been shown to perform well on network classification tasks by exploiting dependencies between class labels of neighboring nodes. However, relational classifiers can fail when unlabeled nodes have too few labeled neighbors to support learning (during training phase) and/or inference (during testing phase). This situation arises in real-world problems when observed labels are sparse. In this paper, we propose a novel approach to within-network classification that combines aspects of statistical relational learning and semi-supervised learning to improve classification performance in sparse networks. Our approach works by adding "ghost edges" to a network, which enable the flow of information from labeled to unlabeled nodes. Through experiments on real-world data sets, we demonstrate that our approach performs well across a range of conditions where existing approaches, such as collective classification and semi-supervised learning, fail. On all tasks, our approach improves area under the ROC curve (AUC) by up to 15 points over existing approaches. Furthermore, we demonstrate that our approach runs in time proportional to L E , where L is the number of labeled nodes and E is the number of edges.

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

statistical relational learning
collective classification


Network Anomaly Detection Based on Wavelet Fuzzy Neural Network with Modified QPSO This paper proposes a novel network anomaly detection method employing wavelet fuzzy neural network (WFNN) to use modified Quantum-Behaved Particle Swarm Optimization (QPSO). In this paper, wavelet transform is applied to extract fault characteristics from the anomaly state. Fuzzy theory and neural network are employed to fuzzify the extracted information. Wavelet is then integrated with fuzzy neural network to form the wavelet fuzzy neural network (WFNN). The Quantum-Behaved Particle Swarm Optimization proposed by Jun Sun, which outperforms the other optimization algorithm considerably on its simple architecture and fast convergence, has previously applied to solve the optimum problem. However, the QPSO also has its own shortcomings. In QPSO if a particle flew off the boundary (the search area), the algorithm usually would regard the position value of the particle as the value of the boundary. If the boundary is at the position of local optimum, the particles were trapped into local optimum easily. It is impossible for them to arrive at the global optimum. With the increase of particle, the diversity of swam would be declined and the global search quality of the algorithm would be also declined. In the modified algorithm, it shows that the particles field off the boundary were distributed in the c*r and () search space. The diversity of swam and the global search quality would be enhanced. So there exists a modified QPSO which is employed to train WFNN in this paper. We have demonstrated performance comparisons to QPSO-WFNN, PSO-WFNN using the same data set extracts from the KDD99 Datasets, and the results have shown that the MQPSO-WFNN model exhibits superior performance with a higher attack detection rate and lower false positive rate. Experiments with KDD Cup 1999 connection traffic data have shown that this model is able to effectively detect intrusive behaviors. It also shows the remarkable ability of our IDS to detect new type of attacks.

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

quantum-behaved particle swarm optimization


ontology matching using vector space Interoperability of heterogeneous systems on the Web will be achieved through an agreement between the underlying ontologies. Ontology matching is an operation that takes two ontologies and determines their semantic mapping. This paper presents a method of ontology matching which is based on modeling ontologies in a vector space and estimating their similarity degree by matching their concept vectors. The proposed method is successfully applied to the test suit of Ontology Alignment Evaluation Initiative 2005 [10] and compared to the results reported by other methods. In terms of precision and recall, the results look promising.

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


Response to thermal and physical strain during flashover training in Croatian firefighters Flashover training (FOT) induced a mild physiological cardiovascular response. More than 25% FOT attendees were obese. Elevated basal blood pressure was found in >50% FOT attendees. Croatian firefighters need to improve their physical fitness.

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

cardiac strain
arterial blood pressure
body mass index


Materialized In-Network View for spatial aggregation queries in wireless sensor network Wireless sensor networks composed of battery-powered sensor nodes are invaluable instruments for remote environment sensing. For sensor network applications, sensed readings are often collected in the form of aggregated data from a portion of a sensor network as requested by spatial aggregation queries. In a large distributed sensor network, queries can be issued from various locations at any time. Existing in-network query execution techniques execute queries independently that considerably overconsumes the precious energy of sensor nodes. As a result, the lifespan of a sensor network is inevitably shortened. In this paper, we propose a Materialized In-Network View (MINV) framework that precalculates aggregated data from clusters of sensor nodes as intermediate query results preserved in the network and made ready for queries. The executions of queries are performed as simple collections of these aggregated data. Thus, the quantities and sizes of messages transmitted among sensor nodes can be greatly reduced, thus prolonging the lifetime of a sensor network. Through extensive simulations, the effectiveness of our proposed framework is validated.

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

spatial aggregation query
materialized view


A systematic approach for the development of porous concrete based on axiomatic design theory This paper presents a design framework developed using axiomatic design (AD) theory that can be applied in the design process of porous concrete. The main contribution of this paper is the definition of an AD framework based on the needs and functional requirements of porous concrete. The framework shows how AD theory can be used to provide guidelines for proportioning and manufacturing porous concrete. The advantage of the AD approach is that it systemizes the way to decouple design parameters and makes designers to think rationally between what we want to achieve and how we propose to satisfy the functional requirements of porous concrete. In this paper, test results of laboratory-size porous concrete specimens under compression were analyzed to evaluate the performance of the porous concrete based on the desired functional requirements.

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

axiomatic design
porous concrete
functional requirements
design parameters


MRI breast cancer diagnosis hybrid approach using adaptive ant-based segmentation and multilayer perceptron neural networks classifier Proposed a hybrid algorithm to classify the breast cancer images into two outcomes: Benign or Malignant. An improved version of the classical ant-based clustering algorithm to segment the region of interest of breast images. The overall accuracy offered by the employed hybrid technique confirms that the effectiveness and performance of the proposed hybrid system is high.

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

magnetic resonance (mr) images
ant colony optimization (aco)
swarm intelligence
neural network classifier


Performance evaluation of data aggregation for cluster-based wireless sensor network In wireless sensor network, data fusion is considered an essential process for preserving sensor energy. Periodic data sampling leads to enormous collection of raw facts, the transmission of which would rapidly deplete the sensor power. In this paper, we have performed data aggregation on the basis of entropy of the sensors. The entropy is computed from the proposed local and global probability models. The models provide assistance in extracting high precision data from the sensor nodes. We have also proposed an energy efficient method for clustering the nodes in the network. Initially, sensors sensing the same category of data are placed within a distinct cluster. The remaining unclustered sensors estimate their divergence with respect to the clustered neighbors and ultimately join the least-divergent cluster. The overall performance of our proposed methods is evaluated using NS-2 simulator in terms of convergence rate, aggregation cycles, average packet drops, transmission cost and network lifetime. Finally, the simulation results establish the validity and efficiency of our approach.

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

divergence clustering
entropy-based data aggregation
local and global aggregation


very fast lr parsing LR parsers can be made to run 6 to 10 times as fast as the best table-interpretive LR parsers. The resulting parse time is negligible compared to the time required by the remainder of a typical compiler containing the parser. A parsing speed of 1/2 million lines per minute on a computer similar to a VAX 11/780 was achieved, up from an interpretive speed of 40,000 lines per minute. A speed of 240,000 lines per minute on an Intel 80286 was achieved, up from an interpretive speed of 37,000 lines per minute. The improvement is obtained by translating the parser's finite state control into assembly language. States become code memory addresses. The current input symbol resides in a register and a quick sequence of register-constant comparisons determines the next state, which is merely jumped to. The parser's push-down stack is implemented directly on a hardware stack. The stack contains code memory addresses rather than the traditional state numbers. The strongly-connected components of the directed graph induced by the parser's terminal and nonterminal transitions are examined to determine a typically small subset of the states that require parse-time stack-overflow-check code when hardware does not provide the check automatically. The increase in speed is at the expense of space: a factor of 2 to 4 increase in total table size can be expected, depending upon whether syntactic error recovery is required.

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

error recovery
parser
factor
input
space
size
language
code
directed graph
hardware
sequence
control
parsing

terminals transit interpretation computation memorialized compilation assemblers timing component


A new tree structure code for equivalent circuit and evolutionary estimation of parameters To optimize the parameters of electrical elements contained in an equivalent circuit for electrochemical impedance spectroscopy, we proposed a simple, intuitive and universal tree structure code (TSC) to encode an arbitrary complex circuit, then designed a genetic algorithm for parameter optimization (GAPO) to work with the TSC and estimate the parameter values of electrical elements. The GAPO uses a novel crossover operator that performs by the non-convex linear combination of multiple parents and sets up a crossover subspace to enhance the global search. We first examined the effects of some key control parameters in the GAPO on the optimization process by selecting a relatively complex equivalent circuit to generate simulated data and comparing the parameters obtained by GAPO with the original values. Secondly, to examine the effectiveness and robustness of GAPO, we chose a set of simulated data generated by a relatively simple circuit, three sets of real impedance data on modified gold electrodes and a set of real impedance data on the anode of lithium-ion battery to run the GAPO and compared their calculated results with those obtained by complex nonlinear least square method (CNLS) supported by LEVM software. Finally, we compared the effects of five representative weighting strategies on the GAPO based on a set of simulated data generated by a relatively complicated circuit but with up to 10% Gaussian noise and the set of real impedance data on the anode Of lithium-ion battery. All of these experimental results show that the GAPO works more quickly, efficiently and stably than CNLS when optimizing the element parameters. We also found that appropriate weighting strategies can help reduce the effects of experimental errors on GAPO, but the effects really depend on the nature of the specific impedance data. (c) 2006 Elsevier B.V. All rights reserved.

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

tree structure code
equivalent circuit
electrochemical impedance
parameter optimization


Drug-Resistant Tuberculosis This paper summarizes the presentations of the meeting on drug-resistant tuberculosis held in London in March of 2001. Multidrug-resistant tuberculosis (MDR TB) is defined and the causes, risk factors, and recent treatment advances are briefly described. The larger social and economic environment in which MDR TB occurs is discussed.

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

multidrug-resistant tuberculosis
tb cure rates
prisons
tb treatment
dots
dots plus
poverty


Application-Specific Service Technologies for Commodity Operating Systems in Real-Time Environments In order to eliminate the costs of proprietary systems and special purpose hardware, many real-time and embedded computing platforms are being built on commodity operating systems and generic hardware. Unfortunately, many such systems are ill-suited to the low-latency and predictable timing requirements of real-time applications. This article, therefore, focuses on application-specific service technologies for low-cost commodity operating systems and hardware, so that real-time service guarantees can be met. We describe contrasting methods to deploy first-class services on commodity systems that are dispatched with low latency and execute asynchronously according to bounds on CPU, memory, and I/O device usage. Specifically, we present a "user-level sandboxing" (ULS) mechanism that relies on hardware protection to isolate application-specific services from the core kernel. This approach is compared with a hybrid language and runtime protection scheme, called SafeX, that allows untrusted services to be dynamically linked and loaded into a base kernel. SafeX and ULS have been implemented on commodity Linux systems. Experimental results have shown-that both approaches are capable of reducing service violations (and, hence, better qualities of service) for real-time tasks, compared to traditional user-level methods of service deployment in process-private address spaces. ULS imposes minimal additional overheads on service dispatch latency compared to SafeX, with the advantage that it does not require application-specific services to execute in the trusted kernel domain. As evidence of the potential capabilities of ULS, we show how a user-level networking stack can be implemented to avoid data copying via the kernel and allow packet processing without explicit process scheduling. This improves throughput and reduces jitter.

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

design
experimentation
system extensibility
predictability


Foundations of instance level updates in expressive description logics In description logic (DL), ABoxes are used for describing the state of affairs in an application domain. We consider the problem of updating ABoxes when the state changes, assuming that update information is described at an atomic level, i.e., in terms of possibly negated ABox assertions that involve only atomic concepts and roles. We analyze such basic ABox updates in several standard DLs, in particular addressing questions of expressibility and succinctness: can updated ABoxes always be expressed in the DL in which the original ABox was formulated and, if so, what is the size of the updated ABox? It turns out that DLs have to include nominals and the '@' constructor of hybrid logic for updated ABoxes to be expressible, and that this still holds when updated ABoxes are approximated. Moreover, the size of updated ABoxes is exponential in the role depth of the original ABox and the size of the update. We also show that this situation improves when updated ABoxes are allowed to contain additional auxiliary symbols. Then, DLs only need to include nominals for updated ABoxes to exist, and the size of updated ABoxes is polynomial in the size of both the original ABox and the update. (C) 2011 Elsevier B.V. All rights reserved.

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


using uncertainty in reputation methods to enforce cooperation in ad-hoc networks This paper gives an approach to reputation computation that incorporates "uncertainty" based on subjective logic. Uncertainty can arise when a node joins the network and thus has no history, or when a node's behavior changes in a way that is not clearly malicious, but at least suspicious. This uncertainty indicates when a node evaluating the reputation rating of another node should poll its neighbors for recommendations, because its local opinion is not sufficiently well-informed.The uncertainty based algorithm has several parameters and the computed reputation depends on these parameters. To evaluate the effectiveness of the uncertainty based method and to determine the effect of the parameters on the reputation computations, we have implemented a simulation infrastructure for the behavior of ad-hoc networks using the uncertainty based scheme. The simulator can also use other previously proposed mechanisms for reputation computation. The simulator is used to determine optimal parameters for the various schemes and how well each scheme a) ensures cooperative nodes receive service when requested, and b) throttles the ability of free-loading (malicious) nodes to consume service without contributing. The simulations show that the reputation computation that incorporates uncertainty provides superior recognition of "malicious" behavior in a variety of ad-hoc network situations. These initial results are sufficiently promising to motivate continuing study of reputation computations incorporating uncertainty to additional models of malicious behavior and a broader range of network behaviors.

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

cooperation
uncertainty
subjective logic
reputation


Dual mode and miniaturized rectangular dielectric resonator antenna with a simple feeding scheme The objective of this article is to propose a miniaturized rectangular dielectric resonator antenna (RDRA) configuration and dual mode operation using a simple feeding scheme. It demonstrates the potential advantages achieved by choosing a microstrip line feeding mechanism at the edge of the RDRA. Measurement and simulation results are both in good agreement. The fabricated antenna possesses wide impedance bandwidth (BW) of 800 MHz (5.65 to 6.48 GHz) and dimensions of RDRA are 17 7 3 mm3. Measured radiation patterns have linear polarization over the frequency range. By the proposed design, the BW is enhanced more than four times as compared to the conventional way to excite the RDRA by microstrip line. To validate the design, the comparison of published design is discussed. 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:229235, 2015.

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


mining product reputations on the web Knowing the reputations of your own and/or competitors' products is important for marketing and customer relationship management. It is, however, very costly to collect and analyze survey data manually. This paper presents a new framework for mining product reputations on the Internet. It automatically collects people's opinions about target products from Web pages, and it uses text mining techniques to obtain the reputations of those products.On the basis of human-test samples, we generate in advance syntactic and linguistic rules to determine whether any given statement is an opinion or not, as well as whether such any opinion is positive or negative in nature. We first collect statements regarding target products using a general search engine, and then, using the rules, extract opinions from among them and attach three labels to each opinion, labels indicating the positive/negative determination, the product name itself, and an numerical value expressing the degree of system confidence that the statement is, in fact, an opinion. The labeled opinions are then input into an opinion database.The mining of reputations, i.e., the finding of statistically meaningful information included in the database, is then conducted. We specify target categories using label values (such as positive opinions of product A) and perform four types of text mining: extraction of 1) characteristic words, 2) co-occurrence words, 3) typical sentences, for individual target categories, and 4) correspondence analysis among multiple target categories.Actual marketing data is used to demonstrate the validity and effectiveness of the framework, which offers a drastic reduction in the overall cost of reputation analysis over that of conventional survey approaches and supports the discovery of knowledge from the pool of opinions on the web.

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

value
framework
input
survey
text mining
analysis
web
collect
reduction
general
knowledge
paper
management
product
mining
label
values
search engine
extraction
types
data
demonstrate
internet
database
cost
rules
reputation

market
human
validation
informal
posit
relationships
systems
determinism
test
web page
custom
discoveries
linguistics
effect


Optimal piecewise smooth interpolation of experimental data The notions of optimal piecewise smooth interpolation and oscillation of interpolation type are introduced. This notions are used and illustrated on some cubic piecewise smooth interpolation procedures and on some cubic splines. It is obtained a cubic spline of interpolation having minimal quadratic oscillation in average, as an application of the least squares method.

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

piecewise smooth interpolation
oscillation of interpolation type
quadratic oscillation in average


Region and boundary feature estimation on ultrasound images using moment invariants In ultrasound images, tissues are characterized by their speckle texture. Moment-based techniques have proven their ability to capture texture features. However, in ultrasound images, the speckle size increases with the distance from the probe and in some cases the speckle has a concentric texture arrangement. We propose to use moment invariants with respect to image scale and rotation to capture the texture in such cases. Results on synthetic data show that moment invariants are able to characterize the texture but also that some moment orders are sensitive to regions and, moreover, some are sensitive to the boundaries between two different textures. This behavior seems to be very interesting to be used within some segmentation scheme dealing with a combination of regional and boundary information. In this paper we will try to prove the usability of this complementary information in a min-cut/max-flow graph cut scheme.

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

ultrasound images
speckle
moment invariants

texture analysis
min-cut/maw-flow graph cut


Facies recognition using a smoothing process through Fast Independent Component Analysis and Discrete Cosine Transform We apply Independent Component Analysis (ICA) to improve the classification of well-log data based on lithologies. We apply the Discrete Cosine Transform (DCT) to denoise and to smooth the data. The DCT smoothing process helps to increase the success rate of prediction.

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

discrete cosine transform
independent component analysis

automatic classification
reservoir characterization


Spatial transformation of motion and deformation fields using nonrigid registration In this paper, we present a technique that can be used to transform the motion or deformation fields defined in the coordinate system of one subject into the coordinate system of another subject. Such a transformation accounts for the differences in the coordinate systems of the two subjects due to misalignment and size/shape variation, enabling the motion or deformation of each of the subjects to be directly quantitatively and qualitatively compared. The field transformation is performed by using a nonrigid registration algorithm to determine the intersubject coordinate system mapping from the first subject to the second subject. This fixes the relationship between the coordinate systems of the two subjects, and allows us to recover the deformation/motion vectors of the second subject for each corresponding point in the first subject. Since these vectors are still aligned with the coordinate system of the second subject, the inverse of the intersubject coordinate mapping is required to transform these vectors into the coordinate system of the first subject, and we approximate this inverse using a numerical line integral method. The accuracy of our numerical inversion technique is demonstrated using a synthetic example, after which we present applications of our method to sequences of cardiac and brain images.

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

atlas
brain deformation
cardiac motion
conjugate map
diffeomorphism
numerical inverse


Distributed localized bi-objective search A new distributed heuristic approach is designed for approximating the Pareto set of bi-objective optimization problems (DLBS). DLBS is based on parallel cooperative computation, objective space decomposition, and adaptive search. DLBS is studied, experimented, and deployed on a cluster of hundreds of core. The DLBS efficiency is measured in terms of approximation quality, computational time and scalability.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 objective programming
combinatorial optimization
parallel and distributed computing
evolutionary computation