Human factors in GIScience laboratory at the Pennsylvania State University The human factors in GIScience Laboratory (Human Factors Lab) of The Pennsylvania State Universitys Department of Geography is located in University Park, PA (USA). University Park and bordering State College, PA are found in the heart of PA between the cities of New York City, NY, Philadelphia, PA, and Pittsburgh, PA. The laboratory is directed by Dr. Alexander Klippel and is part of the GeoVISTA Center. The Human Factors Lab contributes to Penn State Geographys strong tradition as a leader in research on map perception, spatial cognition, and behavior in spatial environments. This report focuses upon basic research topics in spatial cognition, including: (1) perceptual and cognitive factors in map symbolization and design, (2) the creation of cognitively ergonomic route directions for next generation location based services (LBS), (3) You-Are-Here maps and the creation of a sense of place through map-like representations, (4) the conceptualization and representation of dynamic phenomena (i.e., geographic movement pattern), and (5) the relationship between linguistic and non-linguistic conceptualization.

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

spatial cognition
giscience
human factors


The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros In this paper, we give the convergence analysis of the Euler-like iterative method for the simultaneous inclusion of all simple real or complex zeros of a polynomial. The established initial conditions provide the safe convergence of the considered method and the fourth order of convergence. These conditions are computationally verifiable, which is of practical importance. A procedure for the choice of initial inclusion disks is also given. (C) 2000 Elsevier Science Ltd. All rights reserved.

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


using a software testing technique to identify registers for partial scan implementation Scan design has been widely used to ease test generation process for digital circuits. Although full scan approach results in high fault coverage while reducing ATPG effort, it introduces area and performance overheads that are most times unacceptable. Hence, partial scan is a commonly used technique to improve testability of sequential circuits while respecting design constraints. In this paper, we present a method to select sequential elements (flip-flops) to compose a partial scan chain. We use a software engineering technique to identify internal variables or signals of the circuit's behavioral description that have low observability. Experiments demonstrate that our approach achieves a high fault coverage including few flip-flops in the scan chain. Moreover, comparative results show that, for complex circuits, proposed technique is more efficient than some classical methods in selecting flip-flops to compose partial scan.

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

partial scan design
hardware testing
testability improvement
automatic test generation
hardware description language


Fuzzy answer sets approximations Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answer sets are between these bounds. This paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. The operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answer sets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool.

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

fuzzy logic
search-space pruning operators


Parallel queue processor architecture based on produced order computation model This paper proposes novel produced order parallel queue processor architecture. To store intermediate results, the proposed system uses a first-in-first-out (FIFO) circular queue-registers instead of random access registers. Datum is inserted in the queue-registers in produced order scheme and can be reused. We show that this feature has profound implications in the areas of parallel execution, programs compactness, hardware simplicity and high execution speed. Our performance evaluations show a significant performance improvement (e.g., 10 to 26% decrease in program size and 6 to 46% decrease in execution time over a range of benchmark programs) when compared with the earlier proposed architecture.

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

high performance
circular queue-registers
design


Theoretical basis of parameter tuning for finding optima near the boundaries of search spaces in real-coded genetic algorithms Studies on parameter tuning in evolutionary algorithms are essential for achieving efficient adaptive searches. This paper discusses parameter tuning in real-valued crossover operators theoretically. The theoretical analysis is devoted to improving robustness of real-coded genetic algorithms (RCGAs) for finding optima near the boundaries of bounded search spaces, which can be found in most real-world applications. The proposed technique for crossover-parameter tuning is expressed mathematically, and thus enables us to control the dispersion of child distribution quantitatively. The universal applicability and effect have been confirmed theoretically and verified empirically with five crossover operators. Statistical properties of several practical RCGAs are also investigated numerically. Performance comparison with various parameter values has been conducted on test functions with the optima placed not only at the center but also in a corner of the search space. Although the parameter-tuning technique is fairly simple, the experimental results have shown the great effectiveness.

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

real-parameter evolutionary algorithms
parameter setting
bounded search space
numerical optimization
finiteness


decoupling local variable accesses in a wide-issue superscalar processor Providing adequate data bandwidth is extremely important for a wide-issue superscalar processor to achieve its full performance potential. Adding a large number of ports to a data cache, however, becomes increasingly inefficient and can add to the hardware complexity significantly. This paper takes an alternative or complementary approach for providing more data bandwidth, called the data-decoupled architecture. The approach, with support from the compiler and/or hardware, partitions the memory stream into two independent streams early in the processor pipeline, and feeds each stream to a separate memory access queue and cache. Under this model, the paper studies the potential of decoupling memory accesses to program's local variables that are allocated on the run-time stack. Using a set of integer and floating-point programs from the SPEC95 benchmark suite, it is shown that local variable accesses constitute a large portion of all the memory references, while their reference space is very small, averaging around 7 words per (static) procedure. To service local variable accesses quickly, two optimizations, fast data forwarding and access combining, are proposed and studied. Some of the important design parameters, such as the cache size, the number of cache ports, and the degree of access combining, are studied based on simulations. The potential performance of the proposed scheme is measured using various configurations, and it is concluded that the scheme can become a viable alternative to building a single multi-ported data cache.

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

streams
benchmark
design
performance
pipeline
paper
access
model
superscalar processor
processor
cache
space
size
architecture
bandwidth
data
support
complexity
hardware
scheme

simulation
forward
floating point
timing
combinational
locality
variability
partition
program
optimality
data cache
configurability
memorialized
compilation


a new framework for efficient password-based authenticated key exchange Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts. To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction off ers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability (UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al.

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


Hotspots Elimination and Temperature Flattening in VLSI Circuits This paper proposes a new solution to the problem of eliminating hotspots from gate-level netlists as well as examines the effects of timing constraints on the temperature reduction and the overall temperature flattening on the chip. Our core technique consists of three steps. First, a thermal analysis is carried out for logic netlists. (The netlists are assumed to be either isolated or embedded in a larger system with macro-cells.) We then apply a new technique, called isothermal logic partitioning technique (LP-temp), to the netlists, which essentially builds isothermal logic clusters for the netlists and splits each of the logic clusters exceeding the maximum allowed temperature through its hottest point. This will enlarge a contact point for the hotspot to cool down. Finally, the entire system is replaced using a custom designed temperature-aware floorplanner so that the temperature across the entire system is reduced and flattened. We have developed a thermal-aware design flow, integrating our thermal-aware logic partitioning technique with a timing and thermal-aware floorplanner. Two cases were analyzed: (tight timing) LP-temp combined with the timing and thermal-aware floorplanner, where the partitioned units by LP-temp are replaced locally considering a tight timing budget (5% timing degradation); (loose timing) LP-temp combined with thermal-aware replacement, considering a loose timing budget (10% timing degradation). From experimentations using a set of benchmark designs, it is confirmed that our temperature reduction technique is effective, generating designs with an average of 5.54% and 9.9% more reduction of peak temperature (on average) for the cases of tight and loose timing than that of the designs by a conventional thermal-aware floorplanner without using LP-temp, respectively. We also analyzed the effect of our proposed technique on field-programmable gate arrays (FPGAs) in order to contrast its effectiveness on systems with hotspots on hardmacros. Results show that our technique can reduce the temperature in these systems on average 3.40% and 6.61 % for the case of loose and tight timing constraints respectively compared to the thermal-aware floorplanner without using LP-temp.

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

hotspots
temperature flattening
temperature reduction


Shocks to G7 stock prices have a permanent effect? Evidence from panel unit root tests with structural change d There is a plethora of studies that investigate evidence for the behaviour of stock prices using univariate techniques for unit roots. Whether or not stock prices are characterised by a unit root have implications for the efficient market hypothesis, which asserts that returns of a stock market are unpredictable from previous price changes. The extant literature has found mixed evidence on the integrational properties of stock prices. In this paper, for the first time, we provide evidence on the unit root hypothesis for G7 stock price indices using the Lagrangian multiplier panel unit root test that allows for structural breaks. Our main finding is that stock prices are stationary processes, inconsistent with the efficient market hypothesis. (c) 2007 Published by Elsevier B.V. on behalf of IMACS.

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

lagrangian multiplier panel unit root test


abstract functions and lifetime learning in genetic programming for symbolic regression Typically, an individual in Genetic Programming (GP) can not make the most of its genetic inheritance. Once it is mapped, its fitness is immediately evaluated and it survives only until the genetic operators and its competitors eliminate it. Thus, the key to survival is to be born strong. This paper proposes a simple alternative to this powerlessness by allowing an individual to tune its internal nodes and going through several evaluations before it has to compete with other individuals. We demonstrate that this system, Chameleon , outperforms standard GP over a selection of symbolic regression type problems on both training and test sets; that the system works harmoniously with two other well known extensions to GP, that is, linear scaling and a diversity promoting tournament selection method; that it can benefit dramatically from a simple cache; that adding to functions set does not always add to the tuning expense; and that tuning alone can be enough to promote smaller trees in the population. Finally, we touch upon the consequences of ignoring the effects of complexity when focusing on just the tree sizes to induce parsimony pressure in GP populations.

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

linear scaling
symbolic regression
lifetime learning
genetic programming


development of a navigation system with a route planning algorithm using body-worn sensors There are many kinds of events where participants converge and move around freely looking at points of interest. Since in these event spaces, the participants go where they want, some problems may arise for the event manager such as people staying in one area too long or congestion that occurs at specific attractions. Therefore, we propose here a new navigation system that has a route planning algorithm to satisfy the objectives of the event manager. In an actual test of our system, we found that the participants' actions were in line with the objectives of the event manager. Moreover, we also found that our system performs better by using wearable computing technologies because detailed information on participants is acquired.

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

wearable computing
navigation system
route planning algorithm


Author gender identification from text ? Text is still the most prevalent Internet media type. Examples of this include popular social networking applications such as Twitter, Craigslist, Facebook, etc. Other web applications such as e-mail, blog, chat rooms, etc. are also mostly text based. A question we address in this paper that deals with text based Internet forensics is the following: given a short text document, can we identify if the author is a man or a woman? This question is motivated by recent events where people faked their gender on the Internet. Note that this is different from the authorship attribution problem. In this paper we investigate author gender identification for short length, multi-genre, content-free text, such as the ones found in many Internet applications. Fundamental questions we ask are: do men and women inherently use different classes of language styles? If this is true, what are good linguistic features that indicate gender? Based on research in human psychology, we propose 545 psycho-linguistic and gender-preferential cues along with stylometric features to build the feature space for this identification problem. Note that identifying the correct set of features that indicate gender is an open research problem. Three machine learning algorithms (support vector machine, Bayesian logistic regression and AdaBoost decision tree) are then designed for gender identification based on the proposed features. Extensive experiments on large text corpora (Reuters Corpus Volume 1 newsgroup data and Enron e-mail data) indicate an accuracy up to 85.1% in identifying the gender. Experiments also indicate that function words, word-based features and structural features are significant gender discriminators.

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

gender identification
logistic regression
decision tree
support vector machine


Evaluation of DIABNET, a decision support system for therapy planning in gestational diabetes DIABNET is a knowledge-based system designed to aid doctors with therapy planning in gestational diabetes. The system core is a qualitative model, implemented by a Causal Probabilistic Network, that is able to detect the insulin effectiveness on a daily basis. DIABNET analyses monitoring data and proposes quantitative changes in insulin therapy and qualitative diet modifications. This paper proposes an evaluation methodology to assess the system performance when working in a real scenario. The methodology manages the absence of a gold standard and includes: a subjective analysis based on questionnaires and an objective analysis based on a quantitative comparison of the systems and experts proposals. The paper also shows the results of two experiments in which expert diabetologists evaluated the therapeutical advice provided by DIABNET during the follow up of 9 patients with gestational diabetes. DIABNET detected the need of a therapy modification in 92% of the cases showing its appropriateness for automatic alarm generation. Around 80% of the proposals were accepted by experts. The evaluation results are encouraging and allow characterisation of the systems performance when proposing therapy modifications. Evaluation in its turn helps to refine the knowledge managed by DIABNET and enables us to look towards the further clinical use of DIABNET as a decision tool in gestational diabetes integrated in a telemedicine service.

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

evaluation
therapy planning
gestational diabetes

subjective questionnaires
causal probabilistic networks


Efficient parallelization of a dynamic global vegetation model with river routing The LPJ dynamic global vegetation and hydrology model with river routing is implemented on a compute cluster in order to reduce the overall computation time. In order to achieve this, a parallel algorithm had to be developed for the river routing part of the LPJ code. It can be shown that the run time of the parallel LPJ model scales well with the number of parallel tasks, even getting a super-linear speedup for 8128 tasks. The sequential part of the model code can be estimated to be only 0.16%. This offers the opportunity, for example, to apply the model to find optimal climate change mitigation/adaptation paths requiring a multitude of subsequent simulation runs. The algorithm can also be used for networks with a different topology than river routing networks.

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

dgvm
hydrological model
carbon cycle
parallel computing


A comprehensive study of energy efficiency and performance of flash-based SSD Use of flash memory as a storage medium is becoming popular in diverse computing environments. However, because of differences in interface, flash memory requires a hard-disk-emulation layer, called FTL (flash translation layer). Although the FTL enables flash memory storages to replace conventional hard disks, it induces significant computational and space overhead. Despite the low power consumption of flash memory, this overhead leads to significant power consumption in an overall storage system. In this paper, we analyze the characteristics of flash-based storage devices from the viewpoint of power consumption and energy efficiency by using various methodologies. First, we utilize simulation to investigate the interior operation of flash-based storage of flash-based storages. Subsequently, we measure the performance and energy efficiency of commodity flash-based SSDs by using microbenchmarks to identify the block-device level characteristics and macrobenchmarks to reveal their filesystem level characteristics. (C) 2011 Elsevier B.V. All rights reserved.

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


Recognition of handwritten Bengali characters: a novel multistage approach A multistage scheme for the recognition of handwritten Bengali characters is introduced. An analysis of the Bengali character set has been carried out to isolate specific high-level features that can help in forming smaller sub-groups within the character set. This analysis demonstrates how detection of these various high-level features might help formulate successful multistage OCR design. A multiple expert decision combination hierarchy has been exploited to achieve higher performance from the proposed multi-stage framework.

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

handwritten bengali character recognition


Proximity-Based Frameworks for Generating Embeddings from Multi-Output Data This paper is about supervised and semi-supervised dimensionality reduction (DR) by generating spectral embeddings from multi-output data based on the pairwise proximity information. Two flexible and generic frameworks are proposed to achieve supervised DR (SDR) for multilabel classification. One is able to extend any existing single-label SDR to multilabel via sample duplication, referred to as MESD. The other is a multilabel design framework that tackles the SDR problem by computing weight (proximity) matrices based on simultaneous feature and label information, referred to as MOPE, as a generalization of many current techniques. A diverse set of different schemes for label-based proximity calculation, as well as a mechanism for combining label-based and feature-based weight information by considering information importance and prioritization, are proposed for MOPE. Additionally, we summarize many current spectral methods for unsupervised DR (UDR), single/multilabel SDR, and semi-supervised DR (SSDR) and express them under a common template representation as a general guide to researchers in the field. We also propose a general framework for achieving SSDR by combining existing SDR and UDR models, and also a procedure of reducing the computational cost via learning with a target set of relation features. The effectiveness of our proposed methodologies is demonstrated with experiments with document collections for multilabel text categorization from the natural language processing domain.

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

dimensionality reduction
supervised
multilabel classification
embeddings


Bounded control of an underactuated biomimetic aerial vehicle-Validation with robustness tests Flapping wing Micro Aerial Vehicles (FMAVs) have recently emerged as a promising challenge lying on the progress of the avionics technologies. The present paper deals with the development of simple control laws for an embedded implementation on a biomimetic MAV, aiming to control its attitude and position. The control laws are bounded, taking into consideration the amplitude bounds of the control angles characterizing the flapping wings movement. In order to validate the control laws, a simplified model having a simple wing kinematic parametrization and considering only the main aerodynamic forces and torques is proposed. The stability of the controller is shown in simulations using a diptera insect model. The robustness of the proposed controller is emphasized through different robustness tests. They concern mainly, model and aerodynamic parameters errors, and aim to validate the considered simplifications in the model. (C) 2012 Elsevier B.V. All rights reserved.

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


Manager communication and workplace trust: Understanding manager and employee perceptions in the e-world Today's business environment is populated with individuals who are digitally connected to clients, contractors, managers, and employees. Traditionally, the ways and behaviors of managers had developed and thrived within face-to-face work environments, but as computer-mediated technologies continue to change the boundaries of the business community, permit alternative worksites to increase, and the traditional workday to disappear, the role of the manager has changed. This article focuses on the communication behaviors between managers and their employees, and how these behaviors have changed as digital communication methods have become mainstream within organizations today. The variables of interest are manager communication and workplace trust. The intended outcome is to uncover the expectations that have yet to be agreed upon within the manageremployee e-relationship.

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

communication
trust
employee perceptions


An efficient resource allocation for maximizing benefit of users and resource providers in ad hoc grid environment Ad hoc grids allow a group of individuals to accomplish a mission that involves computation and communication among the grid components, often without fixed structure. In an ad hoc grid, every node in the network can spontaneously arise as a resource consumer or a resource producer at any time when it needs a resource or it possesses an idle resource. At the same time, the node in ad hoc grid is often energy constrained. The paper proposes an efficient resource allocation scheme for grid computing marketplace where ad hoc grid users can buy usage of memory and CPU from grid resource providers. The ad hoc grid user agents purpose to obtain the optimized quality of service to accomplish their tasks on time with a given budget, and the goal of grid resource providers as profit-maximization. Combining perspectives of both ad hoc grid users and resource providers, the paper present ad hoc grid resource allocation algorithm to maximize the global utility of the ad hoc grid system which are beneficial for both grid users and grid resource providers. Simulations are conducted to compare the performance of the algorithms with related work.

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

ad hoc grid
resource allocation
maximizing benefit


ACOPHY: A Simple and General Ant Colony Optimization Approach for Phylogenetic Tree Reconstruction We introduce ACOPHY, a novel framework to apply Ant Colony Optimization (ACO) for phylogenetic reconstruction. ACOPHY overcomes a main drawback of other attempts to reconstruct phylogenies by defining a compact ACO graph that is nicely coupled with the tree space. The proposed graph allows the ants to walk globally through the tree space. Thus, ACOPHY can be generally applied to all well-known optimality criteria in phylogenetics. We compared ACOPHY with the traditional phylogenetic method PHYLIP and obtained slightly better results. This is promising since our current implementation of ACOPHY is still at the proof of concept stage. We list a number of points where ACOPHY can be improved. Once the improvements are integrated, we hope for competitive performance against other recent phylogenetic inference methods.

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

phylogenetic reconstruction
ant colony optimization


adapting rule-based model descriptions for simulating in continuous and hybrid space Space plays an ever increasing role in cell biological modeling and simulation. This ranges from compartmental dynamics, via mesh-based approaches, to individuals moving in continuous space. An attributed, multi-level, rule-based language, ML-Space, is presented that allows to integrate these different types of spatial dynamics within one model. The associated simulator combines Gillespie's method, the Next Subvolume method, and Brownian dynamics. This allows the simulation of reaction diffusion systems as well as taking excluded volume effects into account. A small example illuminates the potential of the approach in dealing with complex spatial dynamics like those involved in studying the dynamics of lipid rafts and their role in receptor co-localization.

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

spatial simulation
model description languages


Virtual certificates and synthetic certificates: new paradigms for improving public key validation The certificate paradigm is applied recursively to obtain the public keys of a number of Certification Authorities and, accordingly, to obtain the public keys of a number of final entities. Thus, validation of the authorized public key of a party in a network transaction is commonly based on processing the certificate chain descended from a trusted root issuer, involving non-negligible time and cost. Those chains become long in communications between large organizations, which is the typical case of e-commerce and e-government applications. The process of validation of extensive chains introduces performance problems in two aspects: signature verification and revocation checking. That is, the repeated processing of long chains of certificates creates severe efficiency problems. This fact causes that most of the advantages provided by Public Key Infrastructures (PKIs) are not conveniently exploited. In this paper we analyze the scenarios in which large volumes of digitally signed transactions between commercial entities exist. These cases require of interoperation among PKIs. We show that solutions available in those scenarios still involve processing of too long chains of certificates, either at the receiving computer or by an outsourced entity. For this reason, we propose new concepts of virtual certificate and synthetic certificate for faster and less costly processing of certificate chains. In this way, communications in a certificate-based intercommunity can be highly improved. We also show how these types of certificates can be applied in practice. (C) 2003 Elsevier B.V. All rights reserved.

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


A partial spline approach for semiparametric estimation of varying-coefficient partially linear models A semiparametric method based on smoothing spline is proposed for the estimation of varying-coefficient partially linear models. A simple and efficient method is proposed, based on a partial spline technique with a lower-dimensional approximation to simultaneously estimate the varying-coefficient function and regression parameters. For interval inference, Bayesian confidence intervals were obtained based on the Bayes models for varying-coefficient functions. The performance of the proposed method is examined both through simulations and by applying it to Boston housing data.

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

partial spline
partially linear
smoothing spline

bayesian confidence interval
penalized likelihood
varying coefficients


marble track music sequencers for children We discuss the development of electronically enhanced construction kits for marble tracks that act as music sequencers for music education of young children. Marbles rolling along the tracks trigger sound events to produce the playback of musical notes and songs. Re-arrangeable tangible elements correspond to timing, durations and pitches of notes and thus allow electronic music sequencing by means of haptic programming. This approach to early music education separates the different tasks of melody making and instrument manipulation, aiming at faster success and fewer frustrating learning experiences. We present two marble track designs: an earlier one, which is based on a central synthesizer and a system-wide communication bus and a second one based on multiple decentralized synthesizer units. We discuss previous work in the field of machine-readable models and haptic programming and report on experiences with both sequencer designs including user tests of the second design.

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

haptic programming
sequencers
marble track
music education


a framework for analysis of data freshness Data freshness has been identified as one of the most important data quality attributes in information systems. This importance increases particularly in the context of distributed systems, composed of a large set of autonomous data sources, where integrating data having different freshness may lead to semantic problems. There are various definitions of data freshness in the literature, depending on the applications where they are used, as well as different metrics to measure them. This paper presents an analysis of these definitions and metrics and proposes a taxonomy based upon the nature of the data, the type of application and the synchronization policies underlying the multi-source information system. We analyze, in terms of the taxonomy, the way freshness is defined and used in several types of systems and we present some open research problems in the field of data freshness evaluation.

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

quality evaluation
multi-source information systems


Investigation of the eTS Evolving Fuzzy Systems Applied to Real Estate Appraisal The evolving Takagi-Sugeno algorithm (eTS) was employed to built models assisting with property valuation on the basis of real-world data drawn from a cadastral system, registry of sales transactions, and cadastral map. The eTS performance was compared with evolutionary fuzzy systems implemented in KEEL. Statistical analysis of the results was performed using nonparametric tests followed by post hoc procedures designed for multiple comparisons. The results confirmed the advantages of the eTS algorithm.

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

evolving fuzzy systems
property valuation
keel

ets learning algorithm
feature selection
gis


A differential approach to solve the inverse eigenvalue problem derived from a neural network We consider the problem of designing a general additive neural network which possesses prescribed equilibria. The relation between this design problem and a problem of generating a matrix with specified eiegenvalues, which maps a given set of vectors of another given set, is investigated. The obtained inverse eigenvalue problem is then solved using a gradient flow approach. Working with discretisation of systems of differential equations allows to preserve the original dimension of the problem and could give the possibility of constructing adaptive schemes faster than algebraic one.

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

inverse eigenvalue problem
gradient flow approach
neural network


the square root law does not require a linear key Square root laws are theorems about imperfect steganography, embedding which fails to preserve all statistical properties of covers. They show that, in various situations, capacity of covers grows only with the square root of the available cover size. In a paper given at this conference last year [14], we showed an important caveat: when the sender's and recipient's shared embedding key determines the embedding path, its length must be at least linear in the size of the hidden payload to avoid their enemy exhausting over all possible sets of locations. It was left open to show that a linear key is sufficient. There is no necessity, however, for the recipient to know exactly which locations were changed during the embedding process. In this paper we remove that condition, allowing the embedder to combine more than one cover location to convey one bit of payload. As long as the embedder lives beneath the classic square root law bound, we can do more than prove the sufficiency of a linear key: we can even show that asymptotically perfect steganographic security is possible with no key at all. Furthermore, by computing Steganographic Fisher Information, we can show that the keyless embedding tends to perfect security at least as fast as the "ideal" embedding, which requires an unfeasibly large key to spread payload uniformly at random over the cover. Finally, we show asymptotic perfect security of a simple matrix embedding, which allows payload capacity of order ? n log n to be achieved.

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


Expertise seeking: A review Expertise seeking involves selecting people for consultation about info needs. People, e.g. work-group colleagues, are among the most frequent sources. Seekers balance quality and accessibility in their selection of sources. Source selection is affected by task-related, seeker-related and contextual factors. Multiple barriers complicate, degrade, or prevent expertise seeking.

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

expert seeking
people finding
information seeking


Control of uncertain highly nonlinear biological process based on TakagiSugeno fuzzy models To design and implement an automatic regulation of wastewater pre-treatment. To guarantee a level of pollution fixed on the outlet side of the sewer collector. To use TakagiSugeno fuzzy method for on line approximation of nonlinear functions. To implement the developed method for monitoring and control of the plant.

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

wastewater model
fuzzy logic modeling
nonlinear adaptive control
lyapunov theory


Simulation of surface-tension-driven interfacial flow with smoothed particle hydrodynamics method The method for simulation of surface-tension-driven interfacial flow with smoothed particle hydrodynamics is developed. The calculation of surface tension force is based on the interface reconstruction. The boundary particles for each fluid are detected dynamically. The position of the interface particles are specified in the middle of the boundary particles of each fluid. According to the positions of the interface particles, the interface can be reconstructed. The normal vector and curvature of the interface can be obtained. Then the surface tension force is calculated according to the reconstructed interface. Finally the surface tension force is transferred to the SPH particles near the interface. The accuracy and efficiency of the developed method are investigated. Drop deformation in shear flow, oscillation of square drop, head-on binary collision, and off-center binary collision are simulated. The developed method can be applied to the simulation of surface-tension-driven interfacial flow with high density ratio of up to 797.88 and high viscosity ratio of up to 55.56. (C) 2012 Elsevier Ltd. All rights reserved.

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

interface reconstruction
surface tension
interfacial flow
smoothed particle hydrodynamics


Glutamatergic Transmission in Opiate and Alcohol Dependence Both the nucleus accumbens (NAcc) and central amygdala (CeA) are thought to play roles in tolerance to, and dependence on, abused drugs. Although our past studies in rat brain slices suggested a role for NMDA receptors (NMDARs) in NAcc neurons in the effects of acute and chronic opiate treatment, the cellular and molecular mechanisms remained unclear. Therefore, we examined the effects of morphine dependence on electrophysiological properties of NMDARs in freshly isolated NAcc neurons and on expression of mRNA coding for NR2A-C subunits using single-cell RT-PCR. Chronic morphine did not alter the affinity for NMDAR agonists glutamate, homoquinolinate, or NMDA, but decreased the affinity of the coagonist glycine. Chronic morphine altered the NMDAR inhibition by two NMDAR antagonists, 7-Cl-kynurenate and ifenprodil, but not that by d-APV or Mg2+. Chronic morphine accelerated the NMDA current desensitization rate in NAcc neurons. In single-cell RT-PCR, chronic morphine predominantly reduced the number of neurons expressing multiple NR2 subunits. Ethanol also alters NMDARs. We found that low ethanol concentrations (IC50= 13 mM) inhibited NMDA currents and NMDA-EPSPs in most NAcc neurons in a slice preparation. NAcc neurons from ethanol-dependent rats showed enhanced NMDA sensitivity. In CeA neurons, acute ethanol decreased (by 1025%) non-NMDA- and NMDA-EPSPs in most neurons. In CeA neurons from ethanol-dependent rats, acute ethanol decreased the non-NMDA-EPSPs to the same extent as in nave rats, but inhibited (by 3040%) NMDA-EPSPs significantly more than in controls, suggesting sensitization to ethanol. Preliminary studies with microdialysis and real-time PCR analysis support this idea

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

nucleus accumbens
central amygdala
chronic morphine

chronic ethanol
electrophysiology
pharmacology
rt-pcr
nmda receptor


On the scalability of rendezvous-based location services for geographic wireless ad hoc routing Geographic routing protocols allow stateless routing by taking advantage of the location information of mobile nodes and thus are highly scalable. A central challenge in geographic routing protocols is the design of scalable distributed location services that track mobile node locations. A number of location services have been proposed, but little is known about the relative performance of these location services. In this paper, we perform a detailed performance comparison of three rendezvous-based location services that cover a range of design choices: a quorum-based protocol (XYLS) which disseminates each nodes location to O ( N ) nodes, a hierarchical protocol (GLS) which disseminates each nodes location to O(logN) nodes, and a geographic hashing-based protocol (GHLS) which disseminates each nodes location to O(1) nodes. We present a quantitative model of protocol overheads for predicting the performance tradeoffs of the protocols for static networks. We then analyze the performance impact of mobility on these location services. Finally, we compare the performance of routing protocols equipped with the three location services with two topology-based routing protocols, AODV and DSR, for a wide range of network sizes. Our study demonstrates that when practical mobile ad hoc network (MANET) sizes are considered, the constants matter more than the asymptotic costs of location service protocols. In particular, while GLS scales better asymptotically, GHLS transmits fewer control packets and delivers more data packets than GLS in MANETs of sizes considered practical today and in the near future. Additionally, in contrast to the complex GLS design, the simplicity of GHLS provides significant resilience to performance degradation from mobility. Finally, although XYLS has a comparable packet delivery ratio to GHLS, it achieves this ratio with a higher overhead.

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

geographic routing
location services
manets
scalability


Finding logos in real-world images with point-context representation-based region search Finding logos in the real-world images is a challenging task due to their small size, simple shape, less texture and clutter background. In this paper, through visual logo analysis with different types of features, we propose a novel framework for finding visual logos in the real-world images. First, we exploit the contextual shape and patch information around feature points, merge them into a combined feature representation (point-context). Considering the characteristics of logos, this kind of fusion is an effective enhancement for the discriminability of single point features. Second, to eliminate the interference of the complex and noisy background, we transfer the logo recognition to a region-to-image search problem by segmenting real-world images into region trees. A weak geometric constraint based on regions is encoded into an inverted file structure to accelerate the search process. Third, we apply global features to refine initial results in the re-ranking stage. Finally, we combine each region score both in max-response and accumulate-response mode to obtain the final results. Performances of the proposed approach are evaluated on both our CASIA-LOGO dataset and the standard Flickr logos 27 dataset. Experiments and comparisons show that our approach is superior to the state-of-the-art approaches.

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


Artificial vision by multi-layered neural networks: Neocognitron and its advances The neocognitron is a neural network model proposed by Fukushima (1980). Its architecture was suggested by neurophysiological findings on the visual systems of mammals. It is a hierarchical multi-layered network. It acquires the ability to robustly recognize visual patterns through learning. Although the neocognitron has a long history, modifications of the network to improve its performance are still going on. For example, a recent neocognitron uses a new learning rule, named add-if-silent, which makes the learning process much simpler and more stable. Nevertheless, a high recognition rate can be kept with a smaller scale of the network. Referring to the history of the neocognitron, this paper discusses recent advances in the neocognitron. We also show that various new functions can be realized by, for example, introducing top-down connections to the neocognitron: mechanism of selective attention, recognition and completion of partly occluded patterns, restoring occluded contours, and so on.

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

hierarchical network
bottom-up and top-down
modeling neural networks


pd method and socio-political context of the development organization Little research is done on how socio-political factors intertwine with method implementation. This paper is a follow up of a reported PD method implementation failure four years ago. For branch related reasons, the implementation fell short. This article tells the story of what happened then. To our surprise, the original reason for introducing the PD method called Personas had disappeared during our one and a half year attempt at method implementation. Internal socio-political developments had solved the power struggle that the PD method was aimed to mediate. We propose that it is time to expand the method focus with studies revealing more about the socio-political internal climate and contingencies in today's software development practices that influence method introduction and adaptation.

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

software engineering
interaction design
industrial cooperation
socio politics
research methodology
participatory design


orthogonal transform processor cores based on discrete cosine transform (abstract only) The conception of orthogonal transforms (OT) processors design is proposed. It is based on the choice of discrete cosine transform to serve basic transform for all other OT. The algorithms of OT calculating based on cosine transform are developed. An architecture of the multifunctional OT processor based on cosine transform and the architectures of the single-functional OT processors based on cosine transform are proposed.

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

digital signal processing
specialized vlsi


exhaustive path tracing with paris traceroute Traceroute [2] is used to learn the path between two machines in the internet. Uses range from the diagnosis of network problems to the assemblage of internet maps. Unfortunately, traceroute measurements can be inaccurate and incomplete when the measured route traverses a load balancer.

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


Conceptual modeling for data and knowledge management In order to exploit knowledge embedded in databases and to migrate from data to knowledge management environments, conceptual modeling languages must offer more expressiveness than traditional modeling languages. This paper proposes the conceptual graph formalism as such a modeling language. It shows through an example and a comparison with Telos, a semantically rich knowledge modeling language, that it is suited for that purpose. The conceptual graph formalism offers simplicity of use through its graphical components and small set of constructs and operators. It allows easy migration from database to knowledge base environments. Thus, this paper advocates its use.

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

conceptual modeling for knowledge management


presenting a day in the life of video-based requirements engineering In today's global economy, innovation through technology is a key driver for a sustainable economic growth and competitiveness. Siemens as a global player possesses a tremendous portfolio of innovative technologies. In an effort to highlight some of these technologies, Siemens has organized an Internet-based event for selected industrial partners. The event comprised a virtual world showcasing five technological innovation areas, including video-based requirements engineering (VBRE). Attendees were connected to the virtual tradeshow and could visit manned booths, choose which technology presentation to attend, and even follow a guided tour. The film we present shows VBRE immersed in a virtual world where the avatars of participants are guided in a tour, can interact with the technology, and experience the effects in real-time. A presenter first gives an introductory talk along with animated slides explaining key technology elements. During the tour, questions are asked by participants and answered by the presenter akin to following a tour guide in a museum. The avatars then interact with the virtual objects from the demonstrated VBRE technology. The film shows all of these aspects and in particular demonstrates how several different technologies are harmoniously brought together.

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

mixed reality
multimedia
uml
virtual reality
video-based requirements engineering
3d animation models
requirements elicitation
open-sim
second life


Optical, electrical and structural properties of spin-on MSQ low-k dielectrics over a wide temperature range Looking onto application of low-k and ultra low-k materials within FEOL, high temperature load is one of the major challenges. But also temperature ranges below standard curing conditions are of special interest, e.g. for integration of transparent low-k materials into optical devices due to their small refractive index. In this work the development of the optical, electrical and structural properties of two spin-on MSQ low-k dielectrics over a low-temperature range has been investigated. Incorporation of porosity due to porogen removal for LK2000 causes a different behaviour of the electrical and optical parameters compared to ACCUGLASS within the low-temperature range. Both materials show unstable properties which normalize by getting closer to the standard curing conditions. Hydrophobizity of the surfaces is developing at curing temperatures of 400C and higher, what agrees to the lowering of the leakage current density. Optical, electrical and structural parameters fluctuate very sensitive on changing the curing temperature, so usage of those materials within a low-temperature range requires a very stable curing process to achieve reproducible material properties.

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


Measuring convergence of China's ICT industry: An inputoutput analysis The convergence of the information and communication technology (ICT) industry is ubiquitous phenomena, which can be classified from the supply/demand side or complementary/substitute relation. According to the classification, the paper measures the convergence of China's ICT sectors based on its 2002 inputoutput (IO) table, including five manufacturing sectors and two service sectors. Then, using IO table cross-entropy updating technique, the paper investigates the convergence evolution of four ICT manufacturing sectors from 1997 to 2002. The research finds the following conclusions. In 2002, the supply side convergence of manufacturing sectors was higher than that of service sectors, while service sectors featured a higher degree of the demand side convergence. The year of 2002 witnessed high complementary convergence between some China's ICT manufacturing and service sectors. During the period from 1997 to 2002, the supply side convergence dominated the convergence of China's ICT industry, while the demand-side convergence experienced little structural change.

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

industry convergence
inputoutput technique
cross-entropy updating
china's ict industry


crawling english-japanese person-name transliterations from the web Automatic compilation of lexicon is a dream of lexicon compilers as well as lexicon users. This paper proposes a system that crawls English-Japanese person-name transliterations from the Web, which works a back-end collector for automatic compilation of bilingual person-name lexicon. Our crawler collected 561K transliterations in five months. From them, an English-Japanese person-name lexicon with 406K entries has been compiled by an automatic post processing. This lexicon is much larger than other similar resources including English-Japanese lexicon of HeiNER obtained from Wikipedia.

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

automatic lexicon compilation
mining transliteration pairs
person name


Algebraic theory of probabilistic processes In this paper we extend de Nicola and Hennessy's testing theory to deal with probabilities. We say that two processes are testing equivalent if the probabilities with which they pass any test are equal. We present three alternative semantic views of our testing equivalence. First, we introduce adequate extensions of acceptance sets (inducing an operational characterization) and acceptance trees (inducing a denotational semantics). We also present a sound and complete axiomatization of our testing equivalence. So, this paper represents a complete study of the adaptation of the classical testing theory for probabilistic processes. (C) 2002 Elsevier Science Inc. All rights reserved.

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

probabilistic process algebras
probabilistic testing semantics


Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach During the last decades, many studies have been conducted on multicast routing in mobile ad hoc networks (MANET) and a host of algorithms have been proposed. In existing algorithms, the mobility characteristics are assumed to be constant, and so they do not scale well when the mobility parameters are not deterministic. To the best of our knowledge no work has been done on multicast routing when the mobility parameters are stochastic, while in realistic applications these parameters vary with time. In this paper, we propose a mobility-based multicast routing algorithm for wireless MANETs wherein the mobility characteristics are stochastic and unknown. The proposed algorithm estimates the expected relative mobility of each host, by sampling its movement parameters in various epochs, to realistically predict its motion behavior, and takes advantage of the Steiner connected dominating set to form the virtual multicast backbone. To do this, in this paper, a stochastic version of the minimum Steiner connected dominating set problem in weighted network graphs, where the relative mobility of each host is considered as its weight is initially introduced. Then, a distributed learning automata-based algorithm is designed to solve this problem. The designed algorithm is proposed for multicast routing in wireless mobile Ad-hoc networks. The experiments show the superiority of the proposed multicast routing algorithm over the existing methods in terms of the packet delivery ratio, multicast route lifetime, and end-to-end delay. We present a strong convergence theorem in which the convergence of the proposed distributed learning automata-based algorithm to the optimal solution is proved. It is shown that the most stable multicast route is found with a probability as close as to unity by the proper choice of the parameters of the distributed learning automata. (C) 2009 Elsevier B.V. All rights reserved.

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

multicast routing
steiner connected dominating set
distributed learning automata


The Network Workbench: network simulation software for academic investigation of Internet concepts Simulation offers significant advantages as a basis for academic projects in computer networking. Because many unimportant details can be abstracted away, and also because simulations can be completely repeatable, it is possible to address the same concepts more quickly than is possible with actual networks. At the same time, students who program a protocol for a network simulator come to understand the protocol much better than if they learn only from reading and lectures. This paper reports on a new network simulator, the Network Workbench, which is intended for use in the academic environment. It is based on discrete event simulation and structured around a five-layer stack abstracted from the Internet protocols (TCP/IP family). While the Workbench is less powerful than some tools used for investigation of larger networks or more complex protocols, it has compensating advantages. Its use can be learned quickly and it is sufficiently powerful, comprehensive, and extensible to allow investigation of a considerable range of problems. The Workbench, which is available to the academic community under no-cost license, includes a set of protocol programming exercises for introductory networking courses and it also has proved usable for more advanced student research projects. This paper describes the philosophy behind the Workbench, gives a brief outline of its history, explains its internal structure, and describes its use in computer network teaching and research.

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


Federating queries in SPARQL 1.1: Syntax, semantics and evaluation ? Given the sustained growth that we are experiencing in the number of SPARQL SPARQL endpoints available, the need to be able to send federated SPARQL queries across these has also grown. To address this use case, the W3C SPARQL SPARQL working group is defining a federation extension for SPARQL 1.1 which allows for combining graph patterns that can be evaluated over several endpoints within a single query. In this paper, we describe the syntax of that extension and formalize its semantics. Additionally, we describe how a query evaluation system can be implemented for that federation extension, describing some static optimization techniques and reusing a query engine used for data-intensive science, so as to deal with large amounts of intermediate and final results. Finally we carry out a series of experiments that show that our optimizations speed up the federated query evaluation process.

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

sparql 1.1
distributed data management
distributed query processing
rdf


Hough transform neural network for pattern detection and seismic applications Hough transform neural network is adopted to detect the line pattern of direct wave and the hyperbolic pattern of reflection wave in a one-shot seismogram. We use time difference from point to hyperbola and line as the distance in the pattern detection of seismic direct and reflection waves. This distance calculation makes the parameter learning feasible. One set of parameters represents one pattern. Many sets of parameters represent many patterns. The neural network can calculate the distances from point to many patterns as total error. The parameter learning rule is derived by gradient descent method to minimize the total error. The network is applied to three kinds of data in the experiments. One is the line and hyperbolic pattern in the image data. The second is the simulated one-shot seismic data. And the last is the real one-shot seismic data. Experimental results show that lines and hyperbolas can be detected correctly in three kinds of data. The method can also tolerate certain level of noise data. The detection results in the one-shot seismogram can improve the seismic interpretation and further seismic data processing.

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

hough transform neural network
reflection wave

seismic pattern detection
hyperbolic pattern detection


A framework for the design of bank communications systems The development of electronic financial markets is moving rapidly. Banks are moving towards electronic banking in order to gain a prominent place in the emerging electronic world. The development of a robust and secure communications infrastructure is a key factor to building up an electronic banking system. In this paper, a framework is provided for the design of bank communications systems. The key issues of high availability, traffic prioritization and security are discussed and a framework is presented for the design of bank communications systems that focuses on these issues. (C) 2003 Elsevier B.V. All rights reserved.

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

electronic banking
bank communications systems
high availability
traffic prioritization
security


A simple method for implicitizing rational curves and surfaces This paper presents a simple method for converting rational parametric equations of curves and surfaces into implicit equations. The method proceeds via writing out the implicit polynomial F of estimated degree with indeterminate coefficients ui, substituting the rational expressions for the given parametric curve or surface into F to yield a rational expression g/h in the parameter s (or s and t), equating the coefficients of g in terms of s (and t) to 0 to generate a sparse, partially triangular system of linear equations in ui with constant coefficients, and finally solving the linear system for ui. If a nontrivial solution is found, then an implicit polynomial is obtained; otherwise, one repeats the same process, increasing the degree of F. Our experiments show that this simple method is efficient. It performs particularly well in the presence of base points and may detect the dependency of parameters incidentally.

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


ObjectAction Complexes: Grounded abstractions of sensorymotor processes This paper formalises ObjectAction Complexes (OACs) as a basis for symbolic representations of sensorymotor experience and behaviours. OACs are designed to capture the interaction between objects and associated actions in artificial cognitive systems. This paper gives a formal definition of OACs, provides examples of their use for autonomous cognitive robots, and enumerates a number of critical learning problems in terms of OACs.

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

robotics
grounding
reasoning about action and change
execution monitoring
machine learning


Two techniques to improve the precision of a demand-driven null-dereference verification approach We propose two novel extensions to a base flow-sensitive backwards analysis. First: a way to skip difficult constructs soundly. Second: a way to account for calls to Collections APIs soundly and efficiently. We have evaluated our approach on large programs. Its efficiency is excellent. It has significantly higher precision than the analysis on which it is based.

dataflow analysis
weakest pre-conditions


Efficient glossy global illumination with interactive viewing The ability to perform interactive walkthroughs of global illumination solutions including glossy effects is a challenging open problem. In this paper we overcome certain limitations of previous approaches. We first introduce a novel, memory- and compute-efficient representation of incoming illumination, in the context of a hierarchical radiance clustering algorithm. We then represent outgoing radiance with an adaptive hierarchical basis, in a manner suitable for interactive display. Using appropriate refinement and display strategies, we achieve walkthroughs of glossy solutions at interactive rates for non-trivial scenes. In addition, our implementation has been developed to be portable and easily adaptable as an extension to existing, diffuse-only, hierarchical radiosity systems. We present results of the implementation of glossy global illumination in two independent global illumination systems.

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


Post-buckling analysis of rectangular plates comprising Functionally Graded Strips in thermal environments Description is given of a semi-analytical finite strip method for analysing the post-buckling behaviour of functionally graded rectangular plates in thermal environments where plates are under uniform, tent-like or nonlinear temperature change across the thickness. The material properties are assumed to vary through the thickness according to the power law. The formulations are based on the classical plate theory and the concept of the principle of the minimum potential energy. The NewtonRaphson method is used to solve the equilibrium equations. A range of applications are described and the numerical results are compared to the available results, wherever possible.

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

classical plate theory
functionally graded strips


Data detection in relay-based communication systems using Bayesian methods Data detection in a relay-based communication system (RCS) is challenging because its end-to-end channel, which comprises a cascade of several channels, has unique statistical characteristics. Assuming different channel conditions, in this paper, we address the problem of data detection in an RCS where one amplify-and-forward relay is used as an intermediate node between a transmitter and a receiver. Our approach is based on Bayesian methodologies in which a variant of Markov Chain Monte Carlo (MCMC) technique, known as MetropolisHasting-within-Gibbs, is applied for systems with quasi-static channel models, whereas particle filtering technique is used for systems with fast varying channels to develop joint data detection and channel estimation algorithms. By providing detailed derivations, we present two algorithms for each channel condition by formulating the transmission process of the communication systems in different ways. The effectiveness of our algorithms is demonstrated through computer simulations.

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

relay-based metropolishasting gibbs particle-filtering


An FFT-based signal identification approach for obtaining the propagation constants of the leaky modes in layered media We propose to find the propagation constants of modes in layered media by means of signal identification methods. To this effect we employ Cauchy's theorem, conformal mapping and Fast Fourier Transform (FFT) techniques to generate relevant Hankel moments, afterwards to be processed with selected signal identification algorithms. The method, terminated by a few Newton steps, provides a batch of highly accurate roots in appropriate disks or half-disks.

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

electromagnetic propagation in stratified media


achieving subspace or key security for woa using natural or circular watermarking This paper presents two watermarking schemes that are secure when considering the Watermarked content Only Attack (WOA) framework. The definition of watermark security is first recalled and the distinction between key-security and subspace- security classes for Spread Spectrum (SS) watermarking schemes is presented afterwards. Blind source separation techniques are also recalled as a tool to assess the security of a SS watermarking scheme and prove that classical SS and Improved SS are not secure within the WOA framework. To further illustrate these security issues, we next build on a new watermarking scheme called Natural Watermarking (NW). We prove it to be subspace-secure under specific hypotheses. Natural watermarking does not change the Gaussian natural distributions of the projection of each carriers. Furthermore NWprevents estimations both of the watermark subspace (subspace-security) and the different carriers (key-security). We then extend the nice properties of NW to derive the more general family of Circular Watermarking schemes which are key-secure and may offer a better robustness to AWGN attack than NW. An implementation of CW based on ISS is next proposed and comparison of bit error rates for NW, CW, SS and ISS finally draws some conclusions on the robustness cost to achieve security.

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

circular watermarking
woa
natural watermarking
watermarking


Large throw magnetic microactuator The design and fabrication of an electromagnetic MEMS actuator capable of repeatedly switching over a gap length of 100 mu m is presented. The device is to be used as a switch for radio-frequency (RF) circuits. It is based on a potcore type electromagnet and a mover suspended on a microbeam. The device was first modelled and optimised using a finite element analysis and then microfabricated. The ultra thick, negative photoresist, SU-8, was used extensively throughout the construction as: (i) an electroplating mould for the copper coils (up to four layers thick at 50 mu m per layer), (ii) the magnetic material for the pot core and mover by loading it with various powders to produce a range of magnetic properties and (iii) the actuator beams because of its low elastic modulus. The potcore has a footprint of similar to 0.8 mm(2) and for a driving current of 1.4 A (corresponding to a power dissipation of about 80 mW) generates an initial force of 0.11 mN which is sufficient to close a 100 pm gap. In this prototype form, the device could be operated for more than 104 cycles. The maximum switching distance achieved was similar to 200 mu m. (C) 2008 Elsevier Ltd. All rights reserved.

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

microactuators
microbeams
rf switch
reluctance
su-8


Encouraging infrastructure competition via the ladder of investment ? Recent discussion of regulatory interventions in telecommunications markets have considered an approach in which competitors are encouraged progressively to make investments in network assets which are less and less easily replicablethus climbing the ladder of investment. The paper proposes and illustrates methods for assessing the replicability of different assets and sets out the steps which regulators can follow in implementing the approach.

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


Visor projected helmet mounted displays technology and applications Helmet Mounted Sight and Display systems are now in service in military aircraft. Although these systems share some common features with ground based `virtual reality' systems, the military cockpit environment and the application they are used for, dictate a different approach in the design, development and qualification for military use. The primary function of the Aircrew helmet is to protect the pilot. The advent of helmet mounted displays places additional constraints on the helmet which is now an important element of the cockpit displays system, providing weapon aiming, and other information to the pilot. The design of HMDs for the military cockpit environment is therefore a demanding task if the operational benefits are to be realised without affecting pilot safety. Many designs now use the helmet visor as the display surface rather than eyepieces in front of the pilots eyes. This has resulted in a family of visor projected displays which cater for a range of requirements from simple day helmet mounted sights to wide field of view, 24 h displays. This paper provides an overview of the visor projected HMD design and technology, discusses the building blocks within a typical HMD system and describes practical implementation for several different applications.

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

helmet mounted display
night vision
helmet tracker


Building k-edge-connected neighborhood graph for distance-based data projection Neighborhood graph construction is the first step of data projection based on geodesic distances. This paper presents an approach for constructing a k-edge-connected neighborhood graph. The approach works by applying a greedy algorithm to add edges in a non-decreasing order of edge length to the neighborhood graph if end vertices of each edge are not yet k-edge-connected on the graph. The approach is applicable to a wide range of data including data distributed in clusters. It is compared with other approaches through experiments.

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

dimensionality reduction
manifold learning


Using physical context for just-in-time information retrieval Jimminy is a wearable personal note-taking and note-archival application that automatically displays notes that might be relevant to the wearer in his current environment. The system selects old notes to show on a head-up display based on the wearer's current location, people in the immediate area, and the subject-line and contents of any current notes being written. This paper describes an experiment that evaluates the usefulness of the wearer's physical context (location and people in the area) for automatically finding useful archived information. The results suggest that, while physical context can be used to discover useful archived notes, the subject and text of notes currently being entered are a much better indicator of usefulness in the personal note-taking domain.

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


Fuzzy expert system with double knowledge base for ultrasonic classification This article shows a pattern recognition method for object classification using ultrasonic sensors and a dual knowledge base fuzzy expert system. The developed system uses a pair of ultrasonic sensors for obtaining information about the object shape from the ultrasonic echo signal envelope. In order to reduce the size of the database, a set of parameters is calculated for extracting knowledge about the object. However, the information provided by ultrasonic sensors contains a very high uncertainty level. This uncertainty is caused by several environmental effects, which are very difficult to eliminate in industrial applications. Among these environment factors are the air temperature and humidity, the air movement, etc. They create variations in the proprieties of the medium and disturbances during the acoustic propagation process. The presented system has been specially designed for industrial applications, where it is very difficult to reduce these disturbances and where it is necessary to use intelligent systems with high autonomy. The fuzzy expert system proposed has a dual knowledge base, that is, a statistical knowledge located on the memberships functions, and the standard rule-based knowledge. This expert system deals with the uncertainties in the information, and it is able to generate and modify the knowledge base and the decision rules in an automatic way. Furthermore, it is able to adapt the knowledge base to the slow changes produced by disturbing factors, such as humidity and temperature. On the other hand, because this system maintains a rule-based structure it is very easy to incorporate expert human knowledge.

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


Planning the location and rating of distributed energy storage in LV networks using a genetic algorithm with simulated annealing To fix voltage rise in LV networks, DNOs traditionally reinforce LV networks. We show that the severity of the voltage problem depends on the penetration of PV. A new planning tool is produced for locating and sizing energy storage in networks. Storage is shown to be cheaper than reinforcement depending on the PV penetration. We use the tool to show that small single phase storage reduces rating/capacity.

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

distributed storage and generation
power distribution planning
genetic algorithms


Buckling analysis of shear deformable shallow shells by the boundary element method In this work a boundary element (BE) formulation for buckling problem of shear deformable shallow shells is presented. A set of five boundary integral equations are obtained by coupling two-dimensional plane stress elasticity with shear deformable plate bending (Reissner). The domain integrals appearing in the formulation (due to the curvature and due to the domain load) are transferred into equivalent boundary integrals. The BE formulation is presented as an eigenvalue problem, to provide direct evaluation of critical load factors and buckling modes. Several examples are presented. The BE results for a cylindrical shallow shell with different curvatures are compared with other numerical solutions and good agreements are obtained.

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

curved plate
buckling coefficients
shear deformable theory


A non-destructive method for the removal of residual resist in imprinted patterns In this paper we describe a bi-layer resist imprinting procedure in which the residual resist remaining after the imprint step was removed by selective dissolution. This eliminates the risk of dry etch damage to the substrate or pattern and variations in the stamp height can be accommodated. The bi-layer comprises a thin layer of Microchem LOR (A) resist with a covering layer of PMMA. Residual resist was removed by selective dissolution in CD26 developer solution and by controlling the dissolution process an undercut profile suitable for lift-off can be obtained. The paper describes several applications of the procedure including the fabrication of imprinted T-shaped metal gates and gratings.

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


Speeding Up Cycle Based Logic Simulation Using Graphics Processing Units Verification has grown to dominate the cost of electronic system design, consuming about 60% of design effort. Among several verification techniques, logic simulation remains the major verification technique. Speeding up logic simulation results in great savings and shorter time-to-market. We parallelize logic simulation using Graphics Processing Units (GPUs). In the past, GPUs were special-purpose application accelerators, suitable only for conventional graphics applications. The new generations of GPU architecture provide easier programmability and increased generality while maintaining the tremendous memory bandwidth and computational power of traditional GPUs. We develop a parallel cycle-based logic simulation algorithm that uses And Inverter Graphs (AIGs) as design representations. AIGs have proven to be an effective representation for various design automation applications, and we obtain similar benefits for speeding up logic simulation. We develop two clustering algorithms that partition the gates in the designs into independent blocks. Our algorithms exploit the massively parallel GPU architecture featuring thousands of concurrent threads, fast memory, and memory coalescing for optimizations. We demonstrate up-to 5x and 21x speedups on several benchmarks using our simulation system with the first and second clustering algorithms, respectively. Our work ultimately results in significant reduction in the overall design cycle.

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

graphics processing units (gpu)
parallel logic simulation
cycle based simulation
and inverter graph (aig)