Effect of RuO2 electrode on laser-MBE prepared HfO2 gate dielectrics In this paper, we report our recent study of the effect of RuO2 as an alternative top electrode for pMOS devices to overcome the serious problems of polysilicon (poly-Si) gate depletion, high gate resistance and dopant penetration in the trend of down to 50nm devices and beyond. The conductive oxide RuO2, prepared by RF sputtering, was investigated as the gate electrode on the Laser MBE (LMBE) fabricated HfO2 for pMOS devices. Structural, dielectric and electric properties were investigated. RuO2/HfO2/n-Si capacitors showed negligible flatband voltage shift ( 10MVcm?1). Compared to the SiO2 dielectric with the same EOT value, RuO2/HfO2/n-Si capacitors exhibited at least 4 orders of leakage current density reduction. The work function value of the RuO2 top electrode was calculated to be about 5.0eV by two methods, and the effective fixed oxide charge density was determined to be 3.31012cm?2. All the results above indicate that RuO2 is a promising alternative gate electrode for LMBE grown HfO2 gate dielectrics.

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


A model for rational abandonments from invisible queues We propose a model for abandonments from a queue, due to excessive wait, assuming that waiting customers act rationally but without being able to observe the queue length. Customers are allowed to be heterogeneous in their preferences and consequent behavior. Our goal is to characterize customers' patience via more basic primitives, specifically waiting costs and service benefits: these two are optimally balanced by waiting customers, based on their individual cost parameters and anticipated waiting time. The waiting time distribution and patience profile then emerge as an equilibrium point of the system. The problem formulation is motivated by teleservices, prevalently telephone- and Internet-based. In such services, customers and servers are remote and queues are typically associated with the servers, hence queues are invisible to waiting customers. Our base model is the M/M/m queue, where it is shown that a unique equilibrium exists, in which rational abandonments can occur only upon arrival (zero or infinite patience for each customer). As such a behavior fails to capture the essence of abandonments, the base model is modified to account for unusual congestion or failure conditions. This indeed facilitates abandonments in finite time, leading to a nontrivial, customer dependent patience profile. Our analysis shows, quite surprisingly, that the equilibrium is unique in this case as well, and amenable to explicit calculation.

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

multiserver exponential queues
nash equilibrium
call centers


Frame-Based Packet-Mode Scheduling for Input-Queued Switches Most packet scheduling algorithms for input-queued switches operate on fixed-sized packets known as cells. In reality, communication traffic in many systems such as Internet runs on variable-sized packets. Motivated by potential savings of segmentation and reassembly, there has been increasing interest in scheduling variable-sized packets in a nonpreemptive manner known as packet-mode scheduling. This paper studies frame-based packet-mode scheduling for better scalability. It first shows that the admissible condition is no longer sufficient for packet-mode scheduling. Then, a relation between the frame size and packet sizes is derived that classifies under what conditions the packet-mode scheduling problem is polynomial solvable or is NP-hard. This relation reveals an interesting result that under various packet size distributions, it may be polynomial solvable even if many different packet sizes occur in the packet set, whereas it may be NP-hard with just two packet sizes present. Finally, as a practical solution, this paper studies how a speedup can help packet-mode scheduling. It is shown that the admissible condition becomes sufficient also when a speedup of two is used. A simple algorithm with a speedup of two is presented.

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

cell-mode scheduling
frame-based scheduling
input-queued switch
np-hard
packet-mode scheduling


Image classification using correlation tensor analysis Images, as high-dimensional data, usually embody large variabilities. To classify images for versatile applications, an effective algorithm is necessarily designed by systematically considering the data structure, similarity metric, discriminant subspace, and classifier. In this paper, we provide evidence that, besides the Fisher criterion, graph embedding, and tensorization used in many existing methods, the correlation-based similarity metric embodied in supervised multilinear discriminant subspace learning can additionally improve the classification performance. In particular, a novel discriminant subspace learning algorithm, called correlation tensor analysis (CTA), is designed to incorporate both graph-embedded correlational mapping and discriminant analysis in a Fisher type of learning manner. The correlation metric can estimate intrinsic angles and distances for the locally isometric embedding, which can deal with the case when Euclidean metric is incapable of capturing the intrinsic similarities between data points. CTA learns multiple interrelated subspaces to obtain a low-dimensional data representation reflecting both class label information and intrinsic geometric structure of the data distribution. Extensive comparisons with most popular subspace learning methods on face recognition evaluation demonstrate the effectiveness and superiority of CTA. Parameter analysis also reveals its robustness.

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

discriminant analysis
face recognition
image classification
subspace learning


LDBOD: A novel local distribution based outlier detector As an important research direction in KDD field, outlier detection has been drawing much attention from different communities. In this paper, two novel algorithms LDBOD and LDBOD+ for outlier detection are proposed. Similar to LOF, they also aim to find local outliers. However, LDBOD/LDBOD+ detects local outliers from the viewpoint of local distribution, which is characterized through three proposed measurements, local-average-distance, local-density, and local-asymmetry-degree. Several experiments were conducted to demonstrate the advantages of LDBOD/LDBOD+ compared with LOF.

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


Vertically integrated SOI circuits for low-power and high-performance applications Vertical integration offers numerous advantages over conventional structures. By stacking multiple-material layers to form double gate transistors and by stacking multiple device layers to form multidevice-layer integration, vertical integration can emerge as the technology of choice for low-power and high-performance integration. In this paper, we demonstrate that the vertical integration can achieve better circuit performance and power dissipation due to improved device characteristics and reduced interconnect complexity and delay. The structures of vertically integrated double gate (DG) silicon-on-insulator (SOI) devices and circuits, and corresponding multidevice-layer (3-D) SOI circuits are presented; a general double-gate SOI model is provided for the study of symmetric and asymmetric SOI CMOS circuits; circuit speed, power dissipation of double-gate dynamic threshold (DGDT) SOI circuits are investigated and compared to single gate (SG) SOI circuits; potential 3-D SOI circuits are laid out. Chip area, layout complexity, process cost, and impact on circuit performance are studied. Results show that DGDT SOI CMOS circuits provide the best power-delay product, which makes them very attractive for low-voltage low-power applications. Multidevice-layer integration achieves performance improvement by shortening the interconnects. Results indicate that up to 40% of interconnect performance improvements can be expected for a 4-device-layer integration.

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

digital cmos
high performance
high-speed interconnect
low-power design
low voltage
three-dimensional (3-d) circuits


Characterization of millimeter-wave antenna using photonic measurement techniques This article describes an electric-field measurement system that is based on electro-optic sampling (EOS). This system is able to map near- and far-field patterns of millimeter waves radiated from antennas by scanning the electric-field sensor probe. With the bandwidth set to more than 150 GHz, it can detect an electric field of less than 1.0 V/m at 60 GHz. This electric field is about one-tenth the field limit detectable by conventional microwave EOS systems. A comparison of measured and calculated electric fields in both the frequency and time-domains demonstrates the accuracy and usefulness of the system. (C) 2004 Wiley Periodicals. Inc.

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

electro-optic sampling
millimeter wave
eo probe
time-domain measurement


Approximation by Bezier type of Meyer-Konig and Zeller operators In this paper, we give direct, inverse and equivalence approximation theorems for the Bezier type of Meyer-Konig and Zeller operator with unified Ditzian-Totik modulus omega(lambda)(phi)(f, t) (0 <=lambda <= 1). (C) 2007 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

bezier type operator
meyer-konig and zeller operator
ditzian-totik modulus
k-functional
approximation equivalence theorem


Movement and visual coding: the structure of visuo-spatial working memory The influential model of verbal working memory (WM) introduced by Baddeley and Hitch (Recent advances in learning and motivation. Academic, New York, 1974) comprised three interacting component parts; an executive controller and two subservient systems. The two subservient systems, one underpinning verbal processing and the other underpinning visual processing are themselves subdivided. In the verbal system, a passive phonological store is maintained by an active phonological loop, which is able to rehearse the material in the passive store. The visual working memory system has traditionally been thought of as having a similar architecture with a passive visual store being maintained by an active store, which codes in terms of movement over space. The paper discusses the evidence for this relationship in visuo-spatial WM and concludes that the architecture does not fit well with the experimental literature. A direction for future research is suggested.

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


PSD: Practical Sybil detection schemes using stickiness and persistence in online recommender systems Design a novel robust algorithm for monitoring recommender systems. Exploring new metrics (stickiness and persistence) for detecting Sybil attacks. Validating our scheme with experiments on various Sybil attack types.

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

online recommender system
temporal monitoring


Diagnosis of capacity bottlenecks via passive monitoring in 3G networks: An empirical analysis In this work we address the problem of inferring the presence of a capacity bottleneck from passive measurements in a 3G mobile network. The study is based on one month of packet traces collected in the UMTS core network of mobilkom austria AG & Co KG, the leading mobile telecommunications provider in Austria, EU. During the measurement period a bottleneck link in the UMTS core network was revealed and removed, therefore the traces enable the accurate analysis and comparison of the traffic behavior in the two network conditions: with and without a capacity bottleneck. Two approaches to bottleneck detection are investigated. The first one is based on the signal analysis of the marginal rate distribution of the traffic aggregate along one day cycle. Since TCP-controlled traffic dominates the overall traffic mix, the presence of a bottleneck strains the aggregate rate distribution and compresses it against the capacity limit during the peak hour. The second approach is based on the analysis of several TCP performance parameters, e.g. estimated frequency of retransmissions. Such statistics are unstable due to the presence of few top users, but this effect can be counteracted with simple filtering methods. Both approaches are validated via simulations. Our results show that both approaches can be used to provide early warning about future occurrences of capacity bottlenecks, and can complement other existing monitoring tools in the operation of a production network.

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

passive monitoring
bottleneck detection
3g
umts


Designing and Embedding Reliable Virtual Infrastructures In a virtualized infrastructure where physical resources are shared, a single physical server failure will terminate several virtual servers and crippling the virtual infrastructures which contained those virtual servers. In the worst case, more failures may cascade from overloading the remaining servers. To guarantee some level of reliability, each virtual infrastructure,atinstantiation, should be augmented with backup virtual nodes and links that have sufficient capacities. This ensures that, when physical failures occur, sufficient computing resources are available and the virtual network topology is preserved. However, in doing so, the utilization of the physical infrastructure may be greatly reduced. This can be circumvented if backup resources are pooled and shared across multiple virtual infrastructures, and intelligently embedded in the physical infrastructure. These techniques can reduce the physical foot print of virtual backups while guaranteeing reliability.

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


Learning intentional behavior in the K-model of the amygdala and entorhinal cortex with the cortico-hyppocampal formation The interaction between entorhinal cortex (EC), amygdala, and hippocampal and cortical areas in vertebrate brains is studied using the dynamical K model approach. Special emphasis is given to the role of EC in decision making under the influence of sensory, orientation, and motivational clues. We introduce a simplified KIV model with positive and negative reinforcement learning in the hippocampus and the cortex. The developed model is implemented in a 2D computational environment for multi-sensory control of the movement of a simulated animal. Our results support the interpretation of recent EEG measurements with instantaneous macroscopic phase transitions.

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


CONSTRUCTING 2N-SOLITON PERIODIC WAVE SOLUTIONS FOR GENERALIZED DERIVATIVE NONLINEAR SCHRODINGER EQUATION In this paper, three new kinds of N-fold Darboux transformations with multi-parameters for spectral problem associated with generalized Derivative Nonlinear Schrodinger equation (GDNS) are structured with the help of different gauge transformations. With these transformations, some new 2N-soliton periodic wave solutions for the GDNS equation are obtained by taking position spectral (lambda > 0), negaton spectral (lambda < 0) and complexiton spectral. When N = 1 we obtained two-soliton periodic wave solutions. In particular, when N = 2 we obtained some four-soliton periodic wave solutions. By using mathematical software, we show their profiles. In this method, we can give a Darboux transformation for a very systematic system of even-dimensional and odd-dimensional Lax integrable systems. This method can also be applied to other nonlinear evolution equations.

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

generalized derivative nonlinear schrodinger equation

n-fold darboux transformations
periodic wave solution


Tracking articulated objects by learning intrinsic structure of motion In this paper, we propose a novel dimensionality reduction method, temporal neighbor preserving embedding (TNPE), to learn the low-dimensional intrinsic motion manifold of articulated objects. The method simultaneously learns the embedding manifold and the mapping from an image feature space to an embedding space by preserving the local temporal relationship hidden in sequential data points. Then tracking is formulated as the problem of estimating the configuration of an articulated object from the learned central embedding representation. To solve this problem, we combine Bayesian mixture of experts (BME) with Gaussian mixture model (GMM) to establish a probabilistic non-linear mapping from the embedding space to the configuration space. The experimental result on articulated hand and human pose tracking shows an encouraging performance on stability and accuracy.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 vision
articulated objects tracking
non-linear manifold learning


B-cubing: New possibilities for efficient SAT-solving SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA ( electronic design automation) applications, so the efficiency of SAT-solving is of great practical importance. B-cubing is our extension and generalization of Goldberg et al.' s supercubing, an approach to pruning in SAT-solving completely different from the standard approach used in leading solvers. We have built a B-cubing-based solver that is competitive with, and often outperforms, leading conventional solvers ( e. g., ZChaff II) on a wide range of EDA benchmarks. However, B-cubing is hard to understand and even the correctness of the algorithm is not obvious. This paper presents the theoretical basis for B-cubing, proves our approach correct, details our implementation and experimental results, and maps out other correct possibilities for further improving SAT-solving.

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


Enhanced security models and a generic construction approach for linkable ring signature A ring signature scheme is a group signature scheme but with no group manager to setup a group or revoke a signer's identity. It allows members of a group to sign messages such that the resulting signatures do not reveal the identities of the group members who actually created these signatures (anonymity) and no one can tell if two signatures are created by the same signer (unlinkability). Furthermore, the formation of a group is spontaneous. Diversion group members (non-signers) can be totally unaware of being conscripted to the group. The notion of linkable ring signature, introduced by Liu et al. in 2004, also provides signer anonymity and spontaneity, but at the same time, allows anyone to determine whether two signatures have been issued by the same group member (linkability). In this paper, we propose a suite of enhanced security models and show that they capture stronger notions of signer anonymity and linkability than the original ones proposed by Liu et al. in 2004. We also propose a generic approach for constructing a linkable ring signature scheme. The generic approach leads us to the construction of two efficient polynomial-structured schemes and one type-restricted separable scheme. The separable scheme allows group members to have different sets of DL (discrete logarithm) domain parameters. All schemes are shown secure under the enhanced security models defined in this paper.

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


Sometimes the internet reads the question wrong: Children's search strategies & difficulties When children search for information on a given topic, how do they go about searching for and retrieving information? What can their information seeking strategies tell us about the development of search interfaces for children's digital libraries, search engines and information repositories? We interviewed New Zealand (NZ) school children to seek insights into how they are conducting information searches during their education.

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


using behavioral exploration objectives to solve deceptive problems in neuro-evolution Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with deceptive fitness functions. Most of the published approaches to stimulate exploration rely on a distance between genotypes or phenotypes; however, such distances are difficult to compute when evolving neural networks due to (1) the algorithmic complexity of graph similarity measures, (2) the competing conventions problem and (3) the complexity of most neural-network encodings. In this paper, we introduce and compare two conceptually simple, yet efficient methods to improve exploration and avoid premature convergence when evolving both the topology and the parameters of neural networks. The two proposed methods, respectively called behavioral novelty and behavioral diversity , are built on multiobjective evolutionary algorithms and on a user-defined distance between behaviors. They can be employed with any genotype. We benchmarked them on the evolution of a neural network to compute a Boolean function with a deceptive fitness. The results obtained with the two proposed methods are statistically similar to those of NEAT and substantially better than those of the control experiment and of a phenotype-based diversity mechanism.

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

neural networks
deceptive problems
diversity


Calibration of Smooth Camera Models Generic imaging models can be used to represent any camera. Current generic models are discrete and define a mapping between each pixel in the image and a straight line in 3D space. This paper presents a modification of the generic camera model that allows the simplification of the calibration procedure. The only requirement is that the coordinates of the 3D projecting lines are related by functions that vary smoothly across space. Such a model is obtained by modifying the general imaging model using radial basis functions (RBFs) to interpolate image coordinates and 3D lines, thereby allowing both an increase in resolution (due to their continuous nature) and a more compact representation. Using this variation of the general imaging model, we also develop a calibration procedure. This procedure only requires that a 3D point be matched to each pixel. In addition, not all the pixels need to be calibrated. As a result, the complexity of the procedure is significantly decreased. Normalization is applied to the coordinates of both image and 3D points, which increases the accuracy of the calibration. Results with both synthetic and real datasets show that the model and calibration procedure are easily applicable and provide accurate calibration results.

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

general camera models
camera calibration
smooth vector-valued functions


The solution equivalence of minimax disparity and minimum variance problems for OWA operators The aim of this paper is to answer the open question of Wang and Parkan (Information Sciences 175 (2005), 20-29) that the solutions of maximum entropy OWA operator problem under given orness level and the minimax disparity OWA operator problem under given orness level are equivalent. They both have the: same equidifferent form, which composes a weighting vector of nonnegative arithmetic progression and zeros. This equidifferent OWA weighting vector generating method can also be seen as an improved solution method for the minimum variance and minimax dispersion problems respectively. (c) 2006 Elsevier Inc. All rights reserved.

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

owa operator
minimum variance
minimax disparity


A branch-and-price-and-cut approach for sustainable crop rotation planning A new fully-combinatorial sustainable crop planning problem is proven NP-hard. A {0,1} linear programming formulation and an extended formulation are provided. The sub-problem in the extended formulation has the integrality property. A Branch-and-Price-and-Cut (BPC) algorithm is proposed. Comparative results for a large set of instances show the effectiveness of BPC.

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

or in agriculture
production planning
integer programming
decomposition
column generation


Exponential Taylor methods: Analysis and implementation For the time integration of semilinear systems of differential equations, a class of multiderivative exponential integrators is considered. The methods are based on a Taylor series expansion of the semilinearity about the numerical solution, the required derivatives are computed by automatic differentiation. Inserting these derivatives into the variation-of-constants formula results in an exponential integrator which requires the action of the exponential of an augmented Jacobian only. The convergence properties of such exponential integrators are analyzed, and potential sources of numerical instabilities are identified. In particular, it is shown that local linearization gives rise to better stability for stiff problems. A number of numerical experiments illustrate the theoretical results. (c) 2012 Elsevier Ltd. All rights reserved.

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

exponential integrators
local linearization
stability

taylor series methods
multiderivative methods


Asymmetrical Doherty power architecture with an integrated driver stage in the auxiliary branch This contribution presents the analysis, design and characterization of a high gain Doherty power amplifier implementing an integrated Driver stage in the Auxiliary branch. Guidelines and design equations are demonstrated, fulfilling the full integration of the whole new architecture. The development of a microwave monolithic integrated circuit prototype based on TriQuint GaN technology for 7 GHz applications is reported. 10.5 dB of Gain, 38.1 dBm of saturated output power and 42% of efficiency at 7 dB of output back-off have been demonstrated by experimental results. 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:498507, 2014.

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

doherty
driver stage
gan
efficiency
power amplifier


Spectral decomposition in statistical process control Spectral decomposition method has been used in obtaining statistical control of time series data analyzed providing quick response in detecting out of control state of the process compared to that of Shewhart control charts.

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

spectral decomposition
statistical process control
time series data


Event-based 3D reconstruction from neuromorphic retinas This paper presents a novel N N -ocular 3D reconstruction algorithm for event-based vision data from bio-inspired artificial retina sensors. Artificial retinas capture visual information asynchronously and encode it into streams of asynchronous spike-like pulse signals carrying information on, e.g., temporal contrast events in the scene. The precise time of the occurrence of these visual features are implicitly encoded in the spike timings. Due to the high temporal resolution of the asynchronous visual information acquisition, the output of these sensors is ideally suited for dynamic 3D reconstruction. The presented technique takes full benefit of the event-driven operation, i.e. events are processed individually at the moment they arrive. This strategy allows us to preserve the original dynamics of the scene, hence allowing for more robust 3D reconstructions. As opposed to existing techniques, this algorithm is based on geometric and time constraints alone, making it particularly simple to implement and largely linear.

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

stereovision
neuromorphic vision
asynchronous event-based vision


A fuzzy multi-criteria model for the industrial cooperation program transaction strategies: A case in Taiwan In international trade offset practices (in Taiwan known as industrial cooperation program, ICP) have received increased attention over the past 20 years. In the coming 10 years, the Taiwanese government may expend roughly US$16 billion for purchasing Patriot-III missiles, P-3 long-range anti-submarine planes, and diesel-engine submarines from the United States through foreign military sale, and can achieve US$8 billion ICP credit the largest in Taiwanese history. Offsets or ICP can be regarded as fuzzy multiple criteria decision-making (MCDM) problems, therefore, the fuzziness and uncertainty of subjective perception should be considered. This paper provides an alternative approach, the non-additive fuzzy integral, to deal with the fuzzy MCDM problems especially when there is dependence among considered criteria. The main purpose of this paper is to discuss with Taiwans ICP Optimal Offset Transaction Policy and propose a framework of drawing on ICP credit in future. This paper considers the four aspects of policy, ability, economy, and environment, to establish a set of fuzzy AHP multiple criteria decision mode to identify the evaluative criteria variables and project items order for ICP project. This decision mode was identified as a workable method.

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

multiple criteria decision-making (mcdm)


Introduction to the special issue on teaching and learning in information retrieval We present an overview of the special issue in this paper. The main objective is to provide information for lecturers on how to improve the student experience, using current knowledge in the field. To this end we present an overview of six papers covering areas as diverse as tools and methods used to support teaching and learning, pedagogical challenges in teaching mathematics for search, etc.

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


Automatic segmentation of granular objects in images: Combining local density clustering and gradient-barrier watershed Propose a general framework for granular object recognition and segmentation. Apply the scheme to a wide variety of applications. Propose a modified watershed approach called gradient-barrier watershed. Incorporate a clustering step in the marker finding procedure. Propose a scheme for edge detection and fore/background separation called intensity moment approach.

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

granular object recognition
local density clustering
intensity moment
edge detection

image segmentation
gradient-barrier watershed
cell/nuclei segmentation
nanoparticle segmentation


Text Segmentation for MRC Document Compression The mixed raster content (MRC) standard (ITU-T T. 44) specifies a framework for document compression which can dramatically improve the compression/quality tradeoff as compared to traditional lossy image compression algorithms. The key to MRC compression is the separation of the document into foreground and background layers, represented as a binary mask. Therefore, the resulting quality and compression ratio of a MRC document encoder is highly dependent upon the segmentation algorithm used to compute the binary mask. In this paper, we propose a novel multiscale segmentation scheme for MRC document encoding based upon the sequential application of two algorithms. The first algorithm, cost optimized segmentation (COS), is a blockwise segmentation algorithm formulated in a global cost optimization framework. The second algorithm, connected component classification (CCC), refines the initial segmentation by classifying feature vectors of connected components using an Markov random field (MRF) model. The combined COS/CCC segmentation algorithms are then incorporated into a multiscale framework in order to improve the segmentation accuracy of text with varying size. In comparisons to state-of-the-art commercial MRC products and selected segmentation algorithms in the literature, we show that the new algorithm achieves greater accuracy of text detection but with a lower false detection rate of nontext features. We also demonstrate that the proposed segmentation algorithm can improve the quality of decoded documents while simultaneously lowering the bit rate.

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

image segmentation
markov random fields
multiscale image analysis


Efficient high order waveguide mode solvers based on boundary integral equations ? For optical waveguides with high index contrast and sharp corners, high order full-vectorial mode solvers are difficult to develop, due to the field singularities at the corners. A recently developed method (the so-called BIE-NtD method) based on boundary integral equations (BIEs) and Neumann-to-Dirichlet (NtD) maps achieves high order of accuracy for dielectric waveguides. In this paper, we develop two new BIE mode solvers, including an improved version of the BIE-NtD method and a new BIE-DtN method based on Dirichlet-to-Neumann (DtN) maps. For homogeneous domains with sharp corners, we propose better BIEs to compute the DtN and NtD maps, and new kernel-splitting techniques to discretize hypersingular operators. Numerical results indicate that the new methods are more efficient and more accurate, and work very well for metallic waveguides and waveguides with extended mode profiles.

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

optical waveguides
boundary integral equations
mode solvers

dirichlet-to-neumann map
neumann-to-dirichlet map
hypersingular integral operators


Knowledge and process management in health care organizations Objective: Medical knowledge management and care process management have become to be considered as valuable strategic assets that can lead to sustained increase in Health Care Organization (HCO) performance. Thus, it is essential to investigate which are the enablers for promoting knowledge-based organizations (people, organization, process, and system perspectives). Although the are essential for a HCO to manage knowledge effectively, it is still unclear how to employ them in more principled fashion. This requires innovative management strategies to determine effective ways of utilizing knowledge resources and capabilities available both within and outside the organization. Method: This paper reviews knowledge and process management theories, methods, and technologies that are potentially effective in building high performance HCOs. They come from a variety of fields behind computer science and medical informatics, e.g. from business and organization sciences to psychological and cognitive sciences, from epistemology to sociology. However, the success in developing future Health Information Systems (HIS) requires their incorporation into a new conceptual framework after recognizing how peculiar are the characteristics of HCOs with respect to other organizations. Investigating the nature of knowledge, in general, and of medical knowledge, in particular, is essential to define which services the future HIS should provide to foster collaboration between patients and health professionals. The knowledge creation process is then described in order to emphasize its dynamic and social characteristics. The potential of workflow technology for building innovative HISs is analyzed together with several basic research issues which are very challenging for researchers in the field. Result: A framework for augmenting the conceptual analysis of theories, methods, tools and effects of knowledge management in building high performance HCOs.

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

communication models and infrastructures


Modified shuffled frog leaping algorithm with genetic algorithm crossover for solving economic load dispatch problem with valve-point effect Problem: economic load dispatch with valve point effect. Solution method: modified shuffled frog leaping algorithm (MSFLA) with genetic algorithm (GA) cross-over. Validated the proposed method with four test case system. The results are quite promising and effective compared with several benchmark methods.

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


A statistical algorithm for power- and timing-limited parametric yield optimization of large integrated circuits Variability in process parameters leads to a significant parametric yield loss of high-performance ICs due to the large spread in leakage-power consumption and speed of chips. In this paper, we propose an algorithm for total power minimization under timing constraints in the presence of variability. The algorithm is formulated as a robust optimization program with a guarantee of power and timing yields, with both power and timing metrics being treated probabilistically. Power reduction is performed by simultaneous sizing and dual threshold-voltage assignment. An extremely fast run-time is achieved by casting the problem as a second-order conic problem and solving it using efficient interior-point optimization methods. The performance of the algorithm was evaluated on a variety of public and industrial benchmarks, with a library characterized using 70-nm Berkeley Predictive Technology Model. When compared to the deterministic optimization, the new algorithm, on average, reduces static power and total power at the 99.9th quantile by 31% and 17%, respectively, without loss of parametric yield. The run-time on the benchmarks is 30x faster than other known statistical power-minimization algorithms.

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

leakage
manufacturability
statistical optimization


The Kohonen self-organizing map: an application to the study of strategic groups in the UK hotel industry This paper examines a neural network method known as the self-organizing map (SOM). The motivation behind the SOM is to transform the data to a two-dimensional grid of nodes while preserving its 'topological' structure. In neural network terminology this involves unsupervised learning. The nearest related statistical technique is cluster analysis. We employ the SOM in the task of identifying strategic groups of companies, using data which relate to the generic strategies suggested by Porter. Following identification of different groups of hotels with certain strategic emphases, the study investigates correlations between strategies followed and hotel performance. We compare and contrast the 'feature map' generated by the SOM with the results of a standard cluster analysis using the k-means method. The data also cover performance indicators and the results indicate that performance varies between strategic groups.

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

neural network
unsupervised learning
cluster analysis


A sparse coding approach for local-to-global 3D shape description The definition of reliable shape descriptors is an essential topic for 3D object retrieval. In general, two main approaches are considered: global, and local. Global approaches are effective in describing the whole object, while local ones are more suitable to characterize small parts of the shape. Recently some strategies to combine these two approaches have been proposed which are mainly concentrated to the so-called bag of words paradigm. With this paper we address this problem and propose an alternative strategy that goes beyond the bag of word approach. In particular, a sparse coding technique is exploited for the 3D domain: a set of local shape descriptors are collected from the shape, and then a dictionary is trained as generative model. In this fashion the dictionary is used as global shape descriptor for shape retrieval purposes. Several experiments are performed on standard databases in order to evaluate the proposed method in challenging situations like the case of SHREC 2011: robustness benchmark where strong shape transformations are included, and the case of SHREC 2007: partial matching track where composite models are considered in the query phase. A drastic improvement of the proposed method is observed by showing that sparse coding approach is particularly suitable for local-to-global description and outperforms other approaches such as the bag of words.

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

3d object retrieval
sparse coding
bag of words


Neural network and multiple linear regression to predict school children dimensions for ergonomic school furniture design The current study investigates the possibility of obtaining the anthropometric dimensions, critical to school furniture design, without measuring all of them. The study first selects some anthropometric dimensions that are easy to measure. Two methods are then used to check if these easy-to-measure dimensions can predict the dimensions critical to the furniture design. These methods are multiple linear regression and neural networks. Each dimension that is deemed necessary to ergonomically design school furniture is expressed as a function of some other measured anthropometric dimensions. Results show that out of the five dimensions needed for chair design, four can be related to other dimensions that can be measured while children are standing. Therefore, the method suggested here would definitely save time and effort and avoid the difficulty of dealing with students while measuring these dimensions. In general, it was found that neural networks perform better than multiple linear regression in the current study.

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

school furniture
multiple linear regression
neural network


Evolutionary weighting of image features for diagnosing of CNS tumors This paper concerns an application of evolutionary feature weighting for diagnosis support in neuropathology. The original data in the classification task are the microscopic images of ten classes of central nervous system (CNS) neuroepithelial tumors. These images are segmented and described by the features characterizing regions resulting from the segmentation process. The final features are in part irrelevant. Thus, we employ an evolutionary algorithm to reduce the number of irrelevant attributes, using the predictive accuracy of a classifier (wrapper approach) as an individuals fitness measure. The novelty of our approach consists in the application of evolutionary algorithm for feature weighting, not only for feature selection. The weights obtained give quantitative information about the relative importance of the features. The results of computational experiments show a significant improvement of predictive accuracy of the evolutionarily found feature sets with respect to the original feature set.

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


Stroke Correspondence Construction Using Manifold Learning Stroke correspondence construction is a precondition for generating inbetween frames from a set of key frames. In our case, each stroke in a key frame is a vector represented as a Disk B-Spline Curve (DBSC) which is a flexible and compact vector format. However, it is not easy to construct correspondences between multiple DBSC strokes effectively because of the following points: (1) with the use of shape descriptors, the dimensionality of the feature space is high; (2) the number of strokes in different key frames is usually large and different from each other and (3) the length of corresponding strokes can be very different. The first point makes matching difficult. The other two points imply many to many and part to whole correspondences between strokes. To solve these problems, this paper presents a DBSC stroke correspondence construction approach, which introduces a manifold learning technique to the matching process. Moreover, in order to handle the mapping between unequal numbers of strokes with different lengths, a stroke reconstruction algorithm is developed to convert the many to many and part to whole stroke correspondences to one to one compound stroke correspondence.

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

correspondence construction
manifold learning


introducing mr. dlib, a machine-readable digital library In this demonstration-paper we present Mr. DLib, a machine-readable digital library. Mr. DLib provides access to several millions of articles in full-text and their metadata in XML and JSON format via a RESTful Web Service. In addition, Mr. DLib provides related documents for given academic articles. The service is intended to serve researchers who need bibliographic data and full-text of scholarly literature for their analyses (e.g. impact and trend analysis); providers of academic services who need additional information to enhance their own services (e.g. literature recommendations); and providers who want to build their own services based on data from Mr. DLib.

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

digital library
bibliographic data
trend analysis
web service
metadata

api
machine-readable
rest
citation analysis
impact analysis


Model of perception: The hierarchy of inclusive sensory characteristics and top-down cascade transfer of excitation The article offers a new view on the organization of the processes of human perception. It introduces the concept of inclusive sensory characteristic, which is a response of a given perceptual level to those features or characteristics of an underlying level whose spatial organization or specific temporal succession constitutes an adaptively meaningful entity. The sequence of inclusive characteristics forms a hierarchy: from features to the highest inclusive characteristics which bind sensory data into unified images and scenes. The highest inclusive characteristic is neither an image nor a scene, but a unique scheme of combination of underlying-level objects, which produces the image or the scene. Specific patterns of electric activity, which map inclusive characteristics, are relayed by feedbacks from upper to lower neuronal levels. This forms a cascade of top-down transfer of excitation, which stimulates those neuronal populations whose signals correspond to the highest inclusive characteristic of a given act of perception. Stimulation from above reduces the time of response of selected neurons at underlying levels to simultaneously arriving spikes to milliseconds. As a result, neuronal. populations at the underlying levels, which are involved in a given act of perception, become, for a short time, coincidence detectors. The hierarchically arranged set of neuronal ensembles of coincidence detectors forms a fast sensory pathway, single and unique for each act of perception.

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

perception
inclusive sensory characteristics


Minesniper The flight control system of a minehunting ROV-type weapon developed by SIMRAD is presented. The system is separated into lightly interacting subsystems, and autopilots are designed for steering, diving and speed control. The design of the separate controllers is based on PI, forward loop and sliding mode techniques. The diving control system, using the battery-packet as actuator, is specially examined. Results from sea testing show performance and stability for the autopilots.

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

minehunting rov
autopilot-design
ballast actuator


finding more null pointer bugs, but not too many In the summer of 2006, the FindBugs project was challenged to improve the null pointer analysis in FindBugs so that we could find more null pointer bugs. In particular, we were challenged to try to do as well as a publicly available analysis by Reasoning, Inc on version 4.1.24 of Apache Tomcat. Reasoning's report is a result of running their own static analysis tool and using manual auditing to remove false positives. Reasoning reported a total of 9 null pointer warnings in Tomcat 4.1.24, of which only 2 were reported by FindBugs 1.0. While we wanted to improve the analysis in FindBugs, we wanted to retain our current low level of false positives. As of result of the work presented in this paper, FindBugs now reports 4 of the 9 warnings in Tomcat, shows that one of the warnings reported by Reasoning is a false positive, and classifies the remaining 4 as being dependent on the feasibility of a particular path, which cannot be easier ascertained by a local examination of the source code. Moreover, we found 24 additional null pointer bugs in Tomcat that had been missed by Reasoning, and overall doubled the number of null pointer bugs found by FindBugs while improving the quality and significance of reported defects.

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

software quality
java
null pointers
bug patterns


Application of acoustic directional data for audio event recognition via HMM/CRF in perimeter surveillance systems Audio event modeling platform for improved threat identification in surveillance is reported. Discrete sound events can be identified accurately via sound energy and direction features. Time-series audio event classification achieves a higher accuracy with exogenous variables. Better audio event detection helps minimize video surveillance blindspots. Accurate audio activity classification reduce false positives and minimize operator burden.

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

robotics
automation
hidden markov models
conditional random fields
machine learning
artificial intelligence


An adaptive fuzzy c-means clustering-based mixtures of experts model for unlabeled data classification Compared with labeled data, unlabeled data are more readily available. Currently, classification of unlabeled data is an open issue, especially for the case of unknown class number. In this paper, we propose an adaptive fuzzy c-means (FCM)-based mixtures of experts model to deal with the problem. In this model, each mixture of experts (ME) consists of two expert networks and a gating network. Two experts, namely, Gaussian neural network (GNN) and sigmoid neural network (SNN), are selected as two candidates. Two phases are employed to construct the proposed model. First, the whole input space is partitioned into several clusters using the FCM clustering algorithm. The number of clusters can be determined adaptively by a cluster validity function. Second, the proposed model is trained by a small fraction of samples which are closer to their corresponding cluster centers. A numerical study is made on several synthetic and real-world data sets. Compared with the other four models, the proposed model exhibits better generalization ability in dealing with problems of unsupervised classification. The experimental results also show that the extension version of the proposed model for semi-supervised classification is comparable to the CVS3VM CVS 3 VM approach.

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

mixture of experts
gaussian neural network
unlabeled data classification


Performance of simultaneous multithreaded multimedia-enhanced processors for MPEG-2 video decompression This paper explores microarchitecture models for a simultaneous multithreaded (SMT) processor with multimedia enhancements. We start with a wide-issue superscalar processor, enhance it by the SMT technique, by multimedia units, and by an additional on-chip RAM storage. Our workload is a multithreaded MPEG-2 video decompression algorithm that extensively uses multimedia units. The simulations show that a single-threaded, 8-issue maximum processor (assuming an abundance of resources) reaches an instructions per cycle (IPC) count of only 1.60, while an 8-threaded 8-issue processor is able to reach an IPC of 6.07. A more realistic processor model reaches an IPC of 1.27 in the single-threaded 8-issue vs 3.03 in the 4-threaded 4-issue and 3.21 in the 8-threaded 8-issue modes. Our conclusion on next generations microprocessors is that a 2- or 4-threaded 4-issue processor with a small on-chip RAM accessed by a local load/store unit will be superior to a wide-issue (single-threaded) superscalar processor at least for MPEG-2 style video decompression algorithms.

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

simultaneous multithreading
multimedia extension
mpeg-2
multithreaded video decompression


Complex Wavelet Bases, Steerability, and the Marr-Like Pyramid Our aim in this paper is to tighten the link between wavelets, some classical image-processing operators, and David Marr's theory of early vision. The cornerstone of our approach is a new complex wavelet basis that behaves like a smoothed version of the Gradient-Laplace operator. Starting from first principles, we show that a single-generator wavelet can be defined analytically and that it yields a semi-orthogonal complex basis of L-2 (R-2), irrespective of the dilation matrix used. We also provide an efficient FFT-based filterbank implementation. We then propose a slightly redundant version of the transform that is nearly translation -invariant and that is optimized for better steerability (Gaussian-like smoothing kernel). We call it the Marr-like wavelet pyramid because it essentially replicates the processing steps in Marr's theory of early vision. We use it to derive a primal wavelet sketch which is a compact description of the image by a multiscale, subsampled edge map. Finally, we provide an efficient iterative algorithm for the reconstruction of an image from its primal wavelet sketch.

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

feature extraction
primal sketch
steerable filters
wavelet design


Topological Approach to Rigorous Numerics of Chaotic Dynamical Systems with Strong Expansion of Error Bounds A new algorithm for obtaining rigorous results concerning the existence of chaotic invariant sets of dynamical systems generated by non-autonomous, time-periodic differential equations is presented. Unlike all other algorithms the presented algorithm does not require the numerical integration of the solutions and as a consequence it is insensitive to the rapid error growth in the case of long integration. The result is based on a new theoretical approach to the computation of the homology of the Poincar, map. A concrete numerical example concerning a time-periodic differential equation in the complex plane is provided.

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

poincare map
fixed point index
isolating block
symbolic dynamics
interval arithmetic
rigorous numerical algorithm


new specialist tools for medieval document xml markup The digitalization of historical text documents as a basis of data mining and information retrieval for the purpose of progress in the history sciences is urgently needed. We present a novel, specialist XML tool-suite supporting the working historian in the transcription of original medieval charters into a machine-readable form.

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

xml tagging
tool-support
history informatics


A novel user identification scheme with key distribution preserving user anonymity for distributed computer networks Recently, Yang et al. proposed an efficient user identification scheme with key distribution, in which it is possible for the user to anonymously log into a system and establish a secret key shared with the system. Mangipudi and Katti later demonstrated a Deniable-of-Service (DoS) attack on the Yang et al. scheme and then proposed an improvement to withstand such an attack. However, this paper demonstrates an identity disclosure attack to show that neither schemes claimed user anonymity requirement can be achieved. We further propose a novel user identification scheme with key distribution preserving user anonymity for distributed computer networks. The proposed scheme not only withstands the attacks mentioned above, but also achieves the following: (i) user anonymity, (ii) key distribution, (iii) mutual authentication, and (iv) key confirmation. The performance of our scheme is of greater efficiency than that of previously proposed schemes in terms of communication costs and computational complexities.

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

anonymity
identification
key distribution
mutual authentication
key confirmation


Measurements of current density distribution in shaped e-beam writers Four methods for current density mapping in shaped e-beam writers are compared. Spatial resolution and signal-to-noise ratio of each method are evaluated. These methods can be performed using native equipment of typical shaped EB writer.

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

shaped e-beam writer
electron beam
knife-edge method
phosphor screen
electron resist
proximity effect


Lamina2Shape-An image processing tool for an explicit description of lamina shape tested on winter wheat (Triticum aestivum L.) Measurement of dimensions, area and shape of individual laminae is required in many agronomic studies, especially in spite of the increasing use of 3D crop models. To assess variation in lamina shape quantitatively, usually a large number of samples are required and methods to analyze leaf shape are often laborious and time-consuming. We propose Lamina2Shape, an algorithm that allows an efficient processing of lamina images to analyze their shape and tested it on winter wheat (Triticum aestivum L. cv. Soissons). There, images of laminae were obtained using a flat-bed scanner. Using these images, laminae were discriminated from a unicolored background based on thresholds for the ratio of pixel values (0 <= I <= 255) in the red, green and blue channels (I(blue)/I(red) <= 1.23 and I(blue)/I(green)/ <= 1.10). Following, a numerical lamina width function w(l) is computed for each lamina in the image as an explicit description of their dimensions (length, width, and area) and shape. The accuracy of the algorithm was assessed by tests performed for the two main steps of the procedure: background discrimination and computation of w(l). The accuracy of background discrimination was tested by comparing values for area measured by manual cropping of laminae to the corresponding values computed with Lamina2Shape. Both yielded almost the same results. The accuracy of computation of w(l) was tested using images of predefined shape simulated with a lamina shape model. The algorithm was able to re-compute the predefined shape with high accuracy. We applied Lamina2Shape to quantify dimensions and shape of cereal laminae. Examples presented were from an experiment with winter wheat grown at different plant population densities. (C) 2009 Elsevier B.V. All rights reserved.

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

image processing
lamina
leaf
shape
triticum aestivum
wheat


Integrating color and shape-texture features for adaptive real-time object tracking We extend the standard mean-shift tracking algorithm to an adaptive tracker by selecting reliable features from color and shape-texture cues according to their descriptive ability. The target model is updated according to the similarity between the initial and current models, and this makes the tracker more robust. The proposed algorithm has been compared with other trackers using challenging image sequences, and it provides better performance.

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

feature selection
model updating
multicue
visual tracking


mental models and problem solving in using a calculator It has often been suggested that users understand and reason about complex systems on the basis of a mental model of the system's internal mechanics. This paper describes an empirical study of how mental model knowledge is used in operating a stack calculator. One group of naive users were taught step-by-step procedures for solving typical problems on the calculator. A second group of naive users were taught the same procedures in conjunction with an explicit model of the calculator's stack mechanism. The users then solved problems on the calculator while thinking aloud. Analysis of the performance of these two groups indicates that the model had little effect in routine problem solving situations, but significantly improved performance for novel problems. Analyses of the think-aloud protocols indicate that the users employed five distinct modes of problem solving: skilled methods, problem reduction strategies, a conversion algorithm, model-based problem space search, and methods-based problem space search. Skilled methods, problem reduction strategies and the conversion algorithm were used for solving more routine problems and did not necessarily depend on mental model knowledge. Problem space search was used in the novel problems. For the model users, the states and operations of the stack mechanism served as the problem space to be searched for a problem solution. In contrast, the no-model users employed a less effective search strategy based on the recombination of pieces of known procedures. These results indicate that explicitly teaching naive users an appropriate mental model of a system can provide a psychologically effective and robust basis for operating the machine.

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

analysis
performance
reduction
complex systems
teaching
group
model
knowledge
paper
robust
search
strategies
systems
users
space
algorithm
effect

empirical studies
intern
situated
method
procedure
mental model
operability
think aloud
conversation


Robust acquisition of 3D informations from short image sequences This paper addresses the problem of 3D reconstruction from a set of viewpoints on a short baseline. Its main contribution is the development of a robust algorithm which can extract 3D informations from a set of images taken with a very small baseline, even in the presence of significant occlusion. To achieve this goal, we use a multi-pass process that works layer by layer. In each pass we begin with a space carving step which is made robust through some morphological operations. Then we introduce an original technique to solve the ambiguity inherent to space carving in the case of short baseline. Once we have a voxel representation of the objects, we propose a method based on differential geometry to build a smooth mesh. Results are presented, demonstrating the efficiency and usefulness of the method.

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

structure from motion
voxel space
dynamic programming
mathematical morphology
partial differential equation filter


a cooperative multiagent system for traffic management and control The main goal of an Advanced Traffic Management System is to help human road managers to improve traffic flows and road safety. This goal turns out to be especially hard due to the difficulties in getting continuous traffic information and also because this information is distributed in several equipments belonging to different traffic administrations and offices. So, if a traffic administration detects a traffic incident, the traffic administration must decide whom, when, what and how to perform the control actions to deal with this incident. Current approaches to answer these questions are completely human based. We propose that a Multiagent System (MAS) is able to almost-automatically carry out the answers to these questions. In this paper it is exposed the main features of this MAS (its ontology, agents and interaction protocols) and the behavior exhibited by this MAS when a meteorological incident is detected by a traffic administration in a real traffic scenario, the A3 Spanish freeway.

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

multiagent systems applications
intelligent transport systems


Positioning error minimization with specific narrowband disturbance rejections using a low-order H-2 and KYP lemma based control A control design method which combines the generalized Kalman-Yakubovich-Popov (KYP) lemma and the H-2 control is proposed to attenuate specific narrowband disturbance and simultaneously minimize the positioning error of the control system Two specific narrowband disturbance near the bandwidth are rejected sufficiently via the KYP lemma based design In addition, the enhancement of the overall positioning accuracy of the control system is achieved via H-2 control design to minimize the positioning error The proposed control design method is applied in the feedback servo loop design for a lead-zirconate-titanate (PZT) micro-actuator in hard disk drives (HDDs) to attenuate disturbances at 650 Hz and 2 kHz and also minimize the positioning error such that the system positioning accuracy is enhanced ultimately Simulation and experimental results are shown and demonstrate the effectiveness of the proposed method. (C) 2010 Elsevier Ltd All rights reserved.

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

h-2 control
vibration rejection
position error signal


IEEE Latin America Transactions Vol. 10 Issue 1 January 2012 This is the first special issue of the IEEE Latin America Transactions of the year 2012. Special issues are published, out of regular issues schedule, according to the availability of extended best papers from recognized high level conferences that claim for a special issue. The current issue includes extended best papers of the 10th I2TS' - 2011 International Information and Telecommunication Technologies Conference.

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

ieee latin america transactions
special issue


Design of a hybrid system for the diabetes and heart diseases Data can be classified according to their properties. Classification is implemented by developing a model with existing records by using sample data. One of the aims of classification is to increase the reliability of the results obtained from the data. Fuzzy and crisp values are used together in medical data. Regarding to this, a new method is presented for classification of data of a medical database in this study. Also a hybrid neural network that includes artificial neural network (ANN) and fuzzy neural network (FNN) was developed. Two real-time problem data were investigated for determining the applicability of the proposed method. The data were obtained from the University of California at Irvine (UCI) machine learning repository. The datasets are Pima Indians diabetes and Cleveland heart disease. In order to evaluate the performance of the proposed method accuracy, sensitivity and specificity performance measures that are used commonly in medical classification studies were used. The classification accuracies of these datasets were obtained by k-fold cross-validation. The proposed method achieved accuracy values 84.24% and 86.8% for Pima Indians diabetes dataset and Cleveland heart disease dataset, respectively. It has been observed that these results are one of the best results compared with results obtained from related previous studies and reported in the UCI web sites.

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

classification
fuzzy neural network
pima indians diabetes
cleveland heart disease


exploring the neighborhood with dora to expedite software maintenance Completing software maintenance and evolution tasks for today??s large, complex software systems can be difficult, often requiring considerable time to understand the system well enough to make correct changes. Despite evidence that successful programmers use program structure as well as identifier names to explore software, most existing program exploration techniques use either structural or lexical identifier information. By using only one type of information, automated tools ignore valuable clues about a developer's intentions - clues critical to the human program comprehension process. In this paper, we present and evaluate a technique that exploits both program structure and lexical information to help programmers more effectively explore programs. Our approach uses structural information to focus automated program exploration and lexical information to prune irrelevant structure edges from consideration. For the important program exploration step of expanding from a seed, our experimental results demonstrate that an integrated lexical-and structural-based approach is significantly more effective than a state-of-the-art structural program exploration technique

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

software maintenance
program exploration

natural language program analysis
software tools


A Novel Table-Based Approach for Design of FinFET Circuits A new lookup-table (LUT) approach, based on normalization of the drain current with an I(D)-V(G) template, is proposed for simulation of MOS transistor circuits. The LUT approach is validated by considering two examples and by comparing the LUT results with mixed-mode (device-circuit) simulation results. This approach is implemented in a circuit simulator and integrated, for the first time, with an optimizer to enable efficient design of circuits, particularly those involving novel technologies for which compact models are not fully developed. Three FinFET-based circuits are designed to demonstrate the effectiveness of the proposed environment. Furthermore, it is shown that the table-based platform can take into account variations in process, supply voltage, and temperature during the design.

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

hierarchical particle swarm optimization (pso)


Applying sampling to improve software inspections The main objective of software inspections is to find faults in software documents. The benefits of inspections are reported from researchers as well as software organizations. However, inspections are time consuming and the resources may not be sufficient to inspect all documents. Sampling of documents in inspections provides a systematic solution to select what to be inspected in the case resources are not sufficient to inspect everything. The method presented in this paper uses sampling, inspection and resource scheduling to increase the efficiency of an inspection session. A pre-inspection phase is used in order to determine which documents need most inspection time, i.e. which documents contain most faults. Then, the main inspection is focused on these documents. We describe the sampling method and provide empirical evidence, which indicates that the method is appropriate to use. A Monte Carlo simulation is used to evaluate the proposed method and a case study using industrial data is used to validate the simulation model. Furthermore, we discuss the results and important future research in the area of sampling of software inspections.

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

monte carlo simulation
sampling
efficiency


FrostWire P2P forensic examinations FrostWire is a peer-to-peer (P2P) application derived from the open source code of Limewire. Frostwire was first released in February of 2005 as a Gnutella P2P client. As interest in the Gnutella network waned, FrostWire switched in later versions to becoming a torrent client. Since the United States government shut Limewire down, FrostWire has become more popular and is seen more often in criminal investigations. This paper describes the different components of FrostWire and the useful information which can be obtained in a digital forensic examination.

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


Coping with complexity: past, present and future In 1981, a technical report was published with the somewhat enigmatic title Coping with complexity. Its purpose was to discuss how computers could be used to assist process plant operators in coping with complex situations during plant disturbances. Today, coping with complexity is a problem not only for process plant operators but for everyone. And while computers in 1981 were looked upon as the solution, they are now seen as the source of the problem. This paper discusses why and how the meaning of coping with complexity has changed over the years and speculate on what may lie ahead.

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

intractability automation training control


An investigation of coupling, reuse and maintenance in a commercial C++ application This paper describes an investigation into the use of coupling complexity metrics to obtain early indications of various properties of a system of C++ classes. The properties of interest are: (i) the potential reusability of a class and (ii) the likelihood that a class will be affected by maintenance changes made to the overall system. The study indicates that coupling metrics can provide useful indications of both reusable classes and of classes that may have a significant influence on the effort expended during system maintenance and testing.

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

object oriented metrics
c++
software change


Diagnosis of gastric carcinoma by classification on feature projections A new classification algorithm, called benefit maximizing classifier on feature projections (BCFP), is developed and applied to the problem of diagnosis of gastric carcinoma. The domain contains records of patients with known diagnosis through gastroscopy results. Given a training set of such records, the BCFP classifier learns how to differentiate a new case in the domain. BCFP represents a concept in the form of feature projections on each feature dimension separately. Classification in the BCFP algorithm is based on a voting among the individual predictions made on each feature. In the gastric carcinoma domain, a lesion can be an indicator of one of nine different levels of gastric carcinoma, from early to late stages. The benefit of correct classification of early levels is much more than that of late cases. Also, the costs of wrong classifications are not symmetric. In the training phase, the BCFP algorithm learns classification rules that maximize the benefit of classification. In the querying phase, using these rules, the BCFP algorithm tries to make a prediction maximizing the benefit. A genetic algorithm is applied to select the relevant features. The performance of the BCFP algorithm is evaluated in terms of accuracy and running time. The rules induced are verified by experts of the domain.

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

machine learning
feature projection
benefit maximization


Markerless human motion tracking from a single camera using interval particle filtering In this paper we present a new approach for marker less human motion capture from conventional camera feeds. The aim of our study is to recover 3D positions of key points of the body that can serve for gait analysis. Our approach is based on foreground extraction, an articulated body model and particle filters. In order to be generic and simple, no restrictive dynamic modeling was used. A new modified particle-filtering algorithm was introduced. It is used efficiently to search the model configurations space. This new algorithm, which we call Interval Particle Filtering, reorganizes the configurations search space in an optimal deterministic way and proved to be efficient in tracking natural human movement. Results for human motion capture from a single camera are presented and compared to results obtained from a marker based system. The system proved to be able to track motion successfully even in partial occlusions and even outdoors.

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

articulated body model
particle filtering
gait analysis


Forecasting stock markets using wavelet transforms and recurrent neural networks: An integrated system based on artificial bee colony algorithm This study presents an integrated system where wavelet transforms and recurrent neural network (RNN) based on artificial bee colony (abc) algorithm (called ABC-RNN) are combined for stock price forecasting. The system comprises three stages. First, the wavelet transform using the Haar wavelet is applied to decompose the stock price time series and thus eliminate noise. Second, the RNN, which has a simple architecture and uses numerous fundamental and technical indicators, is applied to construct the input features chosen via Stepwise Regression-Correlation Selection (SRCS). Third, the Artificial Bee Colony algorithm (ABC) is utilized to optimize the RNN weights and biases under a parameter space design. For illustration and evaluation purposes, this study refers to the simulation results of several international stock markets, including the Dow Jones Industrial Average Index (DJIA), London FTSE-100 Index (FTSE), Tokyo Nikkei-225 Index (Nikkei), and Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX). As these simulation results demonstrate, the proposed system is highly promising and can be implemented in a real-time trading system for forecasting stock prices and maximizing profits. Crown Copyright (C) 2010 Published by Elsevier B.V. All rights reserved.

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

stepwise regression-correlation selection (srcs)


Numerical flow visualization of first cycle and cyclic motion of a rigid fling-clapping wing A flow visualization of the two-dimensional rigid fling-clap motions of the flat-plate wing is performed to get the knowledge of fling-clapping mechanism that might be employed by insects during flight. In this numerical visualization, the time-dependent Navier-Stokes equations are solved for two types of wing motion; 'fling followed by clap and pause motion' and,cyclic fling-clapping motion'. The result is observed regarding the main flow features such as the sequential development of the two families of separation vortex pairs and their movement. For the 'fling followed by clap and pause motion', a strong separation vortex pair of counterrotation develops in the opening between the wings in the fling phase and they then move out from the opening in the following clap phase. For 'the cyclic fling-clapping motion', the separation vortex pair developed in the outside space in the clap phase move into the opening in the following fling phase. The separation vortex pair in the opening developed in the fling phase of the cyclic motion is observed to be stronger than those of the 'fling followed by clap and pause motion'. Regarding the strong fling separation vortex and the weak clap separation vortex above it in the opening, the flow pattern of the fling phase of the cyclic fling and clap motion is different to that of the fling phase of the first cycle. The flow pattern of the third cycle of the cyclic fling-clapping motion is observed to be almost same as that of the second cycle. Therefore, a periodicity of the flow pattern is established after the second cycle.

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

first cycle
numerical visualization
separation vortex

fling-clap motion
navier-stokes equation
insect flight


A cape of HDT industrial reactor for middle distillates Hydrodesulfurization (HDS) and hydrodenitrogenation (HDN) of middle distillates over a commercial Ni-Mo/gamma-Al(2)O(3) has been studied under wide operating conditions of 340-380 degrees C and 38-98 atm. A power law model was presented to each one of those reactions. The parameters of kinetic equations were estimated solving the ordinary differential equations by the fourth order Runge-Kutta-Gill algorithm and Marquardt method for searching of kinetic parameters (kinetic constants as well as the orders of the reactions). An adiabatic diesel hydrotreating trickle-bed reactor packed with the same catalyst was simulated numerically in order to check up the behavior of this specific reaction system. One-dimensional pseudo-homogeneous model was used in this work. For each feed, the mass and energy balance equations were integrated along the length of the catalytic bed using the fourth Runge-Kutta-Gill method. The performance of two industrial reactors was checked. Alternative configurations are proposed in this work, which have advantages compared with conventional HDT commercial reactors. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

multiphase reactor
hydrogenation reactor
kinetic model
reactor modeling


The progressive mesh compression based on meaningful segmentation Nowadays, both mesh meaningful segmentation (also called shape decomposition) and progressive compression are fundamental important problems, and some compression algorithms have been developed with the help of patch-type segmentation. However, little attention has been paid to the effective combination of mesh compression and meaningful segmentation. In this paper, to accomplish both adaptive selective accessibility and a reasonable compression ratio, we break down the original mesh into meaningful parts and encode each part by an efficient compression algorithm. In our method, the segmentation of a model is obtained by a new feature-based decomposition algorithm, which makes use of the salient feature contours to parse the object. Moreover, the progressive compression is an improved degree-driven method, which adapts a multi-granularity quantization method in geometry encoding to obtain a higher compression ratio. We provide evidence that the proposed combination can be beneficial in many applications, such as view-dependent rendering and streaming of large meshes in a compressed form.

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

mesh compression
progressive
meaningful segmentation


ATALK: A decentralized agent platform for engineering open and dynamic organizations Identified role hand-over as a foundation service for open organizations. Proposed a decentralized middleware to support role hand-over process. Designed a service-oriented agent architecture for dynamic role integration & management. Definition of case studies and performance analysis of our solution.

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

multiagent systems
organization
dynamic reorganization
service-oriented architecture