A comparative study of TF*IDF, LSI and multi-words for text classification One of the main themes in text mining is text representation, which is fundamental and indispensable for text-based intellegent information processing. Generally, text representation inludes two tasks: indexing and weighting. This paper has comparatively studied TF*IDF, LSI and multi-word for text representation. We used a Chinese and an English document collection to respectively evaluate the three methods in information retreival and text categorization. Experimental results have demonstrated that in text categorization, LSI has better performance than other methods in both document collections. Also, LSI has produced the best performance in retrieving English documents. This outcome has shown that LSI has both favorable semantic and statistical quality and is different with the claim that LSI can not produce discriminative power for indexing. (C) 2010 Elsevier Ltd. All rights reserved.

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

text representation
lsi
text classification
text categorization


Serotonin controls the maturation of the GABA phenotype in the ventral spinal cord via 5-HT1B receptors Serotonin (5-hydroxytryptamine or 5-HT) is a pleiotropic neurotransmitter known to play a crucial modulating role during the construction of brain circuits. Descending bulbo-spinal 5-HT fibers, coming from the caudal medullary cell groups of the raphe nuclei, progressively invade the mouse spinal cord and arrive at lumbar segments at E15.5 when the number of ventral GABA immunoreactive (GABA-ir) interneurons reaches its maximum. We thus raised the question of a possible interaction between these two neurotransmitter systems and investigated the effect of 5-HT descending inputs on the maturation of the GABA phenotype in ventral spinal interneurons. Using a quantitative anatomical study performed on acute and cultured embryonic mouse spinal cord, we found that the GABAergic neuronal population matured according to a similar rostro-caudal gradient both in utero and in organotypic culture. We showed that 5-HT delayed the maturation of the GABA phenotype in lumbar but not brachial interneurons. Using pharmacological treatments and mice lacking 5-HT1B or 5-HT1A, we demonstrated that the 5-HT repressing effect on the GABAergic phenotype was specifically attributed to 5-HT1B receptors.

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

mouse embryonic development
serotonin receptors
spinal gaba interneurons
raphe descending inputs
transmitter specification


The ability of UK offshore workers of different body size and shape to egress through a restricted window space Up to 75% of successful small window egress outcome is size related. Bideltoid breadth, chest depth and weight combined explain ?70% of egress outcome. 25% or more of egress outcome relates to non-anatomical factors. Predictive testing will inevitably lead to false+ve and ve results. Flexibility and tissue compressibility may also explain successful egress.

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


Interval boundary element method for 2D transient diffusion problem In this paper the description of an unsteady heat transfer for two-dimensional problem is presented. It is assumed that all thermophysical parameters (specific heat, mass density and heat conduction) are given as intervals. The problem discussed has been solved using the 1st scheme of the boundary element method. The interval Gauss elimination method with the decomposition procedure has been applied to solve the obtained interval system of equations. In the final part of the paper the results of numerical computations are shown.

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


Multi-constraint QoS routing using a new single mixed metrics Multi-constraint quality-of-service (QoS) routing has become increasingly important as the Internet evolves to support real-time services. It is well known, however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the most popular. Although mixed metric routing discards potentially useful information, this is compensated for by significant complexity reduction. Exploiting this tradeoff is becoming increasingly important where low complexity designs are desired, such as in battery operated wireless applications. In this paper, novel single mixed metrics for multi-constraint routing are introduced. The proposed techniques have similar complexity compared with existing low complexity methods. Simulation and analytical results are presented which show that it can obtain better performance than comparable techniques in terms of generating feasible routes.

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

multi-constraint routing
quality of service
computer networks


Design of adaptive neural predictor for failure analysis on hip and knee joints of humans Due to recent heart attacks on humans, it is necessary to predict heart graphs of humans during running positions. On the other hand, hip and knee joints should be analyzed to predict walking and running conditions. Therefore, in this experimental works, hip, knee, and heart attacks are analyzed in experimentally. After experimental measurement, a proposed neural network is employed to predict hip, knee, and heart attack behavior of humans with walking and running stages.

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

hip joint
knee joint
artificial neural network
vibration analysis


Transformations of Gaussian Process priors for user matching ? ?? We explore the complementary properties of Kinect sensor and inertial sensors. We describe a GP model to improve the context sensing in proxemic interactions. The model incorporates positions and accelerations in multi-rate sensor fusion. We identify users by matching Kinect skeletons with the sensed data from devices. User matching and identification through people?s everyday movements is feasible.

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

user identification
proxemic interaction
gaussian processes
mobile sensing


Generalization of the thermal model of infrared radiation sensors In many theories and applications, generalized models can give a good head start for further research where the implementation of new elements and/or boundary conditions could become quite complex. In this paper the development of a compact thermal model of an infrared sensor will be presented. This thermal model includes not only the thermal resistances and capacitances of the sensor structure itself but the radiative and convective thermal resistances to the ambience and between the sensor plate and the heat source (thermal transfer impedance) which is important when the heat source and the sensor are in close proximity. Limitations and the applicability of the proposed model are also discussed. We also aim to present how the proposed model can be used for other IR sensor structures as well.

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

thermal modelling
thermal characterization
fir sensors
infrared sensor card
radiative thermal transfer impedance


ultra-succinct representation of ordered trees There exist two well-known succinct representations of ordered trees: BP (balanced parenthesis) [Munro, Raman 2001] and DFUDS (depth first unary degree sequence) [Benoit et al. 2005]. Both have size 2 n + o( n ) bits for n -node trees, which asymptotically matches the information-theoretic lower bound. Many fundamental operations on trees can be done in constant time on word RAM, for example finding the parent, the first child, the next sibling, the number of descendants, etc. However there has been no single representation supporting every existing operation in constant time; BP does not support i -th child, while DFUDS does not support lca (lowest common ancestor). In this paper, we give the first succinct tree representation supporting every one of the fundamental operations previously proposed for BP or DFUDS along with some new operations in constant time. Moreover, its size surpasses the information-theoretic lower bound and matches the entropy of the tree based on the distribution of node degrees. We call this an ultra-succinct data structure. As a consequence, a tree in which every internal node has exactly two children can be represented in n + o( n ) bits. We also show applications for ultra-succinct compressed suffix trees and labeled trees.

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

children
tree
applications
lower bound
entropy
size
trees
support
representation
paper
sequence

examples
intern
data structures
operability
timing
distributed
suffix-tree
informal


Age Synthesis and Estimation via Faces: A Survey Human age, as an important personal trait, can be directly inferred by distinct patterns emerging from the facial appearance. Derived from rapid advances in computer graphics and machine vision, computer-based age synthesis and estimation via faces have become particularly prevalent topics recently because of their explosively emerging real-world applications, such as forensic art, electronic customer relationship management, security control and surveillance monitoring, biometrics, entertainment, and cosmetology. Age synthesis is defined to rerender a face image aesthetically with natural aging and rejuvenating effects on the individual face. Age estimation is defined to label a face image automatically with the exact age (year) or the age group (year range) of the individual face. Because of their particularity and complexity, both problems are attractive yet challenging to computer-based application system designers. Large efforts from both academia and industry have been devoted in the last a few decades. In this paper, we survey the complete state-of-the-art techniques in the face image-based age synthesis and estimation topics. Existing models, popular algorithms, system performances, technical difficulties, popular face aging databases, evaluation protocols, and promising future directions are also provided with systematic discussions.

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

face aging
age estimation
age synthesis
survey


Design of waveguide microwave filters by means of artificial neural networks Cylindrical post-based waveguide filters are a relevant component of antenna feeding networks. Their synthesis performed via automatic optimization based on full-wave analyses can be very time consuming. In this article a novel fast-design approach based on Levy's and Moore's algorithms and an artificial neural network (ANN) architecture is presented. (c) 2006 Wiley Periodicals, Inc. Int J RF and Microwave CAE 16: 554-560, 2006.

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


Online longitudinal survey research - Viability and participation This article explores the viability of conducting longitudinal survey research using, the Internet in samples exposed to trauma. A questionnaire battery assessing psychological adjustment following adverse life experiences was posted online. Participants who signed up to take part in the longitudinal aspect of the study were contacted 3 and 6 months after initial participation to complete the second and third waves of the research. Issues of data screening and sample attrition rates are considered and the demoaraphic profiles and questionnaire scores of those who did and did not take part in the study during successive time points are compared. The results demonstrate that it is possible to conduct repeated measures survey research online and that the similarity in characteristics between those who do and do not take part during successive time points mirrors that found in traditional pencil-and-paper trauma surveys.

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


Analysis of blocking dynamic circuits In order for dynamic circuits to operate correctly, their inputs must be monotonically rising during evaluation. Blocking dynamic circuits satisfy this constraint by delaying evaluation until all inputs have been properly setup relative to the evaluation clock. By viewing dynamic gates as latches, we. demonstrate that the optimal delay of a blocking dynamic gate may occur when the setup time is negative. With blocking dynamic circuits, cascading low-skew dynamic gates allows each dynamic gate to tolerate a degraded input level. The larger noise margin provides greater flexibility with the delay versus noise margin tradeoff (i.e., the circuit robustness versus speed tradeoff). This paper generalizes blocking dynamic circuits and provides a systematic approach for assigning clock phases, given delay and noise margin constraints. Using this framework, one can analyze any logic network consisting of blocking dynamic circuits.

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

blocking evaluation clocks
clock distribution
skew analysis
timing analysis


Understanding social relationship evolution by using real-world sensing data Mobile and pervasive computing technologies enable us to obtain real-world sensing data for sociological studies, such as exploring human behaviors and relationships. In this paper, we present a study of understanding social relationship evolution by using real-life anonymized mobile phone data. First, we define a friendship as a directed relation, i.e., person A regards another person B as his or her friend but not necessarily vice versa. Second, we recognize human friendship from a supervised learning perspective. The Support Vector Machine (SVM) approach is adopted as the inference model to predict friendship based on a variety of features extracted from the mobile phone data, including proximity, outgoing calls, outgoing text messages, incoming calls, and incoming text messages. Third, we demonstrate the social relation evolution process by using the social balance theory. For the friendship prediction, we achieved an overall recognition rate of 97.0 % by number and a class average accuracy of 89.8 %. This shows that social relationships (not only reciprocal friends and non-friends, but non-reciprocal friends) can be likely predicted by using real-world sensing data. With respect to the friendship evolution, we verified that the principles of reciprocality and transitivity play an important role in social relation evolution.

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

social relationship
friendship prediction
friendship evolution


Role of Integrated Photonics Technologies in the Realization of Terabit Nodes [Invited] It is widely recognized that in the new generation of photonic terabit packet routers optical integrated circuits will play a fundamental role for minimizing the cost of ownership, footprint, and power consumption of high-speed photonic interfaces. We review the present and future technologies for optical packet router architectures and the specific applications for photonic integrated circuits. Three technologies are today used for implementing optical integration: (a) monolithic InP integration allows all passive and active functions to be performed on the same chip with a minimum footprint but can raise issues of yield and scalability in bit rate; (b) hybrid InP/Si, in which the only functionality left to InP is the emitter, provides moderate yield performances but good results in terms of footprint and scalability in bit rate; (c) hybrid InP/silica, in which all active functionalities are performed in InP and all the passive in silica, is very well performing in terms of yield but has a large footprint and limited scalability in bit rate, which could be a limitation in certain applications.

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

integrated optics
monolithic integrated circuits
hybrid integrated circuits
silicon-on-insulator technology
semiconductor lasers
photodetectors


Analysis of simulation models with fuzzy graph based metamodeling The analysis of complex simulation models using so-called metamodels offers reduced complexity and an understandable representation. In this paper we present an efficient algorithm that constructs a metamodel only from simulation data, so no a priori knowledge has to be included. Since no additional parameters have to be adjusted, the method is easy to use. It will be shown that the resulting system approximates the underlying model with an adjustable precision. In addition, the data can contain imprecise values or values with a corresponding confidence interval. This is especially well suited for simulation data due to its stochastic nature. The metamodel is represented in form of a Fuzzy Graph which allows the analyst to directly extract easy to interpret if-then rules. A real world token bus model was approximated with the proposed method. It is shown how the resulting Fuzzy Graph can be used to analyze this model and how the rule extraction leads to meaningful information about the model behavior.

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


Two-stage economic and environmental load dispatching framework using particle filtering Economic load dispatch (ELD) is the operation of generation plants producing reliable electricity at the lowest cost, while recognizing limitations of the system. The environmental economic load dispatch (EELD) problem extends the ELD to include environmental considerations which makes it even more challenging due to the fact that it considers a very large scale and dynamic system that is highly complex and has inherent uncertainty. In this study, we propose a novel two-stage economic and environmental load dispatching framework using particle filtering for the efficient and reliable dynamic dispatching of electricity under uncertainty. The proposed framework includes (1) a short term demand forecasting algorithm using wavelet transform adaptive modeling, and (2) a dynamic load dispatching algorithm using particle filtering developed in a simulation environment. The proposed approach has been successfully demonstrated for different scenarios in the original IEEE-30 bus test system, which has been benchmarked against contemporary models available in the literature; and a modified version of the IEEE-30 bus test system, where the loads are modeled to update according to the weather and other external conditions.

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

environmental and economic load dispatching


SURFACE MORPHOLOGY OF CHALKBOARD TIPS CAPTURES THE UNIQUENESS OF THE USER'S HAND STROKES Penmanship has a high degree of uniqueness as exemplified by the standard use of hand signature as identifier in contract validations and property ownerships. In this work, we demonstrate that the distinctiveness of one's writing patterns is possibly embedded in the molding of chalk tips. Using conventional photometric stereo method, the three-dimensional surface features of blackboard chalk tips used in Math and Physics lectures are microscopically resolved. Principal component analysis (PCA) and neural networks (NN) are then combined in identifying the chalk user based on the extracted topography. We show that NN approach applied to eight lecturers allow average classification accuracy (FNN) equal to 100% and 71.5 +/- 2.7% for the training and test sets, respectively. Test sets are chalks not seen previously by the trained NN and represent 25% or 93 of the 368 chalk samples used. We note that the NN test set prediction is more than five-fold higher than the proportional chance criterion (PCC, FPCC = 12.9%), strongly hinting to a high degree of unique correlation between the user's hand strokes and the chalk tip features. The result of NN is also about three-fold better than the standard methods of linear discriminant analysis (LDA, FLDA = 27.0 +/- 4.2%) or classification and regression trees (CART, FCART = 17.3 +/- 3.7%). While the procedure discussed is far from becoming a practical biometric tool, our work offers a fundamental perspective to the extent on which the uniqueness of hand strokes of humans can be exhibited.

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

photometric stereo method
neural networks


Robust mixed time-optimal control for third-order systems with model uncertainty In this paper, a robust near time-optimal controller for some third-order uncertain systems with constrained input is presented. The response is usually composed of two parts. At first, the states move towards the goal state from arbitrary initial conditions by pure time-optimal control (bang-bang) and then there is sliding along a predetermined surface within an ellipsoid. The sliding surface is chosen in such a way that the integral of the absolute value of the system error is minimized. Using a combined control algorithm, robustness and stability of the system is guaranteed even with parameter uncertainty and disturbance. The error convergence rate is also improved compared with pure time-optimal control. Simulation results demonstrate the advanced performance of the proposed control algorithm.

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

bang-bang control
sliding-mode control
switch curve
stressful disturbance
robust control


The e-MapScholar projectan example of interoperability in GIScience education The proliferation of the use of digital spatial data in learning and teaching provides a set of opportunities and challenges for the development of e-learning materials suitable for use by a broad spectrum of disciplines in Higher Education. Effective e-learning materials must both provide engaging materials with which the learner can interact and be relevant to the learners disciplinary and background knowledge. Interoperability aims to allow sharing of data and materials through the use of common agreements and specifications. Shared learning materials can take advantage of interoperable components to provide customisable components, and must consider issues in sharing data across institutional borders. The e-MapScholar project delivers teaching materials related to spatial data, which are customisable with respect to both context and location. Issues in the provision of such interoperable materials are discussed, including suitable levels of granularity of materials, the provision of tools to facilitate customisation and mechanisms to deliver multiple data sets and the metadata issues related to such materials. The examples shown make extensive use of the OpenGIS consortium specifications in the delivery of spatial data.

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


Autonomous Vehicle Parking Using Hybrid Artificial Intelligent Approach This paper devotes to design and implement a hybrid artificial intelligent control scheme for a car-like vehicle to perform the task of optimal parking. The parallel parking control scheme addresses three issues: trajectory planner, decisional kernel, and trajectory tracking control. Design of the control scheme consists of several techniques: genetic algorithm, Petri net, and fuzzy logic control. The genetic algorithm is used to determine the feasible parking locations. The Petri net is used to replace the traditional decision flow chart and plan alternative parking routes especially in global space. The parking routine can be re-performed if the initially assigned route is interfered or when the targeted parking space has been occupied. The fuzzy logic controller is used to drive the vehicle along with the optimal parking route. The proposed scheme is put into several scenarios to test and verify its applicability and to manifest its distinguished features.

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

vehicle parking
genetic algorithm
petri net


Robust feature extraction from spectrum estimated using bispectrum for speaker recognition Extraction of robust features from noisy speech signals is one of the challenging problems in speaker recognition. As bispectrum and all higher order spectra for Gaussian process are identically zero, it removes the additive white Gaussian noise while preserving the magnitude and phase information of original signal. The spectrum of original signal can be recovered from its noisy version using this property. Robust Mel Frequency Cepstral Coefficients (MFCC) are extracted from the estimated spectral magnitude (denoted as Bispectral-MFCC (BMFCC)). The effectiveness of BMFCC has been tested on TIMIT and SGGS databases in noisy environment. The proposed BMFCC features yield 95.30%, 97.26% and 94.22% speaker recognition rate on TIMIT, SGGS and SGGS2 databases, respectively for 20 dB SNR whereas these values for 0 dB SNR are 45.84%, 50.79% and 44.98%. The experimental results show the superiority of the proposed technique compared to conventional methods for all databases.

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

bispectrum
gaussian noise
speaker recognition


Sequential extraction of minor components Principal component analysis (PCA) and Minor component analysis (MCA) are similar but have different dynamical performances. Unexpectedly, a sequential extraction algorithm for MCA proposed by Luo and Unbehauen [11] does not work for MCA, while it works for PCA. We propose a different sequential-addition algorithm which works for MCA. We also show a conversion mechanism by which any PCA algorithms are converted to dynamically equivalent MCA algorithms and vice versa.

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


Genetic stability and territorial structure facilitate the evolution of tag-mediated altruism Evolutionary theorists have long been interested in the conditions that permit the evolution of altruistic cooperation. Recent work has demonstrated that altruistic donation can evolve in surprisingly simple models, in which agents base their decisions to donate solely on the similarity of evolved "tags" relative to evolved tag-difference tolerances. There is disagreement, however, about the conditions under which tag-mediated altruism will in fact evolve. Here we vary two critical parameters in a standard model of tag-mediated altruism-genetic stability and territorial structure- and show that altruism evolves in a wide range of conditions. We demonstrate the evolution of significant levels of altruism even when the immediate costs to donors equal the benefits to recipients. We describe the mechanism that permits the emergence of altruism in the model as a form of kin selection that is facilitated by interactions between altruism, genetic drift, and fecundity.

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

altruism
tags
genetic stability
territorial structure
fecundity


A data-driven stochastic approach to model and analyze test data on fatigue response A stochastic approach to model and analyze test data on the fatigue response of materials and laminated composites is developed. The developed approach is data-driven in nature. It has been customary to describe the fatigue response of metallic and laminated composite materials using a suitable parameter that can serve as the indicator and descriptor of damage accumulation. In the present methodology, the fatigue response of the material is quantified by interpreting the corresponding material parameter to be an embedded Markov process. The true probability distributions of the fatigue response parameter are extracted from sample test data based on an analytical approach, and they are used in the formulation. To this end, the Maximum Entropy Method is incorporated into the formulation. A recursive stochastic matrix equation is developed based on the test data using the theory of reliability and FokkerPlankKolmogorov equation. Application of the methodology to a composite laminate is demonstrated.

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

fatigue behavior
failure of materials
stochastic process modeling
markov chains


Generating data transfers for distributed GPU parallel programs We automatically generate heterogeneous communications for distributed-memory architectures. Communication generation is based on static compiler analysis and runtime decisions. Accurate heterogeneous communications are generated for regular applications. Heterogeneous communications deal with accelerator-based GPU data transfers and message-passing for transfers between CPUs.

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

distributed memory
data transfer
source-to-source transformation
parallel execution
compiler directives


A classification reliability driven reject rule for multi-expert systems In this paper we propose a reject rule applicable to a Multi-Expert System (MES). The rule is adaptive to the given domain and allows the achievement of the best trade-off between reject and error rates as a function of the costs attributed to errors and rejects in the considered application. The results of the method axe particularly effective since the method does not rely on particular statistical assumptions, as other reject rules. An experimental analysis carried out on publicly available databases is reported together with a comparison with other methods present in the literature.

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

multi-expert systems
reject option
classification cost


Fast edge integration based active contours for color images In this paper, a novel geometric active contour model for color image is presented. It combines squared local contrast based alignment term about directional information of edge location as part of driving force, together with the improved geodesic active contour model containing Bays error based two-region segmentation information. And all these measures are integrated as a unified framework. Finally, an unconditionally stable and simple numerical scheme, including the narrow band and fast marching methods, is introduced for efficiently implementing this novel model. Experimental results on color image segmentation show that it can extract the contour of color images precisely and its performance is shown much better than the geodesic-aided CV (GACV) method when directional information about edge location is supplied.

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

active contour
squared local contrast
color image segmentation


Lossless Compression of Color Sequences Using Optimal Linear Prediction Theory In this paper, we present a novel technique that uses the optimal linear prediction theory to exploit all the existing redundancies in a color video sequence for lossless compression purposes. The main idea is to introduce the spatial, the spectral, and the temporal correlations in the autocorrelation matrix estimate. In this way, we calculate the cross correlations between adjacent frames and adjacent color components to improve the prediction, i.e., reduce the prediction error energy. The residual image is then coded using a context-based Golomb-Rice coder, where the error modeling is provided by a quantized version of the local prediction error variance. Experimental results show that the proposed algorithm achieves good compression ratios and it is roboust against the scene change problem.

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

lossless compression
optimal linear prediction


Convergence criteria of a new three-step iteration with errors for nonexpansive nonself-mappings A new three-step iteration with errors for nonexpansive nonself-mappings in Banach spaces is introduced and studied. Weak and strong convergence theorems of such iterations are established. The results obtained in this paper extend and improve the several recent results in this area. (c) 2006 Elsevier Ltd. All rights reserved.

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

nonexpansive nonself-mappings
completely continuous
uniformly convex
opial's condition
condition (a)


Brief history of systems analysis in forest resources An introduction to the special volume on Operations Research in Forestry from the 14th Symposium for Systems Analysis in Forest Resources, held at the Marbella Resort, Maitencillo, Chile, March 811, 2011. This volume of the Annals of Operations Research contains some of the papers presented at the Symposium that were submitted for publication and passed the rigorous peer review process. In addition, manuscripts were solicited from the operations research and forest resources communities to enrich the contributions for this special volume.

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

symposium proceedings
ssafr
or
forest sector


A new image prediction model based on spatio-temporal techniques This paper addresses an image prediction problem focused on images with no identifiable objects. In it, we present several approaches to predict the next image of a given sequence, when the image lacks the well-defined objects, such as meteorological maps or satellite imagery. In these images no clear borders are present, and any object candidate moves, changes, appears and disappears in any image. Nevertheless, this evolution, though unrestricted, is gradual and, hence, prediction looks feasible. One of the approaches presented here, based on a spatio-temporal autoregressive (STAR) model, offers good results for these kinds of images. The main contribution of this paper is to adapt spatio-temporal models to an image prediction problem. As a byproduct of this research, we have achieved a new image compression method, suitable for images without defined shapes.

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

causal images
spatio-temporal autoregressive model
tracking and prediction
image sequence


On the Use of Guided Design Search for Discovering Significant Decision Variables in the Fixed-Charge Capacitated Multicommodity Network Design Problem A preprocessing technique, Guided Design Search (GDS), is presented for the fixed-charge multicommodity capacitated network design (FCMD) problem. GDS applies design of experiment (DOE) principles in order to identify the critical edges in FCMD by analyzing the observed effects of tests using strictly generated sets of edge inclusion/exclusion decisions. Reasoning that these critical edges will exist in most of the high-quality solutions, they are set to their appropriate value, resulting in a reduced solution space for FCMD. High-quality solutions to this reduced FCMD were found quickly and often improved on those found for the unreduced problem. GDS is shown to dominate several other approaches for reducing the solution space. This success serves to broaden the applicability of experimental design screening and preprocessing techniques. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 53(1),6-18 2009

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


Increasing online accessibility at IP Australia In the context of increasing usage of online services for filing, etc. at IP offices worldwide, this article describes progress at IP Australia in offering such services. A number of patent and trade mark services such as filing, and databases are available, although online filing services for designs and plant breeders rights are not yet available. Particular attention is paid to the Trade Mark Assisted Filing Service, which helps customers to determine the potential registrability of a proposed mark. Further attention is paid to improvements to existing patent searching capabilities, including details of a project to build and deliver a new search system for Australian patent data.

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

ip australia
online services
assisted filing service
potential registrability
databases

trade marks
trade mark registration
patent filing


Selection experiments in the Penna model for biological aging We consider the Penna model for biological aging to investigate correlations between early fertility and late life survival rates in populations at equilibrium. We consider inherited initial reproduction ages together with a reproduction cost translated in a probability that mother and offspring die at birth, depending on the mother age. For convenient sets of parameters, the equilibrated populations present genetic variability in what regards both genetically programmed death age and initial reproduction age. In the asexual Penna model, a negative correlation between early life fertility and late life survival rates naturally emerges in the stationary solutions. In the sexual Penna model, selection experiments are performed where individuals are sorted by initial reproduction age from the equilibrated populations and the separated populations are evolved independently. After a transient, a negative correlation between early fertility and late age survival rates also emerges in the sense that populations that start reproducing earlier present smaller average genetically programmed death age. These effects appear due to the age structure of populations in the steady state solution of the evolution equations. We claim that the same demographic effects may be playing an important role in selection experiments in the laboratory.

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


Instant Pickles: Generating Object-Oriented Pickler Combinators for Fast and Extensible Serialization As more applications migrate to the cloud, and as "big data" edges into even more production environments, the performance and simplicity of exchanging data between compute nodes/devices is increasing in importance. An issue central to distributed programming, yet often under-considered, is serialization or pickling, i.e., persisting runtime objects by converting them into a binary or text representation. Pickler combinators are a popular approach from functional programming; their composability alleviates some of the tedium of writing pickling code by hand, but they don't translate well to object-oriented programming due to qualities like open class hierarchies and subtyping polymorphism. Furthermore, both functional pickler combinators and popular, Java-based serialization frameworks tend to be tied to a specific pickle format, leaving programmers with no choice of how their data is persisted. In this paper, we present object-oriented pickler combinators and a framework for generating them at compile-time, called scala/pickling, designed to be the default serialization mechanism of the Scala programming language. The static generation of OO picklers enables significant performance improvements, outperforming Java and Kryo in most of our benchmarks. In addition to high performance and the need for little to no boilerplate, our framework is extensible: using the type class pattern, users can provide both (1) custom, easily interchangeable pickle formats and (2) custom picklers, to override the default behavior of the pickling framework. In benchmarks, we compare scala/pickling with other popular industrial frameworks, and present results on time, memory usage, and size when pickling/unpickling a number of data types used in real-world, large-scale distributed applications and frameworks.

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

serialization
pickling
distributed programming
scala


Trust-based robust scheduling and runtime adaptation of scientific workflow Robustness and reliability with respect to the successful completion of a schedule are crucial requirements for scheduling in scientific workflow management systems because service providers are becoming autonomous. We introduce a model to incorporate trust, which indicates the probability that a service agent will comply with its commitments to improve the predictability and stability of the schedule. To deal with exceptions during the execution of a schedule, we adapt and evolve the schedule at runtime by interleaving the processes of evaluating, scheduling, executing and monitoring in the life cycle of the workflow management. Experiments show that schedules maximizing participants' trust are more likely to survive and succeed in open and dynamic environments. The results also prove that the proposed approach of workflow evaluation can find the most robust execution flow efficiently, thus avoiding the need of scheduling every possible execution path in the workflow definition. Copyright (C) 2009 John Wiley & Sons, Ltd.

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


Study of flow and pressure field in microchannels with various cross-section areas In this work a micro-flow sensor integrated in the bottom surface of a rectangular microchannel is used in order to evaluate simultaneously both the flow velocity and the pressure in various micro-flow conditions. In this way direct flow rate measurement is achieved while real-time monitoring of the corresponding flow and pressure values are obtained. The effect of the microchannel dimensions in the flow determination is also studied. An almost linear relation of ?P/L with respect to Re was extracted, which indicates a laminar flow behavior. The friction factor, corresponding to the specific microchannel dimensions was calculated together with the fRe value.

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

liquid flow velocity
pressure drop
microchannel integration


address/memory management for a gigantic lisp environment or, gc considered harmful The possibility of incredibly cheap, fantastically large media for storage gives rise to a realistic LISP memory management scheme under which GC may be postponed for days, or even indefinitely; the idea is encapsulated in the acronym DDIGC? Don't Do It!. Tertiary memory is used to archive pages of the LISP environment which are perhaps reclaimable, but which have not been proven so; whereas the standard technique of paging is used to swap active data from the main memory to a secondary store such as magnetic disk. Some scenarios are presented considering a variety of currently-available technologies, and of one speculative possibilityvideodiscby which a requisite compactifying GC would be done overnight, or over the weekend. With enough tertiary available, one design could last for over 12 years without a GC. Write-once memories, probably unusable for most applications, would not be at a disadvantage here.

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

media applications technologies lisp design storage data proven management scheme

scenario activation environments speculating addressing standardization memorialized archival


Impact of platform heterogeneity on the design of parallel algorithms for morphological processing of high-dimensional image data The main objective of this paper is to describe a realistic framework to understand parallel performance of high-dimensional image processing algorithms in the context of heterogeneous networks of workstations (NOWs). As a case study, this paper explores techniques for mapping hyperspectral image analysis techniques onto fully heterogeneous NOWs. Hyperspectral imaging is a new technique in remote sensing that has gained tremendous popularity in many research areas, including satellite imaging and aerial reconnaissance. The automation of techniques able to transform massive amounts of hyperspectral data into scientific understanding in valid response times is critical for space-based Earth science and planetary exploration. Using an evaluation strategy which is based on comparing the efficiency achieved by an heterogeneous algorithm on a fully heterogeneous NOW with that evidenced by its homogeneous version on a homogeneous NOW with the same aggregate performance as the heterogeneous one, we develop a detailed analysis of parallel algorithms that integrate the spatial and spectral information in the image data through mathematical morphology concepts. For comparative purposes, performance data for the tested algorithms on Thunderhead (a large-scale Beowulf cluster at NASA's Goddard Space Flight Center) are also provided. Our detailed investigation of the parallel properties of the proposed morphological algorithms provides several intriguing findings that may help image analysts in selection of parallel techniques and strategies for specific applications.

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

hyperspectral imaging
mathematical morphology

heterogeneous computing
parallel algorithm design
cluster computing
performance analysis


towards fault tolerance in web services compositions Many businesses are now moving towards the use of composite web services that are based on a collection of web services working together to achieve an objective. Although they are becoming business-critical elements, current development support tools do not provide a practical way to include fault tolerance characteristics in web services compositions. This paper proposes a mechanism that allows programmers to easily develop fault tolerant compositions using diverse web services. The mechanism allows programmers to specify alternative web services for each operation and offers a set of artifacts that simplify the coding process, by automatically dealing with all the aspects related to the redundant web services invocation and responses voting. The mechanism is also able to perform a continuous evaluation of the services based on their behavior during operation. The approach is illustrated using compositions based on web services publicly available in the Internet and on the web services specified by the standard TPC-App performance benchmark.

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


a genetic algorithm encoding for a class of cardinality constraints A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variables must be a subset--of cardinality not exceeding a given value--of a larger set of available items.The solution of the practically important structural optimization problem where the set of distinct values of the design variables must be a small subset of a larger set of commercially available values is used as a test-bed. Very good results have been found in the numerical experiments performed using standard binary encoding and genetic operators.

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

genetic algorithm
structural optimization


Two methods for privacy preserving data mining with malicious participants Privacy preserving data mining addresses the need of multiple parties with private inputs to run a data mining algorithm and learn the results over the combined data without revealing any unnecessary information. Most of the existing cryptographic solutions to privacy-preserving data mining assume semi-honest participants. In theory, these solutions can be extended to the malicious model using standard techniques like commitment schemes and zero-knowledge proofs. However, these techniques are often expensive, especially when the data sizes are large. In this paper, we investigate alternative ways to convert solutions in the semi-honest model to the malicious model. We take two classical solutions as examples, one of which can be extended to the malicious model with only slight modifications while another requires a careful redesign of the protocol. In both cases, our solutions for the malicious model are much more efficient than the zero-knowledge proofs based solutions.

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


sum capacity, rate distribution and scenarios for multiuser diversity in mimo-ofdma We consider an innovative downlink multiuser MIMO scheme. Several users compete for the available resources in time, frequency and space. The proposed scheme exploits multiuser diversity and uses interference cancellation at the transmitter. We evaluate it for indoor, hot spot and multihop scenarios. Significant gains in terms of sum capacity can be achieved even under line of sight conditions. The theoretical limit can be approximately achieved in most scenarios. A nice feature of the proposed scheme is that it inherently provides some fairness regarding rate distribution among users even though fairness is not explicitly taken into account by the scheduler.

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


Dynamic LES of colliding vortex rings using a 3D vortex method A Lagrangian particle method is used to simulate the collision of coaxial vortex rings in three dimensions. The scheme combines a 3D, adaptive, viscous, vortex element method with a dynamic eddy viscosity model of the subfilter scale stresses. The vortex method is based on discretization of the vorticity field into Lagrangian vortex elements and transport of the elements along particle trajectories. The computations incorporate a mesh redistribution algorithm which creates new elements in regions of high strain and locally redistributes the vorticity field into a smaller number of elements when particles tend to cluster. The subfilter scale vorticity model consists of approximating the effect of unresolved vorticity stresses using a gradient-diffusion eddy viscosity model, following the development in Part I (J. R. Mansfield, O. M. Knio, and C. Meneveau, J. Comput. Phys. 145, 693 (1998)). Dynamic implementation of the model relies on determining model coefficients through test-filtering the Lagrangian particle representation of the filtered vorticity field. Computations of ring collisions show that, combined, the mesh redistribution scheme and subfilter scale model result in a robust scheme that can be extended into the late stages of evolution of the flow. In addition, it is shown that the Lagrangian LES scheme captures several experimentally observed features of the ring collisions, including turbulent breakdown into small-scale structures and the generation of small-scale radially propagating vortex rings. (C) 1999 Academic Press.

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


A comparison of the Jacobian-free NewtonKrylov method and the EVP model for solving the sea ice momentum equation with a viscous-plastic formulation: A serial algorithm study Numerical convergence properties of a recently developed Jacobian-free NewtonKrylov (JFNK) solver are compared to the ones of the widely used EVP model when solving the sea ice momentum equation with a Viscous-Plastic (VP) formulation. To do so, very accurate reference solutions are produced with an independent Picard solver with an advective time step of 10s and a tight nonlinear convergence criterion on 10, 20, 40, and 80-km grids. Approximate solutions with the JFNK and EVP solvers are obtained for advective time steps of 10, 20 and 30min. Because of an artificial elastic term, the EVP model permits an explicit time-stepping scheme with a relatively large subcycling time step. The elastic waves excited during the subcycling are intended to damp out and almost entirely disappear such that the approximate solution should be close to the VP solution. Results show that residual elastic waves cause the EVP approximate solution to have notable differences with the reference solution and that these differences get more important as the grid is refined. Compared to the reference solution, additional shear lines and zones of strong convergence/divergence are seen in the EVP approximate solution. The approximate solution obtained with the JFNK solver is very close to the reference solution for all spatial resolutions tested.

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

sea ice
newtonkrylov method
numerical convergence

viscous-plastic rheology
numerical stability


Efficient sign coding and estimation of zero-quantized coefficients in embedded wavelet image codecs Wavelet transform coefficients are defined by both a magnitude and a sign. While efficient algorithms exist for coding the transform coefficient magnitudes, current wavelet image coding algorithms are not as efficient at coding the sign of the transform coefficients. It is generally assumed that there, is no compression gain to be obtained from entropy coding of the sign. Only recently have some authors begun to investigate this component of wavelet image coding. In this paper, sign coding is examined in detail in the context of an embedded wavelet image coder. In addition to using intraband wavelet coefficients in a. sign coding context model, a projection technique is described that allows nonintraband wavelet coefficients to be incorporated into the context model. At the decoder, accumulated sign prediction statistics are also used to derive improved reconstruction estimates for zero-quantized coefficients. These techniques are shown to yield PSNR improvements averaging 0.3 dB, and are applicable to any genre of embedded wavelet image codec.

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


On cores and stable sets for fuzzy games In this paper, cores and stable sets for games with fuzzy coalitions are introduced and their relations studied. For convex fuzzy games it turns out that all cores coincide and that the core is the unique stable set. Also relations between cores and stable sets of fuzzy clan games are discussed. (C) 2003 Elsevier B.V. All rights reserved.

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

cooperative game
fuzzy game
convex fuzzy game
fuzzy clan game


Least Conservative Support and Tolerance Tubes This(1) paper studies a distribution-free estimator of the conditional support and tolerance intervals of a distributions underlying a set of paired independent and identically distributed (i.i.d.) observations. The key ingredients are (a) an appropriate notion of risk which measures what probability mass is not captured by the estimate, (b) a uniform concentration inequality for the empirical risk based on a compression argument, and (c) the derivation of a lower bound to the mutual information, dictating how to maximize the informativeness of the estimator. For this result we extend Fano's inequality to the bivariate case.

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

fano's inequality
statistical learning theory


A finite volume method solution for the bidomain equations and their application to modelling cardiac ischaemia This paper presents an implementation of the finite volume method with the aim of studying subendocardial ischaemia during the ST segment. In this implementation, based on hexahedral finite volumes, each quadrilateral sub-face is split into two triangles to improve the accuracy of the numerical integration in complex geometries and when fibre rotation is included. The numerical method is validated against previously published solutions obtained from slab and cylindrical models of the left ventricle with subendocardial ischaemia and no fibre rotation. Epicardial potential distributions are then obtained for a half-ellipsoid model of the left ventricle. In this case it is shown that for isotropic cardiac tissue the degree of subendocardial ischaemia does not affect the epicardial potential distribution, which is consistent with previous findings from analytical studies in simpler geometries. The paper also considers the behaviour of various preconditioners for solving numerically the resulting system of algebraic equations resulting from the implementation of the finite volume method. It is observed that each geometry considered has its own optimal preconditioner.

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

numerical solutions
electrocardiography
ischaemic tissue


analysis and comparison of intelligent control methods for computer-controlled artificial leg The computer-controlled artificial legs, most of which are above-knee prostheses(AKP) can better adapt to the human gait and walking modes, automatically distinguishing terrain and coordinate the symmetry of gait. Due to the complexity and non-linearity of AKP control, it is required to design a kind of controller being intelligent enough for it. Research and product development of computer-controlled AKP is comprehensively discussed in the paper. The expert controller based on finite-state machine method and BP neural network controller based on PD supervision are especially analyzed. The major intelligent control methods applied for existing AKP products are also compared with each other here. The development of intelligent control technology in the future is pointed out.

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


Structure and Function of AChBP, Homologue of the Ligand-Binding Domain of the Nicotinic Acetylcholine Receptor Acetylcholine-binding protein (AChBP) is a novel protein with high similarity to the extracellular domain of the nicotinic acetylcholine receptor. AChBP lacks the transmembrane domains and intracellular loops typical for the nAChRs. AChBP is secreted from glia cells in the central nervous system of the freshwater snail, Lymnaea stagnalis, where it modulates synaptic transmission. AChBP forms homopentamers with pharmacology that resembles the ?7-type of nicotinic receptors. As such, AChBP is a good model for the ligand-binding domain of the nAChRs. In the crystal structure of AChBP at 2.7 , each protomer has a modified immunoglobulin fold. Almost all residues previously shown to be involved in ligand binding in the nicotinic receptor are found in a pocket at the subunit interface, which is lined with aromatic residues. The AChBP crystal structure explains many of the biochemical studies on the nicotinic acetylcholine receptors. Surprisingly, the interface between protomers is relatively weakly conserved between families in the superfamily of pentameric ligand-gated ion channels. The lack of conservation has implications for the mechanism of gating of the ion channels.

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

nicotinic acetylcholine receptor
crystal structure
achbp
glia

ligand-gated ion channel
acetylcholine-binding site
modulating synaptic transmission


The Precomputed-Branch architecture: Efficient branches with compiler support Accurate instruction fetch and branch prediction is increasingly important in today's superscalar architectures. Fetch prediction is the process of determining the next instruction to request from the memory subsystem. Branch prediction is the process of predicting the likely outcome of branch instructions. A branch target buffer (BTB) is often used to provide target addresses for taken branches and to predict the destination of indirect jumps. Using a BTB avoids the delay needed to recalculate the destination address and reduces the misfetch penalty. However, an effective branch target buffer can be large and can possibly increase the cycle time of a processor. We propose that a design used in older computers, such as the PDP-8, be used in modern architectures instead of a BTB design. The compiler would pre-compute the branch destination for most branch instructions, allowing the branch information to be stored with the instruction. We consider computing branch destinations at link time and as instructions are fetched into the instruction cache; both alternatives offer similar performance with different advantages. A very small BTB is still useful to predict indirect branches, which cannot be pre-computed. Our results show that the Precomputed-Branch architecture performs better than an architecture using only a BTB, and has significant hardware savings. This is particularly true for larger programs more representative of modern applications.

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

branch architecture
code reordering optimizations


Subgradients of marginal functions in parametric mathematical programming In this paper we derive new results for computing and estimating the so-called Frechet and limiting (basic and singular) subgradients of marginal functions in real Banach spaces and specify these results for important classes of problems in parametric optimization with smooth and nonsmooth data. Then we employ them to establish new calculus rules of generalized differentiation as well as efficient conditions for Lipschitzian stability and optimality in nonlinear and nondifferentiable programming and for mathematical programs with equilibrium constraints. We compare the results derived via our dual-space approach with some known estimates and optimality conditions obtained mostly via primal-space developments.

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

generalized differentiation
mathematical programming

nonsmooth functions and set-valued mappings


Numerical simulation of frost heave with coupled water freezing, temperature and stress fields in tunnel excavation Artificial ground freezing is an effective ground improvement technique to deal with diverse geotechnical construction problems as it serves to cut off the water and also improves the ground soil strength. However, ground freezing may produce frost heave and thaw settlement at the ground surface. Predicting and controlling the frost heave is a challenge to engineering construction in a heavily populated city. This paper proposes an analysis model that couples the water freezing, temperature and stress fields. This model is first applied to an underground excavation problem of a corridor where ground freezing is used. The numerical predictions are compared with field measurements. It is then applied for a model tunnel problem to study the effect of the overlying soil thickness, frozen soil wall thickness, excavation radius and brine temperature on the frost heave. It is found that the vertical component of the frost heave follows a normal distribution with a maximum at the tunnel axis, while the horizontal component reaches a maximum at a distance from the tunnel axis. This distance is directly proportional to the thickness of the overlying soil. A critical brine temperature is also found at which the frost heave at the ground surface reaches a maximum.

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

ground freezing
numerical simulation
frost heave


Error detection, error correction and performance evaluation in on-line mathematical expression recognition Automatic recognition of on-line mathematical expressions is difficult especially when there exist errors. In this paper, we incorporate an error detection and correction mechanism into a parser developed previously by us based on definite clause grammar (DCG). The resulting system can handle lexical, syntactic and some semantic errors. The recognition speed for 600 commonly seen expressions is quite acceptable, ranging from 0.73 to 6s per expression on a modest workstation. In addition, we propose a performance evaluation scheme which can be used to demonstrate the effectiveness of both the symbol recognition and structural analysis stages by a single measure.

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

definite clause grammar
error detection and correction
performance evaluation
structural analysis


Two-view multibody structure from motion We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. Our approach exploits the algebraic and geometric properties of the so-called multibody epipolar constraint and its associated multibody fundamental matrix, which are natural generalizations of the epipolar constraint and of the fundamental matrix to multiple motions. We derive a rank constraint on a polynomial embedding of the correspondences, from which one can estimate the number of independent motions as well as linearly solve for the multibody fundamental matrix. We then show how to compute the epipolar lines from the first-order derivatives of the multibody epipolar constraint and the epipoles by solving a plane clustering problem using Generalized PCA (GPCA). Given the epipoles and epipolar lines, the estimation of individual fundamental matrices becomes a linear problem. The clustering of the feature points is then automatically obtained from either the epipoles and epipolar lines or from the individual fundamental matrices. Although our approach is mostly designed for noise-free correspondences, we also test its performance on synthetic and real data with moderate levels of noise.

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

multibody structure from motion
multibody epipolar constraint
multibody fundamental matrix

3-d motion segmentation
generalized pca (gpca)


Improved collision attacks on MD4 and MD5 At Eurocrypt'05, Wang et al. presented efficient collision attacks on MD5 and MD4 hash functions. They found a collision of MD5 with a complexity of less than 237 MD5 hash operations, and a collision of MD4 with complexity less than 28 MD4 hash operations. In their attack, the procedure to generate a collision is divided into 4 steps. First, they determine the message differential and output differentials of chaining variables in each step, which generates a collision with small complexity. Second, they construct sufficient conditions that guarantee that the desired differential is always calculated. Third, they find a message modification that can satisfy the sufficient conditions with high probability. Finally, they search for a message that satisfies all sufficient conditions. In this paper, we focus on the message modification of MD5 and MD4, and propose a new message modification. Using our message modification, a collision of MD5 can be found with complexity less than 2(29) MD5 hash operations, and a collision of MD4 can be found with complexity less than 3 MD4 hash operations. To improve the complexity from previous attacks, we mainly use two ideas. The first idea is to use message modification that can satisfy more sufficient conditions in the second round than in previous attacks. The second idea is to use message modification that can enable us to search for a collision starting from an intermediate step.

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


FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS This paper discusses the k-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs are n points in the plane and a positive integer k, and we are asked whether we can travel in straight lines through these n points with at most k bends. There are a number of applications where minimizing the number of bends in the tour is desirable because bends are considered very costly. We prove that this problem is fixed-parameter tractable (FPT). The proof is based on the kernelization approach. We also consider the RECTILINEAR k-BENDS TRAVELING SALESMAN PROBLEM, which requires that the line-segments be axis-parallel.(a) Note that a rectilinear tour with k bends is a cover with k-line segments, and therefore a cover by lines. We introduce two types of constraints derived from the distinction between line-segments and lines. We derive FPT-algorithms with different techniques and improved time complexity for these cases.

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

computational geometry
fixed-parameter tractable
minimum-bends tours
covering with hyperplanes


Reliable facility location problem considering facility failure scenarios Purpose - The facility in an emergency system could be immobilized because of the huge destructive power of an irregular emergency and the uncertainty of the time, place and scale of occurrence. So facility failure scenarios must be considered at the time of location. The purpose of this paper is to establish a location model based on the worst facility failure, the objective of which is to minimize the cost and cover the demand maximally. It is demonstrated that location choice, considering facility failure, has significant meaning when considering economic benefit and covering the demand. Design/methodology/approach - A hi-level programming model which studies the facility location is established by using the methods of scenario analysis and robust optimization. It is compared with a classic location model, without considering facility failure, from the points of view of economic benefit and maximal covering demand. Findings - Compared to the classic location model, without considering facility failure, it is demonstrated that the location model which considers facility failure can save more costs from the economic benefit point of view and, from the maximal covering of the demand point of view, has a higher covering ratio. So facility failure scenario should be considered in the location of an emergency facility. Originality/value - The paper studies facility location based on the worst scenario, from the two aspects of economic benefits and maximal covering demand.

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

plant location and layout
facilities
service failures
emergency measures
reliability
bi-level programming
maximal covering model
minimal cost model


Ordered fractal semigroups as a model of computation We introduce the notion of an ordered (generalized) fractal semigroup and show that it characterizes ordered non-Archimedean quasi-metric semigroups. With the help of this characterization, several properties of ordered fractal structures are discussed. Our study is motivated, in great part, by the fact, proved here, that the structure of an ordered non-Archimedean quasi-metric semigroup provides an efficient setting to interpret the properties of several interesting examples of spaces which appear in some fields of theoretical computer science and image processing, respectively. (C) 2002 Elsevier Science Ltd. All rights reserved.

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


Fast interval-valued statistical modeling of interconnect and effective capacitance Correlated interval representations of range uncertainty offer an attractive solution to approximating computations on statistical quantities. The key idea is to use finite intervals to approximate the essential mass of a probability density function (pdf) as it moves through numerical operators; the resulting compact interval-valued solution can be easily interpreted as a statistical distribution and efficiently sampled. This paper first describes improved interval-valued algorithms for asymptotic wave evaluation (AWE)/passive reduced-order interconnect macromodeling algorithm (PRIMA) model order reduction for tree-structured interconnect circuits with correlated resistance, inductance, and capacitance (RLC) parameter variations. By moving to a much faster interval-valued linear solver based on path-tracing ideas, and making more optimal tradeoffs between interval- and scalar-valued computations, the delay statistics roughly 10 x faster than classical Monte Carlo (MC) simulation, with accuracy to within 5% can be extracted. This improved interval analysis strategy is further applied in order to build statistical effective capacitance (C-eff) models for variational interconnect, and show how to extract statistics of Ceff over 100x faster than classical MC simulation, with errors less than 4%.

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

effective capacitance
interconnect
modeling


Microscopy study of the conductive filament in HfO2 resistive switching memory devices We study resistive switching memories with Hf or Ti metal oxygen exchange layers. STEM dark field and EELS are used to observe the conductive filament. The filament is a cone-shaped metal-rich region in the HfO2 dielectric layer. Composition of the metallic filament is dominated by Hf or Ti depending on the OEL.

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


Graph self-organizing maps for cyclic and unbounded graphs Self-organizing maps capable of processing graph structured information are a relatively new concept. This paper describes a novel concept on the processing of graph structured information using the self-organizing map framework which allows the processing of much more general types of graphs, e.g. cyclic graphs, directed graphs. Previous approaches to this problem were limited to the processing of bounded graphs, their computational complexity can grow rapidly with the level of connectivity of the graphs concerned, and are restricted to the processing of positional graphs. The novel concept proposed in this paper, namely, by using the clusters formed in the state space of the self-organizing map to represent the strengths of the activation of the neighboring vertices, rather than as in previous approaches, using the state space of the surrounding vertices to represent such strengths of activations. Such an approach resulted in reduced computational demand, and in allowing the processing of non-positional graphs.

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

mapping and clustering of structured data


Image-Space Texture-Based Output-Coherent Surface Flow Visualization Image-space line integral convolution (LIC) is a popular scheme for visualizing surface vector fields due to its simplicity and high efficiency. To avoid inconsistencies or color blur during the user interactions, existing approaches employ surface parameterization or 3D volume texture schemes. However, they often require expensive computation or memory cost, and cannot achieve consistent results in terms of both the granularity and color distribution on different scales. This paper introduces a novel image-space surface flow visualization approach that preserves the coherence during user interactions. To make the noise texture under different viewpoints coherent, we propose to precompute a sequence of mipmap noise textures in a coarse-to-fine manner for consistent transition, and map the textures onto each triangle with randomly assigned and constant texture coordinates. Further, a standard image-space LIC is performed to generate the flow texture. The proposed approach is simple and GPU-friendly, and can be easily combined with various texture-based flow visualization techniques. By leveraging viewpoint-dependent backward tracing and mipmap noise phase, our method can be incorporated with the image-based flow visualization (IBFV) technique for coherent visualization of unsteady flows. We demonstrate consistent and highly efficient flow visualization on a variety of data sets.

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

flow visualization
mipmap
lic
ibfv
unsteady flows


Enhancing customer privacy while searching for products and services on the world wide web Purpose - To propose a model of a privacy-enhanced catalogue search system (PECSS) in an attempt to address privacy threats to consumers, who search for products and services on the world wide web. Design/methodology/approach - The model extends an agent-based architecture for electronic catalogue mediation by supplementing it with a privacy enhancement mechanism. This mechanism introduces fake queries into the original stream of user queries, in an attempt to reduce the similarity between the actual interests of users ("internal user profile") and the interests as observed by potential eavesdroppers on the web ("external user profile"). A prototype was constructed to demonstrate the feasibility and effectiveness of the model. Findings - The evaluation of the model indicates that, by generating five fake queries per each original user query, the user's profile is hidden most effectively from any potential eavesdropper. Future research is needed to identify the optimal glossary of fake queries for various clients. The model also should be tested against various attacks perpetrated against the mixed stream of original and fake queries (i.e. statistical clustering). Research limitations/implications - The model's feasibility was evaluated through a prototype. It was not empirically tested against various statistical methods used by intruders to reveal the original queries. Practical implications - A useful architecture for electronic commerce providers, internet service providers (ISP) and individual clients who are concerned with their privacy and wish to minimize their dependencies on third-party security providers. Originality/value - The contribution of the PECSS model stems from the fact that, as the internet gradually transforms into a non-free service, anonymous browsing cannot be employed any more to protect consumers' privacy, and therefore other approaches should be explored. Moreover, unlike other approaches, our model does not rely on the honesty of any third mediators and proxies that are also exposed to the interests of the client. In addition, the proposed model is scalable as it is installed on the user's computer.

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


Bayesian Estimation of Multi-Trap RTN Parameters Using Markov Chain Monte Carlo Method Random telegraph noise (RTN) is a phenomenon that is considered to limit the reliability and performance of circuits using advanced devices. The time constants of carrier capture and emission and the associated change in the threshold voltage are important parameters commonly included in various models, but their extraction from time-domain observations has been a difficult task. In this study, we propose a statistical method for simultaneously estimating interrelated parameters: the time constants and magnitude of the threshold voltage shift. Our method is based on a graphical network representation, and the parameters are estimated using the Markov chain Monte Carlo method. Experimental application of the proposed method to synthetic and measured time-domain RTN signals was successful. The proposed method can handle interrelated parameters of multiple traps and thereby contributes to the construction of more accurate RTN models.

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

random telegraph noise
bayesian estimation
markov chain monte carlo

device characterization
source separation
statistical machine learning


Fourth-order compact and energy conservative difference schemes for the nonlinear Schrodinger equation in two dimensions In this paper, a fourth-order compact and energy conservative difference scheme is proposed for solving the two-dimensional nonlinear Schrodinger equation with periodic boundary condition and initial condition, and the optimal convergent rate, without any restriction on the grid ratio, at the order of O(h(4) + tau(2)) in the discrete L-2-norm with time step tau and mesh size h is obtained. Besides the standard techniques of the energy method, a new technique and some important lemmas are proposed to prove the high order convergence. In order to avoid the outer iteration in implementation, a linearized compact and energy conservative difference scheme is derived. Numerical examples are given to support the theoretical analysis. (C) 2013 Elsevier Inc. All rights reserved.

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

compact and conservative difference scheme


A different approach to information management by exceptions (toward the prevention of another Enron) We review the fall of Enron and other bankruptcies from the perspective of information management by exceptions (MBE) for insights into how to prevent another collapse. We entertain the idea that a group of special employees in an institution such as Enron can be analogously equated to a malignant tumor in human body, which can grow abnormally to bring the institution to collapse. Following this general analogy, we examine the biological spectrum for insights into a business framework for an MBE in the wrong doing detection. Such a model can be used to insure the institution's stability, growth and therefore profitability.

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

biologically inspired
managerial cybernetics
information management


Exploring the functional significance of dendritic inhibition in cortical pyramidal cells Inhibitory synapses contacting the soma and axon initial segment are commonly presumed to participate in shaping the response properties of cortical pyramidal cells. Such an inhibitory mechanism has been explored in numerous computational models. However, the majority of inhibitory synapses target the dendrites of pyramidal cells, and recent physiological data suggests that this dendritic inhibition affects tuning properties. We describe a model that can be used to investigate the role of dendritic inhibition in the competition between neurons. With this model we demonstrate that dendritic inhibition significantly enhances the computational and representational properties of neural networks.

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