circuit-aware architectural simulation Architectural simulation has achieved a prominent role in the system design cycle by providing designers the ability to quickly examine a wide variety of design choices. However, the recent trend in system design toward architectures that react to circuit-level phenomena has outstripped the capabilities of traditional cycle-based architectural simulators. In this paper, we present an architectural simulator design that incorporates a circuit modeling capability, permitting architectural-level simulations that react to circuit characteristics (such as latency,energy,or current draw) on a cycle-by-cycle basis. While these additional capabilities slow simulation speed, we show that the careful application of circuit simulation optimizations and simulation sampling techniques permit high levels of detail with sufficient speed to examine entire workloads.

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

circuit simulation
architectural simulation

high-performance simulation
computer system simulation


Development of novel wideband H-plane horn antennas by employing asymmetrical slots based on SIW technology In this article, a novel wideband horn antenna based on substrate integrated waveguide (SIW) technology is proposed. Design procedure is explained in details. The designed antenna consists of asymmetric radiating slots. Microstrip line is used as a transition between the 50? standard source and the proposed antenna. The proposed antenna is designed to operate from 25 to over 55GHz which exhibits 75% fractional bandwidth. Peak gain of the proposed antenna varies between 1 and 4dB in its operating band. In addition, simulated radiation performances show approximately fixed and omnidirectional radiation patterns at the range of the operating frequencies. Furthermore, whole of the proposed antenna is implemented only on a single layer substrate with dimensions of 10.4mm23.65mm1.6mm. Performances of the proposed antenna have been simulated with two different commercial software. In order to verify the design procedure and simulation results, the redesigned antenna for operation around 14GHz has been simulated, fabricated, and tested.

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

substrate integrated waveguide (siw)
wideband antennas


navigation control for mobile virtual environments In this paper, we describe a project which uses PDAs to provide an interactive experience with a virtual environment. In particular, we focus on the navigational aspects of allowing the users to move through, and view, the environment. As this system will be deployed in a museum, it was crucial that the navigation be as intuitive as possible. To that end, we developed and evaluated two prototypes: one was based purely on gesture, whilst the other used a combination of gesture and keypad. For the purposes of our application, the combination of keypad and gesture provided the most effective.

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

mobile computing
pda
virtual reality
input


An architecture for fluid real-time conversational agents: integrating incremental output generation and input processing Embodied conversational agents still do not achieve the fluidity and smoothness of natural conversational interaction. One main reason is that current system often respond with big latencies and in inflexible ways. We argue that to overcome these problems, real-time conversational agents need to be based on an underlying architecture that provides two essential features for fast and fluent behavior adaptation: a close bi-directional coordination between input processing and output generation, and incrementality of processing at both stages. We propose an architectural framework for conversational agents [Artificial Social Agent Platform (ASAP)] providing these two ingredients for fluid real-time conversation. The overall architectural concept is described, along with specific means of specifying incremental behavior in BML and technical implementations of different modules. We show how phenomena of fluid real-time conversation, like adapting to user feedback or smooth turn-keeping, can be realized with ASAP and we describe in detail an example real-time interaction with the implemented system.

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

embodied conversational agents architecture


The Hybrid Monte Carlo algorithm on parallel computers ? I give a pedagogical introduction to the generalised Hybrid Monte Carlo and related algorithms. I shall explain why they work, how their performance depends upon the number of degrees of freedom and the correlation length, and how they can be tuned to reduce critical slowing down.

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

critical slowing down
correlation length


Data dissemination using interest-tree in socially aware networking Interrelation between interests and its impact on data dissemination is explored. A layered structure is presented to model various relationships between interests. An Interest-Tree based data dissemination scheme is proposed to improve efficiency. Extensive simulations verify performance and effectiveness of the proposed scheme.

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

social awareness
community structure
user interest
tree structure


Fast k-nearest neighbor classification using cluster-based trees Most fast k-nearest neighbor (k-NN) algorithms exploit metric properties of distance measures for reducing computation cost and a few can work effectively on both metric and nonmetric measures. We propose a cluster-based tree algorithm to accelerate k-NN classification without any presuppositions about the metric form and properties of a dissimilarity measure. A mechanism of early decision making and minimal side-operations for choosing searching paths largely contribute to the efficiency of the algorithm. The algorithm is evaluated through extensive experiments over standard NIST and MNIST databases.

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

nearest neighbor classification
nonmetrics
metrics
cluster tree


?-insensitive Hebbian learning One of the major paradigms for unsupervised learning in artificial neural networks is Hebbian learning. The standard implementations of Hebbian learning are optimal under the assumptions of i.i.d. Gaussian noise in a data set. We derive ?-insensitive Hebbian learning based on minimising the least absolute error in a compressed data set and show that the learning rule is equivalent to the principal component analysis (PCA) networks learning rules under a variety of conditions. We then show that the extension of the ?-insensitive rules to nonlinear PCA (NLPCA) gives learning rules which find the independent components of a data set. Finally, we shown that using ?-insensitive minor components analysis is extremely effective at noise removal.

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

hebbian learning
noise
independent components


Text Clustering with Seeds Affinity Propagation Based on an effective clustering algorithm-Affinity Propagation (AP)-we present in this paper a novel semisupervised text clustering algorithm, called Seeds Affinity Propagation (SAP). There are two main contributions in our approach: 1) a new similarity metric that captures the structural information of texts, and 2) a novel seed construction method to improve the semisupervised clustering process. To study the performance of the new algorithm, we applied it to the benchmark data set Reuters-21578 and compared it to two state-of-the-art clustering algorithms, namely, k-means algorithm and the original AP algorithm. Furthermore, we have analyzed the individual impact of the two proposed contributions. Results show that the proposed similarity metric is more effective in text clustering (F-measures ca. 21 percent higher than in the AP algorithm) and the proposed semisupervised strategy achieves both better clustering results and faster convergence (using only 76 percent iterations of the original AP). The complete SAP algorithm obtains higher F-measure (ca. 40 percent improvement over k-means and AP) and lower entropy (ca. 28 percent decrease over k-means and AP), improves significantly clustering execution time (20 times faster) in respect that k-means, and provides enhanced robustness compared with all other methods.

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

cofeature set
unilateral feature set
significant cofeature set


A novel approach for recognition of human actions with semi-global features In this study a new approach is presented for the recognition of human actions of everyday life with a fixed camera. The originality of the presented method consists in characterizing sequences by a temporal succession of semi-global features, which are extracted from "space-time micro-volumes". The advantage of this approach lies in the use of robust features (estimated on several frames) associated with the ability to manage actions with variable durations and easily segment the sequences with algorithms that are specific to time-varying data. Each action is actually characterized by a temporal sequence that constitutes the input of a Hidden Markov Model system for the recognition. Results presented of 1,614 sequences performed by several persons validate the proposed approach.

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

action recognition
behavior recognition
hidden markov models
motion analysis


efficient web browsing on small screens A global increase in PDA and cell phone ownership and a rise in the use of wireless services have caused mobile browsing to become an important means of Internet access. However, the small screen of such mobile devices limits the usability of information browsing and searching. This paper presents a novel method that automatically adapts a desktop presentation to a mobile presentation, proceeding in two steps: detecting boundaries between different information blocks and then representing the information to fit in small screens. Distinct from other approaches, our approach analyzes both the DOM structure and the visual layout to divide the original Web page into several subpages, each of which includes closely related content and is suitable for display on the small screen. Furthermore, a table of contents is automatically generated to facilitate the navigation between different subpages. An evaluation of a prototype of our approach shows that the browsing usability is significantly improved.

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

adaptive interface for small screens
mobile web browser


An ultralightweight RFID authentication protocol with CRC and permutation Radio Frequency Identification (RFID) technology will become one of the most popular technologies to identify objects in the near future. However, the major barrier that the RFID system is facing presently is the security and privacy issue. Recently, an ultralightweight RFID authentication protocol with permutation has been proposed to provide security and prevent all possible attacks. However, it is discovered that a type of desynchronization attack can successfully break the proposed scheme. To overcome the vulnerability under the desynchronization attacks, we propose an approximate ultralightweight RFID authentication protocol which integrates the operation of the XOR operator, build-in CRC-16 function, the permutation and secret key backup technology to improve the security functions without increasing any security cost. We formally verify the security functionality of the proposed scheme by using Simple Promela Interpreter (SPIN). Analysis shows that our proposal has a strong ability to prevent existing possible attacks.

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

rfid ultralightweight permutation desynchronization spin


Assessing Finland's Wireless Valley: can the pioneering continue? Internationally, the success of Finland's Wireless Valley, i.e., the Finnish telecom/mobile cluster, has often been credited to Finnish industry competitiveness, population dispersion, and pro-technology attitudes. Yet, the number of competitors has been low, while demographic dispersion and technology attitudes have not been that different from those in other Nordic countries. In effect, the cluster performance during the second-generation rivalry has been a function of geopolitics (Finland's special relationship with Tsarist Russia and Soviet Union), public strategies (Nordic cooperation, EU strategies and Finnish liberalization in the 1970s and 1980s), and first-mover advantages (firm-level strategies of Finnish mobile vendors and operators). In the emerging 3G competition, the importance of geopolitics and public strategies has become secondary to that of the marketplace. As a result, the Finnish success drivers are dissipating in the new environment.

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

telecom innovation
mobile communication
internet development


Goal oriented adaptivity for coupled flow and transport problems with applications in oil reservoir simulations Goal oriented adaptivity has become an important and widely used technique for solving partial differential equations at a reduced computational cost. The technique is based on a computable estimate of the error in a linear functional of interest, and an adaptive strategy that improves the solution, for instance by refining the mesh locally according to the error estimator. In this paper, we extend this theory to a multi-physical setting involving a coupled set of equations. Here adaptive algorithms become even more crucial since we do not only need estimators that indicate in which part of the domain the solution needs to be improved, but also which equation contributes most to the error, and thus, needs to be solved more accurately. We derive a goal oriented error estimator for a system of coupled pressure and transport equations that serves as a basic model for oil reservoir simulation. We utilize a 2D model to present extensive numerical results, where we explain in detail how the adaptive algorithm works in practice.

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

finite element methods
duality
a posteriori error estimation


A first order method for finding minimal norm-like solutions of convex optimization problems We consider a general class of convex optimization problems in which one seeks to minimize a strongly convex function over a closed and convex set which is by itself an optimal set of another convex problem. We introduce a gradient-based method, called the minimal norm gradient method, for solving this class of problems, and establish the convergence of the sequence generated by the algorithm as well as a rate of convergence of the sequence of function values. The paper ends with several illustrating numerical examples.

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


Meditation improves self-regulation over the life span The use of meditation to improve emotion and attention regulation has a long history in Asia and there are many practitioners in Western countries. Much of the evidence on the effectiveness of meditation is either anecdotal or a comparison of long-term meditators with controls matched in age and health. Recently, it has been possible to establish changes in self-regulation in undergraduate students after only 5 days of meditation practice, allowing randomized trials comparing effects of meditation with other self-control methods such as relaxation training. Early studies took place in Chinese universities; however, similar effects have been obtained with U.S. undergraduates, and with Chinese children aged 4.5 years and older Chinese participants aged 65 years. Studies using neuroimaging techniques have shown that meditation improves activation and connectivity in brain areas related to self-regulation, and these findings may provide an opportunity to examine remediation of mental disorders in a new light.

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


Parallel smoothing of quad meshes For use in real-time applications, we present a fast algorithm for converting a quad mesh to a smooth, piecewise polynomial surface on the Graphics Processing Unit (GPU). The surface has well-defined normals everywhere and closely mimics the shape of Catmull-Clark subdivision surfaces. It consists of bicubic splines wherever possible, and a new class of patches-c-patches-where a vertex has a valence different from 4. The algorithm fits well into parallel streams so that meshes with 12,000 input quads, of which 60% have one or more non-4-valent vertices, are converted, evaluated and rendered with 9x9 resolution per quad at 50 frames per second. The GPU computations are ordered so that evaluation avoids pixel dropout.

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


Enhanced fair scheduling for IEEE 802.11e wireless LANs As wireless LANs are gaining popularity, the demand for supporting multimedia and QoS-sensitive applications becomes more important than before. Although enhancements to the legacy IEEE 802.11 MAC to support QoS mechanisms have been proposed, they suffer from unfair allocation of bandwidth between high and low priority traffic. We propose a distributed enhanced fair scheduling (EFS) scheme that can conquer the above problem. With a fast backoff mechanism in the backoff timer decrement state and by dynamically adjusting backoff intervals according to the network load, we can enhance the performance of the EFS. We have evaluated the performance of the EFS through simulation. Experimental results show that the proposed EFS has better throughput performance than DFS by 13%, lower average MAC delay than DFS by 6% and the two have nearly equal fairness. Although the enhanced distributed channel access (EDCA) in IEEE 802.11 e has better throughput and delay performance than EFS and DFS, it has very poor fairness. The contention free burst (CFB) mechanism in EDCA is the main factor that results in good throughput performance, lower average MAC delay and poor fairness. Our EFS is very suitable for applications that need strict fair bandwidth allocation, such as pay services.

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

backoff interval
ieee 802.11e
quality of service
wireless lan


a simplified approach to rushes summarization In this paper we describe methods for video summarization in the context of the TRECVID 2008 BBC Rushes Summarization task. Color, motion, and audio features are used to segment, filter, and cluster the video. We experiment with varying the segment similarity measure to improve the joint clustering of segments with and without camera motion. Compared to our previous effort for TRECVID 2007 we have reduced the complexity of the summarization process as well as the visual complexity of the summaries themselves. We find our objective (inclusion) performance to be competitive with systems exhibiting similar subjective performance.

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


3D IEM formulation with an IEM/FEM coupling scheme for solving elastostatic problems In this paper, a detailed three-dimensional infinite element methodology (IEM) formulation with an infinite element (IE)finite element (FE) coupling scheme for investigating elastostatic problems is presented. This method is equally well suited for a regular perfect domain and a domain with geometric singularity; for example, domains with cracks. In this method, the primary problem domain is subdivided into two sub-domains modeled separately using IEM and finite element method (FEM), respectively. All degrees of freedom related to the IE sub-domain, except for those associated with the coupling interface, are condensed and transformed to form a finite master IE with the master nodes on the sub-domain boundary. Finally, a symmetrical IE stiffness matrix containing only master node degrees of freedom is assembled into the system stiffness matrix for the FE sub-domain. A very fine mesh pattern can be established using these efficient numerical techniques without increasing the d.o.f.'s of the global FEM solution. Numerical examples are presented and compared with the corresponding analytical or numerical solutions to show the performance of the proposed methodology.

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

3d finite element method
3d infinite element method
iefe coupling method


The Development and Evaluation of an Eyes-Free Interaction Model for Mobile Reading Devices Research into eyes-free mobile reading devices has grown in recent years. This research has focused mainly on the image processing required by such a device, with a lower emphasis on the user interaction. In this paper, a model of a voice user interface (VUI) for a mobile reading device is presented. Three field studies with blind participants were conducted to develop and refine the model. A formal grammar is used to describe the VUI, and a stochastic Petri net was developed to model the complete user-device interaction. Evaluation and analysis of the user testing of a prototype led to empirically derived probabilities of grammar token usage for the commands that comprise the VUI

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

audio user interfaces
human computer interaction
human factors
interactive systems
modeling
speech recognition
stochastic systems
user interaces


Ball-Morph: Definition, Implementation, and Comparative Evaluation We define b-compatibility for planar curves and propose three ball morphing techniques between pairs of b-compatible curves. Ball-morphs use the automatic ball-map correspondence, proposed by Chazal et al. [1], from which we derive different vertex trajectories (linear, circular, and parabolic). All three morphs are symmetric, meeting both curves with the same angle, which is a right angle for the circular and parabolic. We provide simple constructions for these ball-morphs and compare them to each other and other simple morphs (linear-interpolation, closest-projection, curvature-interpolation, Laplace-blending, and heat-propagation) using six cost measures (travel-distance, distortion, stretch, local acceleration, average squared mean curvature, and maximum squared mean curvature). The results depend heavily on the input curves. Nevertheless, we found that the linear ball-morph has consistently the shortest travel-distance and the circular ball-morph has the least amount of distortion.

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

curve interpolation
medial axis
curve averaging
surface reconstruction from slices
ball-map


improved security in apl applications packages This paper describes an experimental augmentation of APL/360 which substantially improves the privacy and security of APL applications packages. It is based upon the concept of qualifying a name: the user may specify that the name of any variable, function, or group is to be implicity qualified by the user's sign-on number. In effect, the name becomes the private property of the user. Any referent of the name is considered a protected object, since access by other users is possible only through functions created by the user who qualified the name.

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

applications users concept object group access paper privacy effect user

variability experimentation packaging functional secure


Local Linear Transform and New Features of Histogram Characteristic Functions for Steganalysis of Least Significant Bit Matching Steganography In the context of additive noise steganography model, we propose a method to detect least significant bit (LSB) matching steganography in grayscale images. Images are decomposed into detail sub-bands with local linear transform (LLT) masks which are sensitive to embedding. Novel normalized characteristic function features weighted by a bank of band-pass filters are extracted from the detail sub-bands. A suboptimal feature set is searched by using a threshold selection algorithm. Extensive experiments are performed on four diverse uncompressed image databases. In comparison with other well-known feature sets, the proposed feature set performs the best under most circumstances.

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

steganalysis
lsb matching
local linear transform
characteristic function


Comprehensively and efficiently protecting the heap The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on computer programs. In most implementations, the heap management library keeps the heap meta-data (heap structure information) and the application's heap data in an interleaved fashion and does not protect them against each other. Such implementations are inherently unsafe: vulnerabilities in the application can cause the heap library to perform unintended actions to achieve control-flow and non-control attacks. Unfortunately, current heap protection techniques are limited in that they use too many assumptions on how the attacks will be performed, require new hardware support, or require too many changes to the software developers' toolchain. We propose Heap Server, a new solution that does not have such drawbacks. Through existing virtual memory and inter-process protection mechanisms, Heap Server prevents the heap meta-data from being illegally over-written, and heap data from being meaningfully overwritten. We show that through aggressive optimizations and parallelism, Heap Server protects the heap with nearly-negligible performance overheads even on heap-intensive applications. We also verify the protection against several real-world exploits and attack kernels.

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

computer security
heap attacks
heap security


Privacy protection for HealthGrid applications Objectives: This contribution aims at introducing the problem of privacy protection in e-Health and at describing a number of existing privacy enhancing techniques (PETs). The recognition that privacy constitutes a fundamental right is gradually entering public awareness. Because healthcare-related data are susceptible to being abused for many obvious reasons, public apprehension about privacy has focused on medical data. Public authorities have become convinced of the need to enforce privacy protection and make considerable efforts for promoting through privacy protection legislation the deployment of PETs. Methods. Based on the study of the specific features of Grid technology, ways in which PET services could be integrated in the HealthGrid are being analyzed. Grid technology aims at removing barriers between local and remote resources. The privacy and legal issues raised by the HealthGrid are caused by the transparent interchange and processing of sensitive medical information. PET technology has already proven its usefulness for privacy protection in health-related marketing and research data collection. Results: While this paper does not describe market-ready solutions for privacy protection in the HealthGrid, it puts forward several cases in which the Grid may benefit from PETs. Conclusion: Early integration of privacy protection services into the HealthGrid can lead to a synergy that is beneficial for the development of the HealthGrid itself.

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


Identifying employee competencies in dynamic work domains: Methodological considerations and a case study We present a formalisation for employee competencies which is based on a psychological framework separating the overt behavioural level from the underlying competence level. On the competence level, employees draw on action potentials ( knowledge, skills and abilities) which in a given situation produce performance outcomes on the behavioural level. Our conception is based on the competence performance approach by [Korossy 1997] and [ Korossy 1999] which uses mathematical structures to establish prerequisite relations on the competence and the performance level. From this framework, a methodology for assessing competencies in dynamic work domains is developed which utilises documents employees have created to assess the competencies they have been acquiring. By means of a case study, we show how the methodology and the resulting structures can be validated in an organisational setting. From the resulting structures, employee competency profiles can be derived and development planning can be supported. The structures also provide the means for making inferences within the competency assessment process which in turn facilitates continuous updating of competency profiles and maintenance of the structures.

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

skills management
competency management
knowledge space theory
competence-performance approach
human resource development
repertory grid technique


Ising model as test for simple random number generators Monte Carlo simulations with up to 176(5) spins show no significant deviations between four different random number generators in multispin coding, as opposed to multiplication with 16807 for one-word-per-spin coding for 32(5). Also world record sizes 1000192(2), 9984(3), 880(4) and 48(6) spins were simulated.

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


Enhancing the plausibility of law equation discovery through cross check among multiple scale-type-based models The study in the field of scientific discovery from data has been directed to the discovery of plausible law equations representing the first principles underlying objective systems. In this paper, a novel principle and an algorithm to predictively discover new scientific law equation formulae consisting of newly given quantities are proposed based on the candidate law equations governing the other quantities under current observation. The first principle-based scientific law equation formulae must follow some mathematical admissibility and consistency. These conditions enable efficient reasoning of the law equation formulae in the prediction process. The soundness and the reproducibility of the equation prediction by this approach have been tested through numerical simulations of physical examples, and, moreover, its practicality has been confirmed through a real socio-psychological analysis. The approach can discover a set of scientific law equations representing common first principles under different set of quantities, and enables to capture general scietific features of the objective system under analysis.

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

scientific equation discovery
scientific law discovery
scientific modeling
first principle
knowledge discovery


Filtering of the pressure spurious modes in P-N-P-N spectral approximations of the Stokes system In the framework of Jacobi polynomials based spectral methods, the P-N-P-N approximation of the Stokes system generally shows the drawback that the pressure kernel does not reduce to the constant field. However, this drawback goes together with the advantage that the velocity field may be perfectly solenoidal, i.e. the divergence of the velocity is the null polynomial. In this paper we suggest a filtering algorithm to recover the pressure in an efficient way. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

spectral methods
pressure spurious modes


The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices A matrix P is called a symmetric orthogonal if P = P-T = P-1. A matrix X is said to be a generalised bisymmetric with respect to P if X = X-T = PXP. It is obvious that any symmetric matrix is also a generalised bisymmetric matrix with respect to I (identity matrix). By extending the idea of the Jacobi and the Gauss-Seidel iterations, this article proposes two new iterative methods, respectively, for computing the generalised bisymmetric (containing symmetric solution as a special case) and skew-symmetric solutions of the generalised Sylvester matrix equation Sigma(l)(i=1) A(i)YB(i) = C, (including Sylvester and Lyapunov matrix equations as special cases) which is encountered in many systems and control applications. When the generalised Sylvester matrix equation has a unique generalised bisymmetric (skew-symmetric) solution, the first (second) iterative method converges to the generalised bisymmetric (skewsymmetric) solution of this matrix equation for any initial generalised bisymmetric (skew-symmetric) matrix. Finally, some numerical results are given to illustrate the effect of the theoretical results.

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

generalised sylvester matrix equation
iterative method
generalised bisymmetric matrix

convergence
skew-symmetric matrix
symmetric orthogonal matrix


Random texture models for material structures We consider the construction and properties of some basic random structure models (point processes, random sets and random function models) for the description and for the simulation of heterogeneous materials. They can be specialized to three dimensional Euclidean space. Their implementation requires the use of image analysis tools.

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

random structures
boolean model
boolean random functions
dead leaves model


A matrix-free, implicit, incompressible fractional-step algorithm for fluid-structure interaction applications In this paper we detail a fast, fully-coupled, partitioned fluid-structure interaction (FSI) scheme. For the incompressible fluid, new fractional-step algorithms are proposed which make possible the fully implicit, but matrix-free, parallel solution of the entire coupled fluid-solid system. These algorithms include artificial compressibility pressure-poisson solution in conjunction with upwind velocity stabilisation, as well as simplified pressure stabilisation for improved computational efficiency. A dual-timestepping approach is proposed where a Jacobi method is employed for the momentum equations while the pressures are concurrently solved via a matrix-free preconditioned GMRES methodology. This enables efficient sub-iteration level coupling between the fluid and solid domains. Parallelisation is effected for distributed-memory systems. The accuracy and efficiency of the developed technology is evaluated by application to benchmark problems from the literature. The new schemes are shown to be efficient and robust, with the developed preconditioned GMRES solver furnishing speed-ups ranging between 50 and 80. (C) 2012 Elsevier 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 B 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 B I O O O O O O O O O O O O O O O

fluid-structure interaction
finite volume method
incompressible split
matrix free


Enhancing patent landscape analysis with visualization output ? A patent landscape analysis can be defined as a state-of-the-art patent search that provides graphic representations of information from search results. The focus is patents and patent applications from a given technology area or company patent portfolio. Unlike a traditional state-of-the-art search which provides relevant information in text format, patent landscape analysis provides graphics and charts to demonstrate patenting trends, leading patent assignees, collaboration partners, white space analysis, technology evaluations, etc. In this article, we will illustrate two case studies from a more in-depth evaluation of some text mining tools. Output from these tools may be integrated into patent analysis workflow to yield critical visual views of the data and actionable business intelligence.

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

text mining
patent landscape analysis
business intelligence

data visualization tools
patent information
intellectual property analysis


Rearrangement Phylogeny of Genomes in Contig Form There has been a trend in increasing the phylogenetic scope of genome sequencing while decreasing the quality of the published sequence for each genome. With reduced finishing effort, there is an increasing number of genomes being published in contig form. Rearrangement algorithms, including gene order-based phylogenetic tools, require whole genome data on gene order, segment order, or some other marker order. Items whose chromosomal location is unknown cannot be part of the input. The question we address here is, for gene order-based phylogenetic analysis, how can we use rearrangement algorithms to handle genomes available in contig form only? Our suggestion is to use the contigs directly in the rearrangement algorithms as if they were chromosomes, while making a number of corrections, e. g., we correct for the number of extra fusion/fission operations required to make contigs comparable to full assemblies. We model the relationship between contig number and genomic distance, and estimate the parameters of this model using insect genome data. With this model, we use distance matrix methods to reconstruct the phylogeny based on genomic distance and numbers of contigs. We compare this with methods to reconstruct ancestral gene orders using uncorrected contig data.

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

assembly
genome rearrangements
drosophila


distributing expressional faces in 2-d emotional space Facial expressions are often classified into one of several basic emotion categories. This categorical approach seems improper to treat faces with blended emotion, as well as hard to measure the intensity of an emotion. In this paper facial expressions are evaluated with dimensional approach of affect that was originally introduced by psycho-physiologic study. An expressional face can be represented as a point in a two-dimensional (2-D) emotional space characterized by arousal and valence factors. To link low-level face features with emotional factors, we propose a simple method that builds an emotional mapping by a coarse labeling on Cohn-Kanade database and a linear fitting on the labeled data. Our preliminary experimental result shows that the proposed emotional mapping can be used to visualize the distribution of affective content in a large face set and further retrieval expressional face images or relevant video shots by specifying a region in the 2-D emotional space.

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

facial expression analysis
least square fitting
image retrieval


AUTOMATIC SEGMENTATION OF INFRARED IMAGE BASED ON chi(2) DISTRIBUTION The accuracy and detecting distance of infrared imaging system is greatly affected by segmentation and recognition algorithms. By analyzing gradient distribution characteristics of infrared images, the gradient histogram of both targets and background can be fitted by chi(2) distribution density function with different degrees of freedom. According to the above statistical characteristics and the least classified probability, an adaptive segmentation algorithm with automatic estimation of gradient histogram threshold is proposed. The algorithm is validated with infrared images and is proved to be effective and practical.

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

gradient histogram distribution
image segmentation


self-service linked government data with dcat and gridworks Open Government Data initiatives in the US, UK and elsewhere have made large amounts of raw data available to the public on the Web. There is enormous potential in applying Linked Data principles to these datasets. This potential currently remains largely untapped because governments lack the resources required to convert from raw data to highquality Linked Data on a large scale. We present a "selfservice" approach to this problem: By connecting a powerful Gridworks-based data workbench application directly to data catalogs, via a standard Data Catalog Vocabulary, data professionals outside of government can contribute to the Linked Data conversion process, thus obtaining data for their own needs and benefiting the larger Linked Government Data effort.

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


Inhibitory activities and possible anticancer targets of Ru(II)-based complexes using computational docking method In an effort to search for better alternatives to cis-platin and its derivatives that are non-selective cytotoxic anticancer agents, many metal based complexes especially that of Ru(II) that will have alternate targets other than universal target such as DNA have been suggested. This paper focus more on finding an alternative protein targets other DNA for some Ru(II)-based complexes using computational docking as a means of addressing commonly reported research challenges with regards to the lack of proper understanding of the anticancer targets of Ru-based complexes. The observed interactions through our docking studies showed that, besides predicted targets such as CatB, HP-NCP and kinase which is in good agreement with experiment since they have been experimentally suggested as possible target of Ru-based anticancer agents, other targets such as RNR and HDAC7 are proposed. Majority of the complexes on the average showed good interactions with rHA which will most likely enhance their pharmacokinetic properties. There is the possibility of some of them acting as anticancer and as antibacterial agent because they bind more favourably with DNA-Gyrase.

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

ru(ii)-based complexes
selectivity
cancer receptors
carboxylic


Isogeometric analysis suitable trivariate NURBS representation of composite panels with a new offset algorithm Analysis suitable trivariate NURBS of composite panels are constructed. A new curve/surface offset algorithm required by analysis is devised. CAD to FEA route for composite panels is streamlined in the proposed framework.

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

isogeometric analysis
nurbs
cad
composite panels


the contribution of user-based subsidies to the impact and sustainability of telecenters - the ecenter project in kyrgyzstan We examine the extent to which user-based subsidies can promote the sustainability and development impact of telecenters, where sustainability is defined in financial and social terms. We do this by looking at a coupon scheme used by the USAID funded eCenter network in Kyrgyzstan. The network consisted of partnerships with existing commercial computer centers which provided fee-based ICT services to their communities. The eCenter program temporarily provided subsidized coupons for Internet access and computer training to users of these centers. Using a mixed-method approach, we found that user-based subsidies have to a certain degree aided financial sustainability by bringing new users to the centers, some of who will, conceivably, become long-term customers bringing ongoing revenues. The subsidies also helped to "kick-start" operations during the initial stage of the project. However we found that the distribution of the coupons did not lead to any significant enhancements to social sustainability by, for instance, encouraging users from underrepresented social groups (though we did find that women were marginally more likely to take advantage of the program). Moreover, we found that the distribution of both Internet and training coupons favored more regular users of the eCenters. Finally, looking beyond sustainability to impact within the community, we found that the coupon program had a limited development impact on participating communities. For example, the population of users who reported economic benefits from using the eCenter (eg. subsequent employment or starting a new business), did not make more use of the coupon program than the user population at large, suggesting that the coupon program itself did not account for this benefit. We argue that, even in the presence of such modest positive effects, user-based subsidies still offer an intriguing model. We believe that if the eCenters had narrowly targeted particular participants for the coupon programs it is likely that the benefits of the program can be enhanced. For example, better social targeting of the coupons could have brought in more women or under represented groups. From a financial sustainability point of view, explicitly targeting new users (as opposed to people already using the center) could have also been more effective. In terms of impact, coupons could have been distributed, for example, specifically to entrepreneurs looking to start a new business. A method of incentivizing eCenter management to perform such targeting is probably required.

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


Efficient cable arrangement in cable stayed bridges based on sensitivity analysis of aeroelastic behaviour Construction of cable supported bridges has experienced a great impulse in the past decade. Bridges having more than 800m of span length were built in France and Japan and some bridges with span length of more than 1km are going to be built, such as the Stonecuters bridge in Hong-Kong, and the Chongming in China (Fig. 1). Because of the increasing length of this class of bridges, they are becoming prone to phenomena like flutter in a similar way than long span suspension bridges. Cable stayed bridges may present a few different alternatives for the cable system. At least harp, fan or modified fan arrangements can be discussed at the beginning of the design. Also variations in the number of cable planes can be studied. Usually, during the design process changes are made by carrying out a number of analyses and using trial and error techniques relying in heuristic rules that are based upon the particular skills of the engineer. This approach can be inefficient in new problems and commonly it needs to be supported with results coming from experimental testing which makes more expensive the whole design process. Instead of that, an approach based in sensitivity analysis can be very helpful for the designer.

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

cable stayed bridges
sensitivity analysis

aeroelastic analysis
efficient structural design
cable configuration


Exploring the role of quantum chemical descriptors in modeling acute toxicity of diverse chemicals to Daphnia magna Expression of acute toxicity is analyzed at the level of electron-dynamics. Real predictivity of acute toxicity of 252 diverse organic chemicals is tested. Total energy and HOMO energy proposed as best simulators of acute toxicity. Electron-correlation energy found to be a good predictor of acute toxicity. Advanced semi-empirical method PM7 observed to be highly reliable.

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


configuration prefetch for single context reconfigurable coprocessors Current reconfigurable systems suffer from a significant overhead due to the time it takes to reconfigure their hardware. In order to deal with this overhead, and increase the power of reconfigurable systems, it is important to develop hardware and software systems to reduce or eliminate this delay. In this paper we propose one technique for significantly reducing the reconfiguration latency: the prefetching of configurations. By loading a configuration into the reconfigurable logic in advance of when it is needed, we can overlap the reconfiguration with useful computation. We demonstrate the power of this technique, and propose an algorithm for automatically adding prefetch operations into reconfigurable applications. This results in a significant decrease in the reconfiguration overhead for these applications.

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

software applications prefetching order latency systems computation delay context demonstrate power logic hardware algorithm paper

operability
configurability
timing
reconfigurable system
reconfigurability


methodology for measuring the digital capability of local governments This paper describes developing and testing the methodology for measuring the digital capability of local governments. The aim of the methodology is to measure the participation (intention) of local governments in having a say in the information society and to measure their inherent capabilities for providing services. The aim is achieved by identifying both the processes and actions that are done on paper or inefficiently. Also the improvement of effectiveness of these processes during time shall be measured. The indicators and methodology were developed in 2011 and the first measurements were also carried out. The aim was to carry out the measurements in all the local governments of Estonia and adjust the methodology so it could be used in other EU countries as well.

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

municipality
efficient local government
work in progress
records management
e-governance


Wavelet kernel penalized estimation for non-equispaced design regression The paper considers regression problems with univariate design points. The design points are irregular and no assumptions on their distribution are imposed. The regression function is retrieved by a wavelet based reproducing kernel Hilbert space (RKHS) technique with the penalty equal to the sum of blockwise RKHS norms. In order to simplify numerical optimization, the problem is replaced by an equivalent quadratic minimization problem with an additional penalty term. The computational algorithm is described in detail and is implemented with both the sets of simulated and real data. Comparison with existing methods showed that the technique suggested in the paper does not oversmooth the function and is superior in terms of the mean squared error. It is also demonstrated that under additional assumptions on design points the method achieves asymptotic optimality in a wide range of Besov spaces.

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

wavelet decomposition
penalization
smoothing splines anova
entropy


a partial reconfigurable architecture for controllers based on petri nets Digital Control System in the industry has been used in most of the applications based on expensive Programmable Logical Controllers (PLC). These Systems are, in general, highly complex and slow, with an operation cycle around 10ms. In this work, a Reconfigurable Logic Controller (RLC) approach is presented, based on a small and low cost Xilinx Virtex-II FPGA architecture, operating as a virtual hardware machine. In this context, the main process is specified in a formal language, based on Petri nets or SFC (Sequential Function Chart). For applications that demand more hardware than that available in the FPGA, a partial reconfiguration mechanism takes place. From the Petri net specification, the main process is split into multiple contexts, which are sequentially executed within the same FPGA, without violating the operation cycle of application.

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

partial reconfiguration
virtual hardware
petri nets

fpgas
programmable logic controller (plc)


A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization Optimization in dynamic environment is considered among prominent optimization problems. There are particular challenges for optimization in dynamic environments, so that the designed algorithms must conquer the challenges in order to perform an efficient optimization. In this paper, a novel optimization algorithm in dynamic environments was proposed based on particle swarm optimization approach, in which several mechanisms were employed to face the challenges in this domain. In this algorithm, an improved multi-swarm approach has been used for finding peaks in the problem space and tracking them after an environment change in an appropriate time. Moreover, a novel method based on change in velocity vector and particle positions was proposed to increase the diversity of swarms. For improving the efficiency of the algorithm, a local search based on adaptive exploiter particle around the best found position as well as a novel awakeningsleeping mechanism were utilized. The experiments were conducted on Moving Peak Benchmark which is the most well-known benchmark in this domain and results have been compared with those of the state-of-the art methods. The results show the superiority of the proposed method.

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

particle swarm optimization
dynamic environments
moving peak benchmark


Candid covariance-free incremental principal component analysis Appearance-based image analysis techniques require fast computation of principal components of high-dimensional image vectors. We introduce a fast incremental principal component analysis (IPCA) algorithm, called candid covariance-free IPCA (CCIPCA), used to compute the principal components of a sequence of samples incrementally without estimating the covariance matrix (so covariance-free). The new method is motivated by the concept of statistical efficiency (the estimate has the smallest variance given the observed data). To do this, it keeps the scale of observations and computes the mean of observations incrementally, which is an efficient estimate for some well-known distributions (e.g., Gaussian), although the highest possible efficiency is not guaranteed in our case because of unknown sample distribution. The method is for real-time applications and, thus, it does not allow iterations. It converges very fast for high-dimensional image vectors. Some links between IPCA and the development of the cerebral cortex are also discussed.

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


participatory design of an autism community network to enhance community participation, health, and well-being We present a socio-technical design that illustrates how a community network health intervention can mobilize human resources across social boundaries, and enhance health and well-being for people on both sides of the boundary. We specifically address how to reduce the barriers to social engagement experienced by autistic individuals who want more supportive life opportunities. We focus on the social milieu of an American college town, on traditional town-gown boundaries, and on possibilities for integrating social resources within this context. Our design adopts community networking to not only connect autistic persons living within an existing social milieu (university undergraduates; local autistic children and their families), but also to integrate individuals across milieus. Our key design idea is that facilitating cross-milieu interactions can initiate and sustain a virtuous cycle of being helped by helping others.

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


Collaborative Lightweight Trust Management Scheme for Wireless Sensor Networks The cooperative multi-hop communication in a remote infrastructureless networking environment poses a serious security threat for the design of wireless sensor networks (WSNs). Because of their vulnerability to attacks, the intrinsic and demanding assignment of WSNs is security. Earlier security solutions aimed at thwarting different types of malicious threats but failed to consider the resource constrained nature of sensor nodes. The stringent resource constraints of WSNs require a lightweight trust-based routing scheme. In this paper, we propose a collaborative lightweight trust-based (CLT) routing protocol for WSNs with minimal overhead in regard to memory and energy consumption. It does not use promiscuous mode of operation to monitor the neighboring nodes for trust derivation. CLT employs a novel trust counselor that monitors and warns the neighboring nodes whose trust falls below a warning threshold. The warning message alarms a sensor node to check and correct the packet forwarding behavior to improve its trust relationship with its neighbors. Theoretical analysis and simulation results of CLT protocol demonstrate higher packet delivery ratio, higher network lifetime, lower end-to-end delay, lower memory and energy consumption than the traditional and existing trust-based routing schemes.

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


New redundant logic design concept for high noise and low voltage scenarios This paper presents a new redundant logic design concept named Turtle Logic (TL). It is a new probabilistic logic method based on port redundancy and complementary data, oriented toward emerging technologies beyond CMOS, where the thermal noise could be predominant and the reliability of the future circuits could be limited. The TL is a technology independent method, which aims to improve error tolerance when these errors are caused by noise within logic and functional units, sequential elements, and in general synchronous pipeline Finite State Machines. Turtle Logic operation is based on the consistency relation of redundant inputs. In the case of discrepancy, the output of the system keeps the previous value, therefore avoiding the propagation of incorrect inputs. A two's complement 88-bit pipelined BaughWooley multiplier is implemented, on which several experiments reveal a perfect tolerance (0% errors) to single line discrepancies for both primary and internal nodes, with a cost of lost clock periods between 6% and 25%. The error ratio for the proposed Turtle Logic implementation with double discrepancies in both true and complementary lines are lower than 0.1% when the noise affects primary input nodes, and lower than 0.9% when the noise affects internal nodes.

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

fault tolerance
robustness
error probability


A general nonlinear Mason model and its application to piezoelectric resonators The one-dimensional electroacoustic behavior of a uniform piezoelectric plate may be modeled by electrical equivalent circuits such as Mason or KLM models. Such models yield mathematically exact solutions to the governing equations, i.e., a set of constitutive equations and the differential equations of electrostatics and mechanics. In this article, we present an extension of the Mason equivalent circuit to the case of arbitrary nonlinear constitutive equations by the use of telegrapher's equations in a mathematically exact way. The resulting model consists of the original Mason circuit, distributed nonlinear voltage sources along its acoustic arm, and a nonlinear voltage source at the electrical terminal. We also show the proof that the circuit meets all the governing equations, and comparison of simulated results and harmonic measurements of FBAR devices. 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.

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

piezoelectric
nonlinear constitutive equations

nonlinear mason circuit model
telegrapher's equations
bulk acoustic wave (baw)
harmonics
intermodulation distortion (imd)


Modeling, Identification and Control at Telemark University College Master studies in process automation started in 1989 at what soon became Telemark University College, and the 20 year anniversary marks the start of our own PhD degree in Process, Energy and Automation Engineering. The paper gives an overview of research activities related to control engineering at Department of Electrical Engineering, Information Technology and Cybernetics.

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


VarioML framework for comprehensive variation data representation and exchange Sharing of data about variation and the associated phenotypes is a critical need, yet variant information can be arbitrarily complex, making a single standard vocabulary elusive and re-formatting difficult. Complex standards have proven too time-consuming to implement.

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

lsdb
variation database curation
data collection
distribution


Chaotic based reconstructed phase space features for detecting ventricular fibrillation Among the variety of cardiac arrhythmias, ventricular fibrillation (VF) and ventricular tachycardia (VT) are life-threatening; thus, accurate classification of these arrhythmias is a crucial task for cardiologists. Nevertheless, VT and VF signals are very similar in the time domain and accurate distinguishing these signals with naked eyes in some cases is impossible. In this paper, a novel self-similarity image-based scheme is introduced to classify the underlying information of VT, VF and normal electrocardiogram (ECG) signals. In this study, VT, VF and normal ECG signals are selected from CCU of the Royal Infirmary of Edinburgh and MIT-BIH datasets. According to the time delay method, signal samples can be assigned to state variables and a trajectory can be achieved. To extract the proposed self-similarity feature, first, two different trajectories from each signal trial are drawn according to two different delay time values. The two-dimensional state space of each trial trajectory is considered as an image. Therefore, two trajectory images are produced for each signal. Number of visited pixels in the first image is determined and is subtracted from that of the second image as the self-similarity feature of that signal. Moreover, another scheme is proposed to have a better estimation of self-similarity in which the logical AND operator is applied to both images (matrices) of each ECG trial. The third proposed criterion is similar to box counting method by this difference that each pixel is assigned a weight according to the trajectory density at that point and finally visited weighted pixels are counted. To classify VF from VT and normal ECG, a threshold is determined through the cross validation phase under the Receiver Operating Characteristic (ROC) criterion. To assess the proposed methods, the mentioned signals are classified using the-state-of-art chaotic features such as correlation dimension, the largest Lyapunov exponent and Approximate Entropy (ApEn). Experimental results indicate superiority of the proposed method in classifying the VT, VF and normal ECG signals compared to present traditional schemes. In addition, computational complexity of the introduced methods is very low and can be implemented in real-time applications.

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

ventricular tachycardia (vt)
ventricular fibrillation (vf)


An empirical comparison of use-in-motion evaluation scenarios for mobile computing devices There is a clear need for evaluation methods that are specifically suited to mobile device evaluation, largely due to the vast differences between traditional desktop computing and mobile computing. One difference of particular interest that needs to be accounted for is that mobile computing devices are frequently used while the user is in motion, in contrast to desktop computing. This study aims to validate the appropriateness of two evaluation methods that vary in representativeness of mobility, one that uses a treadmill to simulate motion and another that uses a controlled walking scenario. The results lead to preliminary guidelines based on study objectives for researchers wishing to use more appropriate evaluation methodologies for empirical, data-driven mobile computing studies. The guidelines indicate that using a treadmill for mobile evaluation can yield representative performance measures, whereas a controlled walking scenario is more likely to adequately simulate the actual user experience.

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

mobile computing
mobility
evaluation
empirical


Cognitive-metacognitive and content-technical aspects of constructivist Internet-based learning environments: a LISREL analysis Through a LISREL analysis, this study validated the Constructivist Internet-based Learning Environment Survey (CILES). CILES consisted of six scales, sorted by two aspects. The first aspect, the cognitive-metacognitive aspect, included the scales of student negotiation, inquiry learning, and reflective thinking, whereas the second aspect, the content-technical aspect, involved the scales of Relevance, Ease of Use, and Challenge. A LISREL structural model was also proposed to examine the relationships between students' responses across these two aspects. Survey responses gathered from 483 high school students in Taiwan were the research data for this study. The results from the LISREL confirmatory analysis showed that CILES had highly satisfactory validity and reliability to assess students' preferences for constructivist Internet-based learning environments. Moreover, the structural model indicated that the Internet learning environments that challenged students' existing concepts could facilitate their preferences for student negotiation.. inquiry learning and reflective thinking activities. It is proposed that the Internet can have rich connections with numerous resources and a variety of perspectives, thus constructing appropriate learning environments to provide different kinds of challenges for learners. (C) 2003 Elsevier Ltd. All rights reserved.

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

interactive learning environment
secondary education
teaching/learning strategies
constructivism
internet-based instruction


Combined learning and pruning for recurrent radial basis function networks based on recursive least square algorithms This paper discusses a way to combine training and pruning for the construction of a recurrent radial basis function network (RRBFN) based on recursive least square (RLS) learning. In our approach, a RRBFN is first trained using the proposed RLS algorithms. Afterwards, the error covariance matrix which is directly obtained from the RLS computations is used to remove some unimportant radial basis function (RBF) nodes. We propose two algorithms: (1) a global version which is suitable for low dimensional input space situation, and (2) a local version which can be applied in situations when the input dimension is large. In both cases, it is shown that the error covariance matrix, obtained from the RLS algorithms, can be used as a means for pruning the trained RRBFN. Simulation examples are presented to illustrate the proposed approaches.

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

recursive least square method
pruning method


An axiomatic approach of fuzzy rough sets based on residuated lattices ? Rough set theory was developed by Pawlak as a formal tool for approximate reasoning about data. Various fuzzy generalizations of rough approximations have been proposed in the literature. As a further generalization of the notion of rough sets, L L -fuzzy rough sets were proposed by Radzikowska and Kerre. In this paper, we present an operator-oriented characterization of L L -fuzzy rough sets, that is, L L -fuzzy approximation operators are defined by axioms. The methods of axiomatization of L L -fuzzy upper and L L -fuzzy lower set-theoretic operators guarantee the existence of corresponding L L -fuzzy relations which produce the operators. Moreover, the relationship between L L -fuzzy rough sets and L L -topological spaces is obtained. The sufficient and necessary condition for the conjecture that an L L -fuzzy interior (closure) operator derived from an L L -fuzzy topological space can associate with an L L -fuzzy reflexive and transitive relation such that the corresponding L L -fuzzy lower (upper) approximation operator is the L L -fuzzy interior (closure) operator is examined.

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

l l -fuzzy relation l l l l l
l l -fuzzy sets l l l l l
l l -fuzzy rough sets l l l l l
residuated lattice


Advanced methods for displays and remote control of robots An in-depth evaluation of the usability and situation awareness performance of different displays and destination controls of robots are presented. In two experiments we evaluate the way information is presented to the operator and assess different means for controlling the robot. Our study compares three types of displays: a blocks display, a HUD (head-up display), and a radar display, and two types of controls: touch screen and hand gestures. The HUD demonstrated better performance when compared to the blocks display and was perceived to have greater usability compared to the radar display. The HUD was also found to be more useful when the operation of the robot was more difficult, i.e., when using the hand-gesture method. The experiments also pointed to the importance of using a wide viewing angle to minimize distortion and for easier coping with the difficulties of locating objects in the field of view margins. The touch screen was found to be superior in terms of both objective performance and its perceived usability. No differences were found between the displays and the controllers in terms of situation awareness. This research sheds light on the preferred display type and controlling method for operating robots from a distance, making it easier to cope with the challenges of operating such systems.

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

humanrobot interaction
directional controllers


Algorithm-based fault tolerance applied to high performance computing We present a new approach to fault tolerance for High Performance Computing system. Our approach is based on a careful adaptation of the Algorithm-Based Fault Tolerance technique [K. Huang, J. Abraham, Algorithm-based fault tolerance for matrix operations, IEEE Transactions on Computers (Spec. Issue Reliable & Fault-Tolerant Comp.) 33 (1984) 518528] to the need of parallel distributed computation. We obtain a strongly scalable mechanism for fault tolerance. We can also detect and correct errors (bit-flip) on the fly of a computation. To assess the viability of our approach, we have developed a fault-tolerant matrixmatrix multiplication subroutine and we propose some models to predict its running time. Our parallel fault-tolerant matrixmatrix multiplication scores 1.4 TFLOPS on 484 processors (cluster jacquard.nersc.gov) and returns a correct result while one process failure has happened. This represents 65% of the machine peak efficiency and less than 12% overhead with respect to the fastest failure-free implementation. We predict (and have observed) that, as we increase the processor count, the overhead of the fault tolerance drops significantly.

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

fault tolerance
high performance computing


Partial synchronization and clustering in a system of diffusively coupled chaotic oscillators We examine the problem of partial synchronization (or clustering) in diffusively coupled arrays of identical chaotic oscillators with periodic boundary conditions. The term partial synchronization denotes a dynamic state in which groups of oscillators synchronize with one another, but there is no synchronization among the groups. By combining numerical and analytical methods we prove the existence of partially synchronized states for systems of three and four oscillators. We determine the stable clustering structures and describe the dynamics within the clusters. Illustrative examples are presented for coupled Rossler systems. At the end of the paper, synchronization in larger arrays of chaotic oscillators is discussed. (C) 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

partial synchronization
diffusively coupled chaotic oscillators
clustering


Applications of structure from motion: a survey Structure from motion (SfM) has been an active research area in computer vision for decades and numerous practical applications are benefiting from this research. While no previous work has tried to summarize the applications appearing in the literature, this paper deals with a comprehensive overview of recent applications of SfM by classifying them into 10 categories, namely augmented reality, autonomous navigation/guidance, motion capture, hand-eye calibration, image/video processing, image-based 3D modeling, remote sensing, image organization/browsing, segmentation and recognition, and military applications. The goal is to provide insights for researchers to position their work more appropriately in the context of existing techniques, and to perceive both new applications and relevant research problems.

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

structure from motion (sfm)
image-based 3d modeling
application


Locating computer clubs in multicultural neighborhoods: How collaborative project work fosters integration processes Located in socially and culturally diverse neighborhoods, we have built a network of intercultural computer clubs, called come_IN. These clubs offer a place to share practices among children and adults of diverse ethnical backgrounds. We show how this initiative ties into the striving for the integration of migrant communities and host society in Germany. In this paper, we analyze how collaborative project work and the use of mobile media and technologies contribute to integration processes in multicultural neighborhoods. Qualitative data gathered from interviews with club participants, participative observation in the computer clubs, as well as the analysis of artifacts created during project work provides the background needed to match local needs and peculiarities with (mobile) technologies. Based on these findings we present two approaches to add to the technological infrastructure: (1) a mesh-network extending the clubs into the neighborhood and (2) a project management tool, which supports projects and stimulates the sharing of ideas among projects.

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

communities
computer clubs
integration
mobile media


Hierarchical sparse representation based Multi-Instance Semi-Supervised Learning with application to image categorization We propose a hierarchical sparse representation based MISSL algorithm. Instance disambiguation is solved via instance-level sparse representation. Weighted multi-instance kernel based ?1-graph ? 1 - graph is constructed at bag-level. Experiments conducted on image data sets show the effectiveness of our method.

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

hierarchical sparse representation
image categorization

multi-instance semi-supervised learning
weighted multi-instance kernel


A framework for low power synthesis of interconnection networks-on-chip with multiple voltage islands The problem of VI-aware Network-on-Chip (NoC) design is extremely challenging, especially with the increasing core counts in today's power-hungry Chip Multiprocessors (CMPs). In this paper, we propose a novel framework for automating the synthesis of regular NoCs with VIs, to satisfy application performance constraints while minimizing chip power dissipation. Our proposed framework uses a set of novel algorithms and heuristics to generate solutions that reduce network traffic by up to 62%, communication power by up to 32%, and total chip power dissipation by up to 13%, compared to the best known prior work that also solves the same problem.

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

networks-on-chip
synthesis algorithms
chip multiprocessor
core-to-tile mapping


Robust Distributed Multiview Video Compression for Wireless Camera Networks We present a novel framework for robustly delivering video data from distributed wireless camera networks that are characterized by packet drops. The main focus in this work is on robustness which is imminently needed in a wireless setting. We propose two alternative models to capture interview correlation among cameras with overlapping views. The view-synthesis-based correlation model requires at least two other camera views and relies on both disparity estimation and view interpolation. The disparity-based correlation model requires only one other camera view and makes use of epipolar geometry. With the proposed models, we show how interview correlation can be exploited for robustness through the use of distributed source coding. The proposed approach has low encoding complexity, is robust while satisfying tight latency constraints and requires no intercamera communication. Our experiments show that on bursty packet erasure channels, the proposed H.263+(1) based method outperforms baseline methods such as H.263+ with forward error correction and H.263+ with intra refresh by up to 2.5 dB. Empirical results further support the relative insensitivity of our proposed approach to the number of additional available camera views or their placement density.

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

distributed video compression
sensor networks


A Query Integrator and Manager for the Query Web We introduce two concepts: the Query Web as a layer of interconnected queries over the document web and the semantic web, and a Query Web Integrator and Manager (QI) that enables the Query Web to evolve. QI permits users to write, save and reuse queries over any web accessible source, including other queries saved in other installations of QI. The saved queries may be in any language (e.g. SPARQL, XQuery); the only condition for interconnection is that the queries return their results in some form of XML. This condition allows queries to chain off each other, and to be written in whatever language is appropriate for the task. We illustrate the potential use of QI for several biomedical use cases, including ontology view generation using a combination of graph-based and logical approaches, value set generation for clinical data management, image annotation using terminology obtained from an ontology web service, ontology-driven brain imaging data integration, small-scale clinical data integration, and wider-scale clinical data integration. Such use cases illustrate the current range of applications of QI and lead us to speculate about the potential evolution from smaller groups of interconnected queries into a larger query network that layers over the document and semantic web. The resulting Query Web could greatly aid researchers and others who now have to manually navigate through multiple information sources in order to answer specific questions.

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


A transformation method of a CORDIC ARMA lattice filter for signal synthesis This paper proposes a method to transform a CORDIC ARMA lattice filter, which is originally realized for signal analysis, into a signal synthesis lattice filter (CORDIC ARMA lattice synthesis filter). In order to perform such a transformation and then obtain the CORDIC ARMA lattice synthesis filter, we must implement the followings with CORDIC: (1) the structure of the altered lattice filter; and (2) an angle calculation module. However, we cannot achieve such an implementation as an extension of the CORDIC ARMA lattice filter algorithm. Therefore, this paper proposes CORDIC implementation schemes for both the structure and module, and then we realize the CORDIC ARMA lattice synthesis filter. By using CORDIC processors, the elementary sections of the CORDIC ARMA lattice synthesis filter are efficiently implemented without any multipliers. Since the obtained signal synthesis lattice filter consists of dedicated CORDIC processors, it keeps the advantage of the CORDIC ARMA lattice filter, that is a simple structure.

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

cordic
arma lattice filter
signal synthesis


Homomorphic graph matching of articulated objects by an integrated recognition scheme In the last few years, several attempts have been made to the study of object recognition under affine transformation, but all these studies have concentrated on graph isomorphism. There has not been any discussion of solving the graph homomorphism problem under affine transformation to date. Therefore, in this paper, an integrated approach, which combines the advantages of both the genetic algorithm and Hopfield neural network, is proposed for solving object recognition under this condition. The genetic algorithm is first used, to find the near-optimal solution including all the poses of the model in the scene. Then the Hopfield network is implemented and repeated to find each pose of the model. This method can solve occluded object recognition problems, and it can also obtain the homomorphic mapping indicating multiple occurrences of a model in the scene. The system is used to recognize articulated objects, and we do not need to know in advance that there is one in the scene. Kinematic properties like the position of the joint, relative displacement can be found for the articulated object. Through experiments, we can demonstrate that the proposed method is robust.

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

affine transformation
hopfield network
object recognition
graph homomorphism