Structure design and test of enterprise security management system with advanced internal security A security system for a company network is progressing as a ESM (Enterprise Security Management) in an existing security solution foundation. The establishment of the security policy is occupying a very important area in ESM of the security system. We tried to analyze the existing ESM system for this and designed a security solution structure for enhancing the internal security. We applied implementing directly IDS system and tested it. This study examined the structure of security solutions in order to build an enterprise security management system. For this purpose, we analyzed existing enterprise security management systems and, based on the results, proposed a enterprise security management system with reinforced internal security and tested the system. For the test, we used a firewall through log analysis and designed an intra-network using virtual IP system.

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

ids security firewall internal management


Improved OBS burst assembly with a buffer safety space in unit input bit rate A burst assembly scheme at the edge routers in optical burst switched networks (OBSNs) is presented for setting up more universal, realistic, and high-powered networks. For the first time, the concept of unit input bit rate is introduced to improve universality. In addition, various factors limiting burst length are discussed, while considering service requirement and hardware architectures. Then, a novel burst assembly algorithm with a buffer safety space is proposed. Based on the above, the assembly process in optical burst switching at edge routers is simulated, and its influence on burst creation, burst length distribution, packet loss ratio, total output data, and valid data ratio are discussed. The results show that the scheme can provide more efficient QoS guarantee in optical burst switched networks, even for 32 random packet sources at an edge router, the packet loss ratio is to 5 x 10(-5), and the valid data ratio reaches 99.7%.

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

optical burst switching
assembly algorithm
buffer safety space
unit input bit rate


Location models for airline hubs behaving as M/D/c queues Models are presented for the optimal location of hubs in airline networks, which take into consideration the congestion effects. Hubs, which are typically the most congested airports, are modeled as M/D/c queuing systems. A formula is derived for the probability of a number of customers in the system, which is later used to propose a capacity constraint. This constraint limits the probability of more than b airplanes in queue, to be smaller than or equal to a given value. Due to the computational complexity of the formulation, the model is solved using a heuristic based on tabu search. Computational experience is presented together with an example using a data set available in the literature. In order to take advantage of economies of scale, most major airlines have selected some airports as transshipment points (hubs). As hubs become congested, the usual hub siting techniques fail in finding their best locations. We propose new methods for locating congested hubs and allocating runways to hub airports.

O O O 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 I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 steganographic scheme for secure communications based on the chaos and Euler theorem Steganography has been proposed as a methodology for transmitting messages through innocuous covers to conceal their existence. This work proposes an asymmetric image steganographic method based on a chaotic dynamic system and the Euler theorem. The hidden message can be recovered using orbits different from the embedding orbits, and the original image is not required to extract the hidden message. Experimental results and discussions reveal that the proposed scheme possesses security, imperceptibility and survivability.

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

asymmetric orbit
covert communication
man-in-the-middle attack


advanced brain computer interface for communication and control The brain computer interface (BCI) technology allows a direct connection between brain and computer without any muscular activity required, and thus it offers a unique opportunity to enhance and/or to restore communication and actions into external word in people with severe motor disability. Here, we present the framework of the current research progresses regarding noninvasive EEG-based BCI applications specifically devoted to interact with the environment and other software. The P300 potentials recorded from the scalp represent a suitable BCI signal control for applications like environmental control. Here we present a set of findings that confirm the feasibility of a real domotic environmental control operated via P300-based BCI and a novelty interface approach to evoke the P300 signal.

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

ambient intelligence
severe motor impairment
technologies for independent life
brain-computer interfaces


Force based tool wear monitoring system for milling process based on relevance vector machine RVM based monitoring system is realized for tool wear recognition. Multinomial function is used to realize multi categories classification. The classification accuracy of RVM is higher than SVM. The consuming time of RVM classification is less than SVM.

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

tool wear monitoring
relevance vector machine
multinomial function
milling process


statistical analysis of simulation output data This paper is a tutorial paper on how to obtain point estimates and confidence intervals of steady state means of simulation output data. The methods of using replications, batch means, and regenerative cycles for obtaining these point and interval estimates are discussed in detail and are applied to a simple time-shared computer model to illustrate their use. A brief discussion is included on using time series methods to obtain these estimates. The advantages and disadvantages of the various methods are given, including specific recommendations as to when certain methods might be used.

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

point
use
simulation
interval
data
tutorial
time series
paper
statistical analysis

sharing
recommendation
method
computer modeling
timing


Entwicklung Serviceorientierter Architekturen zur Integration von Produktion und Dienstleistung Eine Konzeptionsmethode und ihre Anwendung am Beispiel des Recyclings elektronischer Gerte Die Erstellung von Leistungsbndeln aus Sach- und Dienstleistungen wird fr Unternehmen immer bedeutender. Dabei setzen eine Vernderung der organisatorischen Rahmenbedingungen und die dynamische Anpassung der Leistungserstellung an wechselnde Kundenanforderungen wandlungsfhige Informationssystemarchitekturen in Produktion und Dienstleistung voraus. Serviceorientierte Architekturen (SOA) leisten einen Beitrag zur Erhhung dieser Wandlungsfhigkeit. Jedoch ist die Identifikation, Spezifikation und Implementierung von Services als Basis der Serviceorientierten Architekturen bislang nur unzureichend methodisch untersttzt. Der Schlieung dieser Forschungslcke dient eine Konzeptionsmethode, die Anstze zur Kundenintegration adaptiert und eine betriebswirtschaftliche mit einer informationstechnischen Analyse verbindet. Die Anwendbarkeit der Methode wird dabei anhand der prototypischen Erstellung einer Serviceorientierten Architektur fr das Recycling elektronischer Gerte demonstriert. Die angestrebte Ausweitung der Architektur auf weitere Leistungsbndel und die Standardisierung der dabei spezifizierten Services zielen darauf ab, in zuknftigen Arbeiten die Ausschpfung bestehender Potentiale bei der Integration von Produktion und Dienstleistung durch die Bereitstellung einer umfassenden Referenzarchitektur zu frdern.

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

leistungsbndel
serviceorientierte architekturen
recycling

service-identifikation
service-spezifikation
product-service system
service oriented architecture
service identification
service specification


zoomable user interface for in-depth reading The Instant Bookplex system includes a zoomable user interface (ZUI) for navigating through a spatial representation of a document collection. This ZUI supports extended reading in the collection using semantic zooming, graphical presentation of metadata, animated transitions, and an integrated reading tool It helps users find and re-find documents, choose good documents to read next, and navigate between documents.

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

visualization
computer-aided reading
spatial memory
digital library
document management


The Birth of New Genes by RNA- and DNA-Mediated Duplication during Mammalian Evolution Gene duplication has long been recognized as a major force in genome evolution and has recently been recognized as an important source of individual variation. For many years, the origin of functional gene duplicates was assumed to be whole or partial genome duplication events, but recently retrotransposition has also been shown to contribute new functional protein coding genes and siRNA's. In this study, we utilize pseudogenes to recreate more complete gene family histories, and compare the rates of RNA and DNA-mediated duplication and new functional gene formation in five mammalian genomes. We find that RNA-mediated duplication occurs at a much higher and more variable rate than DNA-mediated duplication, and gives rise to many more duplicated sequences over time. We show that, while the chance of RNA-mediated duplicates becoming functional is much lower than that of their DNA-mediated counterparts, the higher rate of retrotransposition leads to nearly equal contributions of new genes by each mechanism. We also find that functional RNA-mediated duplicates are closer to neighboring genes than non-functional RNA-mediated copies, consistent with cooption of regulatory elements at the site of insertion. Overall, new genes derived from DNA and RNA-mediated duplication mechanisms are under similar levels of purifying selective pressure, but have broadly different functions. RNA-mediated duplication gives rise to a diversity of genes but is dominated by the highly expressed genes of RNA metabolic pathways. DNA-mediated duplication can copy regulatory material along with the protein coding region of the gene and often gives rise to classes of genes whose function are dependent on complex regulatory information. This mechanistic difference may in part explain why we find that mammalian protein families tend to evolve by either one mechanism or the other, but rarely by both. Supplementary Material has been provided (see online Supplementary Material at www.liebertonline.com).

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

dna-mediated duplication
rna-mediated duplication
segmental duplication


Hardware design and gait generation of humanoid soccer robot Stepper-3D This paper presents the hardware design and gait generation of humanoid soccer robot Stepper-3D. Virtual Slope Walking, inspired by Passive Dynamic Walking, is introduced for gait generation. In Virtual Slope Walking, by actively extending the stance leg and shortening the swing leg, the robot walks on level ground as it walks down a virtual slope. In practical, Virtual Slope Walking is generated by connecting three key frames in the sagittal plane with sinusoids. Aiming for improving the walking stability, the parallel double crank mechanism are adopted in the leg structure. Experimental results show that Stepper-3D achieves a fast forward walking speed of 0.5 m/s and accomplishes omnidirectional walking. Stepper-3D performed fast and stable walking in the RoboCup 2008 Humanoid competitions.

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


A comparative methodology for the reconstruction of digital events using windows restore points ? This paper describes a methodology for the reconstruction of digital events by comparing states captured in time. Microsoft Windows Restore Point data is used to illustrate how to organize captured state information into a useful timeline of user and system events. It is shown that by comparing consecutive states, events can be uncovered that would otherwise be unknown by analysis of the current system state alone.

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

event reconstruction
event timeline
digital forensics
comparative analysis
registry


Position-based routing in vehicular networks: A survey Routing in vehicular network is a challenging task due to network partitioning, high vehicular speed, and city environment characteristics. These characteristics results in degraded performance in traditional routing protocols. Traditional routing protocols, addressing the issues of mobile ad hoc network, are applicable for MANET applications. Position-based routing protocols, which are mostly based on greedy routing, are more suited to highly dynamic and mobile network. In this paper, we survey state of art routing protocols previously used in vehicular networks, present open research challenges and possible future direction. We categorize protocols into two categories based on their communicating mode (vehicle-to-vehicle, vehicle-to-infrastructure) irrespective of their simulating environment (highway, urban). Both vehicle-to-vehicle and vehicle-to-infrastructure communication provides connectivity based on multi-hop paradigm in a seamless way. We discuss pros and cons for routing protocols belonging to each category. By doing qualitative comparison of routing protocols, it is observed that hybrid communication would be the better choice for both communication mode operable in either a city environment or an open environment.

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

forwarding strategies
position-based routing
vehicular ad hoc network
v2v and v2i communication


A program for computing weak and intermediate field Zeeman splittings from MCHF wave functions Given electronic wave functions generated by the MCHF_CI program (LSJ format), this program calculates diagonal Lande a factors that determine separations of magnetic sublevels in weak external magnetic fields. In addition the program computes off-diagonal Lande factors and constructs the total interaction matrix for an atom in a magnetic field. By diagonalizing the interaction matrix and plotting the eigenvalues as functions of the magnetic field, Zeeman structures beyond the weak field limit are obtained. (C) 2002 Elsevier Science 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 B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O

multiconfiguration hartree-fock plus breit-pauli


A class of discontinuous PetrovGalerkin methods. Part I: The transport equation Considering a simple model transport problem, we present a new finite element method. While the new method fits in the class of discontinuous Galerkin (DG) methods, it differs from standard DG and streamline diffusion methods, in that it uses a space of discontinuous trial functions tailored for stability. The new method, unlike the older approaches, yields optimal estimates for the primal variable in both the element size h and polynomial degree p, and outperforms the standard upwind DG method.

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

petrovgalerkin
discontinuous galerkin
dg

advection
high order
dpg
hp optimal
spectral
conservative
flux
postprocessing


Developing secure data warehouses with a UML extension Data Warehouses (DWs), Multidimensional (MD) Databases, and On-Line Analytical Processing Applications are used as a very powerful mechanism for discovering crucial business information. Considering the extreme importance of the information managed by these kinds of applications, it is essential to specify security measures from the early stages of the DW design in the MD modeling process, and enforce them. In the past years, some proposals for representing main MD modeling properties at the conceptual level have been stated. Nevertheless, none of these proposals considers security issues as an important element in its model, so they do not allow us to specify confidentiality constraints to be enforced by the applications that will use these MD models. In this paper, we will discuss the specific confidentiality problems regarding DWs as well as present an extension of the Unified Modeling Language for specifying security constraints in the conceptual MD modeling, thereby allowing us to design secure DWs. One key advantage of our approach is that we accomplish the conceptual modeling of secure DWs independently of the target platform where the DW has to be implemented, allowing the implementation of the corresponding DWs on any secure commercial database management system. Finally, we will present a case study to show how a conceptual model designed with our approach can be directly implemented on top of Oracle 10g.

O O B I O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 warehouses
uml extension
confidentiality

multidimensional conceptual modeling
secure data warehouses


Model selection for linear classifiers using Bayesian error estimation We propose to use the Bayesian error estimator (BEE) for classifier model selection. We show that the BEE rule speeds up model selection by an order of magnitude. We show that the BEE rule selects a better model than cross-validation. We propose an approximation rule of the BEE for multi-label classification problems.

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

logistic regression
support vector machine
regularization
linear classifier


A rigorous ODE solver and Smale's 14th problem We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of interval arithmetic with directed rounding. As an application, we prove that the Lorenz equations support a strange attractor, as conjectured by Edward Lorenz in 1963. This conjecture was recently listed by Steven Smale as one of several challenging problems for the twenty-first century. We also prove that the attractor is robust, i.e., it persists under small perturbations of the coefficients in the underlying differential equations. Furthermore, the flow of the equations admits a unique SRB measure, whose support coincides with the attractor. The proof is based on a combination of normal form theory and rigorous computations.

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

lorenz attractor
dynamical systems
auto-validating algorithms
normal forms


Topological ordering algorithm for LDAG Directed Acyclic Graph (DAG) is an important tool for workflow modeling and data provenance management. In these applications. DAG usually performs well. Yet for some workflow applications, except data or control dependencies between atomic tasks, there exists another requirement that each atomic task should be accomplished at an expected stage. Therefore, this paper proposes an improved DAG model - LDAG, in which each vertex has a level. Three cases of the level of vertices are discussed. For a reasonable one of these cases, this paper proposes a topological ordering algorithm and proves its correctness. In addition, it discusses the complexity of the algorithm and some other relevant problems. (c) 2012 Elsevier B.V. All rights reserved.

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

topological order
computational complexity


privacy in electronic commerce and the economics of immediate gratification Dichotomies between privacy attitudes and behavior have been noted in the literature but not yet fully explained. We apply lessons from the research on behavioral economics to understand the individual decision making process with respect to privacy in electronic commerce. We show that it is unrealistic to expectindividual rationality in this context. Models of self-control problems and immediate gratification offer more realistic descriptions of the decision process and are more consistent with currently available data. In particular, we show why individuals who may genuinely want to protect their privacy might not do so because of psychological distortions well documented in the behavioral literature; we show that these distortions may affect not only 'naive' individuals but also 'sophisticated' ones; and we prove that this may occur also when individuals perceive the risks from not protecting their privacy as significant.

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

economics
research
affect
decision making
immediate gratification
electronic commerce
behavior
data
process
privacy

hyperbolic discounting
self-control problems
context model
consistency
control
attitude


Adaptive complex event processing for harmful situation detection In the field of infrastructures surveillance and protection, it is important to make decisions based on activities occurring in the environment and its local context and conditions. In this paper we use an active rule based event processing architecture in order to make sense of situations from the combination of different signals received by the rule engine. However obtaining some high level information automatically is not without risks, especially in sensitive environments, and detection mistakes can happen for various reasons: the signals source can be defective, whether it is humanmiss-interpretation of the signalor computedmaterial malfunction; the aggregation rules can be wrong syntaxically, for example when a rule will never be triggered or a situation never detected; the interpretation given to the combination of signals does not correspond to the reality on the fieldbecause the knowledge of the rule designer is subjective or because the environment evolves over-timethe rules are therefore incorrect semantically. In this paper, a new approach is proposed to avoid the third kind of error sources. We present a hybrid machine learning technique adapted to the complexity of the rules representation, in order to create a system more conform to reality. The proposed approach uses a combination of an Association Rule Mining algorithm and Inductive Logic Programming for rule induction. Empirical studies on simulated datasets demonstrate how our method can contribute to sensible systems such as the security of a public or semi-public place.

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

complex event processing
inductive logic programming
association rule mining


Modified neo-fuzzy neuron-based approach for economic and environmental optimal power dispatch At the central energy management center in a power system, the real time controls continuously track the load changes and endeavor to match the total power demand with total generation in such a manner that the operating cost is minimized while all the operating constraints are satisfied. However, due to the strict government regulations on environmental protection, operation at minimum cost is no longer the only criterion for dispatching electrical power. The idea behind the environmentally constrained economic dispatch formulation is to estimate the optimal generation schedule of generating units in such a manner that fuel cost and harmful emission levels are both simultaneously minimized for a given load demand. Conventional optimization techniques become very time consuming and computationally extensive for such complex optimization tasks. These methods are hence not suitable for on-line use. Neural networks and fuzzy systems can be trained to generate accurate relations among variables in complex non-linear dynamical environment, as both are model-free estimators. The existing synergy between these two fields has been exploited in this paper for solving the economic and environmental dispatch problem on-line. A multi-output modified neo-fuzzy neuron (NFN), capable of real time training is proposed for economic and environmental power generation allocation. This model is found to achieve accurate results and the training is observed to be faster than other popular neural networks. The proposed method has been tested on medium-sized sample power systems with three and six generating units and found to be suitable for on-line combined environmental economic dispatch (CEED).

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

combined environmental economic dispatch (ceed)


Numerical computation of derivatives in systems of delay differential equations This article deals with initial value problem solutions in systems of delay differential equations and their derivatives with respect to parameters, where the parameters may occur in the initial value, the initial function, the right-hand-side function, and the delay. Sufficient conditions for differentiability are given, and an efficient and reliable method for the numerical computation is presented. Emphasis is laid on the treatment of problems with a discontinuity at the initial time, for which it is shown that jumps occur in the derivative at the propagated discontinuity times. An explicit expression for the size of the jumps in the derivative is given. Features are discussed of the implementation of COLSOL-DDE, an experimental solver for initial value problems in delay differential equations that also computes the derivatives of the solution. The performance of the developed method is demonstrated by a comparison to standard techniques for derivative approximation. (C) 2013 IMACS. Published by Elsevier B.V. All rights reserved.

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

delay differential equations
derivatives

parameter-dependent delays
numerical methods
software


A Layout-Aware Pattern Grading Procedure for Critical Paths Considering Power Supply Noise and Crosstalk Power supply noise and crosstalk are the two major noise sources that are pattern dependent and negatively impact signal integrity in digital integrated circuits. These noise sources play a greater role in sub-65nm technologies and may cause timing failures and reliability problems in a design; thus must be carefully taken into consideration during test pattern generation and validation. In this paper, we propose a novel method to evaluate path-delay fault test patterns in terms of their ability to cause excess delay on targeted critical paths. It quantifies the noises with a pattern quality value (Q) using the activated aggressor gates and nets information. The proposed method offers design engineers a quick approach to evaluate the critical paths in static timing analysis (STA) and silicon to improve timing margin strategies. By evaluating the failed test pattern, the proposed method can be used to help identify the root cause during failure analysis. Simulation results demonstrate the efficiency and effectiveness of the pattern grading procedure.

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

signal integrity
crosstalk
power supply noise
pattern grading


Decision dependent stochastic processes A new Bayesian inferencing method for decision dependency in a stochastic process. Real world examples provided using preventive and corrective maintenance in a nuclear power plant. A stochastic optimization problem is solved using the decision dependent probability distribution inferences.

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

bayesian inference
decision dependence
endogenous
uncertainty
weibull


MISMIS A comprehensive decision support system for stock market investment Nowadays, stock market is becoming a popular investment platform for both institutional and individual investors. The current financial information systems serve to provide latest information. However, they lack sophisticated analytical tools. This paper proposes a new architecture for financial information systems. The developed prototype is entitled as the Multi-level and Interactive Stock Market Investment System (MISMIS). It is specially designed for investors to build their financial models to forecast stock price and index. The performance of the financial models can be evaluated on a virtual trading platform. There are other features in MISMIS that are tailor-made to handle financial data; these include synchronized time frame, time series prediction techniques, preprocessing and transformation functions, multi-level modeling and interactive user interface. To illustrate the capability of MISMIS, we have evaluated strategies of trading the future options of Hang Seng Index (HSI). We find that historical HSI, Dow Jones Index, property price index, retailing sales figure, prime lending rate, and consumer price index in Hong Kong are essential factors affecting the performance of the trading of HSIs future option. Also there are some feedbacks from the in-depth interviews of six financial consultant upon how they perceived the prototype MISMIS.

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

stock market intelligent trading system
time series analysis
multi-level system


SMALL-FIRM COMPUTING - MOTIVATORS AND INHIBITORS This paper examines information system evolution in small firms. It focuses on applications growth, and uses the experiences of six small manufacturing firms to identify motivators and inhibitors of growth. Many factors were identified. Motivators of growth included: improved enthusiasm for the technology. Inadequate resources and limited education about information systems were among the factors that inhibited applications growth.

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

small-firm computing
growth motivators
growth inhibitors
growth process


Pseudo-codeword analysis of tanner graphs from projective and euclidean planes We consider coded data transmission over a binary-input output-symmetric memoryless channel using a binary linear code. In order to understand the performance of maximum-likelihood (NIL) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's attention needs to be shifted to the pseudo-codewords, in particular, to the minimal pseudo-codewords and their pseudo-weights. In this paper, we investigate some families of codes that have good properties under LP decoding, namely certain families of low-density parity-check (LDPC) codes that are derived from projective and Euclidean planes: we study the structure of their minimal pseudo-codewords and give lower bounds on their pseudo-weight. Besides this main focus, we also present some results that hold for pseudo-codewords and minimal pseudo-codewords of any Tanner graph, and we highlight how the importance of minimal pseudo-codewords under LP decoding varies depending on which binary-input output-symmetric memoryless channel is used.

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

codes from euclidean planes
codes from projective planes
linear programming decoding
message-passing iterative decoding
minimal pseudo-codewords
pseudo-weight
pseudo-weight spectra


JAMMING TRANSITION OF POINT-TO-POINT TRAFFIC THROUGH CO-OPERATIVE MECHANISMS We study the jamming transition of two-dimensional point-to-point traffic through co-operative mechanisms (DCM) using computer simulation. We propose two decentralized co-operative mechanisms CM which are incorporated into the point-to-point traffic models: stepping aside (CM-SA) and choosing alternative routes (CM-CAR). Incorporating CM-SA is to prevent a type of ping-pong jumps from happening when two objects standing face-to-face want to move in opposite directions. Incorporating CM-CAR is to handle the conflict when more than one object competes for the same point in parallel update. We investigate and compare four models mainly from fundamental diagrams, jam patterns and the distribution of co-operation probability. It is found that although it decreases the average velocity a little, the CM-SA increases the critical density and the average flow. Despite increasing the average velocity, the CM-CAR decreases the average flow by creating substantially vacant areas inside jam clusters. We investigate the jam patterns of four models carefully and explain this result qualitatively. In addition, we discuss the advantage and applicability of decentralized co-operation modeling.

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

point-to-point traffic
co-operative mechanism
mobile object
origin-destination
cellular automata


Fuzzy reliability estimation using Bayesian approach The Bayesian reliability estimation under fuzzy environments is proposed in this paper. In order to apply the Bayesian approach, the fuzzy parameters are assumed to be fuzzy random variables with fuzzy prior distributions. The (conventional) Bayesian estimation method will be used to create the fuzzy Bayes point estimator of reliability by invoking the well-known theorem called 'Resolution Identity' in fuzzy sets theory. On the other hand, we also provide the computational procedures to evaluate the membership degree of any given Bayes point estimate of reliability. In order to achieve this purpose, we transform the original problem into a nonlinear programming problem. This nonlinear programming problem is then divided into four subproblems for the purpose of simplifying computation. Finally, the subproblems can be solved by using any commercial optimizers, e.g. GAMS or LINGO. (C) 2004 Elsevier Ltd. All rights reserved.

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

bayes point estimators
failure rate
fuzzy real numbers
reliability function


The switching algorithm for the control of overhead crane This paper presents the fuzzy logic based method to control the trolley cranes. The information, including the position of trolley, load swing and the differences between the present and previous signals, are applied to derive the proper power to drive the trolley. An easy but effective switching algorithm is investigated to improve the control of trolley and suppress the load swing in this paper. This also helps to enhance the control power of the crane to depart from the deadzone. Finally, several experiments through the scaled trolley crane demonstrate the effectiveness of the scheme.

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

fuzzy logic
trolley crane
load swing
deadzone


a dynamic erasure code for multicasting live data Digital fountains, a class of erasure codes, have been used for multicasting stream data and for robust distributed data storage. These methods produce a potentially endless sequence of packets from a fixed (static) message. The dynamic erasure code problem is to extend the digital fountains concept to a message generated simultaneously with the transmission (i.e., live data). Solution of this problem provides a means for robust multicasting or one-way transmission of live data on a computer network. It also gives a method for robust distributed storage of log data, or other serially generated data. A new erasure code is proposed as a solution to the dynamic erasure code problem. It is analytically shown to have a fast decoding algorithm and to be highly bandwidth-efficient.

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


Periodic Bezier curves We construct closed trigonometric curves in a Bezier-like fashion. A closed control polygon defines the curves, and the control points exert a push-pull effect on the curve. The representation of circles and derived curves turns out to be surprisingly simple. Fourier and Bezier coefficients of a curve relate via Discrete Fourier Transform (DFT). As a consequence, DFT also applies to several operations, including parameter shift, successive differentiation and degree-elevation. This Bezier model is a particular instance of a general periodic scheme, where radial basis functions are generated as translates of a symmetric function. In addition to Bezier-like approximation. such a periodic scheme subsumes trigonometric Lagrange interpolation. The change of basis between Bezier and Lagrange proceeds via DFT too, which can be applied to sample the curve at regularly spaced parameter values. The Bezier curve defined by certain control points is a low-pass filtered version of the Lagrange curve interpolating the same set of points. (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 B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dft
lagrange interpolation
periodic bezier

periodic radial basis
trigonometric polynomial


A fourth-order compact finite difference method for higher-order Lidstone boundary value problems A compact finite difference method is proposed for a general class of 2nth-order Lidstone boundary value problems. The existence and uniqueness of the finite difference solution is investigated by the method of upper and lower solutions, without any monotone requirement on the nonlinear term. A monotone iteration process is provided for solving the resulting discrete system efficiently, and a simple and easily verified condition is obtained to guarantee a geometric convergence of the iterations. The convergence of the finite difference solution and the fourth-order accuracy of the proposed method are proved. Numerical results demonstrate the high efficiency and advantages of this new approach. (C) 2008 Elsevier Ltd. All rights reserved.

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

2nth-order lidstone boundary value problem


MRO-MPI: MapReduce overlapping using MPI and an optimized data exchange policy MRO-MPI is an enhanced MapReduce model using MPI for intensive data processing. We maintain the simplicity, improve the speedup and decrease the dependency. Validation was done through three application based on different parameters. Results show that our model outperformed the current Hadoop and MPI-MapReduce.

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

mpi-mapreduce
parallel mapreduce
big data
large scale data processing


The PLFG parallel pseudo-random number generator Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomized algorithms which are, in some cases, less efficient than their deterministic counterpart for smaller problem sizes, can overturn the intractability of various large-scale problems. These algorithms, however, require a source of randomness. Pseudo-random number generators were created for many of these purposes. When performing computations on parallel machines, an additional criterion for randomized algorithms to be worthwhile is the availability of a parallel pseudo-random number generator. This paper presents an efficient algorithm for parallel pseudo-random number generation.

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

randomized computations
monte carlo method
stochastic methods
pseudo-random number generators


emotional remapping of music to facial animation We propose a method to extract the emotional data from a piece of music and then use that data via a remapping algorithm to automatically animate an emotional 3D face sequence. The method is based on studies of the emotional aspect of music and our parametric-based behavioral head model for face animation. We address the issue of affective communication remapping in general, i.e. translation of affective content (eg. emotions, and mood) from one communication form to another. We report on the results of our MusicFace system, which use these techniques to automatically create emotional facial animations from multi-instrument polyphonic music scores in MIDI format and a remapping rule set.

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

affective communication
facial animation


All exceptional groups of lie type have minimal logarithmic signatures As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like \(MST_1, MST_2\) and \(MST_3\). An LS with the shortest length is called a minimal logarithmic signature (MLS) that is highly favourable to be used for cryptographic constructions. The MLS conjecture states that every finite simple group has an MLS. Recently, Nikhil Singhi et al. proved the MLS conjecture to be true for some families of simple groups. In this paper, we firstly prove the existence of MLSs for the exceptional groups of Lie type.

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

exceptional groups of lie type
simple groups


Algorithms for Relatively Cyclotomic Primes We present a general method of generating primes p and q such that q divides Phi(n) ( p), where n > 2 is a fixed number. In particular, we present the deterministic method of finding a primitive nth roots of unity modulo q. We estimate the computational complexity of our methods.

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

computing a primitive nth root of unity modulo primes


A formal model of annotations of digital content This article is a study of the themes and issues concerning the annotation of digital contents, such as textual documents, images, and multimedia documents in general. These digital contents are automatically managed by different kinds of digital library management systems and more generally by different kinds of information management systems. Even though this topic has already been partially studied by other researchers, the previous research work on annotations has left many open issues. These issues concern the lack of clarity about what an annotation is, what its features are, and how it is used. These issues are mainly due to the fact that models and systems for annotations have only been developed for specific purposes. As a result, there is only a fragmentary picture of the annotation and its management, and this is tied to specific contexts of use and lacks-general validity. The aim of the article is to provide a unified and integrated picture of the annotation, ranging from defining what an annotation is to providing a formal model. The key ideas of the model are: the distinction between the meaning and the sign of the annotation, which represent the semantics and the materialization of an annotation, respectively; the clear formalization of the temporal dimension involved with annotations; and the introduction of a distributed hypertext between digital contents and annotations. Therefore, the proposed formal model captures both syntactic and semantic aspects of the annotations. Furthermore, it is built on previously existing models and may be seen as an extension of them.

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

algorithms
design
theory
digital library system
foundations


MILP based short-term centralized and decentralized scheduling of a hydro-chain on Kelkit River Forecasting and MILP based common pool resource management method is developed for short-term scheduling. The day-ahead market prices used in planning are estimated with time-series methods. Method is applied to the model of a hydro-chain at Kelkit River for the first time. Benefits of centralized approach over decentralized approach are investigated. Centralized approach reduces spillages and increases overall profit.

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

reservoir scheduling
optimization models
electric power
energy sources
hydro power


A generalized computational approach to stability of static equilibria of nonlinearly elastic rods in the presence of constraints We present a generalized approach to stability of static equilibria of nonlinearly elastic rods, subjected to general loading, boundary conditions and constraints (of both point-wise and integral type), based upon the linearized dynamics stability criterion. Discretization of the governing equations leads to a non-standard (singular) generalized eigenvalue problem. A new efficient sparse-matrix-friendly algorithm is presented to determine its few left-most eigenvalues, which, in turn, yield stability/instability information. For conservative problems, the eigenvalue problem arising from the linearized dynamics stability criterion is also shown to be equivalent to that arising in the determination of constrained local minima of the potential energy. We illustrate the method with several examples. A novel variational formulation for extensible and unshearable rods is also proposed within the context of one of the example problems.

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


Exploration of Important Sites of Antimalarial Endochins for Optimum Structural Modification Using Group-Based QSAR (G-QSAR) Modeling The emergence of multidrug resistance of the currently available antimalarial drugs has led to the need of the discovery and development of new antimalarial compounds. In the present study, we have used a novel group based quantitative structure-activity relationship (G-QSAR) approach, which allows to establish a correlation of chemical group variation at different molecular sites of interest with the biological activity, using a series of 53 antimalarial endochin analogs. In our previous work, we developed QSAR models for this data set using different chemometric tools and tried to emphasize on importance of descriptor thinning and noise reduction prior to feature selection step. In the present paper, we have tried to select optimal subset of variables using a new strategy for the development of robust G-QSAR models. Starting with an initial pool of 6395 descriptors, we have finally used 51 descriptors for model development using genetic methods. The best model showed encouraging values for internal (Q(2)=0.806, =0.728 and Lambda r(m)((LOO))(2) =0.071), external (R-pred(2)=0.793, =0.729 and Lambda r(m)((test))(2) =0.064) and overall ( =0.725 and Delta r(m)((overall))(2)=0.067) validation parameters. The G-QSAR models developed here from the reduced pool of descriptors were found to be statistically more acceptable than the previously reported models. According to the best model, modification of the fragments based on their interactions with each other at R-1, R-2, R-5 and R-6 positions of the parent moiety are essential for optimum antimalarial activity.

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

antimalarials gfa g/pls g-qsar tm-90-c2b


Stability analysis of neural net controllers using fuzzy neural networks Neural networks can only be trained with a crisp and finite data set. Therefore, the approximation quality of a trained network is hard to verify. So, a common way in proving stability of a trained neural net controller is to demonstrate the existence of a Lyapunov function. In this article we propose a new method how stability of a neural net controller, used as a closed-loop feedback controller, can be proven. Instead of finding a Lyapunov function, conditions for a fuzzy training set are developed. If a fuzzy neural net is trained using this training set special properties of fuzzy neural nets can be used for estimating the generalization error. After defuzzification of the fuzzy net finite stability of the process can be concluded. (C) 1999 Elsevier Science B.V. All rights reserved.

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


Fault-tolerant query processing in structured P2P-systems Recently, a number of query processors has been proposed for the evaluation of relational queries in structured P2P systems. However, as these approaches do not consider peer or link failures, they cannot be deployed without extensions for real-world applications. We show that typical failures in structured P2P systems can have an unpredictable impact on the correctness of the result. In particular stateful operators that store intermediate results on peers, e.g., the distributed hash join, must protect such results against failures. Although many replication schemes for P2P systems exist, they cannot replicate operator states while the query is processed. In this paper we propose an in-query replication scheme which replicates the state of an operator among the neighbors of the processing peer. Our analytical evaluation shows that the network overhead of the in-query replication is in O(1) regarding network size, i.e., our scheme is scalable. We have carried out an extensive experimental evaluation using simulations as well as a PlanetLab deployment. It confirms the effectiveness and the efficiency of the in-query replication scheme and shows the effectiveness of the routing extension in networks of varying reliability.

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

peer-to-peer
distributed query processing
fault-tolerant operators
distributed hash table (dht)


A practical design of content protection for H.264/AVC compressed videos by selective encryption and fingerprinting Digital Rights Management (DRM) of videos is an important issue nowadays. Considering that H.264/AVC videos will be widely used in various applications, we propose a practical design, which combines the methodologies of selective encryption and fingerprinting, for effective DRM of H.264/AVC streaming videos. A selective encryption scheme is first presented to scramble the video content by encrypting a small amount of data in the compressed bit-stream. The scrambled video is H.264-compliant to reduce the complexity of decoder since it can still be played without triggering errors in the decoding process. A fingerprinting scheme is then introduced to provide further protection. We extract a reasonable amount of data from the video and embed the watermark acting as the fingerprint of the video recipient. To acquire the high-quality video for viewing, the user has to decrypt the video obtained from a video server and then combine it with the watermarked data provided from a user information server. The resulting viewable video is thus fingerprinted to deter the user from illegally redistributing the content. Experimental results will demonstrate the feasibility of the proposed approach.

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

selective encryption
fingerprinting
digital rights management

h.264/avc
digital watermark
trailer tracking


Platinum electrode noise in the ENG spectrum The noise from Pt electrodes has not been measured before. We measured the impedance and noise between pairs of Pt electrodes in cylindrical cells within frequency bands which contain the electroneurogram band (ENG, 50010kHz). The results show that the noise from the Pt-saline interface and also the volume conductor are the same as the thermal noise from the real part of those impedances. This means that Pt electrodes are convenient for neural recording because the total source noise from the electrodes and the volume conductor (tissue) can be estimated from the measured total impedance and calculating the thermal noise associated with the resistive part. This differs from Ag/AgCl electrodes for which the interface noise has been reported to be higher than the thermal noise, and therefore calculation of the total noise will be more difficult.

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

pt electrode
impedance measurement
implantable neuroprostheses
neural signal recording
noise measurement


Super-peer-based routing strategies for RDF-based peer-to-peer networks RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper, we will discuss RDF-based P2P networks like Edutella as a specific example of a new type of P2P networks-schema-based P2P networksand describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the super-peer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.

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

peer-to-peer
schema-based routing
distributed rdf repositories
routing protocols
semantic networks


Limit equilibrium based design approach for slope stabilization using multiple rows of drilled shafts In this paper, a limiting equilibrium based methodology, incorporating the method of slices and arching effects of the drilled shafts, is developed for optimizing the use of multiple rows of drilled shafts. This proposed method is focusing on the number of rows, the location of each row, the dimension and spacing of the drilled shafts. Three design criteria are used for optimization: target global factor of safety, the constructability and service limit. A PC-based program called M-UASLOPE has been coded to allow for handling of complex slope geometry, soil profile, and ground water conditions. A design example is presented to illustrate the application of the M-UASLOPE program in the optimized design of multiple rows of drilled shafts for stabilizing the example slope.

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


Video segmentation by MAP labeling of watershed segments This paper addresses the problem of spatio-temporal segmentation of video sequences. An initial intensity segmentation method (watershed segmentation) provides a number of initial segments which are subsequently labeled, with a known number of labels, according to motion information. The label field is modeled as a Markov Random Field where the statistical spatial and temporal interactions are expressed on the basis of the initial watershed segments. The labeling criterion is the maximization of the conditional a posteriori probability of the label field given the motion hypotheses, the estimate of the label field of the previous frame, and the image intensities. For the optimization, an iterative motion estimation-labeling algorithm is proposed and experimental results are presented.

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

markov random fields
motion-based segmentation
region labeling
motion estimation


A new sufficient condition for Hamiltonicity of graphs Rahman and Kaykobad proved the following theorem on Hamiltonian paths in graphs. Let G be a connected graph with n vertices. If d(u) + d(v) + delta(u, v) >= n + 1 for each pair of distinct non-adjacent vertices it and v in G, where S(u, v) is the length of a shortest path between u and v in G, then G has a Hamiltonian path. It is shown that except for two families of graphs a graph is Hamiltonian if it satisfies the condition in Rahman and Kaykobad's theorem. The result obtained in this note is also an answer for a question posed by Rahman and Kaykobad. (c) 2006 Elsevier B.V. All rights reserved.

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

combinatorial problems
graphs hamiltonian cycles


Learning about natural humanrobot interaction styles If we are to achieve natural humanrobot interaction, we may need to complement current vision and speech interfaces. Touch may provide us with an extra tool in this quest. In this paper we demonstrate the role of touch in interaction between a robot and a human. We show how infrared sensors located on robots can be easily used to detect and distinguish human interaction, in this case interaction with individual children. This application of infrared sensors potentially has many uses; for example, in entertainment or service robotics. This system could also benefit therapy or rehabilitation, where the observation and recording of movement and interaction is important. In the long term, this technique might enable robots to adapt to individuals or individual types of user.

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


Optimal pricing in a free market wireless network We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dynamically based on time varying channel conditions, user mobility, and current network prices charged by intermediate nodes. Each node sets its own price for relaying services, with the goal of earning revenue that exceeds its time average reception and transmission expenses. We first develop a greedy pricing strategy that maximizes social welfare while ensuring all participants make non-negative profit. We then construct a (non-greedy) policy that balances profits more evenly by optimizing a profit fairness metric. Both algorithms operate in a distributed manner and do not require knowledge of traffic rates or channel statistics. This work demonstrates that individuals can benefit from carrying wireless devices even if they are not interested in their own personal communication.

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

revenue maximization
ad-hoc mobile
queueing analysis
stochastic optimization
control by pricing


Sequential clustering by statistical methodology To overcome the limitation of requiring the cluster threshold with the parametric approach, this paper presents a clustering constraint which first considers an estimate of the global distribution. The clustering process moves from local clusters identifying the data globally to larger clusters with a specified density function. Merging then occurs to provide a statistically supported representation of the data. A hashing-based sequential clustering algorithm is introduced which utilizes the initial and merging constraints. Experimental data shows the methods effectiveness at classifying varying cluster shapes and sizes when compared to recent clustering techniques.

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

sequential algorithms
gaussian distribution
hashing


improving active learning recall via disjunctive boolean constraints Active learning efficiently hones in on the decision boundary between relevant and irrelevant documents, but in the process can miss entire clusters of relevant documents, yielding classifiers with low recall. In this paper, we propose a method to increase active learning recall by constraining sampling to a document subset rich in relevant examples.

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

missed cluster effect
practical text classification


A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ either MS data or MS/MS data for database searching. While MS-based methods provide wider coverage than MS/MS-based methods, their identification accuracy is lower since MS data have less information than MS/MS data. Thus, it is desired to design more sophisticated algorithms that achieve higher identification accuracy using MS data. Peptide Mass Fingerprinting (PMF) has been widely used to identify single purified proteins from MS data for many years. In this paper, we extend this technology to protein mixture identification. First, we formulate the problem of protein mixture identification as a Partial Set Covering (PSC) problem. Then, we present several algorithms that can solve the PSC problem efficiently. Finally, we extend the partial set covering model to both MS/MS data and the combination of MS data and MS/MS data. The experimental results on simulated data and real data demonstrate the advantages of our method: 1) it outperforms previous MS-based approaches significantly; 2) it is useful in the MS/MS-based protein inference; and 3) it combines MS data and MS/MS data in a unified model such that the identification performance is further improved.

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

protein identification
peptide mass fingerprinting
mass spectrometry
set covering

proteomics
linear programming
optimization


online health communities Online health communities provide a means for patients and their families to learn about an illness, seek and offer support, and connect with others in similar circumstances. They are supported by a variety of technologies (e.g., email lists, forums, chat rooms) and are hosted by patients, advocacy groups, medical organizations, and corporations. They raise difficult design challenges because of the wide variability of members' medical expertise, the severity of problems due to misinformation, and the need for emotional support. The importance of on-line health communities is evidenced by their popularity, as well as the significant impact they have on the lives of their members. This Special Interest Group (SIG) will explore current trends in online health communities, as well as discuss the socio-technical design challenges and opportunities that they afford.

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

health care
e-learning
support groups
virtual communities
medicine
online communities
evaluation


Optimal Placement of Distributed Sensors Against Moving Targets This article addresses the problem of deploying a sparse network of sensors for surveillance of moving targets. The sensor networks of interest consist of sensors which perform independent binary detection on a target, and report detections to a central node for fusion. An optimization framework is developed for placement of sensors within a bounded search region, given sensor performance characteristics, prior information on anticipated target characteristics, and a distributed detection criteria. Individual sensor performance is represented parametrically as are priors on target dynamics. Several numerical examples are included that illustrate the utility of the optimization approach.

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

performance
sensor networks
optimization


Approximation algorithms for multi-agent scheduling to minimize total weighted completion time We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total weighted completion time of his own set of jobs. It is known that the unweighted problem with two agents is NP-hard in the ordinary sense. For this case, we can reduce our problem to a Multi-Objective Shortest-Path (MOSP) problem and this reduction leads to several results including Fully Polynomial Time Approximation Schemes (FPTAS). We also provide an efficient approximation algorithm with a reasonably good worst-case ratio. (C) 2009 Elsevier B.V. All rights reserved.

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

total weighted completion time
approximation algorithm
fptas

multi-agent scheduling
multi-objective shortest-path problem


Adaptive fuzzy modeling versus artificial neural networks In this paper two areas of soft computing (fuzzy modeling and artificial neural networks) are discussed. Based on the fundamental mathematical similarity of fuzzy techniques and radial basis function networks a new training algorithm for fuzzy models is introduced. A feed forward neural network (NN), a radial basis function network (RBF) and a trained fuzzy algorithm are compared for regional yield estimation of agricultural crops (winter rye, winter barley). As training pattern a data set from a training region (Maerkisch-Oderland district, Germany) and as test pattern a data set from a three times larger region were used. Specific advantages and disadvantages of these methods for the estimation of yield were discussed.

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

fuzzy modeling
radial basis function network
training algorithm
yield estimation
agricultural crops

artificial neural network
feed forward network


Automatic realignment with electronic steering of free-space-optical transceivers in MANETs: A proof-of-concept prototype Free-Space-Optical (FSO) communication has the potential to achieve very high wireless communication rates at tens of GHz. Although it has the advantage of high-speed optical modulation, FSO communication is prone to mobility and it requires establishment and maintenance of line-of-sight (LOS) between FSO transceivers since FSO transceivers are highly directional. We consider FSO structures with multiple transceivers placed on a spherical shape with angular diversity and tackle the problem of automatically detecting and maintaining LOS alignment among neighbor multi-transceiver FSO structures. We present a prototype implementation of such multi-transceiver electronically-steered communication structures. Our prototype uses a simple LOS detection and establishment protocol and assigns logical data streams to appropriate physical links. We show that by using multiple directional transceivers and an auto-alignment mechanism, it is possible to maintain optical wireless links in a mobile setting with minimal disruptions and overhead.

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

free-space-optics
mobile ad hoc networks
spatial reuse
directional communication
spherical fso structures


Light transport in biological tissue based on the simplified spherical harmonics equations In this work, we demonstrate the validity of the simplified spherical harmonics equations to approximate the more complicated equation of radiative transfer for modeling light propagation in biological tissue. We derive the simplified spherical harmonics equations up to order N=7 for anisotropic scattering and partially reflective boundary conditions. We compare numerical results with diffusion and discrete ordinates transport solutions. We find that the simplified spherical harmonics methods significantly improve the diffusion solution in transport-like domains with high absorption and small geometries, and are computationally less expensive than the discrete ordinates transport method. For example, the simplified P3 method is approximately two orders of magnitude faster than the discrete ordinates transport method, but only 2.5 times computationally more demanding than the diffusion method. We conclude that the simplified spherical harmonics methods can accurately model light propagation in small tissue geometries at visible and near-infrared wavelengths, yielding transport-like solutions with only a fraction of the computational cost of the transport calculation.

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

radiative transfer
light propagation
spherical harmonics

tissue optics
scattering media
molecular imaging
discrete ordinates method
diffusion equation


The role of moderating factors in user technology acceptance Along with increasing investments in new technologies, user technology acceptance becomes a frequently studied topic in the information systems discipline. The last two decades have seen user acceptance models being proposed, tested, refined, extended and unified. These models have contributed to our understanding of user technology acceptance factors and their relationships. Yet they have also presented two limitations: the relatively low explanatory power and inconsistent influences of the factors across studies. Several researchers have recently started to examine the potential moderating effects that may overcome these limitations. However, studies in this direction are far from being conclusive. This study attempts to provide a systematic analysis of the explanatory and situational limitations of existing technology acceptance studies. Ten moderating factors are identified and categorized into three groups: organizational factors, technological factors and individual factors. An integrative model is subsequently established, followed by corresponding propositions pertaining to the moderating factors.

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

user technology acceptance
moderating factors


PAPR and ICI Reduction of OFDM Signals Using New Weighting Factors from Riemann Matrix Orthogonal frequency division multiplexing (OFDM) systems are significantly affected by peak-to-average-power ratio (PAPR). One of the straightforward methods to solve this problem is to use selected mapping (SLM) algorithm. The main idea of SLM scheme is to select the phase factors that minimize the PAPR and transmit these factors as side information (SI). In this paper, a new phase factors based on the diagonal elements of Riemann matrix is proposed. The results indicates that the introduced scheme has better PAPR reduction and power spectral density (PSD) performance compared to several SLM-based methods. Further, it does not need SI transmission. Also bit error rate (BER) of the proposed phase factor does not degrade with respect to conventional SLM.

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

orthogonal frequency division multiplexing (ofdm)


Refactoring the aspectizable interfaces: An empirical assessment Aspect Oriented Programming aims at addressing the problem of the crosscutting concerns, i.e., those functionalities that are scattered among several modules in a given system. Aspects can be defined to modularize such concerns. In this work, we focus on a specific kind of crosscutting concerns, the scattered implementation of methods declared by interfaces that do not belong to the principal decomposition. We call such interfaces aspectizable. All the aspectizable interfaces identified within a large number of classes from the Java Standard Library and from three Java applications have been automatically migrated to aspects. To assess the effects of the migration on the internal and external quality attributes of these systems, we collected a set of metrics and we conducted an empirical study, in which some maintenance tasks were executed on the two alternative versions ( with and without aspects) of the same system. In this paper, we report the results of such a comparison.

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

program transformations
empirical studies


A key distribution scheme using network coding for mobile ad hoc network Network coding offers an excellent solution for maximizing throughput in various networks. Because of its simplicity and high efficiency, the idea of network coding can also be used for designing lightweight key distribution schemes for wireless ad hoc network. This paper presents a key distribution scheme that exploits the inherent security properties of network coding. The new scheme relies on simple XOR network coding operations to provide data confidentiality and uses message authentication codes to guarantee the integrity of the distributed keys. We also show that our scheme can resist a series of attacks in wireless ad hoc network and has better performance compared with previous schemes proposed in the literature. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

network coding
key distribution scheme
wireless ad hoc network


The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions We prove asymptotically optimal bounds on the Gaussian noise sensitivity and Gaussian surface area of degree-d polynomial threshold functions. In particular, we show that for f a degree-d polynomial threshold function that the Gaussian noise sensitivity of f with parameter epsilon is at most d arcsin (root 2 epsilon-epsilon(2))/pi)/pi. This bound translates into an optimal bound on the Gaussian surface area of such functions, namely that the Gaussian surface area is at most d/root 2 pi. Finally, we note that the later result implies bounds on the runtime of agnostic learning algorithms for polynomial threshold functions.

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

gaussian noise
polynomial threshold functions


Imbalanced classification using support vector machine ensemble Imbalanced data sets often have detrimental effects on the performance of a conventional support vector machine (SVM). To solve this problem, we adopt both strategies of modifying the data distribution and adjusting the classifier. Both minority and majority classes are resampled to increase the generalization ability. For minority class, an one-class support vector machine model combined with synthetic minority oversampling technique is used to oversample the support vector instances. For majority class, we propose a new method to decompose the majority class into clusters and remove two clusters using a distance measure to lessen the effect of outliers. The remaining clusters are used to build an SVM ensemble with the oversampled minority patterns, the SVM ensemble can achieve better performance by considering potentially suboptimal solutions. Experimental results on benchmark data sets are provided to illustrate the effectiveness of the proposed method.

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

support vector machines
resample
smote
ensemble learning


a procedure of adaptive kernel combination with kernel-target alignment for object classification In order to achieve good performance in object classification problems, it is necessary to combine information from various image features. Because the large margin classifiers are constructed based on similarity measures between samples called kernels, finding appropriate feature combinations boils down to designing good kernels among a set of candidates, for example, positive mixtures of predetermined base kernels. There are a couple of ways to determine the mixing weights of multiple kernels: (a) uniform weights, (b) a brute force search over a validation set and (c) multiple kernel learning (MKL). MKL is theoretically and technically very attractive, because it learns the kernel weights and the classifier simultaneously based on the margin criterion. However, we often observe that the support vector machine (SVM) with the average kernel works at least as good as MKL. In this paper, we propose as an alternative, a two-step approach: at first, the kernel weights are determined by optimizing the kernel-target alignment score and then the combined kernel is used by the standard SVM with a single kernel. The experimental results with the VOC 2008 data set [8] show that our simple procedure outperforms the average kernel and MKL.

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

multiple kernel learning
object classification


A Superscalar software architecture model for Multi-Core Processors (MCPs) Design of high-performance servers has become a research thrust to meet the increasing demand of network-based applications. One approach to design such architectures is to exploit the enormous computing power of Multi-Core Processors (MCPs) that are envisioned to become the state-of-the-art in processor architecture. In this paper, we propose a new software architecture model. called SuperScalar, suitable for MCP machines. The proposed SuperScalar model consists of multiple pipelined thread pools, where each pipelined thread pool consists of multiple threads, and each thread takes a different role. The main advantages of the proposed model are global information sharing by the threads and minimal memory requirement due to fewer threads. We have conducted in-depth performance analyses of the proposed scheme along with three prior software architecture schemes (Multi-Process (MP), Multi-Thread (MT) and Event-Driven (ED)) via an analytical model. The performance results indicate that the proposed SuperScalar model shows the best performance across all system and workload parameters compared to the MP, MT and ED models. Although the MT model shows competitive performance with less number of processing cores and smaller data cache size, the advantage of the SuperScalar model becomes obvious as the number of processing cores increases. (C) 2010 Elsevier Inc. All rights reserved.

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


An efficient exploration of multimedia architecture using weighted parameter dependency and sampled-data simulation This paper proposes a system-level design methodology for efficient exploration of parameterized multimedia architecture. The purpose is to find a near-optimal configuration, as far as possible, without performing exhaustive analysis of the design space. This is done through synergistic integration of two independent methodologies, first of which is the multi-stage dynamic optimization based on parameters clustering and sparsing, while the second one being a quick performance estimation through sampled-data simulation of target multimedia application. The experimental results with mediabench show speedup ranging from 186.4 to 339.8, while the corresponding error-to-global optimum ranges from 14.8% to 16.4%.

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

design space exploration
sampled-data simulation


A task migration algorithm for heterogeneous distributed computing systems Most load balancing schemes are based on the assumption that all processors in a distributed computing system (DCS) have similar processing power and workload. However, as technology continues to advance, networks have become more likely to contain processors of different capabilities and configurations. The proposed load balancing method is based on the coterie, a tool first used in mutual exclusion and vote assignment. This paper describes how the unique properties of coteries allow the underlying protocol to be tailored to the capabilities of the individual nodes in a connected network. In general, each processor communicates with only a subset of the other processors in the network, keeping message traffic relatively low. The coterie allows these subsets to be constructed according to a more thoughtful method one that is designed to better meet the needs of networks of varying characteristics. It is also shown that the proposed method will always perform task migration whenever possible i.e., if at least one lightly loaded processor and at least one heavily loaded processor exist in the network, task migration will occur. Further, an extension of our algorithm to provide fault tolerance is given: when a processor fails, the network can continue to function with a modified system configuration.

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

coterie
load balancing
fault tolerance
distributed computing systems


Doping effects of Co2+ ions on structural and magnetic properties of ZnO nanoparticles In this paper, we report the synthesis of Zn1?xCoxO (0.0?x?0.10) nanoparticles by an auto-combustion method using glycine as a fuel. The prepared nanoparticles were characterized by using X-ray diffraction (XRD), field emission scanning electron microscopy (FESEM), Fourier transform infrared spectroscopy (FTIR), Raman spectroscopy and DC magnetization measurements. XRD results showed that Co doped ZnO have a single phase nature with wurtzite structure and Co2+ ions were successfully incorporated into the lattice position of Zn2+ ions in ZnO matrix. FTIR spectra demonstrated that the values of absorption bands were blue shifted with the increase of Co content. From the Raman spectra, all the peaks observed in undoped and Co-doped samples can be assigned to the Raman active modes of ZnO crystal. However, in case of Co doped ZnO sample, additional modes were observed that can be related to the substitution of Co into the Zn site. Magnetic studies showed that Co doped ZnO nanoparticles exhibit room temperature ferromagnetism.

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

diluted magnetic semiconductor
x-ray diffraction


Metatile-based scalable caching and dynamic replacing algorithms for multiple videos over quality-of-service networks This paper presents metafile-based scalable caching and dynamic replacing algorithms for multiple videos over quality-of-service networks. A metafile for each video includes the cached-frame sequence, which is made by scalable caching algorithm minimizing client's buffer size and channel bandwidth under the general video traffic condition. Based on the metafiles, we propose a caching algorithm for multiple videos to effectively reduce both the buffer size and the required bandwidth and replacing algorithm to dynamically update the cached frames when user access pattern changes. Finally, experimental results are provided to compare the proposed algorithms with various existing caching and replacing algorithms.

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

buffer size
channel bandwidth
metafile
scalable caching algorithm

dynamic replacing algorithm
proxy server


Canonical duality theory: Unified understanding and generalized solution for global optimization problems Canonical duality theory is a potentially powerful methodology, which can be used to model complex systems with a unified solution to a wide class of discrete and continuous problems in global optimization and nonconvex analysis. This paper presents a brief review and recent developments of this theory with applications to some well-know problems, including polynomial minimization, mixed integer and fractional programming, nonconvex minimization with nonconvex quadratic constraints, etc. Results shown that under certain conditions, these difficult problems can be solved by deterministic methods within polynomial times, and NP-hard discrete optimization problems can be transformed to certain minimal stationary problems in continuous space Concluding remarks and open problems are presented in the end. (C) 2009 Elsevier Ltd. All rights reserved.

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

global optimization
duality theory
fractional programming

np-hard problems
mixed integer programming