a deployed multi-agent framework for distributed energy applications In this paper, we describe the adaptation of an open-source multi-agent platform for distributed energy applications and the trial deployment of resource-controller agents. The platform provides real-time, two-way communication and decision making between distributed energy resources --- loads and generators --- in electricity distribution networks. Such a decentralized architecture improves grid reliability, allows consumers to play a more active role in their energy usage, benefits the network by alleviating the effects of peak wholesale prices and network constraints, and creates new business opportunities in a deregulated market. Agents have been deployed to control hardware at trial locations in Australia, providing a realistic test environment for the platform, and medium-scale trials are anticipated in the near future.

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

frameworks
collective and emergent agent behavior


ON THE COMPRESSIBILITY OF NP INSTANCES AND CRYPTOGRAPHIC APPLICATIONS We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problems. We consider NP problems that have long instances but relatively short witnesses. The question is whether one can efficiently compress an instance and store a shorter representation that maintains the information of whether the original input is in the language or not. We want the length of the compressed instance to be polynomial in the length of the witness and polylog in the length of original input. Such compression enables succinctly storing instances until a future setting will allow solving them, either via a technological or algorithmic breakthrough or simply until enough time has elapsed. In this paper, we first develop the basic complexity theory of compression, including reducibility, completeness, and a stratification of NP with respect to compression. We then show that compressibility (say, of SAT) would have vast implications for cryptography, including constructions of one-way functions and collision resistant hash functions from any hard-on-average problem in NP and cryptanalysis of key agreement protocols in the "bounded storage model" when mixed with (time) complexity-based cryptography.

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

compression
np problems
cryptography
collision resistant hash
bounded storage model


bridging the gap between geospatial resource providers and model developers This paper analyzes how interoperability and componentization efforts in the geospatial domain have an underestimated impact on the user perspective, directly affecting model development. This discussion is illustrated by the description of the design and implementation of WebMAPS, a geospatial information system to support agricultural planning and monitoring.

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

data and process availability
data publication


THE ISOTROPIC SCALING PROBLEM IN GENERALIZED PROCRUSTES ANALYSIS Gower has offered a method for updating isotropic scaling factors in the context of Generalized Procrustes Analysis. Ten Berge has shown that an explicit eigenvector solution exists for the problem at hand, and rejected Gower's method on account of its unknown convergence properties. In the present paper, the convergence properties of Gower's method are examined. It is shown that Gower's method does converge to the correct eigenvector, if a certain non-negativity assumption is satisfied. It is concluded that there is no reason to adopt Gower's procedure as an alternative to the explicit eigenvector solution.

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


A bibliometric approach to interdisciplinarity in Japanese rice research and technology development Research and development of rice, a major crop, has been promoted on an interdisciplinary basis with the involvement of various research fields ranging from natural sciences to socioeconomics in Japan. This paper focuses on the structure of interdisciplinarity in Japanese rice research and technology development by analyzing the relationship among all relevant disciplines with the use of a compiled bibliography of Japanese rice research with 19,389 articles in 1,611 journals in the publishing years of 19902000. The relationship among the disciplines was characterized by the frequency distribution of articles among journals classified into 24 categories based on the law of scattering originally identified by Bradford (Engineering 13:785786, 1934). The 24 journal categories ranked in decreasing order of productivity of articles were divided into 3 zones; the first nuclear zone with a smaller number of highly productive journal disciplines; the second zone with a large number of less productive disciplines; and the last zone with a larger number of the least productive disciplines, which characterized the structure of interdisciplinarity in Japanese rice research and technology development. Other aspects of the interdisciplinarity were further explored with reference to peripheral journals with a minimal number of papers on a certain subject, and the Groos droop phenomenon at the end of Bradfords S-shape curve that is the region of the least productive journals with only one paper on a certain subject, by analyzing the frequency distribution of articles in journal categories.

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

the groos droop
interdisciplinarity
japan
rice


Noise and Microflora Behavior Noise is ubiquitous, and in any discussion about regulation of immune diversity, oral tolerance, commensal microflora, and health homeostasis, stochastic resonance should not be omitted. It also may have a role in immune receptor regulation, transplant tolerance, and host reaction against intruders. It would be in line with nature's tendency to adapt to available network patterns.

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

digestion
commensal flora
gene rearrangement
ambiguity


One-step robust estimation of fixed-effects panel data models The panel-data regression models are frequently applied to micro-level data, which often suffer from data contamination, erroneous observations, or unobserved heterogeneity. Despite the adverse effects of outliers on classical estimation methods, there are only a few robust estimation methods available for fixed-effects panel data. A new estimation approach based on two different data transformations is therefore proposed. Considering several robust estimation methods applied to the transformed data, the robust and asymptotic properties of the proposed estimators are derived, including their breakdown points and asymptotic distributions. The finite-sample performance of the existing and proposed methods is compared by means of Monte Carlo simulations.

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


CrossNets: High-Performance Neuromorphic Architectures for CMOL Circuits The exponential, Moore's Law, progress of electronics may be continued beyond the 10-nm frontier if the currently dominant CMOS technology is replaced by hybrid CMOL circuits combining a silicon MOSFET stack and a few layers of parallel nanowires connected by self-assembled molecular electronic devices. Such hybrids promise unparalleled performance for advanced information processing, but require special architectures to compensate for specific features of the molecular devices, including low voltage gain and possible high fraction of faulty components. Neuromorphic networks with their defect tolerance seem the most natural way to address these problems. Such circuits may be trained to perform advanced information processing including (at least) effective pattern recognition and classification. We are developing a family of distributed crossbar network (CrossNet) architectures that permit the combination of high connectivity neuromorphic circuits with high component density. Preliminary estimates show that this approach may eventually allow us to place a cortex-scale circuit with about 1010 neurons and about 1014 synapses on an approximately 10 10 cm2 silicon wafer. Such systems may provide an average cell-to-cell latency of about 20 nsec and, thus, perform information processing and system training (possibly including self-evolution after initial training) at a speed that is approximately six orders of magnitude higher than in its biological prototype and at acceptable power dissipation.

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


Embedded trellis coded quantization for JPEG2000 A modified embedded trellis coded quantization (TCQ) for JPEG2000 is presented in this paper. The method for approximately inverting TCQ in the absence of the least significant bits is improved. Experimental results, presented using the optimal rate control algorithm and different embedded TCQ formulations, show that modified embedded TCQ yields significant performance improvement compared to the original one in JPEG2000.

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 B

embedded trellis coded quantization (tcq)


participatory design and international development Information and communication technologies (ICT) are increasingly being considered as ways to support international development efforts, whether in the form of information systems for clinics and hospitals, telecentres or kiosks providing access to internet information resources and e-government services in remote areas, or advice services to support improved agricultural practices and crop management. In doing this work, participatory approaches are commonly espoused, but, as participants in PDC will realize, translating verbal commitments into meaningful participatory realities is a complex challenge requiring critical reflection and careful examination of our practice. This is even more apparent in contexts where there are large cultural and socio-economic differences between practitioners and other participants. Some authors have questioned whether 'established' participatory design methods are effective for this type of work.

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

participatory design
international development


Ordinary differential equations with nonlinear boundary conditions of antiperiodic type The quasi linearization method is successfully applied to differential problems with nonlinear boundary conditions of antiperiodic type. Given are sufficient conditions under which the monotone iterations converge quadratically to a unique solution of our problem. The advantage of this approach lies in the fact that the approximate solutions are obtained iteratively as solutions of the above-mentioned iterations. (C) 2004 Elsevier Ltd. All rights reserved.

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

quadratic convergence
lower and upper solutions


converting a swap-based system to do paging in an architecture lacking page-referenced bits This paper discusses the modifications made to the UNIX operating system for the VAX-11/780 to convert it from a swap-based segmented system to a paging-based virtual memory system. Of particular interest is that the host machine architecture does not include page-referenced bits. We discuss considerations in the design of page-replacement and load-control policies for such an architecture, and outline current work in modeling the policies employed by the system. We describe our experience with the chosen algorithms based on benchmark-driven studies and production system use.

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

paging
use
architecture
memory system
design
operating system
experience
paper

product policy systems benchmark algorithm model virtualization control


A comparative study of two approaches for supporting optimal network location queries Given a set S of sites and a set O of weighted objects, an optimal location query finds the location(s) where introducing a new site maximizes the total weight of the objects that are closer to the new site than to any other site. With such a query, for instance, a franchise corporation (e.g., McDonalds) can find a location to open a new store such that the number of potential store customers (i.e., people living close to the store) is maximized. Optimal location queries are computationally complex to compute and require efficient solutions that scale with large datasets. Previously, two specific approaches have been proposed for efficient computation of optimal location queries. However, they both assume p-norm distance (namely, L1 and L2/Euclidean); hence, they are not applicable where sites and objects are located on spatial networks. In this article, we focus on optimal network location (ONL) queries, i.e., optimal location queries in which objects and sites reside on a spatial network. We introduce two complementary approaches, namely EONL (short for Expansion-based ONL) and BONL (short for Bound-based ONL), which enable efficient computation of ONL queries with datasets of uniform and skewed distributions, respectively. Moreover, with an extensive experimental study we verify and compare the efficiency of our proposed approaches with real world datasets, and we demonstrate the importance of considering network distance (rather than p-norm distance) with ONL queries.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 location-aware system for monitoring sport events Nowadays it is widely recognized the need of developing a new generation of professional equipment for broadcasting that allows a considerable reduction of productions costs in different scenarios. We consider mobile multimedia scenarios where the incorporation of last generation hardware and the development of new software should allow: 1) to decrease the needs of human resources to produce (create, edit, and distribute) audiovisual content; and 2) to increase the richness of the broadcasted product. In this paper, we propose a software system that helps technical directors to deal with many motorized videocameras attached to moving or static objects in wireless environments. We use mobile agents to carry out the processing tasks wherever they are needed. Thus, agents are in charge of tracking the location of interesting static or moving objects and the (current and possible) focus range of all the cameras, as well as of refreshing the query answers efficiently and continuously. We present a traditional rowing race in the Basque Country as motivating scenario, where technical directors may indicate interesting objects or geographic areas in run-time and the system is in charge of selecting the best shots from the cameras in the scenario.

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


Animated transitions in statistical data graphics In this paper we investigate the effectiveness of animated transitions between common statistical data graphics such as bar charts, pie charts, and scatter plots. We extend theoretical models of data graphics to include such transitions, introducing a taxonomy of transition types. We then propose design principles for creating effective transitions and illustrate the application of these principles in DynaVis, a visualization system featuring animated data graphics. Two controlled experiments were conducted to assess the efficacy of various transition types, finding that animated transitions can significantly improve graphical perception.

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

statistica data graphics
animation
information visualization
experiment


The Zero Exemplar Distance Problem Given two genomes with duplicate genes, ZERO EXEMPLAR DISTANCE is the problem of deciding whether the two genomes can be reduced to the same genome without duplicate genes by deleting all but one copy of each gene in each genome. Blin, Fertin, Sikora, and Vialette recently proved that ZERO EXEMPLAR DISTANCE for monochromosomal genomes is NP-hard even if each gene appears at most two times in each genome, thereby settling an important open question on genome rearrangement in the exemplar model. In this article, we give a very simple alternative proof of this result. We also study the problem ZERO EXEMPLAR DISTANCE for multichromosomal genomes without gene order, and prove the analogous result that it is also NP-hard even if each gene appears at most two times in each genome. For the positive direction, we show that both variants of ZERO EXEMPLAR DISTANCE admit polynomial-time algorithms if each gene appears exactly once in one genome and at least once in the other genome. In addition, we present a polynomial-time algorithm for the related problem EXEMPLAR LONGEST COMMON SUBSEQUENCE in the special case that each mandatory symbol appears exactly once in one input sequence and at least once in the other input sequence. This answers an open question of Bonizzoni et al. We also show that ZERO EXEMPLAR DISTANCE for multichromosomal genomes without gene order is fixed-parameter tractable in the general case if the parameter is the maximum number of chromosomes in each genome.

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


external monitoring of endpoint configuration compliance We describe a system for externally monitoring endpoint configuration compliance of an end user system that provides a high assurance monitoring function and data. Typical approaches to monitoring for endpoint configuration compliance rely on the integrity of the endpoint's operating system and do not protect the monitoring function from subversion or spoofing by threats from within the monitored system. Our approach utilizes (1) a virtual machine architecture on the endpoint system to protect the monitoring function and (2) virtual machine introspection of the end user's environment. In this paper we describe our approach to external monitoring of endpoint configuration compliance, present the technical details of our monitoring system, and discuss some of the issues associated with external monitoring.

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

trusted computing
security
virtualization


Bridging the gap between illiterate older adults and cognitive stimulation technologies through pervasive computing The global ageing of the population has made the increase in age-related diseases more obvious, some of which are accompanied by a patients cognitive decline (CD). That is a hard problem for Mexico, as a large number of older adults belong to marginalized sectors. These older adults are characterized by their illiteracy and limited financial resources, which make them more vulnerable to conditions such as the Alzheimers disease. According to the literature, a person who participates often in cognitive stimulation (CS) activities reduces the risk of suffering a CD-related condition. This has provided the motivation to carry out case studies to understand older adults interactions in CS sessions, and their relation with technologies and with members of their social family networks (SFN). To address these technological, social and illiteracy gaps, a pervasive CS collaborative system has been designed and evaluated which eases interaction through natural interfaces and enables SFN members to interact with older adults during their CS activities regardless of their physical location. The evaluation results provide evidence that participants perceived the system as useful, easy to use and providing a pleasurable user experience. Furthermore, these results show the feasibility of augmenting traditional board games (e.g. chess, checkers) to create pervasive CS collaborative applications and the importance and benefits of integrating SFN members as informal caregivers.

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

cognitive stimulation
illiterate older adults
social family networks

pervasive collaborative systems
tangible interfaces


Arson: Tracking the Culprit in Alzheimer's Disease By focusing on the lesions in Alzheimer's disease, and regarding them as either critical or irrelevant, researchers may have missed much regarding the origin and pathogenesis of this disease. In this article we consider that the lesions are so obvious not only because they are pathognomonic for Alzheimer's disease, but also because they represent a major departure from normal physiology. We suggest that these myriad pathological changes are homeostatic compensatory mechanisms to aging.

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

alzheimer's disease
amyloid
antioxidant
homeostasis


A large-scale evaluation of automatic pulmonary nodule detection in chest CT using local image features and k-nearest-neighbour classification A scheme for the automatic detection of nodules in thoracic computed tomography scans is presented and extensively evaluated. The algorithm uses the local image features of shape index and curvedness in order to detect candidate structures in the lung volume and applies two successive k-nearest-neighbour classifiers in the reduction of false-positives. The nodule detection system is trained and tested on three databases extracted from a large-scale experimental screening study. The databases are constructed in order to evaluate the algorithm on both randomly chosen screening data as well as data containing higher proportions of nodules requiring follow-up. The system results are extensively evaluated including performance measurements on specific nodule types and sizes within the databases and on lesions which later proved to be malignant. In a random selection of 813 scans from the screening study a sensitivity of 80% with an average 4.2 false-positives per scan is achieved. The detection results presented are a realistic measure of a CAD system performance in a low-dose screening study which includes a diverse array of nodules of many varying sizes, types and textures.

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

nodule detection
ct
automatic detection
shape index


1001 optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap Protein structure comparison is a fundamental problem for structural genomics, with applications to drug design, fold prediction, protein clustering, and evolutionary studies. Despite its importance, there are very few rigorous methods and widely accepted similarity measures known for this problem. In this paper we describe the last few years of developments on the study of an emerging measure, the contact map overlap (CMO), for protein structure comparison. A contact map is a list of pairs of residues which lie in three-dimensional proximity in the protein's native fold. Although this measure is in principle computationally hard to optimize, we show how it can in fact be computed with great accuracy for related proteins by integer linear programming techniques. These methods have the advantage of providing certificates of near-optimality by means of upper bounds to the optimal alignment value. We also illustrate effective heuristics, such as local search and genetic algorithms. We were able to obtain for the first time optimal alignments for large similar proteins (about 1,000 residues and 2,000 contacts) and used the CMO measure to cluster proteins in families. The clusters obtained were compared to SCOP classification in order to validate the measure. Extensive computational experiments showed that alignments which are off by at most 10% from the optimal value can be computed in a short time. Further experiments showed how this measure reacts to the choice of the threshold defining a contact and how to choose this threshold in a sensible way.

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

lagrangian relaxation
protein structure alignment


The Java module system: Core design and semantic definition Java has no module system. Its packages only subdivide the class namespace, allowing only a very limited form of component-level information hiding and reuse. Two Java Community Processes have started addressing this problem: one describes the runtime system and has reached an early draft stage, while the other considers the developer's view and only has a straw-man proposal. Both are natural language documents, which inevitably contain ambiguities. In this work we design and formalize a core module system for Java. Where the JCP documents are complete, we follow them closely; elsewhere we make reasonable choices. We define the syntax, the type system, and the operational semantics of an LJAM language, defining these rigorously in the Isabelle/HOL automated proof assistant. Using this formalization, we identify various issues with the module system. We highlight the underlying design decisions, and discuss several alternatives and their benefits. Our Isabelle/HOL definitions should provide a basis for further consideration of the design alternatives, for reference implementations, and for proofs of soundness.

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


Pattern recognition after image processing of low-contrast images, the case of the Shroud of Turin We discuss the potentially misleading effect of software techniques for elaborating low-contrast images. In particular, we present the example of the stains embedded into one of the most studied archeological objects in history, the Shroud of Turin. We show for the first time that image processing of both old and recent photographs of the Shroud may lead some researchers to perceive inscriptions and patterns that do not actually exist, confirming that there is a narrow boundary between image enhancement and manipulation.

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

digital image processing
perception
turin shroud
pareidolia


Power-Aware System Design of Wireless Sensor Networks: Power Estimation and Power Profiling Strategies Modern design of wireless devices requires the designers to have a special focus on power consumption to prolong the battery life of the final system. The designer therefore needs power consumption information very early in the process to be able to decide on system parameters, design methods, communication protocols, functionality restrictions. Typically, this is done by running simulations of the system to be developed and performing design space exploration. However, there is a tradeoff between speed and accuracy of simulation, therefore the designer has to be aware of available tools and simulation methods he can choose from to achieve the best possible solution for his case. This paper gives an overview over the currently existing simulators and simulation methods for fast system simulation with respect to power consumption and concludes with a vision of future simulator opportunities.

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

power estimation
power profiling
simulation
simulator

power-aware systems
wireless sensor network (wsn)


A hybrid AC3-tabu search algorithm for solving Sudoku puzzles We propose a new hybrid AC3-tabu search algorithm for Sudoku problems. We perform experiments considering easy, medium, and hard Sudokus. The approach generally outperforms the best results reached by incomplete search.

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

metaheuristics
tabu search
constraint satisfaction


Development of a parallel optimization method based on genetic simulated annealing algorithm This paper presents a parallel genetic simulated annealing (PGSA) algorithm that has been developed and applied to optimize continuous problems. In PGSA, the entire population is divided into sub-populations, and in each sub-population the algorithm uses the local search ability of simulated annealing after crossover and mutation. The best individuals of each sub-population are migrated to neighboring ones after a certain number of epochs. An implementation of the algorithm is discussed and the performance is evaluated against a standard set of test functions. PGSA shows some remarkable improvement in comparison with the conventional parallel genetic algorithm and the breeder genetic algorithm (BGA).

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


Risk factors associated with online game addiction: A hierarchical model Psychopathological conditions are the strongest predicting factors for online game addiction. Sex is a risk factor for online game addiction. Decreased self-esteem is associated with online game addiction.

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

online gaming addiction
social interaction
psychopathology
individual factors
cognitive functions


Molecular modeling study of the PtCl2 complexes of unsaturated S2On+1-coronands: Dynamic simulations and investigation of the ring interconversion Maleonitrile-dithiacrown ethers mn-12S(2)O(2) - mn-21S(2)O(5) (mn = maleonitrile) are preorganized S2On+1-coronands (n = 1 - 4) which force B, AB and A class metal ions into mixed S/O coordination spheres. Moreover, they form chelate complexes with MX2 salts (M = Pd, Pt; X = Cl, Br), which were studied in this paper. The structures of mn-S2On+1 and [PtCl2(mn-S2On+1)] (n = 2, 3) were investigated theoretically by empirical and semiempirical methods using SYBYL (TRIPOS force field) and MSI/ DISCOVER97 (ESFF force field). mn-12S(2)O(2) was investigated experimentally by X-ray analysis and 1D and 2D NMR spectroscopy in solution and the complex formation was studied by H-1, C-13 and Pt-195 NMR titration experiments, respectively. S-inversion was also investigated in order to determine the ring corresponding interconversional barriers. Different orientations of the macrocyclic ring system mn-18S(2)O(4) and of its transition states are shown.

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

thiacrown ether
pt(ii) complexes
molecular dynamic simulations


An assessment of swinger techniques for the playground swing oscillatory motion However, very little attention has been given to the requirements that such swinger techniques place on the swinger himself. The purpose of this study was to find out whether different swinger techniques yield significantly different maximum torques, endurance and coordinative skills, and also to identify preferable techniques. We modelled the seated swinger as a rigid dumbbell and compared three different techniques. A series of computer simulations were run with each technique, testing the performance with different body rotational speeds, delayed onset of body rotation and different body mass distributions, as swing amplitudes were brought up towards 90 degrees. One technique was found to be extremely sensitive to the timing of body actions, limiting swing amplitudes to 50 degrees and 8 degrees when body action was delayed by 0.03 and 0.3 s, respectively. Two other more robust techniques reached 90 degrees even with the largest of these delays, although more time (and endurance) was needed. However, these two methods also differed with respect to maximum torque and endurance, and none was preferable in both these aspects, being dependent on the swinger goals and abilities.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 bdi architecture for normative decision making Norms, to become effective, must be recognised as norms by agents. These agents must be able to accept norms but maintaining their autonomy. In this paper, the multi-context BDI agent architecture has been extended with a recognition and a normative context in order to allow agents to acquire norms from their environment and consider norms in their decision making processes.

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

reasoning
multi-context systems
bdi agents


Network MIMO With Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation, and Reduced-Complexity Scheduling We consider the downlink of a multicell system with multiantenna base stations and single-antenna user terminals, arbitrary base station cooperation clusters, distance-dependent propagation pathloss, and general "fairness" requirements. Base stations in the same cooperation cluster employ joint transmission with linear zero-forcing beamforming, subject to sum or per-base station power constraints. Intercluster interference is treated as noise at the user terminals. Analytic expressions for the system spectral efficiency are found in the large-system limit where both the numbers of users and antennas per base station tend to infinity with a given ratio. In particular, for the per-base station power constraint, we find new results in random matrix theory, yielding the squared Frobenius norm of submatrices of the Moore-Penrose pseudo-inverse for the structured non-i.i.d. channel matrix resulting from the cooperation cluster, user distribution, and path-loss coefficients. The analysis is extended to the case of nonideal Channel State Information at the Transmitters obtained through explicit downlink channel training and uplink feedback. Specifically, our results illuminate the trade-off between the benefit of a larger number of cooperating antennas and the cost of estimating higher-dimensional channel vectors. Furthermore, our analysis leads to a new simplified downlink scheduling scheme that preselects the users according to probabilities obtained from the large-system results, depending on the desired fairness criterion. The proposed scheme performs close to the optimal (finite-dimensional) opportunistic user selection while requiring significantly less channel state feedback, since only a small fraction of preselected users must feed back their channel state information.

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

channel estimation
downlink scheduling
network mimo

large random matrices
linear zero-forcing beamforming


automating custom-precision function evaluation for embedded processors Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-II Pro FPGAs only supports emulated floating-point arithmetic, which leads to slow operation when floating-point arithmetic is desired. This paper presents a customizable mathematical library using fixed-point arithmetic for elementary function evaluation. We approximate functions via polynomial or rational approximations depending on the user-defined accuracy requirements. The data representation for the inputs and outputs are compatible with IEEE single-precision and double-precision floating-point formats. Results show that our 32-bit polynomial method achieves over 80 times speedup over the single-precision mathematical library from Xilinx, while our 64-bit polynomial method achieves over 30 times speedup.

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

reconfigurable computing
fixed-point arithmetic
embedded systems


Tour merging via branch-decomposition Robertson and Seymour introduced branch-width as a new connectivity invariant of graphs in their proof of the Wagner conjecture. Decompositions based on this invariant provide a natural framework for implementing dynamic-programming algorithms to solve graph optimization problems. We describe a heuristic method for finding branch-decompositions; the method is based on the eigenvector technique for finding graph separators. We use this as a tool to obtain high-quality tours for the traveling salesman problem by merging collections of tours produced by standard traveling salesman heuristics.

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


Evaluating the effects of taskindividualtechnology fit in multi-DSS models context: A two-phase view We investigate the effects of individual difference with the framework of taskindividualtechnology fit under a multi-DSS models context using a two-phase view. Our research question is: in addition to tasktechnology fit, does individualtechnology fit or individualtask fit matter in users' attitude and performance in the multi-tasks and multi-DSS models context? We first divide the concept of taskindividualtechnology fit into three dimensions tasktechnology fit (TTF), individualtechnology fit (ITeF), and taskindividual fit (TaIF) so that we can explore mechanisms and effects of interaction among these factors (i.e., task, individual difference, and technology). We then propose a two-phase view of taskindividualtechnology fit (i.e., pre-paradigm phase and paradigm phase) based on Kuhn's concept of revolutionary science. We conducted a controlled laboratory experiment with multiple DSS models and decision-making tasks to test our hypotheses. Results confirmed our arguments that in the paradigm phase, the effects of individual differences on user attitudes toward DSS models can be ignored and that in the pre-paradigm phases individual differences play an important role. In addition, we found that effects of individual difference can be a two-blade sword: ITeF can enhance but TaIF can diminish users' attitude to DSS model (i.e., technology). Our results also suggested that different dimensions of fit may affect performance directly or indirectly.

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

dss models
two-phase view
cognitive style
task structuredness


Kalman's recognition of chaotic dynamics in designing Markov information sources Recently there have been several attempts to construct a Markov information source based on chaotic dynamics of the PLM (piecewise-linear-monotonic) onto maps. Study: however, soon informs us that Kalman's 1956 embedding of a Markov chain is to be highly appreciated. In this paper Kalman's procedure for embedding a prescribed Markov chain into chaotic dynamics of the PLM onto map is revisited and improved by using the PLM onto map with the minimum number of subintervals.

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

plm (piecewise-linear-monotonic) onto map


Development of a method using multispectral imagery and spatial pattern metrics to quantify stress to wheat fields caused by Diuraphis noxia The Russian wheat aphid, Diuraphis noxia, is an important pest of winter wheat, Triticum aestivum, and barley, Hordeum vulgare that has caused an annual economic loss estimated at over 1 billion dollars since it first appeared in the United States. The objective of this study was to determine the potential of combining multispectral imagery with spatial pattern recognition to identify and spatially differentiate D. noxia infestations in wheat fields. Multispectral images were acquired using an MS3100-CIR multispectral camera. D. noxia, drought, and agronomic conditions were identified as major causes for stresses found in wheat fields. Seven spatial metrics were computed for each stress factor. The analysis of spatial metrics quantitatively differentiated the three types of stress found within wheat fields. Detection and differentiation of wheat field stress may help in mapping stress and may have implications for site-specific monitoring systems to identify D. noxia infestations and help to target pesticide applications.

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

multispectral image
plant stress
remote sensing


Worth a thousand words: Integrating clinical photographs into an electronic medical record Technological advances have made clinical photographs ubiquitous but the tremendous value of images is often burdened by concerns that are both legitimate and unsubstantiated. Compliant photos dramatically improve patient value and should be encouraged after adequate institutional preparation. As healthcare networks continue to transition to electronic medical records, clinicians and administrators should outline reasonable policies to integrate photos safely.

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


declarative extensions of xml languages We present a set of XML language extensions that bring notions from functional programming to web authors, extending the power of declarative modelling for the web. Our previous work discussed expressions and user-defined events. In this paper, we discuss how one may extend XML by adding definitions and parameterization; complex data and data types; and reactivity, events and continuous "behaviours". We consider these extensions in the light of World Wide Web Consortium standards, and illustrate their utility by a variety of use cases.

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


a probabilistic template-based approach to discovering repetitive patterns in broadcast videos There are usually repetitive sub-segments in broadcast videos, which may be associated with high-level concepts or events, e.g., news footage, repeated scores in basketball. Unsupervised mining techniques provide generic solutions to discovering such temporal patterns in various video genres, which are currently the subject of great interests to researchers working on multimedia content analysis. In this paper, we propose a novel approach to automatically detecting repetitive patterns in a video stream. In this approach, a video stream is first transformed to a symbol sequence via the spectral clustering algorithm. After computing the transition probabilities of any two symbols in temporal evolution, we produce a set of probabilistic templates to characterize the patterns of potential interest. Finally, we verify each probabilistic template by measuring the similarities between the video sub-segments and the template. Evaluations on various sports videos show promising results.

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

repetitive pattern discovery
video mining


Influence of illumination intensity and temperature on the electrical characteristics of an Al/p-GaAs/In structure prepared by thermal evaporation The temperature and illumination intensity dependence of currentvoltage (I-V) and capacitancevoltage (C-V) characteristics of the Al/p-GaAs barrier diode were investigated. The ideality factor (n ) and zero-bias barrier height (?b0) ( ? b 0 ) were found to be strongly temperature dependent and while ?b0 ? b 0 is decreased, n is increased with decreasing temperature and illumination. The reverse biased I-V measurements under various illuminations exhibited a high photosensitivity. The values of Rs obtained from Cheungs method are decreased with increasing illumination intensity. The interface capacitance of the diode is increased with the increase of illumination intensities. The profiles of interface state density (Nss) distribution as a function of (EssEv) were extracted from the forward IV measurements by taking into account the bias dependence of the effective barrier heights (?e ? e ) for device under dark, illumination and temperature conditions. Furthermore, modified Richardson plot has a good linearity over the investigated temperature range. As a result, the electrical characteristics of diode are affected not only in illumination but also in temperature. It is evaluated that the prepared diode can be used as photocapacitance sensor in modern electronic and optoelectronic devices.

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

al/p-gaas barrier diode
illumination effect
temperature effect
electrical properties


Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs In this paper, we consider the r-dominating set problem on graphs which can be generated from the one-vertex graph by a finite number of homogeneous extensions and by attaching pendant vertices. We show that for such graphs a minimum cardinality r-dominating set can be computed in O(\V\ \E\) time; for distance-hereditary graphs-a proper subclass-we even get a linear time algorithm. Furthermore, since these graph classes are closed under adding false twins, a total dominating set can be computed in the same time bound. (C) 2001 John Wiley & Sons, 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

graph algorithms
domination problem
modular decomposition
distance-hereditary graphs


A robust cost function for stereo matching of road scenes ? We compare different cost functions for stereo matching of road scenes. We propose a new non-parametric cost function: DIFFCensus. The lowest error rate is given by the proposed function.

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

stereo vision
census transform
cross comparison census
graph cuts
matching cost comparison


rf interconnects for communications on-chip In this paper, we propose a new way of implementing on-chip global interconnect that would meet stringent challenges of core-to-core communications in latency, data rate, and re-configurability for future chip-microprocessors (CMP) with efficient area and energy overheads. We discuss the limitation of traditional RC-limited interconnects and possible benefits of multi-band RF-interconnect (RF-I) through on-chip differential transmission lines. The physical implementation of RF-I and its projected performance versus overhead as the function of CMOS technology scaling are discussed as 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

network-on-chip
rf-interconnect
chip multiprocessors


ATTITUDES OF END-USERS TOWARDS INFORMATION TECHNOLOGY IN MANUFACTURING AND SERVICE INDUSTRIES This paper proposes a conceptual framework for end-user attitudes towards information technology and defines how end-users initially develop interest in and learn about computers. Additionally, it reports the results of an empirical inquiry in two industries, based on the conceptual model. The findings suggest that end users in the manufacturing industry manifest attitudes and intentions towards computer use that differ from those of users in the service industry. The research suggests the need for consideration of industry-specific characteristics in information systems research and applications. Finally, the paper discusses managerial implications of the findings and recommends that managers integrate end-user and computer technology.

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

end user attitudes
computer use and decision making
end users and promotion
end users and information technology
end users in manufacturing sector
end users in service sector
purpose of end user computer usage
end users and motivation


Sampling-free linear Bayesian update of polynomial chaos representations We present a fully deterministic approach to a probabilistic interpretation of inverse problems in which unknown quantities are represented by random fields or processes, described by possibly non-Gaussian distributions. The description of the introduced random fields is given in a white noise framework, which enables us to solve the stochastic forward problem through Galerkin projection onto polynomial chaos. With the help of such a representation the probabilistic identification problem is cast in a polynomial chaos expansion setting and the Bayes linear form of updating. By introducing the Hermite algebra this becomes a direct, purely algebraic way of computing the posterior, which is comparatively inexpensive to evaluate. In addition, we show that the well-known Kalman filter is the low order part of this update. The proposed method is here tested on a stationary diffusion equation with prescribed source terms, characterised by an uncertain conductivity parameter which is then identified from limited and noisy data obtained by a measurement of the diffusing quantity.

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

polynomial chaos expansion
linear bayesian update
kalman filter

minimum squared error estimate
minimum variance estimate


Investigating the properties of adaptation in a computational model of the olfactory sensory neuron We developed a detailed computational model of an olfactory sensory neuron to investigate the functional properties of the sensory adaptation in the peripheral olfactory system. The model consists of a system of first-order differential equations that describes the time course of the different components considered, including the biochemical pathways in the cilia and the electrical compartments that represent the cilia, the dendrite, dendritic knob, the cell body and the initial segment of the axon. We used different protocols of stimulation to investigate the response of the model to constant or transient stimuli. In this way, it was possible to explore the occurrence of two types of adaptation mediated by distinct processes in the same cell. The results of the model suggest that different respiratory frequencies during sniffing behavior could be used by animals as a mechanism to avoid adaptation to odorants at the receptor cell level.

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

computational model
olfactory sensory neuron
sniffing
adaptation


Effects of case removal in prognostic models Constructing and updating prognostic models that learn from training cases is a time-consuming task. The more compact, and yet informative, the training sets a re, the faster one can build and properly evaluate such models. We have compared different regression diagnostic methods for selection and removal of training cases in prognostic models. Univariate determinations were performed using classical regression diagnostic statistics. Multivariate determinations were performed using (1) a sequential "backward" selection of cases, and (2) a non-sequential genetic algorithm. The genetic algorithm produced final models that kept few cases and retained predictive capability. A genetic algorithm approach to case selection may be better suited for guiding removal of cases in training sets than a univariate or a sequential multivariate approach, possibly because of its ability to defect sets of cases that are influential en bloc but may not be sufficiently influential when considered in isolation.

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

variable selection
regression diagnostics


privilege federation between different user profiles for service federation Service providers often incorporate services other than the main ones they offer for user convenience. Such service providers need to exchange personal attributes with other providers they interact with and link user accounts. Some service providers, however, can not federate the accounts, because the subject of them is not always same; for instance, one subject of an account is a user of a personal profile, and the other of another account is the one of a family profile. Thus a mechanism is needed to federate user profiles. To address this issue, we propose a privilege federation framework for personal attribute exchange between different user profiles. This framework enables the providers to exchange attributes based on identity federation established by privilege exchange. With it, they can determine what attributes to be exchanged with the privilege assertion and protect privacy information against leakage.

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


A design pattern for industrial robot: User-customized configuration engineering We propose a new design pattern for industrial robot engineering and customization. We develop a user-customized configuration approach. We present an open-engineering platform for implementing the proposed design pattern. We compare the new design pattern and the traditional one based on system dynamics model. The results show higher performance in terms of cost and quality for the proposed design pattern.

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

user-customization
configuration design platform
simulation


temporal and spatial idleness exploitation for optimal-grained leakage control Runtime leakage control techniques, such as power gating (PG) and body biasing (BB), have been applied in a coarse-grained manner traditionally. In order to enable more aggressive leakage reduction, researchers are seeking ways to control leakage with finer granularity. Our research proposes two novel methods, namely circuit clustering for temporal and spatial idleness exploitation, to systematically reduce the granularity of leakage control and improve leakage reduction. Another strength of this paper is the quantitative study of leakage saving and control cost by leakage control with different granularity. With our quantitative study, designers can make the trade-off between leakage saving and control cost, and decide the optimum granularity for leakage control. A heuristic algorithm has been developed to automate the two circuit clustering methods and determine the optimum granularity for any given circuit. The analysis and experiments of this paper is mainly based on RBB. They are also applicable to PG by modifying the cost function.

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

granularity
power gating
leakage control
idleness exploitation
body biasing


Collaborative recommending using formal concept analysis We show how Formal Concept Analysis (FCA) can be applied to Collaborative Recommenders. FCA is a mathematical method for analysing binary relations. Here we apply it to the relation between users and items in a collaborative recommender system. FCA groups the users and items into concepts, ordered by a concept lattice. We present two new algorithms for finding neighbours in a collaborative recommender. Both use the concept lattice as an index to the recommender's ratings matrix. Our experimental results show a major decrease in the amount of work needed to find neighbours, while guaranteeing no loss of accuracy or coverage. (c) 2006 Elsevier B.V. All rights reserved.

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

collaborative filtering
recommender systems


Exploring how perceived threat and self-efficacy contribute to college students use and perceptions of online mental health resources We explored how psychosocial factors predict use of web mental health services. Undergraduate students reported on their use and perception of online resources. Perceived vulnerability predicted use of online services. Self-efficacy moderated the link between perceived severity and use of resources. Self-efficacy predicted more favorable impressions of online resources.

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


Wyner-Ziv video coding for wireless lightweight multimedia applications Wireless video communications promote promising opportunities involving commercial applications on a grand scale as well as highly specialized niche markets. In this regard, the design of efficient video coding systems, meeting such key requirements as low power, mobility and low complexity, is a challenging problem. The solution can be found in fundamental information theoretic results, which gave rise to the distributed video coding (DVC) paradigm, under which lightweight video encoding schemes can be engineered. This article presents a new hash-based DVC architecture incorporating a novel motion-compensated multi-hypothesis prediction technique. The presented method is able to adapt to the regional variations in temporal correlation in a frame. The proposed codec enables scalable Wyner-Ziv video coding and provides state-of-the-art distributed video compression performance. The key novelty of this article is the expansion of the application domain of DVC from conventional video material to medical imaging. Wireless capsule endoscopy in particular, which is essentially wireless video recording in a pill, is proven to be an important application field. The low complexity encoding characteristics, the ability of the novel motion-compensated multi-hypothesis prediction technique to adapt to regional degrees of temporal correlation (which is of crucial importance in the context of endoscopic video content), and the high compression performance make the proposed distributed video codec a strong candidate for future lightweight (medical) imaging applications.

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

wyner-ziv coding
hash-based motion estimation


Software Process Improvement as organizational change: A metaphorical analysis of the literature Software Process Improvement (SPI) typically involves rather complex organizational changes. Acknowledging that managers can approach these changes in quite different ways, this paper addresses the following question: what perspectives do the research literature offer on SPI as organizational change and how is this knowledge presented and published? To answer this question, we analyzed SPI research publications with a main emphasis on organizational change using Gareth Morgan's organizational metaphors (1996) as analytical lenses. In addition, we characterized each article along the following dimensions: knowledge orientation (normative versus descriptive), theoretical emphasis (high versus low), main audience (practitioner versus academic), geographical origin (Scandinavia, the Americas, Europe, or the Asia-Pacific), and publication level (high versus low ranked journal). The review demonstrates that the literature as a whole is firmly grounded in both theory and practice, it appropriately targets both practitioner and academic audiences, and Scandinavian and American researchers are the main contributors. However, the distribution of articles across Morgan's metaphors is uneven and reveals knowledge gaps that present new avenues for research. The current literature offers important insights into organizational change in SPI when viewed through machine, organism, flux and transformation, and brain metaphors. Practitioners may use these articles to guide SPI initiatives. In contrast, the impact of culture, dominance, psychic prison, and politics in SPI has only received scant attention. We argue that these perspectives could offer important additional insights into the challenges involved in managing SPI. Researchers are therefore advised to engage in new SPI research based on one or more of these perspectives. Overall, the paper offers research directions and management lessons, and it provides a roadmap to help identify insights and specific articles related to SPI as organizational change.

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

software process improvement
organizational change
metaphors

literature review
images of organization


PRUNING ARTIFICIAL NEURAL NETWORKS USING NEURAL COMPLEXITY MEASURES This paper describes a new method for pruning artificial neural networks, using a measure of the neural complexity of the neural network. This measure is used to determine the connections that should be pruned. The measure computes the information-theoretic complexity of a neural network, which is similar to, yet different from previous research on pruning. The method proposed here shows how overly large and complex networks can be reduced in size, whilst retaining learnt behaviour and fitness. The technique proposed here helps to discover a network topology that matches the complexity of the problem it is meant to solve. This novel pruning technique is tested in a robot control domain, simulating a racecar. It is shown, that the proposed pruning method is a significant improvement over the most commonly used pruning method Magnitude Based Pruning. Furthermore, some of the pruned networks prove to be faster learners than the benchmark network that they originate from. This means that this pruning method can also help to unleash hidden potential in a network, because the learning time decreases substantially for a pruned a network, due to the reduction of dimensionality of the network.

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

pruning
neural networks
neural complexity


Modified hysteretic damping model applied to Timoshenko timber beams Prediction of material damping in Timoshenko beams. The prediction model comprises two parts, one for bending, and one for shear. Fitted values of loss factors are obtained for two types of wood.

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

timber structure
timoshenko beam
complex stiffness
shear damping
bending damping


Compiling C-like Languages to FPGA Hardware: Some Novel Approaches Targeting Data Memory Organization This paper describes our approaches to raise the level of abstraction at which hardware suitable for accelerating computationally intensive applications can be specified. Field-programmable gate arrays are becoming adopted as a computational platform by the high-performance computing community, but there are challenges to extract maximum performance from these devices. Unlike other approaches, our focus is on data memory organization and input-output bandwidth considerations, which are the typical stumbling block of existing hardware compilation schemes. We describe our approaches, which are based on formal optimization techniques, and present some results showing the advantage of exposing the interaction between data memory system design and parallelism extraction to the compiler.

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


Modeling of tracked mobile manipulators with consideration of trackterrain and vehiclemanipulator interactions This paper presents a systematic method to establish the kinematics model for a tracked mobile manipulator on firm grounds, with consideration of the interactive motions between the tracks and the terrain, as well as those between the tracked vehicle and the onboard manipulator. Kinematics analysis is essential for real-time pose estimation and online autonomous navigation of tracked mobile manipulators. Furthermore, to improve the effectiveness of motion planning, and to simulate or control tracked mobile manipulators, a reliable kinematics model is required. However, kinematics modeling for a tracked mobile manipulator is complicated by the fact that there are infinite number of contact points between the tracks and the terrain, which makes slippage unavoidable. The trackterrain and vehiclemanipulator interactions make the problem even more complicated as the motion of the onboard manipulator and the centrifugal forces during moderate or high speed motion give rise to transfer of the load distribution, which will affect the longitudinal and lateral tractive forces and the resistance. Also, the motion of the mobile platform contributes to the inertial forces of the manipulator, and the trackterrain interactive forces help balance the gravity as well as the manipulation forces. The developed kinematics modeling approach is presented on the basis of a tracked mobile manipulator in our laboratory, but the forward kinematics analysis method, and the trackterrain and vehiclemanipulator interaction analysis algorithm are general, and can be used for any tracked mobile manipulators with little modification. This work lays a solid foundation for autonomous control, online slippage estimation, real-time traction optimization as well as tip-over prediction and prevention of tracked mobile manipulators.

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

kinematics
tracked vehicle
mobile manipulator


Orderings of uniquely colorable hypergraphs ? For a mixed hypergraph H=(X,C,D) H = ( X , C , D ) , where C C and D D are set systems over the vertex set X X , a coloring is a partition of X X into color classes such that every C?C C ? C meets some class in more than one vertex, and every D?D D ? D has a nonempty intersection with at least two classes. A vertex-order x1,x2,,xn x 1 , x 2 , , x n on X X (n=|X| n = | X | ) is uniquely colorable if the subhypergraph induced by {xj:1?j?i} { x j : 1 ? j ? i } has precisely one coloring, for each i i (1?i?n 1 ? i ? n ). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique.

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

algorithmic complexity
uniquely colourable
vertex-order


Electrical characterization of gadolinium oxide deposited by high pressure sputtering with in situ plasma oxidation Gd2O3 obtained by high pressure sputtering from Gd target with plasma oxidation on Si. We have obtained a high k dielectric with good electrical properties. Gate conductances and gate leakage currents are low. Almost negligible hysteresis and frequency dispersion are observed.

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

plasma oxidation
high pressure sputtering
gadolinium oxide
high k dielectric


Scalable location estimation using smart antennas in wireless sensor networks For Wireless Sensor Networks (WSNs), although many localization techniques have been proposed, development of effective localization techniques for sensor nodes, which do not require any hardware or computational burdens on them, continues to be a challenging task. Motivated by this need, this paper proposes a new location discovery scheme in WSNs so called Sectoral Sweeper based Location Estimation (SSLE). Sectoral Sweeper (SS) relies on integration of smart antenna processing capability only at a central node. By expanding the SS scheme, the key idea in the SSLE is to perform two dimensional (azimuth and range) sweeping process over a given sensor field with beamforming capable central node followed by range estimation and direction estimation algorithms. It does not require any hardware or computational load at tiny sensor nodes. Performance evaluation of the SSLE is given in terms of localization error, response message statistics, and complexity analysis for grid and randomly deployed sensor node scenarios under various sweeping conditions. The SSLE performance is also compared with the Centroid method. The advantage of the SSLE is that it is applicable to environments with hard-to-access sensor deployment scenarios and that desired localization accuracy can be obtained by properly adjusting sweeping parameters.

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

localization
smart antenna
sectoral sweeper
centroid


Dynamically adaptive channel reservation scheme for cellular networks In personal communications networks (PCN) supporting network-wide handoffs, new and handoff requests compete for connection resources in both mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. In general, most of the previously proposed schemes for radio channel allocation in cellular networks reduce handoff call blocking probability substantially at the expense of increasing the new call blocking probability by giving higher priority to handoff calls over new calls in admission control. This reduces the total admitted traffic and results in inefficient utilization of wireless channels. The tradeoff between the new and handoff calls blocking probabilities should be defined on importance basis. In this paper, we propose a performance metric equation that makes a trade off between the two probabilities depending on the network preferences. Using this equation, we study the performance of various proposed channel reservation schemes. Also in this paper, a new dynamically adaptive channel reservation scheme (DACRS) is developed and compared with other schemes proposed in the literature. The DACRS assigns handoff-reserved channels to new calls depending on the locality principle in which the base station with the help of location estimation algorithms in the mobile location center predicts the position of the mobile terminal. Eventually, the DACRS is designed to improve channel utilization while satisfying the QoS of the calls. As will be shown analytically and through simulation, the DACRS outperforms current reservation schemes and results in more statistical gain, and powerful channel utilization.

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

wireless network
handoff problem
personal communication networks
mobility
performance analysis


Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity In multiuser wireless systems, dynamic resource allocation between users and over time significantly improves efficiency and performance. In this two-part paper, we study three types of rapacity regions for fading broadcast channels and obtain their corresponding optimal resource allocation strategies: the ergodic (Shannon) capacity region, the zero-outage capacity region, and the outage capacity region with nonzero outage. In Part I, we derive the ergodic capacity region of an M -user fading broadcast channel for code division (CD), time division (TD), and frequency division (FD), assuming that both the transmitter and the receivers have perfect channel side information (CSI), It is shown that by allowing dynamic resource allocation, TD, FD, and CD without successive decoding have the same ergodic capacity region, while optimal CD has a larger region. Optimal resource allocation policies are obtained for these different spectrum-sharing techniques. A simple suboptimal policy is also proposed for TD and CD without successive decoding that results in a rate region quite close to the ergodic capacity region. Numerical results are provided for different fading broadcast channels. In Part II, we obtain analogous results for the zero-outage capacity region and the outage capacity region.

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

broadcast channels
capacity region
optimal resource allocation


On the use of random limited-scan to improve at-speed random pattern testing of scan circuits A method is proposed for improving the fault coverage that can be achieved by random patterns for circuits with scan. Under the test application scheme considered, primary input sequences are applied at-speed between scan operations. The proposed method uses limited scan operations to improve the fault coverage. Under a limited scan operation, the circuit state is shifted by a number of positions which may be smaller than the number of state variables. Limited scan operations are inserted randomly to ensure that the complete test set can be generated by a random pattern generator. Experimental results show that complete fault coverage is achieved by the proposed method, i.e., the proposed method detects all the detectable circuit faults, for all the benchmark circuits considered.

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

at-speed test application
built-in test generation
random test generation


Generic remeshing of 3D triangular meshes with metric-dependent Discrete Voronoi Diagrams In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mesh with a user-defined vertex budget. Our approach can deal with a wide range of applications, from high-quality mesh generation to shape approximation. By using appropriate metric constraints, the method generates isotropic or anisotropic elements. Based on point sampling, our algorithm combines the robustness and theoretical strength of Delaunay criteria with the efficiency of an entirely discrete geometry processing. Besides the general described framework, we show the experimental results using isotropic, quadric-enhanced isotropic, and anisotropic metrics, which prove the efficiency of our method on large meshes at a low computational cost.

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

computational geometry and object modeling


The use of single-date MODIS imagery for estimating large-scale urban impervious surface fraction with spectral mixture analysis and machine learning techniques Urban impervious surface information is essential for urban and environmental applications at the regional/national scales. As a popular image processing technique, spectral mixture analysis (SMA) has rarely been applied to coarse-resolution imagery due to the difficulty of deriving endmember spectra using traditional endmember selection methods, particularly within heterogeneous urban environments. To address this problem, we derived endmember signatures through a least squares solution (LSS) technique with known abundances of sample pixels, and integrated these endmember signatures into SMA for mapping large-scale impervious surface fraction. In addition, with the same sample set, we carried out objective comparative analyses among SMA (i.e. fully constrained and unconstrained SMA) and machine learning (i.e. Cubist regression tree and Random Forests) techniques. Analysis of results suggests three major conclusions. First, with the extrapolated endmember spectra from stratified random training samples, the SMA approaches performed relatively well, as indicated by small MAE values. Second, Random Forests yields more reliable results than Cubist regression tree, and its accuracy is improved with increased sample sizes. Finally, comparative analyses suggest a tentative guide for selecting an optimal approach for large-scale fractional imperviousness estimation: unconstrained SMA might be a favorable option with a small number of samples, while Random Forests might be preferred if a large number of samples are available.

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

impervious surface
modis
random forests
regression tree
spectral mixture analysis


Some remarks on sets of communicating sequential processes in topological rough set framework Communicating Sequential Processes (CSP), is a theoretical framework for discussing concurrent phenomena [7]. In this note, we begin an investigation into the nature of sets of communicating sequential processes. Sets of sequential processes arise naturally when one considers processes contained within specified bounds which provides their approximate description. Adopting the trace formalism, we may express those bounds in a natural way by means of containment of traces. We endow families of process traces and a fortiori, families of processes, with a rough set topology. We show in this note that basic operators on processes preserve exact sets of processes and they are non-expansive (i.e., non-destructive in terminology of [7]) with respect to the metric D on rough sets [6], [5], restricted to exact sets of processes.

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

communicating sequential processes
exact sets of processes

constructive and non-destructive mappings on exact sets of processes


Information exchange architecture based on software defined networking for cooperative intelligent transportation systems Recently, the software defined networking (SDN) technologies have been highlighted because these are not only the alternative to improve the legacy network efficiency, but also the power source to develop the new business ecosystem. Most of all, the SDN technique can be used in several areas because it is one of the software technology. However, the SDN technology is applied partially in the cloud computing until now because it is corresponded well with the cloud computing concepts and applications. Although these are very natural and common instances so far, the problem is very narrow the applying scope of SDN. Due to the fact that cooperative intelligent transportation system (C-ITS) has many variable features, it is very suitable for applying SDN technique. So, we propose the new information exchange architecture, which is based on the SDN technology, for C-ITS. The proposed architecture has improved the throughput than the legacy systems and can be adjusted the traffic flow based on the necessity. The proposed information exchange architecture can be transmitted data, which can be handled various information like as the road traffic flows, tracking the car, based on the interworking data forwarding scheme. Based on these schemes, the proposed architecture outperforms than the legacy systems in several aspects, and we have verified these results through the computer simulations using the OPNet.

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

information exchange architecture
interworking
sdn


A Grid platform for the European Civil Protection e-Infrastructure: the Forest Fires use scenario During the full cycle of the emergency management, Civil Protection operative procedures involve many actors belonging to several institutions playing different roles. In this context the sharing of information is a vital requirement to make correct and effective decisions. Therefore a European-wide technological infrastructure providing a distributed and coordinated access to different kinds of resources (data, information, services, expertise, etc.) could enhance existing Civil Protection applications and even enable new ones. In the recent years Grid technologies have reached a mature state providing a platform for secure and coordinated resource sharing between the participants in the so-called Virtual Organizations. Moreover the Earth and Space Sciences Informatics provide the conceptual tools for modelling the geospatial information shared in Civil Protection applications during its entire life cycle. Therefore a European Civil Protection e-infrastructure could be based on a Grid platform enhanced with Earth Sciences specific services. However Civil Protection applications stress the requirements of Earth Sciences research applications, for example in terms of real-time support. Therefore a set of high-level services specifically tailored for such applications must be built on top of the Grid platform. As a result of a requirement analysis, the FP6 project CYCLOPS has proposed an architectural framework for the future European Civil Protection e-Infrastructure. In this architecture a layer of high-level services tailored to Civil Protection applications is built on top of the EGEE Grid middleware. This architectural approach has been tested implementing a prototype of a grid-enabled RISICO, the application for wild fire risk assessment used by the Italian Civil Protection.

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


Multilevel/AES-LDPCC-CPFSK with channel equalization over WSSUS multipath environment In this paper, in order to ensure secure and robust communication, a new type of data encryption and error correction mechanism called Multilevel/Advanced Encryption Standard-Low Density Parity Check Coded-Continuous Phase Frequency Shift Keying (Multilevel/AES-LDPCC-CPFSK) is carried out. Here, we have chosen AES for data encryption, LDPC codes for error correction and CPFSK for modulation. We have evaluated error performance of this scheme over Wide-Sense Stationary Uncorrelated Scattering (WSSUS) multipath channels with channel equalization. We have simulated 5-level AES, 2-level LDPC for 4CPFSK and 16CPFSK over WSSUS channels modeled by Cooperation in the field of Science & Technology, Project #207 (COST207). We have concluded that our proposed structure has promising results compared to Turbo Codes for all SNR values in WSSUS channels.

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

advanced encryption standard
low density parity check codes
continuous phase frequency shift keying


the labor economics of paid crowdsourcing We present a model of workers supplying labor to paid crowdsourcing projects. We also introduce a novel method for estimating a worker's reservation wage - the key parameter in our labor supply model. We tested our model by presenting experimental subjects with real-effort work scenarios that varied in the offered payment and difficulty. As predicted, subjects worked less when the pay was lower. However, they did not work less when the task was more time-consuming. Interestingly, at least some subjects appear to be "target earners," contrary to the assumptions of the rational model. The strongest evidence for target earning is an observed preference for earning total amounts evenly divisible by 5 , presumably because these amounts make good targets. Despite its predictive failures, we calibrate our model with data pooled from both experiments. We find that the reservation wages of our sample are approximately log normally distributed, with a median wage of $1.38/hour. We discuss how to use our calibrated model in applications.

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

human computation
amazon's mechanical turk


Pricing for utility-driven resource management and allocation in clusters Users perceive varying levels of utility for each different job completed by the cluster. Therefore, there is a need for existing cluster resource management systems (RMS) to provide a means for the user to express its perceived utility during job submission. The cluster RMS can then obtain and consider these user-centric needs such as Quality-of-Service requirements in order to achieve utility-driven resource management and allocation. We advocate the use of computational economy-for this purpose. In this paper, we describe an architectural framework for a utility-driven cluster RMS. We present a user-level job submission specification for soliciting user-centric information that is used by the cluster RMS for making better resource allocation decisions. In addition, we propose a dynamic pricing function that the cluster owner can use to determine the level of sharing within a cluster. Finally, we define two user-centric performance evaluation metrics: Job QoS Satisfaction and Cluster Profitability for measuring the effectiveness of the proposed pricing function in realizing utility-driven resource management and allocation.

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

utility computing
market model
service pricing
cluster computing