Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs We present new combinatorial approximation algorithms for the k-set cover problem. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new algorithms further extend these approaches by utilizing the natural idea of computing large packings of elements into sets of large size. Our results improve the previously best approximation bounds for the k-set cover problem for all values of ka parts per thousand yen6. The analysis technique used could be of independent interest; the upper bound on the approximation factor is obtained by bounding the objective value of a factor-revealing linear program.

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


Modified Kadomtsev-Petviashvili (MKP) equation and electromagnetic soliton We study the propagation of electromagnetic wave (EMW) in an isotropic charge-free infinite ferromagnetic thin film by solving the associated coupled Maxwell and Landau-Lifshitz (LL) equations in (2 + 1) dimensions using a reductive perturbation method. The dynamical equations reduce to the modified Kadomtsev-Petviashvili-II (MKP-II) equation which admits line and lump solitons in addition to breathers. The results show that the magnetisation of the medium is excited in the form of solitons and also the magnetic field component of the propagating EMW is modulated in the form of solitons. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

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


Iterative Data-parallel Mark&Sweep on a GPU Automatic memory management makes programming easier. This is also true for general purpose GPU computing where currently no garbage collectors exist. In this paper we present a parallel mark-and-sweep collector to collect GPU memory on the GPU and tune its performance. Performance is increased by: (1) data-parallel marking and sweeping of regions of memory, (2) marking all elements of large arrays in parallel, (3) trading recursion over parallelism to match deeply linked data structures. (1) is achieved by coarsely processing all potential objects in a region of memory in parallel. When during (1) a large array is detected, it is put aside and a parallel-for is later issued on the GPU to mark its elements. For a data-structure that is a large linked list, we dynamically switch to a marking version with less overhead by performing a few recursive steps sequentially (and multiple lists in parallel). The collector achieves a speedup of a factor of up-to 11 over a sequential collector on the same GPU.

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

algorithms
design
measurement
garbage collection
mark and sweep


Temperature dependence of InP/GaInP quantum dot photoluminescence The integrated photoluminescence (PL) intensities of capped InP/GaInP quantum dot structures have been measured as a function of temperature. The PL is found to decrease by up to four orders of magnitude as the temperature is raised from 18 to 300 K. The temperature data show an Arrhenius behaviour characterised by three activation energies. Analysis of this dependence indicates that the major loss mechanism is thermal activation of excitons out of the dots, followed by nonradiative recombination in the barriers. Identical samples were grown without a capping layer in order to study the morphology of the dots using an atomic force microscope (AFM).

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


Modal similarity Just as Boolean rules define Boolean categories, the Boolean operators define higher-order Boolean categories referred to as modal categories. We examine the similarity order between these categories and the standard category of logical identity (i.e. the modal category defined by the biconditional or equivalence operator). Our goal is 4-fold: first, to introduce a similarity measure for determining this similarity order; second, to show that such a measure is a good predictor of the similarity assessment behaviour observed in our experiment involving key modal categories; third, to argue that as far as the modal categories are concerned, configural similarity assessment may be componential or analytical in nature; and lastly, to draw attention to the intimate interplay that may exist between deductive judgments, similarity assessment and categorisation.

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

similarity
boolean operators
modal categories

modality
higher-order similarity
boolean relational categories
boolean metacategories


Tyre contact length on dry and wet road surfaces measured by three-axial accelerometer Tyreroad contact length was determined by measuring the 3D-accelerations of the tyre carcass. Experiments were performed on dry and wet road surfaces with wide span of parameters. The decrease of contact length on wet roads can be detected already at low driving velocities. The system can detect the vanishing contact length during full aquaplaning. Real-time tyreroad contact length information could benefit both the drivers and active safety systems.

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


learning from examples to improve code completion systems The suggestions made by current IDE's code completion features are based exclusively on static type system of the programming language. As a result, often proposals are made which are irrelevant for a particular working context. Also, these suggestions are ordered alphabetically rather than by their relevance in a particular context. In this paper, we present intelligent code completion systems that learn from existing code repositories. We have implemented three such systems, each using the information contained in repositories in a different way. We perform a large-scale quantitative evaluation of these systems, integrate the best performing one into Eclipse, and evaluate the latter also by a user study. Our experiments give evidence that intelligent code completion systems which learn from examples significantly outperform mainstream code completion systems in terms of the relevance of their suggestions and thus have the potential to enhance developers' productivity.

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

content assist
integrated development environment
code recommender


Image segmentation using association rule features A new type of texture feature based on association rules is described in this paper. Association rules have been used in applications such as market basket analysis to capture relationships present among items in large data sets. It is shown that association rules can be adapted to capture frequently occurring local structures in images. The frequency of occurrence of these structures can be used to characterize texture. Methods for segmentation of textured images based on association rule features are described. Simulation results using images consisting of man made and natural textures show that association rule features perform well compared to other widely used texture features. Association rule features are used to detect cumulus cloud fields in GOES satellite images and are found to achieve higher accuracy than other statistical texture features for this problem.

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


An energy-efficient protocol for data gathering and aggregation in wireless sensor networks Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirement of applications/users such as sensing area coverage. In this paper, we propose a novel hierarchical clustering protocol (DEEG) for long-lived sensor network. DEEG achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all the nodes, the proposed protocol achieves a good performance in terms of network lifetime. DEEG can also handle the energy hetergenous capacities and guarantee that out-network communications always occur in the subregion with high energy reserved. Furthermore, it introduces a simple but efficient approach to cope with the area coverage problem. We evaluate the performance of the proposed protocol using a simple temperature sensing application. Simulation results show that our protocol significantly outperforms LEACH and PEGASIS in terms of network lifetime and the amount of data gathered.

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

wireless sensor networks
data gathering and aggregation


Camera calibration with moving one-dimensional objects In this paper, we show that the rotating 1D calibrating object used in the literature is in essence equivalent to a familiar 2D planar calibration object. In addition, we also show that when the 1D object undergoes a planar motion rather than rotating around a fixed point, such equivalence still holds but the traditional way fails to handle it. Experiments are carried out to verify the theoretical correctness and numerical robustness of our results.

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

1d calibration object
homography
vanishing points
absolute points


distributing and managing data on desktop grids with bitdew Desktop Grids use the computing, network and storage resources from idle desktop PC's distributed over multiple-LAN's or the Internet to compute a large variety of resource-demanding distributed applications. While these applications need to access, compute, store and circulate large volumes of data, little attention has been paid to data management in such large-scale, dynamic, heterogeneous, volatile and highly distributed Grids. To address this problem, we propose the BitDew framework, a programmable environment for automatic and trans-parent data management on computational Desktop Grids. BitDew relies on a specific set of meta-data to drive key data management operations, namely life cycle, distribution, placement, replication and fault-tolerance with a high level of abstraction. The Bitdew runtime environment is a flexible distributed service architecture that integrates modular P2P components such as DHT's for a distributed data catalog and collaborative transport protocols for data distribution.

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


A memetic approach to discrete tomography from noisy projections ? Discrete tomography deals with the reconstruction of images from very few projections, which is, in the general case, an NP-hard problem. This paper describes a new memetic reconstruction algorithm. It generates a set of initial images by network flows, related to two of the input projections, and lets them evolve towards a possible solution, by using crossover and mutation. Switch and compactness operators improve the quality of the reconstructed images during each generation, while the selection of the best images addresses the evolution to an optimal result. One of the most important issues in discrete tomography is known as the stability problem and it is tackled here, in the case of noisy projections, along four directions. Extensive experiments have been carried out to evaluate the robustness of the new methodology. A comparison with the output of two other evolutionary algorithms and a generalized version of a deterministic method shows the effectiveness of our new algorithm.

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


Temporal change analysis for characterization of mass lesions in mammography In this paper, we present a fully automated computer-aided diagnosis (CAD) program to detect temporal changes in mammographic masses between two consecutive screening rounds. The goal of this work was to improve the characterization of mass lesions by adding information about the tumor behavior over time. Towards this goal we previously developed a regional registration technique that finds for each mass lesion on the current view a location on the prior view where the mass was most likely to develop. For the task of interval change analysis, we designed two kinds of temporal features: difference features and similarity features. Difference features indicate the (relative) change in feature values determined on prior and current views. These features may be especially useful for lesions that are visible on both views. Similarity features measure whether two regions are comparable in appearance and may be useful for lesions that are visible on the prior view as well as for newly developing lesions. We evaluated the classification performance with and without the use of temporal features on a dataset consisting of 465 temporal mammogram pairs, 238 benign, and 227 malignant. We used cross validation to partition the dataset into a training set and a test set. The training set was used to train a support vector machine classifier and the test set to evaluate the classifier. The average A. value (area under the receiver operating characteristic curve) for classifying each lesion was 0.74 without temporal features and 0.77 with the use of temporal features. The improvement obtained by adding temporal features was statistically significant (P = 0.005). In particular, similarity features contributed to this improvement. Furthermore, we found that the improvement was comparable for masses that were visible and for masses that were not visible on the prior view. These results show that the use of temporal features is an effective approach to improve the characterization of masses.

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

computer-aided diagnosis (cad)
interval changes
mass characterization


Image Search-From Thousands to Billions in 20 Years This article presents a comprehensive review and analysis on image search in the past 20 years, emphasizing the challenges and opportunities brought by the astonishing increase of dataset scales from thousands to billions in the same time period, which was witnessed first-hand by the authors as active participants in this research area. Starting with a retrospective review of three stages of image search in the history, the article highlights major breakthroughs around the year 2000 in image search features, indexing methods, and commercial systems, which marked the transition from stage two to stage three. Subsequent sections describe the image search research from four important aspects: system framework, feature extraction and image representation, indexing, and big data's potential. Based on the review, the concluding section discusses open research challenges and suggests future research directions in effective visual representation, image knowledge base construction, implicit user feedback and crowdsourcing, mobile image search, and creative multimedia interfaces.

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

review
visual representation
indexing
image knowledge base

algorithms
documentation
performance
image retrieval
web image search
content-based
image feature
global feature
local feature
big data


Random set framework for multiple instance learning Multiple instance learning (MIL) is a technique used for learning a target concept in the presence of noise or in a condition of uncertainty. While standard learning techniques present the learner with individual samples, MIL alternatively presents the learner with sets of samples. Although sets are the primary elements used for analysis in MIL, research in this area has focused on using standard analysis techniques. In the following, a random set framework for multiple instance learning (RSF-MIL) is proposed that can directly perform analysis on sets. The proposed method uses random sets and fuzzy measures to model the MIL problem, thus providing a more natural mathematical framework, a more general MIL solution, and a more versatile learning tool. Comparative experimental results using RSF-MIL are presented for benchmark data sets. RSF-MIL is further compared to the state-of-the-art in landmine detection using ground penetrating radar data.

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

multiple instance learning
random set framework
landmine detection


Solution of contact problems by FETI domain decomposition with natural coarse space projections ? An efficient non-overlapping domain decomposition algorithm of the NeumannNeumann type for solving both coercive and semicoercive contact problems is presented. The discretized problem is first turned by the duality theory of convex programming to the quadratic programming problem with bound and equality constraints and the latter is further modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by an augmented Lagrangian type algorithm with an outer loop for the Lagrange multipliers for the equality constraints and an inner loop for the solution of the bound constrained quadratic programming problems. The projectors are shown to guarantee fast convergence of iterative solution of auxiliary linear problems and to comply with efficient quadratic programming algorithms proposed earlier. Reported theoretical results and numerical experiments indicate high numerical scalability of the algorithm which preserves the parallelism of the FETI methods.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 high-level abstraction of shared accesses We describe the design and use of the tape mechanism, a new high-level abstraction of accesses to shared data for software DSMs. Tapes consolidate and generalize a number of recent protocol optimizations, including update-based locks and record-replay barriers. Tapes are usually created by "recording" shared accesses. The resulting recordings can be used to anticipate future accesses by tailoring data movement to application semantics. Tapes-based mechanisms are layered on top of existing shared-memory protocols, and are largely independent of the underlying memory model. Tapes can also be used to emulate the data-movement semantics of several update-based protocol implementations, without altering the underlying protocol implementation. We have used tapes to create the Tapeworm synchronization library. Tapeworm implements sophisticated record-replay mechanisms across barriers, augments locks with data-movement semantics, and allows the use of producer-consumer segments, which move entire modified segments when any portion of the segment is accessed. We show that Tapeworm eliminates 85% of remote misses, reduces message traffic by 63%, and improves performance by an average of 29% for our application suite.

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

reliability
dsm
programming libraries
shared memory
update protocols


Analysis of low voltage bulk-driven self-biased high swing cascode current mirror A novel low voltage self-biased high swing cascode current mirror (SHCCM) employing bulk-driven NMOS transistors is proposed in this paper. The comparison with the conventional circuit reveals that the proposed bulk-driven circuit operates at lower voltages and provides enhanced bandwidth with improved output resistance. The proposed circuit is further modified by replacing the passive resistance by active MOS realization. Small signal analysis of the proposed and conventional SHCCM are carried out to show the improvement achieved through the proposed circuit. The circuits are simulated in standard SPICE 0.25?m CMOS technology and simulated results are compared with the theoretically obtained results. To ensure robustness of the proposed SHCCM, simulation results of component tolerance and process variation have also been included.

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

bulk-driven mosfet
cascode configuration
self-bias
high swing operation


Improvement of residual bilinearization by particle swarm optimization for achieving the second-order advantage with unfolded partial least-squares The combination of unfolded partial least-squares (U-PLS) with residual bilinearization (RBL) provides a second-order multivariate calibration method capable of achieving the second-order advantage. RBL is performed by varying the test sample scores in order to minimize the residues of a combined U-PLS model for the calibrated components and a principal component model for the potential interferents. The sample scores are then employed to predict the analyte concentration, with regression coefficients taken from the calibration step. When the contribution of multiple potential interferents is severe, particle swarm optimization (PSO) helps in preventing RBL to be trapped by false minima, restoring its predictive ability and making it comparable to the standard parallel factor (PARAFAC) analysis. Both simulated and experimental systems are analyzed in order to show the potentiality of the new technique. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

partial least-squares
particle swarm optimisation
second-order advantage


Computational cost of the Fekete problem I: The Forces Method on the 2-sphere Here, we study the computational complexity of the Fekete point problem. Namely, we give an exhaustive description of the main properties of an algorithm for the minimization of the logarithmic potential energy on the 2-sphere, and we characterize the probability distribution of the cost of the different minima. In particular, we show that a local minimum can be found with an average cost of about O(N2.8) O ( N 2.8 ) .

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


video completion via motion guided spatial-temporal global optimization In this paper, a novel global optimization based approach is proposed for video completion whose target is to restore the spatial-temporal missing regions of a video in a visually plausible way. Our algorithm consists of two stages: motion field completion and color completion via global optimization. First, local motions within the missing parts are completed patch-by-patch greedily using pre-computed available motions in the video. Then the missing regions are filled by sampling patches from available parts of the video. We formulate the video completion as a global energy minimization problem by Markov random fields (MRFs). Based on the completed motion field of the video, a well-defined energy function involving both spatial and temporal coherence relationship is constructed. A coarse-to-fine Belief Propagation (BP) is proposed to solve the optimization problem. Experimental results have demonstrated the good performance of our algorithm.

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

video completion
belief propagation
motion


Mitochondrial DNA Variation in the Aboriginal Populations of the Altai-Baikal Region: Implications for the Genetic History of North Asia and America The discovery of mtDNA types common to Asians and Amerinds (types A, B, C, and D) forced investigators to search for those nations of Asia which, though not considered the ancestors of the Amerinds, have retained a close genetic resemblance with them. We collected samples and studied the gene pools of the Turkic-speaking nations of South Siberia

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


Joint Sparse Learning for 3-D Facial Expression Generation 3-D facial expression generation, including synthesis and retargeting, has received intensive attentions in recent years, because it is important to produce realistic 3-D faces with specific expressions in modern film production and computer games. In this paper, we present joint sparse learning (JSL) to learn mapping functions and their respective inverses to model the relationship between the high-dimensional 3-D faces (of different expressions and identities) and their corresponding low-dimensional representations. Based on JSL, we can effectively and efficiently generate various expressions of a 3-D face by either synthesizing or retargeting. Furthermore, JSL is able to restore 3-D faces with holes by learning a mapping function between incomplete and intact data. Experimental results on a wide range of 3-D faces demonstrate the effectiveness of the proposed approach by comparing with representative ones in terms of quality, time cost, and robustness.

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

3d facial expression generation
sparse learning


the implementation and evaluation of fusion and contraction in array languages Array languages such as Fortran 90, HPF and ZPL have many benefits in simplifying array-based computations and expressing data parallelism. However, they can suffer large performance penalties because they introduce intermediate arrays---both at the source level and during the compilation process---which increase memory usage and pollute the cache. Most compilers address this problem by simply scalarizing the array language and relying on a scalar language compiler to perform loop fusion and array contraction. We instead show that there are advantages to performing a form of loop fusion and array contraction at the array level . This paper describes this approach and explains its advantages. Experimental results show that our scheme typically yields runtime improvements of greater than 20\% and sometimes up to 400\%. In addition, it yields superior memory use when compared against commercial compilers and exhibits comparable memory use when compared with scalar languages. We also explore the interaction between these transformations and communication optimizations.

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

communication
interaction
fusion
cache
use
language
performance
implementation
compilation
data parallelism
paper
runtime
evaluation
scheme

experimentation optimality arrays addressing process memorialized exploration contract


A Link-Based Approach to the Cluster Ensemble Problem Cluster ensembles have recently emerged as a powerful alternative to standard cluster analysis, aggregating several input data clusterings to generate a single output clustering, with improved robustness and stability. From the early work, these techniques held great promise; however, most of them generate the final solution based on incomplete information of a cluster ensemble. The underlying ensemble-information matrix reflects only cluster-data point relations, while those among clusters are generally overlooked. This paper presents a new link-based approach to improve the conventional matrix. It achieves this using the similarity between clusters that are estimated from a link network model of the ensemble. In particular, three new link-based algorithms are proposed for the underlying similarity assessment. The final clustering result is generated from the refined matrix using two different consensus functions of feature-based and graph-based partitioning. This approach is the first to address and explicitly employ the relationship between input partitions, which has not been emphasized by recent studies of matrix refinement. The effectiveness of the link-based approach is empirically demonstrated over 10 data sets (synthetic and real) and three benchmark evaluation measures. The results suggest the new approach is able to efficiently extract information embedded in the input clusterings, and regularly illustrate higher clustering quality in comparison to several state-of-the-art techniques.

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

cluster relations
link-based similarity
data mining


Model Checking Timed and Stochastic Properties with CSL(TA) Markov chains are a well-known stochastic process that provide a balance between being able to adequately model the system's behavior and being able to afford the cost of the model solution. Systems can be modeled directly as Markov chains, or with a higher-level formalism for which Markov chains represent the underlying semantics. Markov chains are widely used to study the performance of computer and telecommunication systems. The definition of stochastic temporal logics like Continuous Stochastic Logic (CSL) and its variant asCSL, and of their model-checking algorithms, allows a unified approach to the verification of systems, allowing the mix of performance evaluation and probabilistic verification. In this paper, we present the stochastic logic CSL(TA), which is more expressive than CSL and asCSL, and in which properties can be specified using automata (more precisely, timed automata with a single clock). The extension with respect to expressiveness allows the specification of properties referring to the probability of a finite sequence of timed events. A typical example is the responsiveness property "with probability at least 0.75, a message sent at time 0 by a system A will be received before time 5 by system B and the acknowledgment will be back at A before time 7", a property that cannot be expressed in either CSL or asCSL. Furthermore, the choice of using automata rather than the classical temporal operators Next and Until should help in enlarging the accessibility of model checking to a larger public. We also present a model-checking algorithm for CSL(TA).

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


An Approach for Optimal Goal Position Assignment in Vehicle Formations In this paper one methodology to solve the goal position assignment (GPA) problem is developed, this is, to assign the corresponding goal position (desired position) for a group of vehicles, knowing the initial positions and the established formation shape. By using this GPA methodology, it can be guaranteed that the formation will be reached in a minimum period of time and with lower collision risk compared with the other possible combinations of pairs "vehicles-goal position". Hungarian algorithm was used as combinatorial optimization algorithm, which requires a cost matrix, therefore it is shown the way to compute the cost matrix to obtain the best GPA. In order to show the optimal behavior of the proposed cost matrix, three approaches of cost matrix were evaluated in simulations of quad-rotor formations. Also, the optimal behavior of the proposed GPA is proved with numerical values of some defined parameters to determine optimal performance. The formation control was based on potential functions, while the control law for each vehicle was based on nested saturation.

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

assignment
vehicle formations
optimization


Electrical characterization of InGaN quantum well pn heterostructures In this work, two methods for electrical characterization of InGaN quantum well pn heterostructures at the nanometer level are presented. Cross-sectional Electrical Force Microscopy and High Resolution Electron Beam Induced Current (HR-EBIC) are used to study and identify regions of the cross-sectional surface of InGaN heterostructures with different types of electrical conductivity, the location of the InGaN quantum well, the location of the pn junction, and the depletion layer. HR-EBIC was implemented in a Scanning Transmission Electron Microscope to take advantage of the high resolution chemical imaging capabilities of this microscope, such as Z-Contrast and Energy Dispersive X-ray Spectroscopy, and the small spread of the high energy electron beam in the electron transparent thin sample that allows electron beam induced current imaging with nanometer resolution.

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


On-line two-machine open shop scheduling with time lags We analyze the performance of the greedy algorithm for the on-line two-machine open shop scheduling problem of minimizing makespan, in which time lags exist between the completion time of the first and the start time of the second operation of any job. The competitive ratio for the greedy algorithm is 2, and it can be reduced to 5/3 if the maximum time lag is less than the minimum positive processing time of any operation. These ratios are tight. We also prove that no on-line non-delay algorithm can have a better competitive ratio. As far as delay algorithms are concerned, no algorithm can do better than the greedy algorithm for the non-clairvoyant variant of the problem. For the clairvoyant variant, no on-line delay algorithm has a competitive ratio better than 2 .

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

on-line scheduling
open shops
worst case analysis


Building adaptive basis functions with a continuous self-organizing map This paper introduces CSOM, a continuous version of the Self-Organizing Map (SOM). The CSOM network generates maps similar to those created with the original SOM algorithm but, due to the continuous nature of the mapping, CSOM outperforms the SOM on function approximation tasks. CSOM integrates self-organization and smooth prediction into a single process. This is a departure from previous work that required two training phases, one to self-organize a map using the SOM algorithm, and another to learn a smooth approximation of a function. System performance is illustrated with three examples.

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

continuous function approximation
competitive learning
interpolation
neural networks
on-line learning
self-organizing map


Towards a Holistic Approach for Mutual Fund Performance Appraisal There is a growing literature that employs nonparametric frontier methods in order to evaluate the performance of investment funds. This paper proposes an integrated approach for analyzing the efficiency and performance of mutual funds. The methodology combines data envelopment analysis (DEA) with a multicriteria decision aid methodology. DEA is employed to assess the relative efficiency of mutual funds in terms of their return, capital flow, gross expense ratio, turnover rate, and risk. In a second stage, a multicriteria approach is employed to develop an overall performance measure on the basis of the DEA efficiency results. The resulting model evaluates all mutual funds in a common basis and enables comparisons over time. The methodology is applied to a sample of more than 500 US equity mutual funds over the period 20032010. The analysis is implemented under three different time-window periods (one, three, and five year evaluations). The results obtained for portfolios constructed on the basis of our global performance measure, Sharpe ratio and Morningstar rating system are useful since they provide significant economic evidence in favor of our global performance measure. Our results entail practical implications for both investors and fund managers in terms of fund selection and efficient portfolio management respectively.

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

mutual funds
efficiency
data envelopment analysis


Design of reaching phase for variable structure controller based on Householder transformation In this paper a design of reaching phase for variable structure controller with sliding mode of an uncertain dynamic system based on Householder transformation method is considered. The proposed method reduces the number of switching gain vector components and performs satisfactorily while the external disturbance component does not satisfy the matching conditions. Subsequently the stability of the global system is studied and furthermore, the design of switched gain matrix elements based on fuzzy logic approach provides useful result for smooth control actions. The efficacy of the proposed method is demonstrated by considering a load-frequency control problem of interconnected power system.

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

switching function
reachability
variable structure control
interconnected power systems
lyapunov function


steady state visual evoked potentials by dual sine waves The sum of sine waves was used to evoke Steady State Visual Evoked Potentials (SSVEP). The SSVEP responses were elicited by visual stimuli in the form of a flickering light emitting diode (LED). We recorded EEG responses to these stimuli and analyzed the observed spectral differences due to square waves, triangle waves and sine waves. We showed that the resolution of the dual stimuli, which is defined as the difference between two frequencies, is essential to SSVEP experiments. Reliable dual SSVEP spikes from EEG signals can only be acquired if the dual stimuli are at least 4Hz apart. We also tested tri-stimuli and showed that consistent EEG responses are not achievable, even though the stimuli were 4Hz apart. The essence of these experiments is to demonstrate the resolutions under which dual sine waves can generate consistent SSVEP responses.

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


automatic tuning of two-level caches to embedded applications The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50\% of the total microprocessor system power, and is thus a good candidate for optimizations. We present an automated method for tuning two-level caches to embedded applications for reduced energy consumption. The method is applicable to both a simulation-based exploration environment and a hardware-based system prototyping environment. We introduce the two-level cache tuner, or TCaT - a heuristic for searching the huge solution space of possible configurations. The heuristic interlaces the exploration of the two cache levels and searches the various cache parameters in a specific order based on their impact on energy. We show the integrity of our heuristic across multiple memory configurations and even in the presence of hardware/software partitioning -- a common optimization capable of achieving significant speedups and/or reduced energy consumption. We apply our exploration heuristic to a large set of embedded applications. Our experiments demonstrate the efficacy of our heuristic: on average the heuristic examines only 7\% of the possible cache configurations, but results in cache sub-system energy savings of 53\%, only 1\% more than the optimal cache configuration. In addition, the configured cache achieves an average speedup of 30\% over the base cache configuration due to tuning of cache line size to the application's needs.

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

architecture tuning
embedded systems
low energy
cache hierarchy
configurable cache
cache exploration
low power
cache optimization


Time dependent vehicle routing problem with a multi ant colony system The Time Dependent Vehicle Routing Problem (TDVRP) consists in optimally routing a fleet of vehicles of fixed capacity when travel times are time dependent, in the sense that the time employed to traverse each given arc, depends on the time of the day the travel starts from its originating node. The optimization method consists in finding solutions that minimize two hierarchical objectives: the number of tours and the total travel time. Optimization of total travel time is a continuous optimization problem that in our approach is solved by discretizing the time space in a suitable number of subspaces. New time dependent local search procedures are also introduced, as well as conditions that guarantee that feasible moves are sought for in constant time. This variant of the classic Vehicle Routing Problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. In this paper it is shown that when dealing with time constraints, like hard delivery time windows for customers, the known solutions for the classic case become unfeasible and the degree of unfeasibility increases with the variability of traffic conditions, while if no hard time constraints are present, the classic solutions become suboptimal. Finally an application of the model to a real case is presented. The model is integrated with a robust shortest path algorithm to compute time dependent paths between each customer pairs of the time dependent model.

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

vehicle routing
time dependent
ant colony system


Case based reasoning method for computer aided welding fixture design This paper presents a case-based reasoning (CBR) method for welding fixture design, a critical issue in the manufacturing of large and complicated equipment. However, previous fixture design research has mainly focused on machining fixtures rather than welding fixtures. In this paper, an approach of data abstraction for fixture design information representation is proposed, first to systemize and manage myriads of fixture related resources, e.g.,past fixture design solutions, fixture units depository. Based on this approach, a multi-level CBR method for welding fixture design is then presented. This method could help designers, by referencing previous design cases, to make a conceptual fixturing solution quickly and, finally, finish the detailed solution of fixture design.

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


Worldwide contributors to the literature of library and information science: top authors, 20072012 This study identifies the top individual contributors to 31 LIS journals from 2007 to 2012, both worldwide (all disciplines) and among four groups: LIS faculty in the US and Canada, LIS faculty in the UK, LIS faculty in other countries, and librarians worldwide. The distribution of authorship is highly skewed. Although more than 9,800 authors (86.4%) each contributed no more than a single article over the six-year period, the top 50 authors (0.4%) each contributed eight or more articles, with an average of 13.0. Together, the top 50 authors account for nearly 8% of the LIS literature. Moreover, the most productive LIS faculty are concentrated in relatively few universities. Faculty in the natural sciences and LIS are more likely to be found among the top 50 authors than their overall contributions would suggest, while librarians, computer scientists and non-academic authors are underrepresented. Top authors are especially likely to publish in the Journal of Informetrics and Scientometrics. Among American LIS faculty, the list of the most prolific authors has changed substantially over time. Only three of the top 21 authors of the 19992004 period can be found on the current top-20 list.

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

authorship contributors disciplines information library


Evaluation of the OECD QSAR Application Toolbox and Toxtree for estimating the mutagenicity of chemicals. Part 2. - unsaturated aliphatic aldehydes The OECD QSAR Application Toolbox versions 1.1.01 and 1.1.02 and Toxtree version 1.60, which were developed for facilitating the practical use of (Q)SAR approaches by regulators, include a mechanistic SAR model for predicting the mutagenicity of - unsaturated aliphatic aldehydes. The aim of this study was to estimate the interest and limitations of this model. First, the model was re-computed to check its transparency and to verify its statistical validity. Then, the model implemented in the two software tools was tested on 34 chemicals not previously used for its design and for which experimental mutagenic activity data were available in the literature. A critical analysis of the results was performed and the practical interest of the model was discussed.

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

qsar toolbox
- unsaturated aliphatic aldehydes
external validation
mechanistic model


Segmentation of tongue muscles from super-resolution magnetic resonance images The first attempt to segment tongue muscles from in vivo MR images is presented. The focus is on segmenting the genioglossus and inferior longitudinalis muscles. The game-theoretic approach is applied for landmark-based segmentation. The database will be publicly released for objective method comparison.

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

human tongue
game theory
magnetic resonance imaging
atlasing


Robust Sybil attack defense with information level in online Recommender Systems Leveraging enough information against Sybil attack on the general purpose RSs. Extensive experiments with real world data sets. Achieving significant performance improvements in terms of HR and PS.

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

author keywords
recommendation systems
robust algorithm


An adaptive control method for time-varying systems Fuzzy set theory has grown to become a major scientific domain collectively referred to as fuzzy systems. It has been shown that there are a lot of applications in almost all sub-areas of fuzzy systems. However, the most successful application has been in fuzzy control. Fuzzy control algorithms have been extensively used in business and industry. In this paper, an adaptive control technique based on the fuzzy parameter identification is presented. The application of this technique includes an example in agriculture.

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


Correlated ATP-Induced Changes in Membrane Area and Membrane Conductance in Single Rat Adipocytes Abstract: In the past few years it has been shown that, like many other non-neuroendocrine cells, adipocytes possess a mechanism for triggered exocytosis. Endocytosis and exocytosis affect the plasma membrane surface area, which can be directly monitored with electrophysiological patch-clamp techniques by measuring membrane capacitance, a parameter linearly related to the plasma membrane area. In this study we used the whole-cell mode of the patch-clamp technique to measure changes in membrane capacitance to monitor the effect of extracellular adenosine triphosphate (ATP) on the dynamics of membrane area changes in single adipocytes. Experimental evidence shows that extracellular application of ATP (100 ?M) increases membrane capacitance for 30 2%. In controls a significantly smaller increase of 3 2% was measured, which is due to a slow exocytic-endocytic membrane cycling rate of 0/3%/min. We found that ATP induces a transient increase in membrane current, temporally associated with the peak rate in membrane capacitance increase. These results show directly the presence of ATP-induced increase in membrane area correlated to the increase in membrane current in single adipocytes.

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


Finite-time synchronization of coupled networks with one single time-varying delay coupling This paper studies finite-time synchronization of hybrid coupled networks. There is only one transmittal delay in the delayed coupling. The fact is that in the signal transmission process, the time delay affects only the variable that is being transmitted from one system to another, so assume that there is only one single time-varying delay coupling is more consistent with the reality. At the same time, the internal delay and coupling delay are time-varying and different. Based on the Lyapunov stability theory, a feedback controller is designed for achieving synchronization between two coupled networks with time-varying delays in finite time. Finally, simulation examples are given to illustrate the theoretical analysis.

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

finite-time synchronization
coupled network
one single delay
lyapunov functional


Enhancing the universality and transferability of freeway incident detection using a Bayesian-based neural network Development of a universal freeway incident detection algorithm is a task that remains unfulfilled despite the promising approaches that have been recently explored. Incident detection researchers are realizing that an operationally successful detection framework needs to fulfill a full set of recognized needs. In this paper we attempt to define one possible set of universality requirements. Among the set of requirements, a freeway incident detection algorithm needs to be operationally accurate and transferable. Guided by the envisioned requirements, we introduce a new algorithm with potential for enhanced performance. The algorithm is a modified form of the Bayesian-based Probabilistic Neural Network (PNN) that utilizes the concept of statistical distance. The paper is divided into three main sections. The first section is a detailed definition of the attributes and capabilities that a potentially universal freeway incident detection framework should possess. The second section discusses the training and testing of the PNN. In the third section, we evaluate the PNN relative to the universality template previously defined. In addition to a large set of simulated incidents, we utilize a fairly large real incident databases from the I-880 freeway in California and the I-35W in Minnesota to comparatively evaluate the performance and transferability of different algorithms, including the PNN. Experimental results indicate that the new PNN-based algorithm is competitive with the Multi Layer Feed Forward (MLF) architecture, which was found in previous studies to yield superior incident detection performance, while being significantly faster to train. In addition, results also point to the possibility of utilizing the real-time learning capability of this new architecture to produce a transferable incident detection algorithm without the need for explicit off-line retraining in the new site. In this respect, and unlike existing algorithms, the PNN has been found to markedly improve in performance with time in service as it retrains itself on captured incident data, verified by the Traffic Management Center (TMC) operator. Moreover, the overall PNN-based framework promises potential enhancements towards the envisioned universality requirements.

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

advanced traffic management
freeway management
neural networks


On the generalization of the Costas property in the continuum We extend the definition of the Costas property to functions in the continuum, namely on intervals of the Deals or the rationals, and argue that such functions can be used in the same applications as discrete Costas arrays. We construct Costas bijections in the real continuum within the class of piecewise continuously differentiable functions, but our attempts to construct a fractal-like Costas bijection there are successful only under slight but necessary deviations from the usual arithmetic laws. The situation over the rationals is different: there, we propose a method of great generality and flexibility for the construction of a Costas fractal bijection. Its success, though, relies heavily on the enumerability of the rationals, and therefore it cannot be generalized over the Deals in an obvious way.

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

piecewise continuously differentiable bijections


Modeling location management in wireless networks with generally distributed parameters In the wireless mobile networks, location update (LU) and paging are two basic operations in the framework of mobility management. The trade-off analysis between LU and paging is traditionally performed under the assumption that the key variables follow exponential distribution. However, recent work showed that such assumptions may be incorrect. In this paper, by introducing the concept of LU inter-arrival time and additionally relaxing the assumptions for the inter-service time, cell residence time and LU inter-arrival time, we present an analytical technique to develop the closed-form formula for the signaling cost applicable to different location management schemes. Specifically, the result is applied to the static scheme and the dynamic movement-based scheme to demonstrate the general applicability. Illustrative numerical examples are given to compare the location management scheme performance based on the cell characteristics. (c) 2006 Elsevier B.V. All rights reserved.

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

location update
paging
cell residence time
wireless networks

dynamic location management
inter-service time
location area


scheduling-independent threads and exceptions in shim Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typical concurrent programming formalisms are prone to races and nondeterminism, despite the presence of mechanisms such as monitors.In this paper, we propose SHIM, the core of a deterministic concurrent language, meaning the behavior of a program is independent of the scheduling of concurrent operations. SHIM does not sacrifice power or flexibility to achieve this determinism. It supports both synchronous and asynchronous paradigms-loosely and tightly synchronized threads-the dynamic creation of threads and shared variables, recursive procedures, and exceptions.We illustrate our programming model with examples including breadth-first-search algorithms and pipelines. By construction, they are race-free. We provide the formal semantics of SHIM and a pre-liminary implementation.

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

hardware/software codesign
deterministic model of computation


A linear approach for sparse coding by a two-layer neural network Many approaches to transform classification problems from non-linear to linear by feature transformation have been recently presented in the literature. These notably include sparse coding methods and deep neural networks. However, many of these approaches require the repeated application of a learning process upon the presentation of unseen data input vectors, or else involve the use of large numbers of parameters and hyper-parameters, which must be chosen through cross-validation, thus increasing running time dramatically. In this paper, we propose and experimentally investigate a new approach for the purpose of overcoming limitations of both kinds. The proposed approach makes use of a linear auto-associative network (called SCNN) with just one hidden layer. The combination of this architecture with a specific error function to be minimized enables one to learn a linear encoder computing a sparse code which turns out to be as similar as possible to the sparse coding that one obtains by re-training the neural network. Importantly, the linearity of SCNN and the choice of the error function allow one to achieve reduced running time in the learning phase. The proposed architecture is evaluated on the basis of two standard machine learning tasks. Its performances are compared with those of recently proposed non-linear auto-associative neural networks. The overall results suggest that linear encoders can be profitably used to obtain sparse data representations in the context of machine learning problems, provided that an appropriate error function is used during the learning phase.

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

neural networks
sparse coding
linear approach


A

novel

differential

multiuser

detection

algorithm

for

multiuser

MIMO-OFDM

systems

We

propose

an

efficient

low

bit

error

rate

(BER)

and

low

complexity

multiple-input

multiple-output

(MIMO)

multiuser

detection

(MUD)

method

for

use

with

multiuser

MIMO

orthogonal

frequency

division

multiplexing

(OFDM)

systems.

It

is

a

hybrid

method

combining

a

multiuser-interference-cancellation-based

decision

feedback

equalizer

using

error

feedback

filter

(MIMO

MIC

DFE-EFF)

and

a

differential

algorithm.

The

proposed

method,

termed

'MIMO

MIC

DFE-EFF

with

a

differential

algorithm'

for

short,

has

a

multiuser

feedback

structure.

We

describe

the

schemes

of

MIMO

MIC

DFE-EFF

and

MIMO

MIC

DFE-EFF

with

a

differential

algorithm,

and

compare

their

minimum

mean

square

error

(MMSE)

performance

and

computational

complexity.

Simulation

results

show

that

a

significant

performance

gain

can

be

achieved

by

employing

the

MIMO

MIC

DFE-EFF

detection

algorithm

in

the

context

of

a

multiuser

MIMO-OFDM

system

over

frequency

selective

Rayleigh

channel.

MIMO

MIC

DFE-EFF

with

the

differential

algorithm

improves

both

computational

efficiency

and

BER

performance

in

a

multistage

structure

relative

to

conventional

DFE-EFF,

though

there

is

a

small

reduction

in

system

performance

compared

with

MIMO

MIC

DFE-EFF

without

the

differential

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

orthogonal frequency division multiplexing (ofdm)


A workflow framework for intelligent service composition In practice, service composition and its evaluation are initiated by participant web services functional and non-functional attributes. It often consists of functional property-based service location, non-functional property-based quality evaluation, and then a finial executive plan. This scheduling process is often unfolded in a workflow framework. Generally, selecting qualified services and composing them manually are time-consuming and error-prone. In view of this challenge, a workflow framework is presented in this paper for intelligently navigating service composition. This workflow framework consists of two primary processing modules, i.e., Planning Module and CSP (Constraint Satisfaction Problems) Solving Module. Taking advantage of services functional attributes, Planning Module aims at producing referred composite plans that play as general patterns. CSP Solving Module focuses on selecting qualified services to implement the composite plans, based on their non-functional attributes evaluation. Finally, a case study is presented to demonstrate the validity of framework.

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

workflow framework
service composition
csp


Fast computation of spatial selections and joins using graphics hardware ? Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects. In the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. Although many run-time and pre-processing-based heuristics have been proposed to alleviate this problem, the CPU cost still remains the bottleneck. In this paper, we propose a novel approach to address this problem using the efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and is applicable to both intersection and distance predicates. We evaluate this approach by comparing the performance with leading software solutions. The results show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins. We integrated this hardware/software co-processing technique into a popular database to evaluate its performance in the presence of indexes, pre-processing and other proprietary optimizations. Extensive experimentation with real-world data sets show that the hardware-accelerated technique not only outperforms the run-time software solutions but also performs as well if not better than pre-processing-assisted techniques.

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

databases
geographic information systems
query optimization


Segmentation of the heart and great vessels in CT images using a model-based adaptation framework Recently, model-based methods for the automatic segmentation of the heart chambers have been proposed. An important application of these methods is the characterization of the heart function. Heart models are, however, increasingly used for interventional guidance making it necessary to also extract the attached great vessels. It is, for instance, important to extract the left atrium and the proximal part of the pulmonary veins to support guidance of ablation procedures for atrial fibrillation treatment. For cardiac resynchronization therapy, a heart model including the coronary sinus is needed. We present a heart model comprising the four heart chambers and the attached great vessels. By assigning individual linear transformations to the heart chambers and to short tubular segments building the great vessels, variable sizes of the heart chambers and bending of the vessels can be described in a consistent way. A configurable algorithmic framework that we call adaptation engine matches the heart model automatically to cardiac CT angiography images in a multi-stage process. First, the heart is detected using a Generalized Hough Transformation. Subsequently, the heart chambers are adapted. This stage uses parametric as well as deformable mesh adaptation techniques. In the final stage, segments of the large vascular structures are successively activated and adapted. To optimize the computational performance, the adaptation engine can vary the mesh resolution and freeze already adapted mesh parts. The data used for validation were independent from the data used for model-building. Ground truth segmentations were generated for 37 CT data sets reconstructed at several cardiac phases from 17 patients. Segmentation errors were assessed for anatomical sub-structures resulting in a mean surface-to-surface error ranging 0.500.82mm for the heart chambers and 0.601.32mm for the parts of the great vessels visible in the images.

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

heart segmentation
model-based segmentation
shape variability
computed tomography


A multi-collection latent topic model for federated search Collection selection is a crucial function, central to the effectiveness and efficiency of a federated information retrieval system. A variety of solutions have been proposed for collection selection adapting proven techniques used in centralised retrieval. This paper defines a new approach to collection selection that models the topical distribution in each collection. We describe an extended version of latent Dirichletallocation that uses a hierarchical hyperprior to enable the different topical distributions found in each collection to be modelled. Under the model, resources are ranked based on the topical relationship between query and collection. By modelling collections in a low dimensional topic space, we can implicitly smooth their term-based characterisation with appropriate terms from topically related samples, thereby dealing with the problem of missing vocabulary within the samples. An important advantage of adopting this hierarchical model over current approaches is that the model generalises well to unseen documents given small samples of each collection. The latent structure of each collection can therefore be estimated well despite imperfect information for each collection such as sampled documents obtained through query-based sampling. Experiments demonstrate that this new, fully integrated topical model is more robust than current state of the art collection selection algorithms.

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

distributed information retrieval
topic models


Medial axis of a planar region by offset self-intersections The medial axis (MA) of a planar region is the locus of those maximal disks contained within its boundary. This entity has many CAD/CAM applications. Approximations based on the Voronoi diagram are efficient for linear-arc boundaries, but such constructions are more difficult if the boundary is free. This paper proposes an algorithm for free-form boundaries that uses the relation between MA and offsets. It takes the curvature information from the boundary in order to find the self-intersections of successive offset curves. These self-intersection points belong to the MA and can be interpolated to obtain an approximation in Bzier form. This method also approximates the medial axis transform by using the offset distance to each self-intersection.

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

medial axis transform
offset self-intersection
interpolation


New Families of Binary Sequence Pairs With Two-Level and Three-Level Correlation A pair of binary sequences is generalized from the concept of a two-level autocorrelation function of a single binary sequence. In this paper, new families of binary sequence pairs with period N = np, where gcd(n, p) = 1, and optimal correlation values -1 are constructed, as well as new families of binary sequence pairs with three-level correlation and period N equivalent to 0(mod 4). For the new binary sequence pairs with optimal correlation values, their corresponding new difference set pairs and almost difference set pairs are also derived.

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

almost difference set pair (adsp)
binary sequence pair
difference set pair (dsp)
optimal correlation value


On the Convergence of Fictitious Play in Channel Selection Games The channel selection (CS) problem in decentralized parallel multiple access channels considers the mutual interference of the different radio devices, and this interaction can be modeled by strategic-form games. Here, we show that the CS problem is a potential game (PG) and thus the fictitious play (FP) converges to a Nash equilibrium (NE) either in pure or mixed strategies. Using a 2-player 2-channel game, it is shown that convergence in mixed strategies might lead to cycles of action profiles which lead to individual spectral efficiencies (SE) which are worse than the SE at the worst NE in mixed and pure strategies. Finally, taking advantage from the fact that the CS problem is a PG and an aggregation game, we show a method to implement FP with local information and minimum feedback.

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

aggregation games
game theory
pure and mixed strategies
potential games
strategic-form games
and spectral efficiency


Diminished Transcription Factor Survival Signals in Dorsal Root Ganglia in Rats with Streptozotocin-Induced Diabetes Rats with experimental diabetes show changes in prenuclear signals that might impact on neuronal transcription factors; these in turn may be responsible for the phenotype switches characteristic of diabetic neuropathies. This study was designed to examine the effect of streptozotocin-diabetes of 12 weeks' duration on the activation of three transcription factors known to affect neuronal phenotype in dorsal root ganglia (DRG). Pooled L4 and L5 were subject to gel-shift analysis to measure binding to consensus oligonucleotides. This revealed significant reduction in activation of CREB and NF?B in DRG from diabetic rats, but no effect on AP-1. The CREB change may be secondary to target tissue NGF depletion, and the reduced NF?B indicates impaired capacity to withstand neurotrophic defects. Thus, these changes my underlie consequences of impaired neurotrophic regulation of phenotype reported in other studies in diabetic rats.

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


enhancing chord recognition accuracy using web resources Machine learning methods for chord recognition have improved considerably in the past few years. However, further progress seems constrained by the scarcity of training data. In this paper, we show that this problem can be partially solved by exploiting noisy but freely and abundantly available online resources, in addition to fully labeled training data. We use these data to restrict the output of the Viterbi algorithm, resulting in significant improvements over the standard decoding process.

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


Game-based curriculum and transformational play: Designing to meaningfully positioning person, content, and context Grounded in our work on designing game-based curriculum, this paper begins with a theoretical articulation of transformational play. Students who play transformationally become protagonists who use the knowledge, skills, and concepts of the educational content to first make sense of a situation and then make choices that actually transform the play space and themselves they are able to see how that space changed because of their own efforts. Grounding these theoretical ideas, in this manuscript we describe one curriculum design informed by this theory. We also describe a study of the same teacher who was observed teaching two different curricula (game-based versus story-based) about persuasive writing. Results showed that while students in both classes demonstrated significant learning gains, the gains were significantly greater for students in the game-based classroom. Additionally, students assigned the game-based unit reported significantly higher levels of engagement, had different goals motivating their participation, and received fewer teacher reprimands to stay on task. Both quantitative and qualitative results are interpreted in terms of the theory of transformational play, which guided the design. Implications in terms of the power of game design methodologies for schools as well as learning theory more generally are discussed. Published by Elsevier Ltd.

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

videogames
play theory
learning environments
educational technology


testbed for information extraction from deep web Search results generated by searchable databases are served dynamically and far larger than the static documents on the Web. These results pages have been referred to as the Deep Web. We need to extract the target data in results pages to integrate them on different searchable databases. We propose a test bed for information extraction from search results. We chose 100 databases randomly from 114,540 pages with search forms. Therefore, these databases have a good variety. We selected 51 databases which include URLs in a results pageand manually identify target information to be extracted. We also suggest evaluation measures for comparing extraction methods and methods for extending the target data.

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


Scheduling with base station diversity and fairness analysis for the downlink of CDMA cellular networks Efficient packet scheduling in CDMA cellular networks is a challenging problem due to the time variant and stochastic nature of the channel fading process. Selection diversity is one of the most effective techniques utilizing random and independent variations of diverse channels to improve the performance of communication over fading channels. In this paper, we propose two packet scheduling schemes exploiting base station selection diversity in the downlink of CDMA cellular networks. The proposed schemes rely on the limited instantaneous channel state information (CSI) to select the best user from the best serving base station at each time slot. This technique increases the system throughput by increasing multiuser diversity gain and reducing the effective interference among adjacent base stations. Results of Monte Carlo simulations are given to demonstrate the improvement of system throughput using the proposed scheduling schemes. In addition, we investigate fairness issue of wireless scheduling schemes. Due to different characteristics of wireless scheduling schemes, the existing fairness indexes may result in misleading comparison among different schemes. We propose a new fairness index to compare the overall satisfaction of the network users for different scheduling schemes. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

cellular networks
diversity
fairness index


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

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

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


Construction of an optimal multicast tree for group communication in a cellular network using genetic algorithm The recent advances in wireless technology has enabled users of Mobile cellular networks in different parts of the world not only to communicate with each other but also to participate in real time applications, viz., video conferencing, multiparty games, online auctions, access to distributed databases, etc., on the fly. All these applications require a Multicast Tree (MT) to be constructed among the group users with the source being the root of the MT. Traditional methods used in a wired network to construct a MT take into account only the distance or delay between the nodes. These methods when extended to mobile networks fail because of the inherent dynamism in a mobile network. To overcome this problem and to give an optimized solution to this problem, a novel Genetic Algorithm (GA) based approach to construct an Optimal Multicast Tree (OMT) with four constraints viz., probability of delay over a path, queuing delay at a node, residual bandwidth of a link, and the speed of the user is proposed in this paper. Further, for a network of N nodes and E edges, with k independent constraints, it has been derived that the time complexity and space complexity for GA based algorithm are O(N-2) and O(N), respectively, whereas the time complexity and space complexity for the non-GA based multi constrained algorithm are O (N-2k) and O(N-2). These results show that the GA based algorithm is insensitive to the number of constraints and it constructs OMT faster than the traditional algorithms. (c) 2006 Elsevier B.V. All rights reserved.

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

mobile network
genetic algorithm
optimal multicast tree

multi constraints
time and space complexity


A measure of entanglement through quantum trajectory approach We propose a measure of entanglement through the quantum trajectory approach. The advantage of this measure is that it can avoid the problem of finding all possible decompositions for mixed states, which is usually complicated. This method can be applied to any physical system whose time evolution is governed by the master equation. As an example, we calculate the entanglement of the following cases: ( A) entangled system composed of a pair of two- level atoms coupling to two separate baths and, ( B) two entangled modes subjected to two separate baths.

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

measure of entanglement
quantum trajectory approach
master equation


Score calculation from final tournament tables In this paper, we deal with the issue of determining the scores of all matches involved in a football tournament. The final table of the tournament, which shows the standings of the teams, is taken as the initial data of the problem. This is a different kind of combinatorial problems which require the construction of valid initial states according to some given final state. We use a rules-based method to solve the problem, analyzing the search space and introducing the notion of black&white graphs. The table data is firstly used to compute possible results of all played matches. Based on the results as well as the total number of scored and conceded goals, possible scores of the matches are then computed. The solution strategy is experimented on several final tables from previous World Cup tournaments. Other experiments are conducted for various team standings, measuring the time required to process some specific data of up to 10 teams.

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


QRS detection based on wavelet coefficients Electrocardiogram (ECG) signal processing and analysis provide crucial information about functional status of the heart. The QRS complex represents the most important component within the ECG signal. Its detection is the first step of all kinds of automatic feature extraction. QRS detector must be able to detect a large number of different QRS morphologies. This paper examines the use of wavelet detail coefficients for the accurate detection of different QRS morphologies in ECG. Our method is based on the power spectrum of QRS complexes in different energy levels since it differs from normal beats to abnormal ones. This property is used to discriminate between true beats (normal and abnormal) and false beats. Significant performance enhancement is observed when the proposed approach is tested with the MIT-BIH arrhythmia database (MITDB). The obtained results show a sensitivity of 99.64% and a positive predictivity of 99.82%.

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

qrs detection
power spectrum
wavelet detail coefficients


a virtualized energy-efficient office environment The energy efficiency of information and communication technology becomes more and more important due to the raise of energy costs and the world wide desire to reduce CO 2 emissions. Data centers have been in the focus concerning their energy efficiency lately, however, also office hosts that are located outside of data centres consume huge amounts of energy (e.g., in public administration or companies). Such office environments promise a high potential in terms of energy savings -- a significant number of hosts remains to be turned on 24 hours per day while being mostly underutilized. This paper investigates the energy consumption in office environments and discusses the potential of energy savings. An energy-efficient office management approach is suggested, based on resource virtualization, power management, and resource sharing. Additionally, the paper evaluates simulation results concerning energy consumption and service provision in the managed office environment. The evaluation indicates that about 75\% of energy savings are achievable in office environments without a significant interruption of provided services.

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

office environment
virtualization
power management
resource sharing
energy efficiency


a performance evaluation of 2d-mesh, ring, and crossbar interconnects for chip multi-processors As the number of processing nodes on chip multi-processors (CMPs) keeps increasing, providing efficient communication with the on-chip interconnect becomes increasingly critical. With 32-core CMP designs on the drawing table of engineers, there is a demand for accurate simulation models that capture all the complexities and interactions of the different design layers including the application, operating system, cache hierarchy, coherency protocol, and other on-chip resources. These components cannot be modeled anymore in isolation as unpredicted performance anomalies may arise once all the system variables are taken into account. In this paper, we present a simulation framework for CMP systems, focusing our attention on the on-chip network. We show preliminary results for the choice of key network parameters (topology, flit size) with respect to the behavior and performance of applications running on top of different network configurations. This paper tries to convey the need for an overall CMP system simulator as a way to accurately characterize the actual behavior of the on-chip network.

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

chip multi-processors
multiprocessor simulations
on-chip networks


thinking about binary trees in an object-oriented world The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using concepts from Object-Oriented Programming and C++. The Binary Search Tree illustrates how adopting a new approach and a new language can lead to a new way of thinking about a familiar problem.

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

implementation
teaching
trees
language
data structures

concept
binary search trees
understandability
object-oriented programming
examples
object-oriented
exploration