Automated Brain Structure Segmentation Based on Atlas Registration and Appearance Models Accurate automated brain structure segmentation methods facilitate the analysis of large-scale neuroimaging studies. This work describes a novel method for brain structure segmentation in magnetic resonance images that combines information about a structure's location and appearance. The spatial model is implemented by registering multiple atlas images to the target image and creating a spatial probability map. The structure's appearance is modeled by a classifier based on Gaussian scale-space features. These components are combined with a regularization term in a Bayesian framework that is globally optimized using graph cuts. The incorporation of the appearance model enables the method to segment structures with complex intensity distributions and increases its robustness against errors in the spatial model. The method is tested in cross-validation experiments on two datasets acquired with different magnetic resonance sequences, in which the hippocampus and cerebellum were segmented by an expert. Furthermore, the method is compared to two other segmentation techniques that were applied to the same data. Results show that the atlas-and appearance-based method produces accurate results with mean Dice similarity indices of 0.95 for the cerebellum, and 0.87 for the hippocampus. This was comparable to or better than the other methods, whereas the proposed technique is more widely applicable and robust.

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

atlas registration
graph cuts
segmentation

brain structures
mri
pattern recognition


the bit bytes the word This paper discusses documentation from the vantage point of language. Documentation has several different uses and many different audiences. One method of specifying the systems documentation that must accompany system installation is to involve the users of the documentation in defining the documentation standards. This was done at Simpson-Sears in Canada, and nine different types of documentation groupings were identified, by audience and by use. Some verbal gymnastics were also performed.

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


Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O(root nm log(n(2)/m)/log n) bound for the nonbipartite cardinality matching problem This paper closes some gaps in the discussion of non-weighted balanced network flow problems. These gaps all concern the phase-ordered augmentation algorithm, which can be viewed as the matching counterpart of the Dinic max-flow algorithm. We show that this algorithm runs in O(n(2)m) time compared to the bound of O(nm(2)) derived in Part III of this series and that the bipartiteness requirement can be omitted. The result which deserves attention is the complexity bound for the cardinality matching problem which was shown for the bipartite case by Feder and Motwani. This bound was previously claimed for the general case in a preprint of Goldberg and Karzanov but omitted in later versions of this paper. (C) 2003 Wiley Periodicals, Inc.

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

cardinality matching problem
network flows

skew-symmetric graphs
antisymmetrical digraphs
graph compression
clique partition


Catheter and MR angiography of persistent trigeminal artery associated with occipital arteriovenous malformation We present a patient with an occipital arteriovenous malformation fed by the posterior cerebral artery coexisting with an ipsilateral persistent trigeminal artery. These anomalies were well demonstrated by MR angiography and confirmed by catheter angiography.

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

basilar artery
carotid arteries
arteries
cerebral angiography
magnetic resonance angiography


Syntactic control of concurrency We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained with minimum loss of expressivity. To that end we define an annotated type system that controls the number of concurrent threads created by terms and give a fully abstract game semantics for the notion of equivalence induced by typable terms and contexts. Finally, we show that the semantics of all typable terms, at any order and in the presence of iteration, has a regular-language representation and thus the restricted observational equivalence is decidable. (c) 2005 Elsevier B.V. All rights reserved.

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


Hashiwokakero is NP-complete In a Hashiwokakero Puzzle, one must build bridges to connect a set of islands. We show that deciding the Solvability of such puzzles is NP-complete. (C) 2009 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

computational complexity
combinatorial problems


automatic text discovering through stroke-based segmentation and text string combination In this paper we present a novel framework of automatic text discovering for content-based multimedia application. For single image, the stroke-based binarization and the coarse-to-fine text extraction will collaborate to generate a clean text image for recognition. For image sequence, multi-frame text enhancement is adopted to increase the text/background contrast, and the recognition results are finally refined by the text string combination algorithm to get more precise semantic information. Two prototype demos have been successfully developed on mobile phones. The experimental results on different platforms show the superior performance of the proposed method.

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

text discovering
text string combination


Scheduling of gas turbine compressor washing This paper describes an estimation method for gas turbine compressor degradation and an economical optimisation model for determining the optimal compressor washing cycles. The optimisation model aims at minimising fuel consumption and emissions in combined-cycle power plants. The results presented are of significant importance for power plants operators that have the possibility of frequently connecting and disconnecting to the power grid. By optimising power generation periods and levels, downtimes and maintenance scheduling, the operators ensure that the plant operates at a high efficiency level in periods when fuel prices are high. High efficiency levels ensure low fuel consumption and emission levels. The work presented in this paper was implemented as a product prototype at ABB Utility Automation in 2003 and patented in 2005, [1].

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


On Achieving Fairness in the Allocation of Scarce Resources: Measurable Principles and Multiple Objective Optimization Approaches Equity principles are embedded within a multiple objective framework for obtaining optimal solutions to a generic allocation problem, such as the fair distribution of water, energy, or other types of key resources among users in society. Because of the great import of fresh water as a scarce and diminishing resource within and among many nations of the world, the equity concepts are used in the allocation of water rights and subsequent water transfers or trades among users to improve the economic efficiency of water utilization. More specifically, water allocation is formulated as a generalized multiple objective problem and then the measurable fairness principles are used in the development of two approaches for equitable water rights allocation. In particular, the proposed priority-based maximal multiperiod network flow programming method has a social aggregation function satisfying the monotonicity and priority principles, and thus is a priority equitable allocation approach. The lexicographic minimax water shortage ratios method, which satisfies the principles of monotonicity, impartiality, and equitability, generates perfectly equitable solutions. The priority ranks and weights used in the two proposed approaches, respectively, are designed to achieve fair treatment of all the competitors for access to limited water resources and constitute important parameters. The capabilities of the approaches are tested and demonstrated in applications to the Aral Sea Basin in Central Asia and the South Saskatchewan River Basin in Western Canada.

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

equity principles
fairness
lexicographic minimax
multiple objective optimization
priority
water allocation


owner-controlled information Information about individuals is currently maintained in many thousands of databases, with much of that information, such as name and address, replicated across multiple databases. However, this proliferation of personal information raises issues of privacy for the individual, as well as maintenance issues in terms of the accuracy of the information. Ideally, each individual would own, maintain and control his personal information, allowing access to those who needed at the time it was needed. Organizations would contact the individual directly to obtain information, therefore being assured of using current and correct information.While research has been performed on users owning and controlling access to their personal information in an electronic commerce environment, we argue that this concept should be extended to all user information including, for example, medical and financial information. The end goal is not for users to simply maintain copies of this information, but to be the source of this information.This paper presents the concept of users owning their personal information and introduces some of the issues involved in users being able to control access to this information. The security requirements, including authentication, access control and audit, as well as user interfaces and trust, for this new paradigm are given particular emphasis.

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


GROWTH AND SUSTAINABILITY OF MANAGED SECURITY SERVICES NETWORKS: AN ECONOMIC PERSPECTIVE Managed security service provider (MSSP) networks are a form of collaboration where several firms share resources such as diagnostics, prevention tools, and policies to provide security for their computer networks. While the decision to outsource the security operations of an organization may seem counterintuitive, there are potential benefits from joining an MSSP network that include pooling of risk and access to more security-enabling resources and expertise. We examine structural results explaining the reasons firms join an MSSP network, and characterize the growth of MSSP network size under different forms of ownership (monopoly versus consortium). We find that the need for an initial investment in MSSP networks (which is necessary to overcome the stalling effect) only affects the optimal network size for a consortium but has no impact on the optimal network size for a profit-maximizing monopolist. Our results provide an explanation why the majority of the MSSPs are for-profit entities and consortium-based MSSPs are less common. Such a market structure can be attributed to the potential for larger size by the for-profit MSSP owner combined with beneficial pricing structure and a lack of growth uncertainty for the early clients.

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

information security
outsourcing
network effects
network growth
network ownership structure


A low phase noise and low spur PLL with auto frequency control circuit for L1-band GPS receiver A low phase noise and low spur phase-locked loop (PLL) for L1-band global positioning system receiver is proposed in this paper. For obtaining low phase noise for PLL, All-PMOS LC-VCO with varactor-smoothing technique and noise-filtering technique is adopted. To reduce the reference spur, a low current-mismatch charge pump is carefully designed. A quasi-closed-loop auto frequency control circuit is used to accelerate the lock process of PLL. The PLL is fabricated in 180nm CMOS Mixed-Signal process while it operates under 1.8V supply voltage. The measured output frequency of PLL is 1.571GHz and output power is ?1.418dBm. The in-band phase noise is ?98.1 dBc/Hz @ 100kHz, while the out-band phase noise is ?130.3dBc/Hz @ 1MHz. The reference spur is ?75.8dBc at 16.368MHz offset. When quasi closed-loop AFC is working, the measured lock time is about 10.2?s.

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

gps
pll
phase noise
spur
auto frequency control


Protean graphs with a variety of ranking schemes We introduce a new class of random graph models for complex real-world networks, based on the protean graph model by Luczak and Pralat. Our generalized protean graph models have two distinguishing features. First, they are not growth models, but instead are based on the assumption that a "steady state" of large but finite size has been reached. Second, the models assume that the vertices are ranked according to a given ranking scheme, and the rank of a vertex determines the probability that that vertex receives a link in a given time step. Precisely. the link probability is proportional to the rank raised to the power-alpha, where the attachment strength a is a tunable parameter. We show that the model leads to a power law degree distribution with exponent 1 + 1/alpha for ranking schemes based on a given prestige label, or on the degree of a vertex. We also study a scheme where each vertex receives an initial rank chosen randomly according to a biased distribution. in this case, the degree distribution depends on the distribution of the initial rank. For one particular choice of parameters we obtain a power law with an exponent that depends both on alpha and on a parameter determining the initial rank distribution. (C) 2009 Elsevier B.V. All rights reserved.

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

random graphs
web graphs
differential equations method
power law graphs
scale-free networks


FPGA based disparity map computation with vergence control Depth estimation in a scene using image pairs acquired by a stereo camera setup, is one of the important tasks of stereo vision systems. The disparity between the stereo images allows for 3D information acquisition which is indispensable in many machine vision applications. Practical stereo vision systems involve wide ranges of disparity levels. Considering that disparity map extraction of an image is a computationally demanding task, practical real-time FPGA based algorithms require increased device utilization resource usage, depending on the disparity levels operational range, which leads to significant power consumption. In this paper a new hardware-efficient real-time disparity map computation module is developed. The module constantly estimates the precisely required range of disparity levels upon a given stereo image set, maintaining this range as low as possible by verging the stereo setup cameras axes. This enables a parallel-pipelined design, for the overall module, realized on a single FPGA device of the Altera Stratix IV family. Accurate disparity maps are computed at a rate of more than 320 frames per second, for a stereo image pair of 640480 pixels spatial resolution with a disparity range of 80 pixels. The presented technique provides very good processing speed at the expense of accuracy, with very good scalability in terms of disparity levels. The proposed method enables a suitable module delivering high performance in real-time stereo vision applications, where space and power are significant concerns.

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


Secure, dependable and publicly verifiable distributed data storage in unattended wireless sensor networks In unattended wireless sensor networks (UWSNs), sensed data are stored locally or at designated nodes and further accessed by authorized collectors on demand. This paradigm is motivated by certain scenarios where historical or digest data (e.g., average temperature in a day), instead of real-time data, are of interest. The data are not instantly forwarded to a central sink upon sensing, thereby saving communication energy for transmission. Such a paradigm can also improve data survivability by making use of distributed data storage in cheap flash memory on nodes. However, the security and dependability of such data storage are critical for the future data accessibility in UWSNs. To address this issue, we propose a secure and dependable distributed storage scheme for UWSNs. Our scheme takes advantages of both secret sharing and Reed-Solomon code, which can achieve computational security and maintain low communication overhead in terms of shortened data dispersing size. We also propose a general coding method to publicly verify data integrity in a distributed manner, with low communication and storage overhead, and without the need of holding original data. The extensive analysis justifies that our scheme can provide secure, dependable and publicly verifiable distributed data storage in UWSNs even in the presence of node compromise and Byzantine failure.

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

dependability
data integrity
wireless sensor networks

secure storage
wireless network security


Adaptive fuzzy logic controller for feed drives of a CNC machine tool This paper introduces an adaptive fuzzy logic controller (AFLC) for precision contour machining which adjusts both input and output membership functions simultaneously. The parameters of the proposed controller are self-tuned in real-time according to a continuous measurement of the performance of the controller itself and estimated disturbance values. The adjustment of the membership functions are restricted within a stable range derived from a stability analysis. The proposed controller as well as a conventional fuzzy logic controller and a PID controller were simulated and implemented on a 3-axis milling machine in contour milling. Both the simulations and experiments show that the AFLC can provide superior performance in terms of contour tracking accuracy compared with the other two controllers particularly in machine tool systems where friction is a serious problem in the feed drives. (C) 2003 Elsevier Ltd. All rights reserved.

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

computer numerical control
machine tools
fuzzy logic control


Multistability of ? ? -divergence based NMF algorithms In this paper, the multistability of a class of Amaris ? ? -divergence based nonnegative matrix factorization learning algorithms is analyzed. The analysis results show that invariant sets for the update algorithms can be constructed. In these invariant sets, the non-convergence of the discussed algorithms can be guaranteed. Based on Lyapunovs stability theorem, the local convergence of this class of learning algorithms is proved in the domain of their update rules. In the simulation, the analysis results are applied to image representation. Experiment results demonstrate that selecting suitable initial data for different applications of these nonnegative matrix factorization algorithms is very important.

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

nonnegative matrix factorization
nmf
local convergence

stability analysis
? ? -divergence ? ? ? ? ?


a visual environment for dynamic web application composition HTML-based interface technologies enable end-users to easily use various remote Web applications. However, it is difficult for end-users to compose new integrated tools of both existing Web applications and legacy local applications such as spreadsheets, chart tools and database. In this paper, the authors propose a new framework where end-users can wrap remote Web applications into visual components called pads , and functionally combine them together through drag & drop-paste operations. The authors use, as the basis, a meme media architecture IntelligentPad that was proposed by the second author. In the IntelligentPad architecture, each visual component called a pad has slots as data I/O ports. By pasting a pad onto another pad users can integrate their functionalities. The framework presented in this paper allows users to visually create a wrapper pad for any Web application by defining HTML nodes within the Web application to work as slots. Examples of such a node include input-forms and text strings on Web pages. Users can directly manipulate both wrapped Web applications and wrapped local legacy tools on their desktop screen to define application linkages among them. Since no programming expertise is required to wrap Web applications or to functionally combine them together, end-users can build new integrated tools of both wrapped Web applications and local legacy applications.

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

media
framework
applications
use
examples
expertise
web application
paper
strings
component
technologies
author
users
intelligentpad
architecture
dynamic
text
wrapper
data
database
tools

input
hypermedia
web application wrapping
personalization
interfaces
spreadsheet
end-user
compositing
locality
program
visualization
environments
web page
operability
web application linkage
integrability


Certifying execution time in multicores We present a verification framework for embedded real-time systems that uses the worst-case execution time as safety parameter. The verification mechanism uses the certifying properties of duality theory to check WCET estimates. The verification is performed on embedded systems that have low computational resources. We propose efficient verification of programs running on multicore architectures based on Abstract-Carrying Code. Experimental results demonstrate our claims on verification efficiency for a subset of the Malardalen WCET benchmarks.

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

abstract interpretation
abstraction-carrying code
lp
lr lr -servers lr lr lr lr lr


dependence trees with copula selection for continuous estimation of distribution algorithms In this paper, a new Estimation of Distribution Algorithm (EDA) is presented. The proposed algorithm employs a dependency tree as a graphical model and bivariate copula functions for modeling relationships between pairwise variables. By selecting copula functions it is possible to build a very flexible joint distribution as a probabilistic model. The experimental results show that the proposed algorithm has a better performance than EDAs based on Gaussian assumptions.

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

edas
dependence trees
bivariate copula functions


Distributed Fault Detection in Sensor Networks using a Recurrent Neural Network In long-term deployments of sensor networks, monitoring the quality of gathered data is a critical issue. Over the time of deployment, sensors are exposed to harsh conditions, causing some of them to fail or to deliver less accurate data. If such a degradation remains undetected, the usefulness of a sensor network can be greatly reduced. We present an approach that learns spatio-temporal correlations between different sensors, and makes use of the learned model to detect anomalous sensors by using distributed computation and only local communication between nodes. We introduce SODESN, a distributed recurrent neural network architecture, and a learning method to train SODESN for fault detection in a distributed scenario. Our approach is evaluated using data from a real-world sensor-network deployment, and shows good results even with imperfect link qualities and a number of simultaneous faults.

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


A novel multiple-controller incorporating a radial basis function neural network based generalized learning model A new adaptive multiple-controller is proposed incorporating a radial basis function (RBF) neural network based generalized learning model (GLM). The GLM assumes that the unknown complex plant is represented by an equivalent stochastic model consisting of a linear time-varying sub-model plus a non-linear RBF neural-network learning sub-model. The proposed non-linear multiple-controller methodology provides the designer with a choice, through simple switching, of using: either, a conventional proportional-integral-derivative (PID) controller, a PID structure based pole (only) placement controller, or a newly developed PID structure based (simultaneous) zero and pole placement controller. Closed-loop stability analysis of the multiple-controller framework is discussed and sample simulation results using a realistic non-linear single-input single-output (SISO) plant model are used to demonstrate the effectiveness of the multiple-controller with respect to tracking desired set-point changes and dealing with sudden introduction of disturbances.

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

multiple controllers
learning models
neural networks
pid control
zero-pole placement control


Chaos control of single time-scale brushless DC motor with sliding mode control method In this paper, the sliding mode control (SMC) scheme of single time-scale brushless DC motor (BLDCM) is investigated. The SMC method consists of 2 sections. To simplify the directive of the stability of the controlled single time-scale BLDCM in the sliding mode, first a special type of PI switching surface is adopted. Second, the SMC controller is obtained to guarantee the occurrence of the PI switching surface. The effectiveness of the theoretical analysis is evaluated by numerical simulations. Thus, the numerical results are used to show the verification and trustworthiness of the proposed method.

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

brushless dc motor
sliding mode control
chaos


Stability and robustness analysis of MIMO MRAC using K(p) = L(2)D(2)S(2) factorization For a class of MIMO systems with input and output unmodeled dynamics, bounded disturbances and any relative degree, using the idea of K(p) = L(2)D(2)S(2) factorization, the design and analysis of robust direct model reference adaptive control are further investigated in this article. By establishing the L(p) and L(2 delta) relationship properties between the input and output, multivariable swapping lemmas and relating all the signals in the closed-loop system with the normalizing signal, stability and robustness of adaptive system are analyzed rigorously. Compared with the existing results, the proof procedure is more compact and simple. A simulation example verifies the effectiveness of the control scheme.

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


About the prediction of molecular properties using the fundamental Quantum QSPR (QQSPR) equation The present theoretical study analyses the Quantum QSPR fundamental linear equation predictive power. Two main alternative algorithms, among several possible choices, are fully described in an add one and add many basis, while the other possibilities are only sketched out. It is shown that one can also apply the described Quantum QSPR prediction algorithms to parent problems in the framework of empirical QSPR, based on the molecular space framework.

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

quantum similarity
quantum qspr (qqspr)
fundamental qqspr equation
predictive algorithms in qqspr
predictions in qspr molecular space


A note on fast computation of effective independence through QR downdating for sensor placement A simple and fast computational algorithm of the Effective Independence for sensor placement is presented in the paper. It is based on the relationship between the Effective Independence and Modal Kinetic Energy method, and on a downdating algorithm of the QR decomposition for a reduced modal matrix. Traditional computations of the Effective Independence, which tries to render the target modes as linearly independent at possible and is significant and influential in the field of sensor placement, require the eigenvalue decomposition or inversion of the Fisher Information matrix, and both are costly. By virtue of the connection between the Modal Kinetic Energy and Effective Independence derived by the authors, the norms of the orthonormal rows after the QR decomposition of the modal matrix can be employed to compute the Effective Independence. Moreover, new downdating steps of the QR decomposition based on the combination of the modified GramSchmidt and Householder transformations are implemented, which further improved its efficiency by eliminating unnecessary expensive QR decompositions in the iterations. The computational burden for traditional methods and the proposed ones are investigated in terms of the floating point operations required. Finally, a numerical example shows that the new algorithms run much more quickly with fewer computation steps, has the advantages of simplicity and clarity in physical significance, and is stable.

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

effective independence
modal kinetic energy
sensor placement
qr decomposition


frequency based predictive input system for hindi In this paper we discuss a novel approach to input text in Hindi. Since almost all Computer users are acquainted with English and are unfamiliar of using Hindi onto the same, it creates a problem when one is required to draft a document in Hindi. We have developed a tool which addresses this problem. A user can input text in Romanized Hindi which is converted in Hindi.

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

word prediction
text input
local language computing
edit distance
transliteration


Segmenting lung fields in serial chest radiographs using both population-based and patient-specific shape statistics This paper presents a new deformable model using both population-based and patient-specific shape statistics to segment lung fields from serial chest radiographs. There are two novelties in the proposed deformable model. First, a modified scale invariant feature transform (SIFT) local descriptor, which is more distinctive than the general intensity and gradient features, is used to characterize the image features in the vicinity of each pixel. Second, the deformable contour is constrained by both population-based and patient-specific shape statistics, and it yields more robust and accurate segmentation of lung fields for serial chest radiographs. In particular, for segmenting the initial time-point images, the population-based shape statistics is used to constrain the deformable contour; as more subsequent images of the same patient are acquired, the patient-specific shape statistics online collected from the previous segmentation results gradually takes more roles. Thus, this patient-specific shape statistics is updated each time when a new segmentation result is obtained, and it is further used to refine the segmentation results of all the available timepoint images. Experimental results show that the proposed method is more robust and accurate than other active shape models in segmenting the lung fields from serial chest radiographs.

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

deformable model
segmentation
serial chest radiographs
shape statistics

scale invariant feature transform (sift) local descriptor


ATOMi: An algorithm for circuit partitioning into multiple FPGAs using time-multiplexed, off-chip, multicasting interconnection architecture Logic emulation is so far the fastest method to verify the system functionality in the gate level before chip fabrication. Field-programmable gate array (FPGA)-based logic emulator with large gate capacity generally comprises a large number of FPGAs or special processors connected in mesh or crossbar topology. However, gate utilization of FPGAs and speed of emulation are limited by the number of signal pins among FPGAs and the interconnection architecture of the logic emulator. This paper first describes a new interconnection architecture called TOMi (Time-multiplexed, Off-chip, Multicasting interconnection) and proposes a circuit partitioning algorithm called ATOMi (Algorithm for TOMi) for multi-FPGA system incorporating four to eight FPGAs where FPGAs are interconnected through TOMi ATOMi reduces the number of off-chip signal transfers to optimize the performance for multi-FPGA system implemented by TOMi Experimental results using Partitioning93 benchmarks show that, by adopting the proposed TOMi interconnection architecture along with ATOMi, the pin count is reduced to 14.4%-88.6% while the critical path delay is reduced to 66.1%-90.1% compared to traditional architectures including mesh, crossbar, and VirtualWire architecture.

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

field-programmable gate arrays (fpgas)
high-speed integrated circuits
interconnections
logic partitioning


Encoding fuzzy possibilistic diagnostics as a constrained optimization problem This paper discusses a knowledge-base encoding methodology for diagnostic tasks, transforming such knowledge into constrained optimization problems. The methodology is based on a reinterpretation of the consistent causal reasoning paradigm [D. Dubois, H. Prade, Fuzzy relation equations and causal reasoning, Fuzzy Sets and Systems 45 (2) (1995) 119134] as an equivalent problem of feasibility subject to equality and inequality constraints (in the binary case). Then, it is extended to the fuzzy case. Preferences under uncertain knowledge are incorporated by transforming the feasibility problem into an optimization one, which may be interpreted in possibilistic terms. The problem is solved by efficient, widely-known, linear and quadratic programming tools, which are able to cope with large-scale problems. Examples illustrating some of the concepts and possibilities of the proposed procedure, as well as a summary comparison with other approaches are also discussed.

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

fault detection and diagnosis
possibilistic reasoning
approximate reasoning


Electrochromic organic and polymeric materials for display applications An electrochromic material is one where a reversible color change takes place upon reduction (gain of electrons) or oxidation (loss of electrons), on passage of electrical current after the application of an appropriate electrode potential. In this review, the general field of electrochromism is introduced, with coverage of the types, applications, and chemical classes of electrochromic materials and the experimental methods that are used in their study. The main classes of electrochromic organic and polymeric materials are then surveyed, with descriptions of representative examples based on the transition metal coordination complexes, viologen systems, and conducting polymers. Examples of the application of such organic and polymeric electrochromic materials in electrochromic displays are given.

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

ecd
electrochromic display
transition metal coordination complex
metallopolymer
phthalocyanine
conducting polymer


A Maritime Inventory Routing Problem: Discrete Time Formulations and Valid Inequalities A single-product maritime inventory routing problem (MIRP) is studied in which the production and consumption rates vary over the planning horizon. The problem involves a heterogeneous fleet and multiple production and consumption ports with limited storage capacity. Two discrete time formulations are developed: an original model and a reformulated model that is a pure fixed charge network flow (FCNF) model with side constraints. Mixed integer sets arising from the decomposition of the formulations are identified. In particular, several lot-sizing relaxations are derived for the formulations and used to establish valid inequalities to strengthen the proposed formulations. Until now, the derivation of models and valid inequalities for MIRPs has mainly been inspired by the developments in the routing community. Here, we have developed a new model leading to new valid inequalities for MIRPs obtained by generalizing valid inequalities from the recent lot-sizing literature. Considering a set of instances based on real data, a computational study is conducted to test the formulations and the effectiveness of the valid inequalities. The FCNF formulation is generally much stronger than the original formulation. The developed valid inequalities reduce the integrality gap significantly for both formulations. By using a branch-and-bound scheme based on the strengthened FCNF formulation, most of our test instances are solved to optimality. (c) 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(4), 297-314 2013

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

maritime transportation
mixed integer linear formulation
lot-sizing relaxations


Home location profiling for users in social media Study the problem of profiling home locations for Twitter users. Leverage STFG to illustrate relationship attribute information in home location prediction. Identify the potential set of locations by performing similarity retrieval on various features. STFG is more powerful than the current methods.

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

social network
tie strength
social tie
labeled relationship


Combining partitional and hierarchical algorithms for robust and efficient data clustering with cohesion self-merging Data clustering has attracted a lot of research attention in the field of computational statistics and data mining. In most related studies, the dissimilarity between two clusters is defined as the distance between their centroids or the distance between two closest ( or farthest) data points. However, all of these measures are vulnerable to outliers and removing the outliers precisely is yet another difficult task. In view of this, we propose a new similarity measure, referred to as cohesion, to measure the intercluster distances. By using this new measure of cohesion, we have designed a two-phase clustering algorithm, called cohesion-based self-merging ( abbreviated as CSM), which runs in time linear to the size of input data set. Combining the features of partitional and hierarchical clustering methods, algorithm CSM partitions the input data set into several small subclusters in the first phase and then continuously merges the subclusters based on cohesion in a hierarchical manner in the second phase. The time and the space complexities of algorithm CSM are analyzed. As shown by our performance studies, the cohesion-based clustering is very robust and possesses excellent tolerance to outliers in various workloads. More importantly, algorithm CSM is shown to be able to cluster the data sets of arbitrary shapes very efficiently and provide better clustering results than those by prior methods.

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

data mining
data clustering
hierarchical clustering


A Deterministic Approximation Algorithm for Maximum 2-Path Packing This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted complete graph so that the total weight of edges in the paths is maximized. Previously, Hassin and Rubinstein gave a randomized cubic-time approximation algorithm for M2PP which achieves an expected ratio of 35/67 - epsilon approximate to 0.5223 - epsilon for any constant epsilon > 0. We refine their algorithm and derandomize it to obtain a deterministic cubic-time approximation algorithm for the problem which achieves a better ratio (namely, 0.5265 - epsilon for any constant epsilon > 0).

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

2-path packing problem
derandomization
pessimistic estimator method


Accuracy of q-space related parameters in MRI: Simulations and phantom measurements The accuracy of q-space measurements was evaluated at a 3.0-T clinical magnetic resonance imaging (MRI) scanner, as compared with a 4.7-T nuclear magnetic resonance (NMR) spectrometer. Measurements were performed using a stimulated-echo pulse-sequence on n-decane as well as on polyethylene glycol (PEG) mixed with different concentrations of water, in order to obtain bi-exponential signal decay curves. The diffusion coefficients as well as the modelled diffusional kurtosis K-fit, were obtained from the signal decay curve, while the full-width at half-maximum (FWHM) and the diffusional kurtosis K were obtained from the displacement distribution. Simulations of restricted diffusion, under conditions similar to those obtainable with a clinical MRI scanner, were carried out assuming various degrees of violation of the short gradient pulse (SGP) condition and of the long diffusion time limit., The results indicated that an MRI system can not be used for quantification of structural sizes less than about 10 mu m by means of FWHM since the parameter underestimates the confinements due to violation of the SGP condition. However, FWHM can still be used as an important contrast parameter. The obtained kurtosis values were lower than expected from theory and the results showed that care must be taken when interpreting a kurtosis estimate deviating from zero.

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

kurtosis magnetic resonance imaging (mri)


Inverse variational inequalities with projection-based solution methods An inverse variational inequality is defined as to find a vector u??Rn u ? ? R n , such that

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

co-coercivity
projection method
self-adaptive strategy


Performance models and workload distribution algorithms for optimizing a hybrid CPUGPU multifrontal solver Problems that involve large and sparse linear systems are ubiquitous in scientific computing, and there are strong needs to accelerate the solution processes. Hybrid CPUGPU systems have recently become a new platform trend with powerful computing capabilities. However, it is not clear how such systems can accelerate the solvers. We study how to make the best use of the CPU and the GPU to minimize the total time required to solve symmetric positive definite systems using the multifrontal method. We analyze the computation and communication costs of the multifrontal method on such hybrid systems to build up timing performance models. Workload distribution algorithms are proposed to determine if a frontal matrix should be factored on the CPU or on the GPU to minimize the total execution time of the overall computation. We provide theoretical analyses and numerical results to illustrate the characteristics and efficiency of the proposed algorithms. Because the performance models and workload distribution algorithms can accommodate different CPUs and GPUs adaptively, we expect the applicability and significance of these techniques to continue to grow as heterogeneous hardware and software evolve.

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

symmetric positive definite
multifrontal method

sparse linear system
graphics processing unit (gpu)
model based performance optimization


A comparative analysis of video codecs for multihop wireless video sensor networks Wireless video sensor networks (WVSNs) have drawn significant attention in recent years due to the advent of low-cost miniaturized cameras, which makes it feasible to realize large-scale WVSNs for a variety of applications including security surveillance, environmental tracking, and health monitoring. However, the conventional video coding paradigms are not suitable for WVSNs due to resource constraints such as limited computation power, battery energy, and network bandwidth. In this paper, we evaluated and analyzed the performance of video codecs based on emerging video coding paradigms such as distributed video coding and distributed compressive video sensing for multihop WVSNs. The main objective of this work was to provide an insight into the computational (encoding/decoding) complexity, energy consumption, node and network lifetime, processing and memory requirements, and the quality of reconstruction of these video codecs. Based on the findings, this paper also provides some guidelines for the selection of appropriate video codecs for a given WVSN application.

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

multihop wireless video sensor networks
video codecs
comparative analysis
distributed video coding


Relevance learning in generative topographic mapping Generative topographic mapping (GTM) provides a flexible statistical model for unsupervised data inspection and topographic mapping. Since it yields to an explicit mapping of a low-dimensional latent space to the observation space and an explicit formula for a constrained Gaussian mixture model induced thereof, it offers diverse functionalities including clustering, dimensionality reduction, topographic mapping, and the like. However, it shares the property of most unsupervised tools that noise in the data cannot be recognized as such and, in consequence, is visualized in the map. The framework of visualization based on auxiliary information and, more specifically, the framework of learning metrics as introduced in [15]and[22] constitutes an elegant way to shape the metric according to auxiliary information at hand such that only those aspects are displayed in distance-based approaches which are relevant for a given classification task. Here we introduce the concept of relevance learning into GTM such that the metric is shaped according to auxiliary class labels. Relying on the prototype-based nature of GTM, efficient realizations of this paradigm are developed and compared on a couple of benchmarks to state-of-the-art supervised dimensionality reduction techniques.

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

gtm
topographic mapping
relevance learning


On credibility improvements for automotive navigation systems Automotive navigation systems are becoming ubiquitous as driver assistance systems. Vendors continuously aim to enhance route guidance by adding new features to their systems. However, we found in an analysis of current navigation systems that many share interaction weaknesses, which can damage the systems credibility. Such issues are most prevalent when selecting a route, deviating from the route intentionally, or when systems react to dynamic traffic warnings. In this work, we analyze the impact on credibility and propose improved interaction mechanisms to enhance perceived credibility of navigation systems. We improve route selection and the integration of dynamic traffic warnings by optimizing route comparability with relevance-based information display. Further, we show how bidirectional communication between driver and device can be enhanced to achieve a better mapping between device behavior and driver intention. We evaluated the proposed mechanisms in a comparative user study and present results that confirm positive effects on perceived credibility.

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

automotive navigation systems
credibility
navigation


An algorithm for evaluating reaction rates of catalytic reaction networks with strong diffusion limitations An h-adaptive mesh procedure to solve the reaction-diffusion problem for multiple reactions in catalytic pellets presenting strong diffusion limitations is developed. The discretization approach selected for this purpose is based on an integral formulation of the conservation equations. The adaptive mesh procedure relies on estimating the error of local reaction rate evaluations. By adding or removing nodes the errors will eventually become bounded within pre-set limits. The algorithm is tried on some test cases derived from the liquid phase catalytic hydrogenation of butadiene and butyne in butene (1, 2-cis and 2-trans) rich hydrocarbon mixtures. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

catalytic reaction networks
integral formulation

diffusion limitation
numerical solution
adaptive procedure


An intelligent categorization engine for bilingual web content filtering It is important to protect children and unsuspecting adults from the harmful effects of objectionable materials, such as pornography, violence, and hate messages, which are now prevalent on the World-Wide Web. This calls for effective tools for web content analysis and filtering of objectionable contents. Our study of existing web content filtering systems has identified a number of deficiencies in these systems. Using the analysis of pornographic web pages as a case study, we present an intelligent bilingual web page categorization engine that can determine if an English or Chinese language web page contains pornographic materials. We have implemented the categorization engine to perform offline web page analysis and near-instantaneous online filtering. Performance evaluation of our system has verified its effectiveness.

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

internet
neural network applications
text processing
unsupervised learning


meteoroid towards a real mvc for the web Web development has moved from simple static pages to complex web applications, some of them resembling desktop ones. In most of these applications the web browser acts as thin-client (or a view) of the model that sits on the server. Despite the technological evolution of the web, there is still no standard mechanism to send data or events from the server to the client without an explicit request from the later, thus forcing the web browser to constantly poll the server for updates. To solve this problem a set of techniques under the name of Comet were proposed, allowing to send information from the server to the web browser without an explicit client request. In this paper we introduce Meteoroid, a Comet approach to make "live" Seaside applications. Our framework exploits the Model-View-Controller (MVC) paradigm for building simple yet scalable web applications, requiring very little programming effort.

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


A quantitative model of first language influence in second language consonant learning Six modelling approaches were used to model listeners non-native consonant identification. All models demonstrated similar rapid improvement to that observed in listeners. Approaches with parallel first and second language models made the best predictions. Results demonstrate L1 experience helps L2 sound learning initially.

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

foreign language sound acquisition
rapid learning
computer model


Hybrid adaptive calibration methods and ensemble strategy for prediction of cloud point in melamine resin production In melamine resin production process, it is essential to supervise the condensation process. Monitoring the value of the cloud point indicates the best point of time to stop the condensation. Currently, the supervision is conducted manually by operators, which from time to time need to draw and analyze samples from the production process. In order to increase efficiency and to improve quantification quality, in this paper we investigate the usage of non-linear chemometric models, which are calibrated based on near infrared (FTNIR) process spectrum measurements. They rely on fuzzy systems model architecture and are able to incrementally adapt themselves during the on-line process, resolving dynamic process changes which may appear on-line over time due to long-term fluctuations (e.g., caused by dirt) and changes in the composition of the educt, often leading to severe error drifts of static models. Extracting the most informative wavebands prior to model training is essential to avoid a curse of dimensionality; this is achieved by a new extended variant of forward selection, termed as forward selection with bands (FSB). Furthermore, variants of how to integrate auxiliary sensor information (temperature, pH value, pressure) together with the FTNIR spectra are presented (hybridity). A specific ensemble strategy is developed which is able to properly compensate noise in repeated spectrum measurements. Results on high-dimensional data from four independent types of melamine resin show that 1) our non-linear modeling methodology can outperform state-of-the-art linear and non-linear chemometric modeling methods in terms of validation error, 2) the ensemble strategy is able to improve the performance of models without ensembling significantly and 3) incremental model updates are necessary in order to keep the predictive quality of the models high by preventing drifting residuals. (C) 2013 Elsevier B.V. All rights reserved.

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

melamine resin production
prediction of cloud point
ensembling

nir spectroscopy
non-linear adaptive chemometric models
waveband extraction
auxiliary sensors


Robust recurrent fuzzy neural network control for linear synchronous motor drive system A robust recurrent fuzzy neural network control (RFNNC) system is proposed to control the position of the mover of a permanent magnet linear synchronous motor drive system in this study. In the proposed RFNNC system, a RFNN controller is the main tracking controller, that is used to mimic an ideal feedback linearization control law, and a robust controller is proposed to confront the shortcoming of the RFNN controller. Moreover, to relax the requirement for the bound of lumped uncertainty, which comprises a minimum approximation error, optimal parameter vectors and higher order terms in Taylor series, a RFNNC system with adaptive bound estimation is investigated. In the control system a simple adaptive algorithm is utilized to estimate the bound of lumped uncertainty. In addition, simulated and experimental results due to periodic reference trajectories show that the dynamic behaviors of the proposed control systems are robust with regard to uncertainties.

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

recurrent fuzzy neural network
taylor series
adaptive bound estimation

permanent magnet linear synchronous motor servo drive


mining statistically important equivalence classes and delta-discriminative emerging patterns The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This computational convenience brings both quality and statistical flaws to the results as observed by many previous studies. In this paper, we introduce a novel algorithm that produces itemsets with ranked statistical merits under sophisticated test statistics such as chi-square, risk ratio, odds ratio, etc. Our algorithm is based on the concept of equivalence classes . An equivalence class is a set of frequent itemsets that always occur together in the same set of transactions. Therefore, itemsets within an equivalence class all share the same level of statistical significance regardless of the variety of test statistics. As an equivalence class can be uniquely determined and concisely represented by a closed pattern and a set of generators, we just mine closed patterns and generators, taking a simultaneous depth-first search scheme. This parallel approach has not been exploited by any prior work. We evaluate our algorithm on two aspects. In general, we compare to LCM and FPclose which are the best algorithms tailored for mining only closed patterns. In particular, we compare to epMiner which is the most recent algorithm for mining a type of relative risk patterns, known as minimal emerging patterns. Experimental results show that our algorithm is faster than all of them, sometimes even multiple orders of magnitude faster. These statistically ranked patterns and the efficiency have a high potential for real-life applications, especially in biomedical and financial fields where classical test statistics are of dominant interest.

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


experimental study of market reputation mechanisms We experimentally compare low-information, high-information and self-reporting reputation mechanisms. The results indicate players strategically reacted to the reputation mechanisms, with higher information mechanisms increasing market efficiency.

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


approximate nearest neighbor under edit distance via product metrics We present a data structure for the approximate nearest neighbor problem under edit metric (which is defined as the minimum number of insertions, deletions and character substitutions needed to transform one string into another). For any l ? 1 and a set of n strings of length d , the data structure reports a 3 l -approximate Nearest Neighbor for any given query string q in O ( d ) time. The space requirement of this data structure is roughly O ( n d 1/( l +1) ), i.e., strongly subexponential. To our knowledge, this is the first data structure for this problem with both o ( n ) query time and storage subexponential in d .

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

product
character
nearest neighbor
space
edit
storage
knowledge
strings
query

requirements
edit-distance
approximation
metrication
data structures
timing
transformation


the use of a virtual instruction set for the software synthesis of hw/sw embedded systems The application range of embedded computing is going to cover the majority of market products spanning from consumer electronic, automotive, telecom and process control. For such applications, typically there is strong cooperation between dedicated hardware modules and software systems. An important issue toward a fully automated system-level implementation is represented by the software development process. The basic requirements are: accurate timing characterization to be used during the early stages of the design to compare alternative architectures and reliable synthesis techniques to ensure the respect of the correct functionality by avoiding, as much as possible, the direct designer's intervention during the development process. This paper describes a novel methodology to address the needs of concurrently synthesizing the software component of a control-dominated hardware-software system, possibly under real-time constraints. An intermediate model (Virtual Instruction Set) for the software is presented, suitable for both for synthesis and analysis purposes. The overall system synthesis is presented with particular emphasis on the problem of low level performance estimation, static scheduling of the software process and retargetable code synthesis.

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

static scheduling
software synthesis
retargetable code synthesis
embedded computing
system synthesis
performance estimation
embedded systems
software development
virtual instruction set


Multi-Criteria Inventory Classification by Using a Fuzzy Analytic Network Process (ANP) Approach Inventory management is an important part of production planning process for enterprises. Decisions for strategies to determine when and how many to buy or make can be made by classifying the inventory items based on their sorts. In this evaluation, ABC inventory classification is one of the most commonly used approaches. In this study, a fuzzy analytic network process approach was proposed to determine the weights of the criteria and the scores of the inventory items were determined with simple additive weighting by using linguistic terms. Applying fuzzy ANP to a multi-criteria inventory classification problem is the novelty of this study in the related literature. In addition, the application area of the problem which is the management of the engineering vehicles' items in a construction firm is different from the other studies.

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

multi-criteria decision making
abc classification
inventory control


Slovak high school students attitudes to ICT using in biology lesson The impact of information and communication technologies and computers on our daily lives has been steadily increasing. This fact influences the change of attitudes toward information and communication technologies. In our contribution we focused on finding the differences between gender and age according to computer attitudes. A questionnaire with 33 Likert type items was used in our research. The sample consists of 518 students from 9 high schools. Students attended the all of grades (first, second, third and fourth). They were 15- to 19-years old. Data were evaluated with factor analysis and the ANOVA. The results of the questionnaire were divided into five dimensions in the concrete. (1) The positive influence of ICT; (2) the negative influence of ICT; (3) advantages of ICT; (4) ICT used in biology lesson; (5) disadvantages of ICT. Totally, boys have more positive attitudes than girls and the younger students had more positive attitudes toward information and communication technologies using in biology lesson in comparison with the older students.

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


Classification of chaos-based digital modulation techniques using wavelet neural networks and performance comparison of wavelet families This paper presents a comparative study of implementation of feature extraction and classification algorithms based on wavelet neural networks (WNN) for chaos-based digital modulation (CBDM) classification. Thirteen different feature extraction methods are generated by separately using Daubechies, Biorthogonal, Coiflets, and Symlets wavelet filters. WNN model is used, which consists of two layers: wavelet entropy and multi-layer perceptron (MLP) neural networks for expert CBDM classification. The chaos-based digital modulated signals used in this experimental study are Chaos Shift Keying (CSK), Chaotic On-Off Keying (COOK), Differential Chaos Shift Keying (DCSK), Correlation Delay Shift Keying (CDSK), Symmetric Chaos Shift Keying (SCSK) and Frequency-Modulated Differential Chaos Shift Keying (FM-DCSK). The performance of this comparison system is evaluated by using total 1806 CBDM signals for each of these feature extraction methods. Mean correct classification rate is about 98.76% for the sample CBDM signals. (C) 2010 Elsevier Ltd. All rights reserved.

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

feature extraction
wavelet neural networks
chaos

modulation classification
chaos-based digital modulation


Compressed hierarchical mining of frequent closed patterns from dense data sets This paper addresses the problem of finding frequent closed patterns ( FCPs) from very dense data sets. We introduce two compressed hierarchical FCP mining algorithms: C-Miner and B-Miner. The two algorithms compress the original mining space, hierarchically partition the whole mining task into independent subtasks, and mine each subtask progressively. The two algorithms adopt different task partitioning strategies: C-Miner partitions the mining task based on Compact Matrix Division, whereas B-Miner partitions the task based on Base Rows Projection. The compressed hierarchical mining algorithms enhance the mining efficiency and facilitate a progressive refinement of results. Moreover, because the subtasks can be mined independently, C-Miner and B-Miner can be readily paralleled without incurring significant communication overhead. We have implemented C-Miner and B-Miner, and our performance study on synthetic data sets and real dense microarray data sets shows their effectiveness over existing schemes. We also report experimental results on parallel versions of these two methods.

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

frequent closed patterns
progressive
dense data sets


Debriefing surgeons on non-technical skills (NOTSS) Surgical trainees must maximise the educational and developmental opportunities of time spent in the operating theatre. Post-operative debriefing on performance based on observed skills is one way of achieving this and is regularly done in other high-risk professions. The non-technical skills for surgeons (NOTSS) behaviour rating system allows surgeons to observe trainees behaviour in the workplace and provide feedback for skill improvement in a structured manner. This paper describes the process of debriefing using NOTSS and presents the results of a usability trial. Two case studies also illustrate how the system was used. The majority of surgical trainers who participated reported that the NOTSS system provided a common language to discuss non-technical skills and was a valuable adjunct to currently available assessment tools. Some trainers found interpersonal skills more difficult to rate than cognitive skills but 73% (n=8) felt that routine use of the system would enhance patient safety.

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

surgical training
education
non-technical skills


Interval arithmetic: From principles to implementation We start with a mathematical definition of a real interval as a closed, connected set of reals. Interval arithmetic operations (addition, subtraction, multiplication, and division) are likewise defined mathematically and we provide algorithms for computing these operations assuming exact real arithmetic. Next, we define interval arithmetic operations on intervals with IEEE 754 floating point endpoints to be sound and optimal approximations of the real interval operations and we show that the IEEE standard's specification of operations involving the signed infinities, signed zeros, and the exact/inexact flag are such as to make a correct and optimal implementation more efficient. From the resulting theorems, we derive data that are sufficiently detailed to convert directly to a program for efficiently implementing the interval operations. Finally, we extend these results to the case of general intervals, which are defined as connected sets of reals, that are not necessarily closed.

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


On the sum-max bicriterion path problem In network analysis, there are many applications in which several weights associated with traversing each arc are given, so it is natural to consider multiple-objective path problems. Usually, there is no path which is simultaneously optimal with respect to all objective functions, so it will be necessary to obtain efficient paths of interest, i.e. paths for which there exists no other path that yields an improvement in one of the objective functions without causing a degradation in the others. Methods for determining efficient paths form part of a very extensive literature on multiple-objective optimization, most of them being proposed for objectives defined by sum functions. Our aim is to study the particular case of a bicriterion problem whose objective functions are defined by a sum and a maximum. A very important aspect of this problem is to find a best compromise solution, which is shown to be equivalent to solve the quickest path problem, which has interesting applications in communication and transportation networks. In this paper, we study a special class of bicriterion path problems where the objective functions are defined by a sum and a maximum: The sum-max bicriterion path problem (SMBPP). After reviewing some special kinds of efficient paths, we propose some algorithms to generate these kinds of efficient paths, based on a progressive reduction of the original network. We analyse its relationship with the quickest path problem (QPP), showing that this is equivalent to the weighted problem associated to the SMBPP, which is also solved by a modification of an algorithm proposed for the QPP. A computational study is presented which shows the superiority of the algorithm proposed in this paper over other existing algorithms to generate the entire set E of efficient paths of the SMBPP.

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

bicriteria analysis
network optimization
quickest paths


location based power analysis to detect malicious code in smartphones This paper proposes to exploit correlation between a user's location and power consumption pattern of his/her smartphone to detect the presence of malicious code in the smartphone. Based on the observation that user location plays an important role in phone usage, the hypothesis is that there is a strong correlation between smartphone power consumption pattern and location. To verify this hypothesis, a detailed study was conducted in which power consumption data from twenty smartphone users was collected over a period of three months. The paper presents this data and a preliminary analysis shows that there is potential for detecting the presence of malicious code in smartphone by detecting abnormalities in location-based power consumption.

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


a decomposition solution to the queueing network model of the centralized dbms with static locking The effect of concurrency control methods on the performance of computer systems is analyzed in the context of a centralized database with a static lock request policy, i.e., database transactions should acquire all locks before their activation. In the lock conflict model the L locks required by each transaction are uniformly distributed over the N locks in the database. The computer system is modelled as a queueing network. Two scheduling policies for transaction activation are considered: FCFS with and without skip. In each case the scheduling overhead for scanning the blocked transactions is taken into account. The number of transactions to be scanned is limited by a window size parameter. The system is analyzed using a hierarchical decomposition method, where the highest level model yields the mean user response time. The results of the approximate solution are validated using a detailed simulation, which shows that the analysis based on no resampling of locks is quite accurate and outperforms the simplified analysis with resampling of locks in accuracy. The effect of varying the values of parameters such as transaction size, granularity of locking, scheduling discipline for transaction activation, scheduling overhead, and window size on system performance is investigated.

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

network
activation
scheduling
policy
simulation
conflict
analysis
concurrency control
performance
response time
context
case
account
model
dbms
user
decomposition
method
accuracy
systems
values
size
mean
distributed
transaction
effect
database
locking

approximation
computation
centrality
queue
scan
hierarchic
network model
windows


On the statistical decorrelation of the 2D discrete wavelet transform coefficients of a wide sense stationary bivariate random process We present a second order statistical analysis of the 2D Discrete Wavelet Transform (2D DWT) coefficients. The input images are considered as wide sense bivariate random processes. We derive closed form expressions for the wavelet coefficients? correlation functions in all possible scenarios: inter-scale and inter-band, inter-scale and intra-band, intra-scale and inter-band and intra-scale and intra-band. The particularization of the input process to the White Gaussian Noise (WGN) case is considered as well. A special attention is paid to the asymptotical analysis obtained by considering an infinite number of decomposition levels. Simulation results are also reported, confirming the theoretical results obtained. The equations derived, and especially the inter-scale and intra-band dependency of the 2D DWT coefficients, are useful for the design of different signal processing systems as for example image denoising algorithms. We show how to apply our theoretical results for designing state of the art denoising systems which exploit the 2D DWT.

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

wavelet transforms
white noise
colored noise


locality discriminating indexing for document classification This paper introduces a locality discriminating indexing (LDI) algorithm for document classification. Based on the hypothesis that samples from different classes reside in class-specific manifold structures, LDI seeks for a projection which best preserves the within-class local structures while suppresses the between-class overlap. Comparative experiments show that the proposed method isable to derives compact discriminating document representations for classification.

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


Tight compact models and comparative analysis for the prize collecting Steiner tree problem We investigate a generalized version of the prize collecting Steiner tree problem (PCSTP), where each node of a given weighted graph is associated with a prize as well as a penalty cost. The problem is to find a tree spanning a subset of nodes that collects a total prize not less than a given quota Q Q , such that the sum of the weights of the edges in the tree plus the sum of the penalties of those nodes that are not covered by the tree is minimized. We formulate several compact mixed-integer programming models for the PCSTP and enhance them by appending valid inequalities, lifting constraints, or reformulating the model using the ReformulationLinearization Technique (RLT). We also conduct a theoretical comparison of the relative strengths of the associated LP relaxations. Extensive results are presented using a large set of benchmark instances to compare the different formulations. In particular, a proposed hybrid compact formulation approach is shown to provide optimal or very near-optimal solutions for instances having up to 2500 nodes and 3125 edges.

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


Novel alarm correlation analysis system based on association rules mining in telecommunication networks Alarm correlation analysis system is an useful method and tool for analyzing alarms and finding the root cause of faults in telecommunication networks. Recently, the application of association rules mining becomes an important research area in alarm correlation analysis. In this paper, we propose a novel Association Rules Mining based Alarm Correlation Analysis System (ARM-ACAS) to find interesting association rules between alarm events. In order to mine some infrequent but important items, ARM-ACAS first uses neural network to classify the alarms with different levels. In addition, ARM-ACAS also exploits an optimization technique with the weighted frequent pattern tree structure to improve the mining efficiency. The system is both efficient and practical in discovering significant relationships of alarms as illustrated by experiments performed on simulated and real-world datasets.

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

alarm correlation analysis
association rules mining
neural network
weighted frequent pattern tree


Self-sustaining non-repetitive activity in a large scale neuronal-level model of the hippocampal circuit The mammalian hippocampus is involved in spatial representation and memory storage and retrieval, and much research is ongoing to elucidate the cellular and system-level mechanisms underlying these cognitive functions. Modeling may be useful to link network-level activity patterns to the relevant features of hippocampal anatomy and electrophysiology. Investigating the effects of circuit connectivity requires simulations of a number of neurons close to real scale. To this end, we construct a model of the hippocampus with 16 distinct neuronal classes (including both local and projection cells) and 200,000 individual neurons. The number of neurons in each class and their interconnectivity are drawn from rat anatomy. Here we analyze the emergent network activity and how it is affected by reducing either the size or the connectivity diversity of the model. When the model is run with a simple variation of the McCullochPitts formalism, self-sustaining non-repetitive activity patterns consistently emerge. Specific firing threshold values are narrowly constrained for each cell class upon multiple runs with different stochastic wiring and initial conditions, yet these values do not directly affect network stability. Analysis of the model at different network sizes demonstrates that a scale reduction of one order of magnitude drastically alters network dynamics, including the variability of the output range, the distribution of firing frequencies, and the duration of self-sustained activity. Moreover, comparing the model to a control condition with an equivalent number of (excitatory/inhibitory balanced) synapses, but removing all class-specific information (i.e.collapsing the network to homogeneous random connectivity) has surprisingly similar effects to downsizing the total number of neurons. The reduced-scale model is also compared directly with integrate-and-fire simulations, which capture considerably more physiological detail at the single-cell level, but still fail to reproduce the full behavioral complexity of the large-scale model. Thus network size, cell class diversity, and connectivity details may all be critical to generate self-sustained non-repetitive activity patterns.

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

rat hippocampus
mccullogh-pitts
integrate and fire
rhythmic activity


Equilibrium analysis and corporate social responsibility for supply chain integration This paper evaluates the profit of coordination between manufacturers on corporate social responsibility (CSR) under network equilibrium. A three-tier supply chain network with multiple manufacturers, distributors, and retailers is considered, and several mathematical models are established to investigate behavior and profits in a decentralized supply chain network, a centralized supply chain network, and a supply chain network with CSR. The system-optimal solution of a supply chain network problem is usually not achievable or stable since each member always tries to maximize its own profit. In order to make such a system-optimal solution in a stable state and ensure the maximization of total profits, a strategy of coordination between manufacturers on CSR is proposed. The amount of payment in CSR of each manufacturer is clearly defined. A hybrid diagonalization method with a super-network representation is proposed and tested with numerical examples. The results show that by taking CSR, the total profits of the whole supply chain network can increase with or without coordination.

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

supply chain management
network flows
variational inequality


Exploiting the benefits of multiple-path network in DSM systems: Architectural alternatives and performance evaluation Modern high-performance networks being used for scalable distributed shared-memory (DSM) systems support multiple paths to increase bandwidth and/or reduce contention. Such networks violate the constraint of pairwise in-order message delivery implicitly required by many existing directory-based cache coherence protocols. To solve this problem, two alternative strategies are currently used by computer architects. The first strategy, used in the SGI Origin series, is to employ an intelligent cache coherence protocol which detects and resolves all race conditions caused by out-of-order (OoO) events. The second strategy, used in the HAL Mercury series, is to use a sophisticated network interlace (NI) which detects and remedies every OoO event before the messages are fed to the cache coherence controllers. Both strategies involve complicated hardware logic, either at the cache coherence controller level or at the NI level. In this paper, we propose a new strategy that uses block correlated FIFO channels. This new strategy detects all potential race conditions and prevents them from occurring. It allows the use of a simple cache coherence protocol and an inexpensive NI. We also present an efficient implementation of this strategy based on current technology. Detailed simulations are performed using benchmark applications to evaluate the performance of our new strategy. The results indicate that, compared to the existing strategies, our new strategy always provides either the best or close to the best overall performance. This study also provides valuable insights into the design trade-offs in incorporating modern networks into DSM systems.

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

parallel architecture
distributed shared-memory systems
performance modeling
interconnection networks
network interface
directory-based protocols
and cache coherence