JAID: An algorithm for data fusion and jamming avoidance on distributed sensor networks Mobile Agent (MA) technology has been recently proposed in Wireless Sensor Networks (WSNs) literature to answer the scalability problem of client/server model in data fusion applications. In this paper, we describe the critical role MAs can play in the field of security and robustness of a WSN in addition to data fusion. The design objective of our Jamming Avoidance Itinerary Design (JAID) algorithm is twofold: (a) to calculate near-optimal routes for MAs that incrementally fuse the data as they visit the nodes; (b) in the face of jamming attacks against the WSN, to modify the itineraries of the MAs to bypass the jammed area(s) while not disrupting the efficient data dissemination from working sensors. If the number of jammed nodes is small, JAID only modifies the pre-jamming scheduled itineraries to increase the algorithms promptness. Otherwise, JAID re-constructs the agent itineraries excluding the jammed area(s). Another important feature of JAID is the suppression of data taken from sensors when the associated successive readings do not vary significantly. Data suppression also occurs when sensors readings are identical to those of their neighboring sensors. Simulation results confirm that JAID enables retrieval of information from the working sensors of partially jammed WSNs and verifies its performance gain over alternative approaches in data fusion tasks.

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

wireless sensor networks
jamming avoidance
data fusion
itineraries


Fault detection using genetic programming Genetic programming (GP) is a stochastic process for automatically generating computer programs. GP has been applied to a variety of problems which are too wide to reasonably enumerate. As far as the authors are aware, it has rarely been used in condition monitoring (CM). In this paper, GP is used to detect faults in rotating machinery. Featuresets from two different machines are used to examine the performance of two-class normal/fault recognition. The results are compared with a few other methods for fault detection: Artificial neural networks (ANNs) have been used in this field for many years, while support vector machines (SVMs) also offer successful solutions. For ANNs and SVMs, genetic algorithms have been used to do feature selection, which is an inherent function of GP. In all cases, the GP demonstrates performance which equals or betters that of the previous best performing approaches on these data sets. The training times are also found to be considerably shorter than the other approaches, whilst the generated classification rules are easy to understand and independently validate.

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

genetic programming
feature selection
condition monitoring
fault detection


On the number of realizations of certain Henneberg graphs arising in protein conformation ? Several application fields require finding Euclidean coordinates consistent with a set of distances. More precisely, given a simple undirected edge-weighted graph, we wish to find a realization in a Euclidean space so that adjacent vertices are placed at a distance which is equal to the corresponding edge weight. Realizations of a graph can be either flexible or rigid. In certain cases, rigidity can be seen as a property of the graph rather than the realization. In the last decade, several advances have been made in graph rigidity, but most of these, for applicative reasons, focus on graphs having a unique realization. In this paper we consider a particular type of weighted Henneberg graphs that model protein backbones and show that almost all of them give rise to sets of incongruent realizations whose cardinality is a power of two.

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

distance geometry
branch-and-prune
partial reflection


A time dependent constitutive model for soils with isotach viscosity This paper presents a three-dimensional elastic viscoplastic constitutive model that is able to reproduce the time dependent behaviour of soils with isotach viscosity. This constitutive law is based on the overstress theory and incorporates some important features, namely: (i) a non-linear creep law with a limit for the amount of creep deformation under isotropic stress conditions; (ii) a flexible loading surface that is capable of reproducing a wide range of shapes in p??J stress space and incorporates the MatsuokaNakai failure criterion in the deviatoric stress space and (iii) assumes that the viscoplastic scalar multiplier is constant on a given loading surface to ensure that critical state conditions are reached. A full description of the model, its governing equations and implementation in a finite element program are presented. The model is then used to simulate the results of laboratory tests, highlighting the models abilities and shortcomings in reproducing the time dependent behaviour of soft clays. Furthermore, the paper investigates the importance of accounting for creep non-linearity and the consequences of isotach viscosity on the critical state line.

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

constitutive relations
viscoplasticity
time dependence


Reinforcement Learning of Optimal Supervisor for Discrete Event Systems with Different Preferences In this paper, we propose an optimal supervisory control method for discrete event systems (DESs) that have different preferences. In our previous work, we proposed an optimal supervisory control method based on reinforcement learning. In this paper, we extend it and consider a system that consists of several local systems. This system is modeled by a decentralized DES (DDES) that consists of local DESs, and is supervised by a central supervisor. In addition, we consider that the supervisor and each local DES have their own preferences. Each preference is represented by a preference function. We introduce the new value function based on the preference functions. Then, we propose the learning method of the optimal supervisor based on reinforcement learning for the DDESs. The supervisor learns how to assign the control pattern so as to maximize the value function for the DDES. The proposed method shows the general framework of optimal supervisory control for the DDES that consists of several local systems with different preferences. We show the efficiency of the proposed method through a computer simulation.

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

discrete event systems
supervisory control
reinforcement learning


Characterizing pairwise contact patterns in human contact networks We use a counting process representation of the pairwise contact process to analyze pairwise contact patterns. Studying two real-world traces, we find that the pairwise contact patterns have three characteristics. First, human contact patterns are influenced by daily and weekly cycles of activity. Second short time intervals with intensive contact event (bursts) are separated by long periods with few contact events. Third, the pairwise contact process exhibits long range dependence. We introduce a Markov modulated Poisson process (MMPP) as a flexible model for pairwise contact process exhibiting both regular structure and irregular bursts of activity. Using standard statistical techniques, we demonstrate that the proposed model is consistent with the empirical data. Our work has significant implication for mobility modeling and performance analysis in human contact networks.

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

human contact networks
pairwise contact process
markov modulated poisson process


Lumped parameter models representing impedance functions at the end of a finite beam on a viscoelastic medium This study presents a lumped parameter model that represents impedance functions at the end of a finite flexural beam on a viscoelastic medium. This model comprises units arranged in series, each of which consists of a spring, a dashpot, and a so-called gyro-mass element. A formula is presented for determining the properties of the elements in the units. The impedance function simulated by the proposed model shows good agreement with the rigorous impedance function. A significant reduction in the degrees of freedom is a major advantage of this model for solving recent vibration problems.

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

impedance functions
lumped parameter models

elastic beam
dynamic response
viscoelastic media


Optical remote sensing and the retrieval of terrestrial vegetation bio-geophysical properties A review Forthcoming superspectral satellite missions dedicated to land monitoring, as well as planned imaging spectrometers, will unleash an unprecedented data stream. The processing requirements for such large data streams involve processing techniques enabling the spatio-temporally explicit quantification of vegetation properties. Typically retrieval must be accurate, robust and fast. Hence, there is a strict requirement to identify next-generation bio-geophysical variable retrieval algorithms which can be molded into an operational processing chain. This paper offers a review of state-of-the-art retrieval methods for quantitative terrestrial bio-geophysical variable extraction using optical remote sensing imagery. We can categorize these methods into (1) parametric regression, (2) non-parametric regression, (3) physically-based and (4) hybrid methods. Hybrid methods combine generic capabilities of physically-based methods with flexible and computationally efficient methods, typically non-parametric regression methods. A review of the theoretical basis of all these methods is given first and followed by published applications. This paper focusses on: (1) retrievability of bio-geophysical variables, (2) ability to generate multiple outputs, (3) possibilities for model transparency description, (4) mapping speed, and (5) possibilities for uncertainty retrieval. Finally, the prospects of implementing these methods into future processing chains for operational retrieval of vegetation properties are presented and discussed.

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

bio-geophysical variables
non-parametric
physical
machine learning
operational variable retrieval


Study and analysis of system LSI design methodologies using C-based behavioral synthesis This paper describes the effects of system LSI design with C language-based behavioral synthesis following several trials of design period reduction and quality improvement for a variety of circuit types. The results of these trials are analyzed from the viewpoints of description productivity, verification productivity, reusability and design flexibility as well as hardware and software co-verification. First the C-based design flow proposed by the authors is described, and the design productivity and verification productivity under this design flow is compared to RTL design. The reusability of the behavioral IP core and its efficiency with HW/SW co-verification are also shown using design examples. Next, using the example of an MPEG-4 video decoder design, a typical design process in a C-based design is shown with considerations regarding verification efficiency, reusability of the IP core and HW/SW co-verification. Finally, the authors' perspectives regarding future directions of system LSI design are discussed.

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

behavioral synthesis
verification
design productivity


Numerical investigation of a laminar pulsating flow in a rectangular duct A pulsating laminar flow of a viscous, incompressible liquid in a rectangular duct has been studied. The motion is induced under an imposed pulsating pressure difference. The problem is solved numerically. Different flow regimes are characterized by a non-dimensional parameter based on the frequency (omega) of the imposed pressure gradient oscillations and the width of the duct (h). This, in fact, is the Reynolds number of the problem at hand. The induced velocity has a phase lag (shift) with respect to the imposed pressure oscillations, which varies from zero at very slow oscillations, to 90 degrees at fast oscillations. The influence of the aspect ratio of the rectangular duct and the pulsating pressure gradient frequency on the phase lag, the amplitude of the induced oscillating velocity, and the wall shear were analyzed. Copyright (C) 1999 John Wiley & Sons, Ltd.

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


On the complexity of monotone dualization and generating minimal hypergraph transversals ? In 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair of monotone Boolean functions, in disjunctive normal forms, can be tested in quasi-polynomial time, thus putting the problem, most likely, somewhere between polynomiality and coNP-completeness. We strengthen this result by showing that the duality testing problem can in fact be solved in polylogarithmic time using a quasi-polynomial number of processors (in the PRAM model). While our decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, it yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and also allows for generating all minimal transversals of a given hypergraph using only polynomial space.

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

dualization
hypergraph transversals
monotone boolean functions
polynomial space


Identifying modules via concept analysis We describe a general technique for identifying modules in legacy code. The method is based on concept analysis-a branch of lattice theory that can be used to identify similarities among a set of objects based on their attributes. We discuss how concept analysis can identify potential modules using both "positive" and "negative" information. We present an algorithmic framework to construct a lattice of concepts from a program, where each concept represents a potential module. We define the notion of a concept partition, present an algorithm for discovering all concept partitions of a given concept lattice. and prove the algorithm correct.

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

modularization
software migration
software restructuring
reverse engineering
design recovery


A synthesis methodology for hybrid custom instruction and coprocessor generation for extensible processors Systems-on-chip often use hardware accelerators or coprocessors to provide efficient implementations of application-specific functions. The recent emergence of extensible processor cores with supporting design tools has given designers with another viable alternative, namely, the use of application-specific custom instructions. Coprocessors and custom instructions can be viewed as two different forms of hardware acceleration that are applicable at different levels of granularity and offer differing tradeoffs. Classical hardware/software-partitioning techniques and application-specific instruction-set design tools address the individual problems of coprocessor generation and custom-instruction addition. However, given a complex applications it is not clear which design choice (coprocessors or custom instructions or a combination) will result in better performance, area, or power consumption. We demonstrate that a combination of custom instructions and coprocessors is often the best solution in many applications, making the case for a hybrid custom-instruction and coprocessor-synthesis methodology. We propose such a methodology that builds upon the basic observations that coprocessors are usually good for coarse-grained tasks and require minimal intervention or support from the processor, while custom instructions are usually suited to fine-grained operations that are best integrated into a processor pipeline. Our methodology uses a hierarchical task-graph representation in order to support both coarse- and fine-grained views of an application, which are necessary to make meaningful tradeoffs. We propose a hierarchical synthesis algorithm that incorporates multiobjective evolutionary optimization in order to handle different design dimensions, such as area and performance, and provide a wide range of nondominated solutions. We have implemented the proposed methodology in the context of a commercial extensible processor-based platform (Xtensa from Tensilica). Our design flow uses a commercial behavioral-synthesis tool and an existing automatic-custominstruction-generation tool. Our experiments with several applications show that simultaneous custom-instruction and coprocessor synthesis can achieve significantly better area/performance tradeoffs than using only one of them.

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

index terms-application-specific instruction set processor


Forty years of Hutton fuzzy unit interval ? This note is a very short history of a specific fuzzy topological space the Hutton's fuzzy unit interval [0,1](L) [ 0 , 1 ] ( L ) which occupies one of the central positions in fuzzy topology. On that occasion the superiority of L -valued topology over [0,1] [ 0 , 1 ] -valued topology is being discussed. We then show how the Hutton's concept evolved. After obvious identifications we can today say that [0,1](L) [ 0 , 1 ] ( L ) is the tensor product [0,1]?L [ 0 , 1 ] ? L of the lattices [0,1] [ 0 , 1 ] and L. An account of the consequences of this new view point is hoped to appear thereafter.

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

l-fuzzy unit interval
l-fuzzy topology
tensor product of complete lattices


Advances and innovations in the field of auscultation, with a special focus on the development of new intelligent communicating stethoscope systems Conventional auscultation is subjective and not easily shared. Modern medical technology allows us to optimize ausculatory findings by physically characterizing sounds through recordings, visualization and automated analysis systems. The development and availability of novel tools based on innovations in Science, Information and Communications Technology provide the clinician with an invaluable aid in order to achieve an early objective diagnosis, as well as offering increased sensitivity and reproducibility of auscultatory findings. Such advances have not only led to the development and use of new intelligent communicating stethoscope systems, but they have also significantly contributed to the revival of telemedicine, particularly as a diagnostic and teaching aid.

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

auscultation stethoscope diagnosis teaching telemedicine


Efficient model-based leak detection in boiler steam-water systems A model-based least-squares algorithm with a time-varying forgetting factor is developed for leak detection in boiler steam-water systems. The algorithm has been tested using real industrial data from Syncrude Canada, and has proven to be effective in detection of boiler tube or steam leaks; proper implementation of the algorithm would lead to early leak warning, which is important in maintaining safe operation of the plant. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

boiler systems
fault diagnosis
process monitoring


Measuring the use of public research in firm R&D in the Hsinchu Science Park Knowledge flow between public and private sectors is widely recognized as a way to stimulate innovation and regional development, particularly in science parks. This work employs a bibliometric approach, based on patent citation, non-patent citation, and publicprivate co-authorship of scientific publications to measure the use of public research in Hsinchu Science Park (HSP) in Taiwan. The result shows that the number of jointly published papers has increased constantly, implying the collaboration between HSP and universities has become more common. However, from the aspect of co-patenting, patent citation, and non-patent reference, technological innovation stemming from public research needs to be enhanced.

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

publicprivate co-authored publication
co-authorship
non-patent citation


Genetic structure, consanguineous marriages and economic development: Panel cointegration and panel cointegration neural network analyses Consanguineous marriages and their effects on human beings in light of biological effects of genetic sicknesses are discussed in many studies. Among many, the likelihood of sicknesses such as phenylketonuria, thalassemia, Landsteiner-Fanconi-Anderson's syndrome, hemophilia and many neuro system anomalies increase drastically in countries with consanguineous marriage practices resulting in increasing economic costs. In the study, we aimed to analyze the effects of consanguineous marriage and its effect on economic growth and development. We also analyzed infant mortality in these countries in light of consanguineous marriages and economic development. In the study, Panel Cointegration specifications are integrated into Neural Network models known with their strong generalization properties. The study focuses the econometric analyses, where the Panel Cointegration Neural Network Model is investigated and compared to the Panel Cointegration Model. According to MSE, MAE and RMSE error criteria and Die-bold Mariano tests of equal forecast accuracy, the results suggest strong advantages of Panel Cointegration MLP models compared to Panel Cointegration models used in regression analysis. (C) 2010 Elsevier Ltd. All rights reserved.

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

human genetics
cansanguine marriage
panel data analysis
panel neural network analysis
panel cointegration mlp model


Image-based quality monitoring system of limestone ore grades In this study, an image analysis-based ore quality monitoring system was developed. The study was conducted at a limestone mine located in India. The samples were collected based on a stratified random sampling method, and images of these samples were taken in a simulated environment in a laboratory. The image preprocessing and segmentation were performed using different segmentation methods to extract morphological, colour and textural features. A total of 189 features was extracted during this study. Principal components analysis was conducted to reduce the feature vector for modeling purposes. Five principal components, which were extracted from the feature vectors, captured 95% of the total feature variance. A neural network model was used as a mapping function for ore grade prediction. The five principal components were used as input, and four grade attributes of limestone (CaO, Al(2)O(3), Fe(2)O(3) and SiO(2)) were used as output. The developed model was then used for day to day quality monitoring at 3 different face locations of the mine. Results revealed that this technique can be successfully used for ore grade monitoring at the mine level in a controlled environment. (C) 2009 Elsevier B.V. All rights reserved.

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

image analysis
principal component analysis
off-line monitoring


Recommenders in a personalized, collaborative digital library environment We envisage an information source not only as an information resource where users may submit queries to satisfy their daily information need, but also as a collaborative working and meeting space of people sharing common interests. Indeed, we will present a highly personalized environment where not only users may organize (and search into) the information space according to their individual taste and use, but which provides advanced features of collaborative work among the users. It is up to the system to discover interesting properties about the users' interests, relationships between users and user communities and to make recommendations based on preference patterns of the users, which is the main topic of this paper.

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

digital library
recommenders
collaborative work


further thoughts on backtracking and bounding This report contains furthers analysis finding more accurate boundaries (pruning) to get a better performance for a specific backtracking algorithm based on the pattern problem. The problem statement is modest-sized to understand the combining criteria implemented reducing substantially the amount of time invested processing, and grows exponentially to the size of the problem making it expensive without applying any constraint.

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


A factor analytic approach to inferring congestion sharing based on flow level measurements Internet traffic primarily consists of packets from elastic flows, i.e., Web transfers, file transfers,. and e-mail, whose transmissions are mediated via the Transmission Control Protocol (TCP). In this paper, we develop a methodology to process TCP flow measurements in order to analyze throughput correlations among TCP flow classes that can be used to infer congestion sharing in the Internet. The primary contributions of this paper are: 1) development of a technique for processing flow records suitable for inferring congested resource sharing; 2) evaluation of the use of factor analysis on processed flow records to explore which TCP flow classes might share congested resources; and 3). validation of our inference methodology using bootstrap methods and nonintrusive, flow level measurements collected at a single network site. Our proposal for using flow level measurements to infer congestion sharing differs significantly from previous research that has employed packet level measurements for making inferences. Possible applications of our method include network monitoring and root cause analysis of poor performance.

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

inference of congestion sharing
network measurement


A survey on Advanced Metering Infrastructure Advances in Metering Infrastructure in Smart Grid. Comprehensive survey on control actions for load demand. Distributed Energy Resources and improvement of delivered power quality.

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

cosem companion specification for energy metering

dlms device language message specification

isms information security management system


A framework of discrete DC programming by discrete convex analysis A theoretical framework of difference of discrete convex functions (discrete DC functions) and optimization problems for discrete DC functions is established. Standard results in continuous DC theory are exported to the discrete DC theory with the use of discrete convex analysis. A discrete DC algorithm, which is a discrete analogue of the continuous DC algorithm (ConcaveConvex procedure in machine learning) is proposed. The algorithm contains the submodular-supermodular procedure as a special case. Exploiting the polyhedral structure of discrete convex functions, the algorithms tailored to specific types of discrete DC functions are proposed.

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


an empirical study of regression test application frequency Regression testing is an expensive maintenance process used to revalidate modified software. Regression test selection (RTS) techniques try to lower the cost of regression testing by selecting and running a subset of the existing test cases. Many such techniques have been proposed and initial studies show that they can produce savings. We believe, however, that issues such as the frequency with which testing is done have a strong effect on the behavior of these techniques. Therefore, we conducted an experiment to assess the effects of test application frequency on the costs and benefits of regression test selection techniques. Our results expose essential tradeoffs that should be considered when using these techniques over a series of software releases.

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

regression testing
software
test
maintenance
behavior
empirical study
process
effect
cost

select
applications
applicaton frequency
experience


JETS: Language and System Support for Many-Parallel-Task Workflows Many-task computing is a well-established paradigm for implementing loosely coupled applications (tasks) on large-scale computing systems. However, few of the model's existing implementations provide efficient, low-latency support for executing tasks that are tightly coupled multiprocessing applications. Thus, a vast array of parallel applications cannot readily be used effectively within many-task workloads. In this work, we present JETS, a middleware component that provides high performance support for many-parallel-task computing (MPTC). JETS is based on a highly concurrent approach to parallel task dispatch and on new capabilities now available in the MPICH2 MPI implementation and the ZeptoOS Linux operating system. JETS represents an advance over the few known examples of multilevel many-parallel-task scheduling systems: it more efficiently schedules and launches many short-duration parallel application invocations; it overcomes the challenges of coupling the user processes of each multiprocessing application invocation via the messaging fabric; and it concurrently manages many application executions in various stages. We report here on the JETS architecture and its performance on both synthetic benchmarks and an MPTC application in molecular dynamics.

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


Investigating users perspectives on e-learning: An integration of TAM and IS success model This study investigates an integrated model of TAM and IS success model. E-learning satisfaction and usage intention both are explained with four variables. Intention and satisfaction both predict the actual use of e-learning. System quality and information quality are found to be the most important drivers. Perceived usefulness mediates the relationship between ease of use and intention.

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


Efficient greedy feature selection for unsupervised learning Reducing the dimensionality of the data has been a challenging task in data mining and machine learning applications. In these applications, the existence of irrelevant and redundant features negatively affects the efficiency and effectiveness of different learning algorithms. Feature selection is one of the dimension reduction techniques, which has been used to allow a better understanding of data and improve the performance of other learning tasks. Although the selection of relevant features has been extensively studied in supervised learning, feature selection in the absence of class labels is still a challenging task. This paper proposes a novel method for unsupervised feature selection, which efficiently selects features in a greedy manner. The paper first defines an effective criterion for unsupervised feature selection that measures the reconstruction error of the data matrix based on the selected subset of features. The paper then presents a novel algorithm for greedily minimizing the reconstruction error based on the features selected so far. The greedy algorithm is based on an efficient recursive formula for calculating the reconstruction error. Experiments on real data sets demonstrate the effectiveness of the proposed algorithm in comparison with the state-of-the-art methods for unsupervised feature selection.

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


quasi-static assignment of voltages and optional cycles for maximizing rewards in real-time systems with energy c-onstraints There exist real-time systems for which it is possible to trade off precision for timeliness. In these cases, a function assigns reward to the application depending on the amount of computation allotted to it. At the same time, many such applications run on battery-powered devices with stringent energy constraints. This paper addresses the problem of maximizing rewards subject to time and energy constraints. We propose a quasi-static approach where the problem is solved in two steps: first, at design-time, a number of solutions are computed and stored (off-line phase); second, one of the precomputed solutions is selected at run-time based on actual values of time and energy (on-line phase). Thus our approach is able to exploit, with low on-line overhead, the dynamic slack caused by tasks executing less number of cycles than in the worst case. We conduct numerous experiments in order to show the advantages of our 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


specifications for a design automation system This paper is a brief discussion of the preliminary specifications design automation system (DAS) for digital devices. The goal of the proposed system is to allow a systems designer to describe his initial requirements to evaluate and modify his design as it passes through the various stages automatic implementation. The development of this system is motivated by need for eneration of an extensive library of designs for use in the UCLA Variable Structure Computer System 1 and by the need for a framework in which optimization research studies may be carried out. It is hoped that this system may also provide information and tools for the many industrial organizations who cannot Justify investment in a design automation system. Design automation has been the subject of serious study both in universities and in industry for several years. 2-7 Several programs for writing logical equations, 8,9 optimizing boolean equations, 10,11 placing circuit modules, 12-14 routing wires, 15,16 simulation, 17-19 and documenting systems have been developed. The emphasis in this work has been for the most the individual design and programs.

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

requirements framework use simulation design paper automation writing research structure systems industrial implementation routing tools

developer computation libraries informal evaluation digitize place variability program organization optimality device module circuits


Modelling the urban water cycle Current urban water management practices aim to remove stormwater and wastewater efficiently from urban areas. An alternative approach is to consider stormwater and wastewater as a potential resource substitute for a portion of the water imported via the reticulated supply system. A holistic view of urban water resources provides the framework for the evaluation of the demand for water supply, the availability of stormwater and wastewater, and the interactions between them. The water balance model (Aquacycle) developed in this study represents water flows through the urban water supply, stormwater, and wastewater systems. Its daily time step provides temporal distribution of the flows, and enables comparison of the different components of the urban water demand. Aquacycle was tested using data from the Woden Valley urban catchment in Canberra, Australia and found able to satisfactorily replicate its water supply, stormwater and wastewater flows.

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


Apps at Hand: Personalized Live Homescreen Based on Mobile App Usage Prediction To facilitate the discovery of mobile apps in personal devices, we present the personalized live homescreen system. The system mines the usage patterns of mobile apps, generates personalized predictions, and then makes apps available at users' hands whenever they want them. Evaluations have verified the promising effectiveness of our system.

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

mobile app
usage prediction
personalized live homescreen

personalized pattern
mobile app discovery


Recursive QR packet combining for uplink single-carrier multi-user MIMO HARQ using near ML detection QR decomposition-based near maximum likelihood block detection significantly improves the transmission performance of uplink single-carrier (SC) multi-user multiple-input multiple-output (MU-MIMO). Hybrid automatic repeat request (HARQ) is an indispensable error control technique for high-quality packet data transmission. The achievable diversity gain of HARQ depends on the packet combining strategy. In uplink MU-MIMO HARQ, the received signal may consist of new packets and retransmitted packets as retransmission for each user acts independently. In this paper, a recursive QR packet combining scheme suitable for uplink SC MU-MIMO HARQ is proposed, which takes into account the number of retransmissions for each user in the detection order. The computational complexity and required storage size can be significantly reduced by the proposed scheme. Moreover, it improves the packet error rate performance and throughput performance significantly over the conventional bit-level log likelihood ratio packet combining, as shown by our computer simulation results. Copyright (C) 2012 John Wiley & Sons, Ltd.

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

single-carrier
mu-mimo
qr decomposition
m-algorithm


Transaction costs and information systems: does IT add up? Transaction cost theory has often been used to support the use of information and communication technology (ICT) to reduce imperfection in the economic system. Electronic markets and hierarchies have repeatedly been described as solutions to inefficiencies in the organisation of transactions in complex and uncertain settings. Far from criticising this assumption, this paper highlights the limits associated with this application of transaction cost theory that has been prevalent in IS research. Building on the concepts first proposed by Ciborra, the paper argues that information-related problems represent only some of the elements contributing to transaction costs. These costs also emerge due to the interdependencies among the various factors contributing to their growth. The study of the consequences associated with ICT design and implementation, grounded in transaction cost theory, should consider the overall implication associated with the adoption and use of ICT and not only the direct effect on problems associated with information flow, distribution, and management.

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

search costs
virtual organisations
intermediaries
exchanges


Atmospheric refraction effects in Earth remote sensing Just as refraction moves the apparent positions of stars from their true ones, it slightly distorts the view of Earth from space, as well as affecting the angle at which sunlight or moonlight illuminates its surface. The astronomer's problem is to correct the apparent position of a star for refraction, relating the position as observed from Earth to the true position. By contrast, the space observer's problem is to obtain the true (refracted) surface zenith angle z? of illumination or of viewing, when the zenith angle z0 of the ray in space is known, and to correct for the apparent horizontal displacement of the surface point being viewed. This paper solves the problem of the refraction angle for a spherical atmosphere by a simple, analytic solution, depending only on the surface index of refraction ?0 namely: sin(z0)=?0 sin(z?). The problem of the apparent horizontal displacement of the point viewed is also solved analytically, but approximately, because the result depends weakly on an assumed vertical structure of the atmosphere. The results are useful primarily in cases where observation must be done at large zenith angle, or low Sun angle.

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

spaceborne imagery
stmospheric refraction
brdf
satellite observations
earth limb observations
terminator observations


Stratified institutions and elementary homomorphisms For conventional logic institutions, when one extends the sentences to contain open sentences, their satisfaction is then parameterized. For instance, in the first-order logic, the satisfaction is parameterized by the valuation of unbound variables, while in modal logics it is further by possible worlds. This paper proposes a uniform treatment of such parameterization of the satisfaction relation within the abstract setting of logics as institutions, by defining the new notion of stratified institutions. In this new framework, the notion of elementary model homomorphisms is defined independently of an internal stratification or elementary diagrams. At this level of abstraction, a general Tarskii style study of connectives is developed. This is an abstract unified approach to the usual Boolean connectives, to quantifiers, and to modal connectives. A general theorem subsuming Tarski's elementary chain theorem is then proved for stratified institutions with this new notion of connectives. (c) 2007 Elsevier B.V. All rights reserved.

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

elementary colimit theorem
formal methods


Using ANNs to predict a subjects response based on EEG traces Numerous reports have shown that performing working-memory tasks causes an elevated rhythmic coupling in different areas of the brain; it has been suggested that this indicates information exchange. Since the information exchanged is encoded in brain waves and measurable by electroencephalography (EEG) it is reasonable to assume that it can be extracted with an appropriate method. In our study we made an attempt to extract the information using an artificial neural network (ANN), which can be considered as a stimulusresponse model with a state observer. The EEG was recorded from three subjects while they performed a modified Sternberg task that required them to respond to each task with the answer true or false. The study revealed that a stimulusresponse model can successfully be identified by observing phase-demodulated theta-band EEG signals 1s prior to a subjects answer. The results also showed that it was possible to predict the answers from the EEG signals with an average reliability of 75% for all the subjects. From this we concluded that it is possible to observe the system states and thus predict the correct answer using the EEG signals as inputs.

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

brain modelling
neural networks
signal processing
phase demodulation
prediction


Why does the standard GARCH(1,1) model work well? The AutoRegressive Conditional Heteroskedasticity (ARCH) and its generalized version (GARCH) family of models have grown to encompass a wide range of specifications, each of them is designed to enhance the ability of the model to capture the characteristics of stochastic data, such as financial time series. The existing literature provides little guidance on how to select optimal parameters, which are critical in efficiency of the model, among the infinite range of available parameters. We introduce a new criterion to find suitable parameters in GARCH models by using Markov length, which is the minimum time interval over which the data can be considered as constituting a Markov process. This criterion is applied to various time series and its results support the known idea that GARCH(1, 1) model works well.

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


An application of genetic algorithms to the robust estimation of soil organic and mineral fraction densities The development and use of a program that combines genetic algorithms and the least median of squares (LMS) method is reported. The combination of these two methods should provide a very robust approach for optimising non-linear functions. The program was specifically developed to estimate soil bulk density using a mass fraction model and was tested against a simulated dataset before being applied to the prediction of bulk density from a dataset created by combining measurements from a number of studies. The prediction of bulk density has a very important role in the calculation of soil elemental pools, and the predictive ability provided by the models described can be used to improve estimates of the key parameters such as soil carbon storage.

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


Stochastic analysis of OneMax problem using Markov chain Experimental and analytical investigations are performed for OneMax problem using WrightFisher model. This study investigates the distribution of the first order schema frequency in the evolution process of Genetic Algorithm (GA). Effects of mutation in GA are analyzed for the standard mutation and asymmetric mutation models. If a population is in linkage equilibrium, it can be shown that OneMax problem is equivalent to the asymmetric mutation model. Thus, we can apply theoretical results obtained in the asymmetric mutation model to OneMax problem and investigate the convergence time of GA calculation within the framework of WrightFisher model.

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

onemax problem
markov chain
asymmetric mutation
convergence time


Estimating extreme probabilities using tail simulated data The paper presents a powerful method for estimating extreme probabilities of a target variable Z = h(X) which is a monotone function of a set of basic variables X = (X-1,...,X-n). To this aim, a sample of (X-1,...,X-n) is simulated in such a way that the corresponding values of Z are in the corresponding tail, and used to fit a Pareto distribution to the associated exceedances. For cases where this method is difficult to apply, an alternative method is proposed, which leads to a low rejection proportion of sample values, when compared with the Monte Carlo method Both methods are shown to be very useful for sensitivity analysis in Bayesian networks or uncertainty in risk analysis, when very large confidence intervals for the marginal/conditional probabilities are required The methods are illustrated with several examples, and one example of application to a real case is used to illustrate the whole process. (C) 1997 Elsevier Science Inc.

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

generalized pareto distribution
simulation
stratified simulation
tails


Overcoming superstrictness in line drawing interpretation This paper presents a new algorithm for correcting incorrect line drawings-incorrect projections of a polyhedral scene. Such incorrect drawings arise, e.g., when an image of a polyhedral world is taken, the edges and vertices are extracted, and a drawing is synthesized. Along the way, the true positions of the vertices in the 2D projection are perturbed due to digitization errors and the preprocessing. As most available algorithms for interpreting line drawings are "superstrict," they judge these noisy inputs as incorrect and fail to reconstruct a three-dimensional scene from them. The presented method overcomes this problem by moving the positions of all vertices until a very close correct drawing is found. The closeness criterion is to minimize the sum of squared distances from each vertex in the input drawing to its corrected position. With this tool, any superstrict method for line drawing interpretation is now practical, as it can be applied to the corrected version of the input drawing.

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

line drawing interpretation
superstrictness

scene understanding
correction algorithms


distributed mst for constant diameter graphs This paper considers the problem of distributively constructing a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model, where each message can contain at most B bits for some parameter B . It is shown that the time required to compute an MST for graphs of diameter 4 or 3 can be as high as &OHgr;(3? n / B ) and &OHgr;(4? n /2? B ), respectively. The lower bound holds even if the algorithm is allowed to be randomized. On the other hand, it is shown that O (log n ) time units suffice to compute an MST deterministically for graphs with diameter 2, when B = O (log n ). These results complement a previously known lower bound of &OHgr;(2? n / B ) for graphs of diameter &OHgr;(log n ).

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

spanning tree
lower bound
algorithm
model
paper
distributed
log
message


Effect of stepped-impedance resonators on rectangular metamaterial unit cells In this article, effect of the stepped-impedance resonator (SIR) miniaturization technique on rectangular metamaterial unit cells is investigated and the influence of the method's structural parameters on the characteristic impedance and the distance between higher resonance modes is discussed. According to the results, the ideal unit cell for this method should be thick enough and have an impedance ratio greater than one. Furthermore, the SIR technique is applied on a conventional two-turn spiral metamaterial unit cell and a new compact spiral unit cell is introduced. The effect of this method on the unit cell parameters is investigated and the new unit cell is compared to the conventional spiral. According to the results, a miniaturization factor of 0.75 can be achieved with the new unit cell. To validate the results, a two dimensional array of the unit cell is fabricated and its S-parameters are measured using the free space method. 2015 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:582590, 2015.

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


A new iterative learning control scheme using the geometric rotation for discrete time systems This paper proposes a new iterative learning control scheme to efficiently construct the control law for discrete time systems. Different from the typical algorithms of iterative learning control in the construction of control law, the new iterative learning controller is presented by using the geometric vector rotation. New parameters with clear geometric meanings are employed here and the structure of the algorithm is more convenient for adjusting the controllers in engineering practice. Furthermore, a detailed convergence analysis of the algorithm is given, and it is theoretically proven that the proposed algorithm ensures that the resulting closed loop system is stable and the tracking error converges to zero exponentially. The result of the simulations given demonstrates the effectiveness of the new geometric algorithm.

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

iterative learning control
vector rotation


Light activation of the isomerization and deprotonation of the protonated Schiff base retinal We perform an ab initio analysis of the photoisomerization of the protonated Schiff base of retinal (PSB-retinal) from 11-cis to 11-trans rotating the C10-C11=C12-C13 dihedral angle from 0A degrees (cis) to -180A degrees (trans). We find that the retinal molecule shows the lowest rotational barrier (0.22 eV) when its charge state is zero as compared to the barrier for the protonated molecule which is similar to 0.89 eV. We conclude that rotation most likely takes place in the excited state of the deprotonated retinal. The addition of a proton creates a much larger barrier implying a switching behavior of retinal that might be useful for several applications in molecular electronics. All conformations of the retinal compound absorb in the green region with small shifts following the dihedral angle rotation; however, the Schiff base of retinal (SB-retinal) at trans-conformation absorbs in the violet region. The rotation of the dihedral angle around the C11=C12 pi-bond affects the absorption energy of the retinal and the binding energy of the SB-retinal with the proton at the N-Schiff; the binding energy is slightly lower at the trans-SB-retinal than at other conformations of the retinal.

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

deprotonation
isomerization
light activation
retinal
schiff base

dft
td-dft
excited state potential energy


Robust non-quadratic static output feedback controller design for Takagi-Sugeno systems using descriptor redundancy This work concerns robust static output feedback controller (SOFC) design for uncertain and disturbed Takagi-Sugeno (TS) systems using an H-infinity criterion. The main result is based on a descriptor formulation of the closed-loop dynamics. The proposed approach allows avoiding appearance of crossing terms between the controller's and the TS system's input matrices leading to easier LMI formulation than existing studies in the literature. Moreover, the proposed SOFC design conditions do not require any restrictions on the output equation and allow dealing with unmeasurable premise variables. Indeed, taking advantage of the uncertain TS modeling, nonlinearities associated to unmeasurable premises variables can be reported from the nominal part to the uncertainties. To provide LMIs of less conservatism, the results are conducted in the non-quadratic framework. Finally, two numerical examples and a benchmark of a crane system are proposed to illustrate the efficiency of the SOFC design methodology. (C) 2012 Elsevier Ltd. All rights reserved.

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

takagi-sugeno models
non-quadratic stabilization


Algebraiccoalgebraic recursion theory of history-dependent dynamical system models We investigate the common recursive structure of history-dependent dynamic models in science and engineering. We give formal semantics in terms of a hybrid algebraiccoalgebraic scheme, namely course-of-value iteration. This theoretical approach yields categories of observationally equivalent model representations with precise semantic relationships. Along the initialfinal axis of these categories, history dependence can appear both literally and transformed into instantaneous state. The framework can be connected to philosophical and epistemological discourse on one side, and to algorithmic considerations for computational modeling on the other.

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

dynamical systems
state-based models
history-dependent models


Review of ranking methods in the data envelopment analysis context Within data envelopment analysis (DEA) is a sub-group of papers in which many researchers have sought to improve the differential capabilities of DEA and to fully rank both efficient, as well as inefficient, decision-making units. The ranking methods have been divided in this paper into six, somewhat overlapping, areas. The first area involves the evaluation of a cross-efficiency matrix, in which the units are self and peer evaluated. The second idea, generally known as the super-efficiency method, ranks through the exclusion of the unit being scored from the dual linear program and an analysis of the change in the Pareto Frontier. The third grouping is based on benchmarking, in which a unit is highly ranked if it is chosen as a useful target for many other units. The fourth group utilizes multivariate statistical techniques, which are generally applied after the DEA dichotomic classification. The fifth research area ranks inefficient units through proportional measures of inefficiency. The last approach requires the collection of additional, preferential information from relevant decision-makers and combines multiple-criteria decision methodologies with the DEA approach. However, whilst each technique is useful in a specialist area, no one methodology can be prescribed here as the complete solution to the question of ranking.

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

ranking techniques
super-efficiency
cross-efficiency
multivariate statistics
mcdm


On robust adaptive motion/force control of nonholonomic mechanical systems: The Acatastatic Pfaffian constraints case The contribution of this work relates to two subjects. In the first part of the paper we present a reduced order dynamic description of mechanical (Lagrangian) systems with Acatastatic nonholonomic constraints. This development was motivated by the need for a convenient anti simple dynamic model for the controller. Essentially, the new element of this development is QR-like decomposition of the constraint matrix. Following this decomposition, we have proven a new dynamic property of the considered system (see Property3). This property allows us to express the system dynamics in terms of a new reduced-order state vector. The second part of the work is concerned with development of the adaptive position/force controllers for Lagrangian systems with the Acatastatic constraints. The adaptive control law guarantees the uniform ultimate boundness of the tracking error. A detailed numerical example is presented to illustrate the developed method.

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

mechanical systems
nonholonomic constraints
acatastatic pfaffian constraints


WebA: A tool for the assistance in design and evaluation of websites The development, analysis and follow-up of the processes designed to assure the usability and accessibility of websites is a tedious work for the moderator or evaluator. This is why there is a necessity for tools that can automate the processes. There are some tools that cover some of the technical aspects, but no tools have been identified that can tackle the process as a whole. For these reasons the Aragonese Usability Laboratory decided to develop WebA (Web Analysis), with the objective to have a complete application. This application is designed through modules with the objective of covering all of the evaluation and analysis phases, and it concludes with a process management module. For the analysis phase a Card Sorting module (open & closed) has been developed that uses the hierarchical and multidimensional cluster analysis, which allows a better information architecture. For the evaluation phases, modules have been developed that allow the semiautomatic evaluation of usability through user satisfaction tests based on Nielsen heuristics and ISO standards, the evaluation of accessibility through the verification of WCAG 1.0 guidelines. The application concludes with a process design and evaluation management module, and modules that automatically generate the reports of the analysis carried out.

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

usability engineering
website usability evaluation
human computer interaction


Human face profile recognition using attributed string A new attributed string matching method for human face profile recognition is proposed in this work. It is a novel idea to apply structural and syntactic technique on face profile matching. The approach works on a chain of profile line segments and highlights the favor of curve matching by suppressing the operations of insert and delete. The technique relies mainly on the merge and change operations of string to tackle the inconsistency problem of feature point detection. A quadratic penalty function is proposed to prohibit large angle changes and overmerging. The method produces very encouraging results and is found to be suitable for similar shape classification.

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

attributed string
curve matching
profile
syntactic
structural


using run time traces in automated programming tutoring Running test cases against a student's solution of a programming assignment is one of the easiest ways to generate feedback. If black-box tests are used, students may have difficulties to retrace the complete system behaviour and to find erroneous programming statements. This paper discusses the use of automated trace generation for assisting students in this task. Both manual and automated trace interpretation is discussed and evaluated by examples.

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

trace analysis
intelligent tutoring systems
automated tutoring


UNDERGRADUATE SPECIAL TOPICS COURSES: WHAT'S ON THE MENU? As faculty and curriculum developers, we were interested in how other schools utilize undergraduate special topics courses in Information Systems (IS). A review of the literature identified no articles that specifically addressed the issue. To gather data, a survey of the IS programs at colleges and universities in the United States was conducted. It was found that 30% of the respondents offered one or more undergraduate special topics course. The most popular categories of courses were: E-commerce, Security, and Data Warehouses. Fifteen courses were grouped into a category called Other Courses. Somewhat surprising was that not one school reported offering a special topics course on Web 2.0 and its related technologies. Conclusions and future research are discussed.

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


adaptive clock synchronization in sensor networks Recent advances in technology have made low cost, low power wireless sensors a reality. Clock synchronization is an important service in any distributed system, including sensor network systems. Applications of clock synchronization in sensor networks include data integration in sensors, sensor reading fusion, TDMA medium access scheduling, and power mode energy saving. However, for a number of reasons, standard clock synchronization protocols are unsuitable for direct application in sensor networks. In this paper, we introduce the concept of adaptive clock synchronization based on the need of the application and the resource constraint in the sensor networks. We describe a probabilistic method for clock synchronization that uses the higher precision of receiver-to-receiver synchronization, as described in Reference Broadcast Synchronization (RBS) protocol. This deterministic protocol is extended to provide a probabilistic bound on the accuracy of the clock synchronization, allowing for a tradeo between accuracy and resource requirement. Expressions to convert service specifications (maximum clock synchronization error and confidence probability) to actual protocol parameters (minimum number of messages and synchronization overhead) are derived. Further, we extend this protocol for maintaining clock synchronization in a multihop network.

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

network
sensor networks
clock synchronization
sensor
applications
scheduling
synchronization
concept
direct
probability
access
paper
constraint
energy saving
tdma
fusion
method
accuracy
systems
broadcast
low power
power
cost
resource

requirements
precise
probabilistic algorithms
express
standardization
read
errors
distributed systems
reasoning
adapt
technologies
message
wireless sensor
data integrity


Discovery of textual knowledge flow based on the management of knowledge maps Textual knowledge flow (TKF) provides an effective technique and theoretical support for file discovery and cooperation of knowledge innovation, intelligent browsing, and personalized recommendation in Web services and e-Science Knowledge Grid. For the discovery of TKF firstly knowledge map (KM) is proposed to represent the textual knowledge; then a hash algorithm is used to code KMs in (order to form an Island which contains enormous KMs belonging to a domain. Under the control of the Island, C-Location and R-Location are introduced to manage those KMs belonging to in Island. KM-Chord is proposed to manage the number of Islands, C-Locations and R-Locations in Web or a library. With the help of the management of KMs, similar relation and associated relation between KMs are found to build the semantic link network (SLN) between KMs. Based on the SLN and users' profile and input, similar or associated TKF with the user's different demands is activated. Experiments show that the proposed method can effectively discover TKF for Web services and e-Science Knowledge Grid. Copyright (E) 2008 John Wile & Sons. Ltd.

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

textual knowledge flow
knowledge map
semantic link network
knowledge grid


A Scalable Multi-Tenant Architecture for Business Process Executions Cloud computing, as a concept, promises cost savings to end-users by letting them outsource their non-critical business functions to a third-party in pay-as-you-go style. However, to enable economic pay-as-you-go services, the end-users need Cloud middleware that maximizes sharing and support near-zero cost for unused applications. Multi-tenancy, which let multiple tenants to share a single application instance securely, is a key enabler for building such a middleware. On the other hand, Business processes capture Business logic of organizations in an abstract and reusable manner, and hence play a key role in most organizations. This paper presents the design and architecture of a scalable Multi-tenant Workflow engine while discussing in detail the potential use cases of such architecture. Primary contributions of this paper are motivating workflow multi-tenancy, and the design and implementation of a scalable multi-tenant workflow engine that enables multiple tenants to run their workflows securely within the same workflow engine instance without modifications to the workflows. Furthermore, the workflow engine supports process sharing and process variability across the tenants and discusses its ramifications.

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

multi-tenancy
service oriented architecture (soa)


Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models A grammar transform is a transformation that converts any data sequence to be compressed into a grammar from which the original data sequence can be fully reconstructed. In a grammar-based code, a data sequence is first converted into a grammar by a grammar transform and then losslessly encoded. In this paper, a greedy grammar transform is first presented; this grammar transform constructs sequentially a sequence of irreducible grammars from which the original data sequence can be recovered incrementally. Based on this grammar transform, three universal lossless data compression algorithms, a sequential algorithm, an improved sequential algorithm, and a hierarchical algorithm, are then developed. These algorithms combine the power of arithmetic coding with that of string matching. It is shown that these algorithms are all universal in the sense that they can achieve asymptotically the entropy rate of any stationary, ergodic source. Moreover, it is proved that their worst case redundancies among all individual sequences of length n are upper-bounded by c log log n / log n, where c is a constant. Simulation results show that the proposed algorithms outperform the Unix Compress and Gzip algorithms, which are based on LZ78 and LZ77, respectively.

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

arithmetic coding
entropy
string matching

universal sequential and hierarchical data compression


GENERALIZED HAUSDORFF MATRICES AS BOUNDED OPERATORS OVER A(k) In this paper we prove a theorem which shows that a generalized Hausdorff matrix is a bounded operator on A(k), defined below by (2); i.e., (H-beta, mu) is an element of B (A(k))

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

absolute summability
cesaro matrix
conservative matrix


APPROACH TO THE DESIGN OF ROBUST NETWORKED CONTROL SYSTEMS The paper describes the application of the traffic engineering framework together with application layer procedures as mechanisms for the reduction of network latency lags. These mechanisms allow using standard and inexpensive hardware and software technologies typically applied for office networking as a means of realising networked control systems (NCSs) with high dynamic control plants, where a high dynamic control plant is the one that requires the sampling period several times shorter than communication lags induced by a network. The general discussion is illustrated by experimental results obtained in a laboratory NCS with the magnetic levitation system (MLS), which is an example of a structurally unstable plant of high dynamics.

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

networked control systems
traffic engineering


Intelligent churn prediction in telecom: employing mRMR feature selection and RotBoost based ensemble classification Churn prediction in telecom has recently gained substantial interest of stakeholders because of associated revenue losses.

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


Variational Bayes phase tracking for correlated dual-frequency measurements with slow dynamics Model of correlated dual-frequency measurements with slow dynamics. Estimation of the signal absolute phase via a variational Bayes filtering method. Closed-form filtering distribution with known modes (number + location). Mean of the filtering distribution is a tractable estimator with low cycle slip rate. Benefit of the method is distinct at low SNR or for low correlation level.

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

absolute phase tracking
phase unwrapping
cycle slips
multifrequency signal
nonlinear bayesian filtering
variational bayes approximation


A CHARACTERISATION OF FIRST-ORDER CONSTRAINT SATISFACTION PROBLEMS We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first-order definable: we show the general problem to be NP-complete, and give a polynomial-time algorithm in the case of cores. A slight modification of this algorithm provides, for first-order definable CSP's, a simple poly-time algorithm to produce a solution when one exists. As an application of our algebraic characterisation of first order CSP's, we describe a large family of L-complete CSP's.

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

first order logic
tree duality
finite duality


Probabilistic prediction of proteinprotein interactions from the protein sequences Prediction of proteinprotein interactions is very important for several bioinformatics tasks though it is not a straightforward problem. In this paper, employing only protein sequence information, a framework is presented to predict proteinprotein interactions using a probabilistic-based tree augmented na?ve (TAN) Bayesian network. Our framework also provides a confidence level for every predicted interaction, which is useful for further analysis by the biologists. The framework is applied to the yeast interaction datasets for predicting interactions and it is shown that our framework gives better performance than support vector machine (SVM). The framework is implemented as a webserver and is available for prediction.

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

tan bayesian classifier
proteinprotein interaction
protein feature extraction
machine learning


Stabilized finite element method for the radial Dirac equation A challenging difficulty in solving the radial Dirac eigenvalue problem numerically is the presence of spurious (unphysical) eigenvalues, among the genuine ones, that are neither related to mathematical interpretations nor to physical explanations. Many attempts have been made and several numerical methods have been applied to solve the problem using the finite element method (FEM), the finite difference method, or other numerical schemes. Unfortunately most of these attempts failed to overcome the difficulty. As a FEM approach, this work can be regarded as a first promising scheme to solve the spuriosity problem completely. Our approach is based on an appropriate choice of trial and test function spaces. We develop a Streamline Upwind PetrovGalerkin method to the equation and derive an explicit stability parameter.

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

dirac operator
finite element scheme
spurious eigenvalue
cubic hermite functions


DFT investigations of phosphotriesters hydrolysis in aqueous solution: a model for DNA single strand scission induced by N-nitrosoureas DNA phosphotriester adducts are common alkylation products of DNA phosphodiester moiety induced by N-nitrosoureas. The 2-hydroxyethyl phosphotriester was reported to hydrolyze more rapidly than other alkyl phosphotriesters both in neutral and in alkaline conditions, which can cause DNA single strand scission. In this work, DFT calculations have been employed to map out the four lowest activation free-energy profiles for neutral and alkaline hydrolysis of triethyl phosphate (TEP) and diethyl 2-hydroxyethyl phosphate (DEHEP). All the hydrolysis pathways were illuminated to be stepwise involving an acyclic or cyclic phosphorane intermediate for TEP or DEHEP, respectively. The rate-limiting step for all the hydrolysis reactions was found to be the formation of phosphorane intermediate, with the exception of DEHEP hydrolysis in alkaline conditions that the decomposition process turned out to be the rate-limiting step, owing to the extraordinary low formation barrier of cyclic phosphorane intermediate catalyzed by hydroxide. The rate-limiting barriers obtained for the four reactions are all consistent with the available experimental information concerning the corresponding hydrolysis reactions of phosphotriesters. Our calculations performed on the phosphate triesters hydrolysis predict that the lower formation barriers of cyclic phosphorane intermediates compared to its acyclic counter-part should be the dominant factor governing the hydrolysis rate enhancement of DEHEP relative to TEP both in neutral and in alkaline conditions.

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

acyclic phosphorane
diethyl 2-hydroxyethyl phosphate
hydrolysis mechanism


Binary survival aggregation functions We introduce a transformation that acts on binary aggregation functions and that generalizes the transformation that maps copulas, a well-studied class of binary aggregation functions with a profound probabilistic interpretation, to their associated survival copulas. The new transformation, called double flipping, is the composition of two elementary flipping transformations introduced earlier, each operating on one of the arguments of the aggregation function. We lay bare the relationships between these elementary flipping operations and double flipping. We study invariants under these transformations. Furthermore, we characterize the transformations that preserve flippability. Most importantly, we characterize different subclasses of flippable aggregation functions, in particular aggregation functions that have an absorbing element or that have a neutral element. In this investigation, the key role played by quasi-copulas and their dual operations is highlighted. These findings support the introduction of the term survival aggregation function. (C) 2011 Elsevier B.V. All rights reserved.

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

aggregation function
double flipping
flipping

copula
restricted 2-increasingness
i-lipschitz continuity
quasi-copula


Evaluation of Routing with Robustness to the Variation in Traffic Demand In this paper, we focus on routing problem in the face of variation in traffic demands. We implement a Robust Routing algorithm (RRT) with an aim of satisfying networking goals such as load balancing, routing robustness to the range of traffic demand matrices or to the traffic changes caused by uncertain traffic demands. We conduct simulation experiments on range of topologies that includes, real network and randomly generated synthetic network topologies. Simulation results show marked improvement in the maximum link utilization compare to Open Shortest Path First. K-shortest path implementation of RRT can be extended for Multi Protocol Level Switching.

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

internet traffic engineering
traffic matrix and traffic demand


Validation of nearest neighbor classifiers This correspondence presents a method to bound the out-of-sample error rate of a nearest neighbor classifier.(1) The bound is based only on the examples that comprise the classifier. Thus all available examples can be used in the classifier; no examples need to be withheld to compute error bounds. The estimate used in the bound is an extension of the holdout estimate. The difference in error rates between the holdout classifier and the classifier consisting of all available examples is estimated using truncated inclusion and exclusion.

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

machine learning
nearest neighbor classifier
statistics


Communities of practice model driven knowledge management in multinational knowledge based enterprises Existing research in intelligent manufacturing literature has highlighted the need for linking organizational culture, business strategy with Knowledge Management (KM) as well as measuring the performance of knowledge management systems for best practice. Communities of Practice (CoPs) are accepted as best practice and distinct from organizational structures while implementing KM. Besides, employing CoPs as an approach for linking business strategies with KM design, CoPs can be the prevailing way for group learning and innovation building within firms. As firms grow in size, scope, and complexity, CoPs members who regularly engage in sharing and learning based on common interests, could improve organizational performance. The purpose of this work is to design a CoPs model for KM which addresses issues related to organization culture, business strategy and performance measurement reported in earlier publications in intelligent manufacturing. A CoPs evaluation hierarchy for KM is developed. It includes four dimensions and sixteen criteria for studying and evaluating organizational culture and business strategy. Fuzzy Multi-Criteria Decision Making (MCDM) approach has been employed to quantitatively analyze various criteria priorities and business strategy preferences of CoPs. In order to validate the CoPs model, a case study has been undertaken in two multinational knowledge based organizations and the results are compared to differentiate strategic preferences. The contributions of this paper include: a) Definition of a CoPs model based on sixteen criteria which helps to understand an organization's KM culture or CoPs; b) Employing these criteria to link an organization's KM culture with four business strategies; c) Develop a quantitative method for measuring KM performance in the context of four business strategies, and d) Validating the CoPs model through its application in two multinationals in Taiwan and Japan. The CoPs model thus can be used by organizations to understand their KM culture, allocate resources towards the chosen business strategy and measure KM performance in the context of the chosen business strategy.

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

communities of practice (cops)
knowledge management (km)
knowledge based best practice


Fragment-based approach for the in silico discovery of multi-target insecticides Pesticides represent extremely useful chemical and biochemical agents for the prevention of crop losses and disease in humans. They act by destroying, repelling or mitigating pests. Insects constitute one of the pests which are very difficult to control. With the pass of the time, insects have become resistant to pesticides because the current insecticides are designed to act through one mechanism of action. For this reason, there is an increasing need for the design of more potent and versatile insecticides. The present study is focused on the development of a fragment-based approach for the in silico discovery of multi-target insecticides from a heterogeneous database of compounds. The present methodology was based on a QSAR discriminant model which classified correctly more than 90% of insecticides and inactive compounds in both, training and prediction series. Also, it permitted the automatic and efficient extraction of fragments responsible of insecticidal activity against several mechanisms of action and new molecular entities were suggested as possible multi-target insecticides. (C) 2011 Elsevier B.V. All rights reserved.

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

linear discriminant analysis
quantitative contributions


Which social elements are visible in virtual groups? Addressing the categorization of social expressions Learning is a social process. That is why it is extremely important to understand how students interact socially in online courses and how it affects the learning process. However, social aspects, understood as those expressions or comments that go beyond strictly academic interaction, i.e. the need to carry out group work, are not clearly defined. Researchers have proposed different models of categories to observe or measure social aspects. This paper contributes to this field through addressing the categorization of social expression in online groups through a qualitative research procedure. Specifically, 19 indicators have been identified and organized into 4 categories: formal, attitudinal, emotional and informal. The findings suggest that those indicators related to formal and attitudinal aspects appear more often than emotional and informal ones. Different profiles (Psychology or Computer Engineering) as well as different levels of experience in online learning (beginners or experts) have also been analyzed, concluding that Psychology students turn to social expressions more often than Computer Engineering ones. As students progress in their undergraduate studies, social expressions are perceived and used to the extent that they ease the learning process. (C) 2011 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 O O O O O O O O O O O O O O O O O O O O O O O O O O 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

cooperative/collaborative learning
social dimension
adult learning