ppxscal/embedding_network huggingface dataset:
Scale Spaces on the 3D Euclidean Motion Group for Enhancement of HARDI Data
Authors: Erik Franken, Remco Duits
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In previous work we studied left-invariant diffusion on the 2D Euclidean motion group for crossing-preserving coherence-enhancing diffusion on 2D images. In this paper we study the equivalent three-dimensional case. This is particularly useful for processing High Angular Resolution Diffusion Imaging (HARDI) data, which can be considered as 3D orientation scores directly. A complicating factor in 3D is that all practical 3D orientation scores are functions on a coset space of the 3D Euclidean motion group instead of on the entire group. We show that, conceptually, we can still apply operations on the entire group by requiring the operations to be ¿-right-invariant. Subsequently, we propose to describe the local structure of the 3D orientation score using left-invariant derivatives and we smooth 3D orientation scores using left-invariant diffusion. Finally, we show a number of results for linear diffusion on artificial HARDI data.
On Universal Composable Security of Time-Stamping Protocols
Authors: Toshihiko Matsuo, Shin'ichiro Matsuo
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

Time-stamping protocols, which assure that a document was existed at a certain time, are applied to some useful and practical applications such as electronic patent applications and so on. There are two major time-stamping protocols, the simple protocol and the linking protocol. In the former, a time-stamp authority issues a time-stamp token that is the digital signature of the concatenated value of a hashed message and the present time. In the latter, the time-stamp authority issues a time-stamp token that is the hash value of the concatenated value of a hashed message and the previous hash value. Although security requirements and analysis for above time-stamping protocols has been discussed, there are no strict cryptographic security notions for them. In this paper, we reconsider the security requirements for time-stamping protocols and define security notions for them, in a universally composable security sense, which was proposed by Canetti. We also show that these notions can be achieved using combinations of a secure key exchange protocol, a secure symmetric encryption scheme, and a secure digital signature scheme.
Stochastic stability for uncertain genetic regulatory networks with interval time-varying delays
Authors: Haixia Wu, Xiaofeng Liao, Songtao Guo, Wei Feng, Zhengxia Wang
Venue: Neurocomputing (2009)

This paper is concerned with the robust asymptotic stability analysis for uncertain genetic regulatory networks with both interval time-varying delays and stochastic noise. By using the stochastic analysis approach, employing some free-weighting matrices and introducing an appropriate type of Lyapunov functional which takes into account the ranges of delays, some new delay-range-dependent and rate-dependent stability criteria are established in terms of linear matrix inequalities (LMIs) to guarantee the delayed genetic regulatory networks to be robustly asymptotically stable in the mean square. As a result, the new criteria are applicable to both fast and slow time-varying delays. Five numerical examples are also used to demonstrate the usefulness of the main results and less conservativeness of the proposed method.
Evolutional Aspects of the Construction of Adaptive Knowledge Base
Authors: Istvan Elek
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper introduces a theoretical approach of the construction of a self developing and adaptive artificial digital organism with huge remembrance and the ability of the interpretation of the surrounding world. The paper describes the self development of intelligence of digital organisms from small fragments of digital knowledge.
Minimize aspect interaction re-evaluation due to software evolution
Authors: Zaid Altahat, Tzilla Elrad
Venue: Proceedings of the Workshop on AOP and Meta-Data for Software Evolution (2009)

Detection of interaction among individually built software modules, such as aspects in AOSD, is one of the most complex problems in software engineering. In addition, software is very dynamic and ever evolving. Software evolution should not annul existing aspect interaction analyses. Changes made to the core module in AOSD should only result in reevaluating interaction analysis of the aspects that depend on the specific changes that were made, changes should not impact aspects that depend on the invariant sub-module.
Brief paper: Decomposition principle in model predictive control for linear systems with bounded disturbances
Authors: Dan Sui, Le Feng, Morten Hovd, Chong Jin Ong
Venue: Automatica (Journal of IFAC) (2009)

Considering a constrained linear system with bounded disturbances, this paper proposes a novel approach which aims at enlarging the domain of attraction by combining a set-based MPC approach with a decomposition principle. The idea of the paper is to extend the ''pre-stabilizing'' MPC, where the MPC control sequence is parameterized as perturbations to a given pre-stabilizing feedback gain, to the case where the pre-stabilizing feedback law is given as the linear combination of a set of feedback gains. This procedure leads to a relatively large terminal set and consequently a large domain of attraction even when using short prediction horizons. As time evolves, by minimizing the nominal performance index, the resulting controller reaches the desired optimal controller with a good asymptotic performance. Compared to the standard ''pre-stabilizing'' MPC, it combines the advantages of having a flexible choice of feedback gains, a large domain of attraction and a good asymptotic behavior.
Triangular Energy Saving Route Protocol by Energy Sieving in Wireless Ad Hoc Networks
Authors: Yi-Chao Wu, Chiu-Ching Tuan
Venue: Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware (2009)

In grid-based routing protocol, one node in a grid is elected as the grid leader. However, nodes consume extra energy for in the traditional grid leader election, especially in a high node density environment. In this paper, we propose a triangular energy saving route protocol by energy sieving (TESRES) to address this issue. In TESRES, a new grid leader election and a triangular route discovery are proposed. In the grid leader election of TESRES, only few nodes are elected as a grid leader in the grid leader election. In the route discovery, TESRES selects the energy-efficient routing path to reduce energy consumption for transmitting packets. Therefore, TESRES could save energy for data transmission and prolong the lifetime of route. In the simulation results, TESRES could reduce 16% and 28% of energy consumption in the grid leader election and route discovery, respectively.
Self-training for biomedical parsing
Authors: David McClosky, Eugene Charniak
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Parser self-training is the technique of taking an existing parser, parsing extra data and then creating a second parser by treating the extra data as further training data. Here we apply this technique to parser adaptation. In particular, we self-train the standard Charniak/Johnson Penn-Treebank parser using unlabeled biomedical abstracts. This achieves an f-score of 84.3% on a standard test set of biomedical abstracts from the Genia corpus. This is a 20% error reduction over the best previous result on biomedical data (80.2% on the same test set).
Experimental evaluation of an Adaptive Staggered Sleep Protocol for wireless sensor networks
Authors: Giuseppe Anastasi, Monica Castronuovo, Marco Conti, Mario Di Francesco
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

In the last years wireless sensor networks (WSN) have emerged as an enabling technology for a wide range of applications. The main challenge in the deployment and actual utilization of WSNs is the scarce energy budget available at sensor nodes. In this paper we address this problem through an Adaptive Staggered Sleep Protocol (ASLEEP) which is suitable to environmental monitoring applications. By tuning dynamically the wakeup period of each sensor node to its current traffic pattern, ASLEEP reduces both energy consumption and message latency. In addition, it can adapt to changes in the operating conditions. We present an experimental evaluation of ASLEEP based on a prototype implementation in a real testbed. The experimental results show that the proposed solution provides better performance, in terms of reduced energy consumption and message latency, in comparison with other similar approaches.
A User-Influenced Pricing Mechanism for Internet Access
Authors: Gergely Biczók, Tuan Anh Trinh
Venue: Proceedings of the 6th International Workshop on Internet Charging and Qos Technologies: Network Economics for Next Generation Networks (2009)

Proper pricing schemes are vital components to the continuing success of the Internet. In this paper, we propose a new pricing scheme for Internet access called user-influenced pricing. Our main contribution is threefold: first, we show how user-influenced pricing can provide the ISP with calculable revenues, while giving the users a chance to lower their costs via voting for their preferred pricing scheme. Second, we develop a cooperative weighted voting game which models the decision-making process, and we derive equilibrium solutions to analyze possible outcomes of the vote. Third, we investigate the distribution of power and we show that users with medium generated traffic volume are pivotal to the outcome. Finally, we discuss the practical feasibility of the proposed mechanism regarding user population, revenue planning and charging.
Coalition Structure Generation in Task-Based Settings
Authors: Viet Dung Dang, Nicholas R. Jennings
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent systems. However, one of the main problems that hinders the wide spread adoption of coalition formation technologies is the computational complexity of coalition structure generation. That is, once a group of agents has been identified, how can it be partitioned in order to maximise the social payoff? To date, most work on this problem has concentrated on simple characteristic function games. However, this lacks the notion of tasks which makes it more difficult to apply it in many applications. Against this background, this paper studies coalition structure generation in a general task-based setting. Specifically, we show that this problem is NP-hard and that the minimum number of coalition structures that need to be searched through in order to establish a solution within a bound from the optimal is exponential to the number of agents. We then go onto develop an anytime algorithm that can establish a solution within a bound from the optimal with a minimal search and can reduce the bound further if time permits.
Voices beyond walls: the role of digital storytelling for empowering marginalized youth in refugee camps
Authors: Nitin Sawhney
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

In this paper we consider the role of digital storytelling for creative empowerment of marginalized youth, through a threeyear program of workshops conducted in the context of Palestinian refugee camps in the West Bank and East Jerusalem. We highlight the current situation regarding arts education and cultural production, and the challenging environment experienced by the youth there. We then describe the Voices Beyond Walls program and key lessons learned to suggest novel tools and practices that may support broader adoption of digital storytelling programs for marginalized youth in diverse global settings.
NAP: a building block for remediating performance bottlenecks via black box network analysis
Authors: Muli Ben-Yehuda, David Breitgand, Michael Factor, Hillel Kolodner, Valentin Kravtsov, Dan Pelleg
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

In this work we present a simple, yet powerful, methodology for application-agnostic diagnostic and remediation of performance hot spots in elastic multi-tiered client/server applications, deployed as collections of black box Virtual Machines (VM). Our novel out-of-band black-box performance management system, Network Analysis for Remediating Performance Bottlenecks (NAP), listens to the TCP/IP traffic on the virtual network interfaces of the VMs comprising an application and analyzes statistical properties of this traffic. From this analysis, which is application independent and transparent to the VMs, NAP identifies performance bottlenecks that might effect application performance and derives remediation decisions that are most likely to alleviate the application performance degradation. We prototyped our solution for the Xen hypervisor and evaluated it using the popular Trade6 benchmark that simulates a typical e-commerce application. Our results show that NAP successfully identifies performance bottlenecks in a complex multi-tier application setting, while incurring negligible performance overhead.
A condition-based maintenance policy for intelligent monitored system
Authors: Wenzhu Liao, Ershun Pan, Lifeng Xi
Venue: International Journal of Computer Applications in Technology (2009)

This study proposes a sequential Condition-Based Maintenance (CBM) policy for intelligent monitored system based on cost and reliability prioritisation. It is assumed that system's reliability could be continuously monitored, whenever it reaches the threshold R, and scheduled maintenance activity is performed to restore the system. This maintenance policy differs from other policies in taking into consideration of influences from the frequency of maintenance activities and operating time on system's failure rate function subject to a deterioration process. Meanwhile, this CBM policy firstly considers the variant operational cost and variant minimal repair cost by the effects of system's corresponding condition, which helps to construct more practical maintenance model. Finally, a numerical example is presented to test this proposed sequential predictive maintenance policy and the simulation results show its efficiency.
Two-factor cancelable biometrics authenticator
Authors: Ying-Han Pang, T. B. J. Andrew, N. C. L. David
Venue: Journal of Computer Science and Technology (2007)

Biometrics-based authentication system offers advantages of providing high reliability and accuracy. However, the contemporary authentication system is impuissance to compromise. If a biometrics data is compromised, it cannot be replaced and rendered unusable. In this paper, a cancelable biometrics-based authenticator is proposed to solve this irrevocability issue. The proposed approach is a two-factor authentication system, which requires both of the random data and facial feature in order to access the system. In this system, tokenized pseudo-random data is coupled with moment-based facial feature via inner product algorithm. The output of the product is then discretized to generate a set of private binary code, coined as 2factor-Hashing code, which is acted as verification key. If this biometrics-based verification key is compromised, a new one can be issued by replacing a different set of random number via token replacement. Then, the compromised one is rendered completely useless. This feature offers an extra protection layer against biometrics fabrication since the verification code is replaceable. Experimental results demonstrate that the proposed system provides zero Equal Error Rate in which there is a clear separation in between the genuine and the imposter distribution populations.
The Norm Game - How a Norm Fails
Authors: Antoni Dydejczyk, Krzysztof Kułakowski, Marcin Rybak
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

We discuss the simulations of the norm game between players at nodes of a directed random network. The final boldness, i.e. the probability of norm breaking by the players, can vary sharply with the initial boldness, jumping from zero to one at some critical value. One of the conditions of this behaviour is that the player who does not punish automatically becomes a defector. The threshold value of the initial boldness can be interpreted as a norm strength. It increases with the punishment and decreases with its cost. Surprisingly, it also decreases with the number of potential punishers. The numerical results are discussed in the context of the statistical data on crimes in Northern Ireland and New Zealand, on divorces in USA, and on the alcohol consumption in Poland.
Embedding process models in object-oriented program code
Authors: Moritz Balz, Michael Goedicke
Venue: Proceedings of the 1st Workshop on Behaviour Modelling in Model-Driven Architecture (2009)

Process modeling has usually a strong connection with run time platforms that allow dynamic configuration and adjustment. While this is reasonable for the operation of large applications, it is of no help in cases when program code is to be engineered, documented or verified with respect to process models. We propose a design pattern for process models that allows to embed complete model semantics in object-oriented program code fragments. The program code can thus be validated and executed with respect to process model semantics and design tools.
GO! with Office 2007 Integrated Projects
Authors: Shelley Gaskin, Catherine Hain
Venue:  (2007)

The primary goal of GO! with Microsoft Office 2007 Introductory, 1/e, aside from teaching computer applications, is ease of implementation, with an approach that is based on clearly-defined projects for students and a one of a kind supplements package. Thorough coverage of Office 2007 applications, from getting started to project-based skills application. MARKET: Ideal for students and professionals seeking a conclusive introduction to Microsoft Office 2007 applications.
Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
Authors: Anna Heusinger, Christian Kanzow
Venue: Computational Optimization and Applications (2009)

We consider the generalized Nash equilibrium problem which, in contrast to the standard Nash equilibrium problem, allows joint constraints of all players involved in the game. Using a regularized Nikaido-Isoda-function, we then present three optimization problems related to the generalized Nash equilibrium problem. The first optimization problem is a complete reformulation of the generalized Nash game in the sense that the global minima are precisely the solutions of the game. However, this reformulation is nonsmooth. We then modify this approach and obtain a smooth constrained optimization problem whose global minima correspond to so-called normalized Nash equilibria. The third approach uses the difference of two regularized Nikaido-Isoda-functions in order to get a smooth unconstrained optimization problem whose global minima are, once again, precisely the normalized Nash equilibria. Conditions for stationary points to be global minima of the two smooth optimization problems are also given. Some numerical results illustrate the behaviour of our approaches.
Tree-width of graphs without a 3×3 grid minor
Authors: E. Birmelé, J. A. Bondy, B. A. Reed
Venue: Discrete Applied Mathematics (2009)

We show that graphs with no minor isomorphic to the 3x3 grid have tree-width at most 7.
Channel hot-carrier degradation under AC stress in short channel nMOS devices with high-k gate stacks
Authors: E. Amat, R. Rodríguez, M. Nafría, X. Aymerich
Venue: Microelectronic Engineering (2009)

The channel hot-carrier (CHC) degradation in nMOS transistors with high-k dielectric subjected to different AC stress configurations was studied. The influence of the gate AC stress waveform parameters on the CHC degradation was analysed, when a constant drain voltage was applied. For short channel devices, CHC degradation has been found to be dependent on duty-cycle and rise/fall times and independent of frequency. These results have been observed independently of the gate dielectric material (SiO"2 or high-k). Moreover, the CHC damage in a nMOS transistor subjected to stress conditions which simulate its operation within a CMOS inverter has been also analysed. Lower degradation is observed in this case.
On the numerical solution of the heat conduction equations subject to nonlocal conditions
Authors: J. Martín-Vaquero, J. Vigo-Aguiar
Venue: Applied Numerical Mathematics (2009)

Many physical phenomena are modelled by nonclassical parabolic boundary value problems with nonlocal boundary conditions. Many different papers studied the second-order parabolic equation, particularly the heat equation subject to the specifications of mass. In this paper, we provide a whole family of new algorithms that improve the CPU time and accuracy of Crandall's formula shown in [J. Martin-Vaquero, J. Vigo-Aguiar, A note on efficient techniques for the second-order parabolic equation subject to non-local conditions, Appl. Numer. Math. 59 (6) (2009) 1258-1264] (and this algorithm improved the results obtained with BTCS, FTCS or Dufort-Frankel three-level techniques previously used in other works, see [M. Dehghan, Efficient techniques for the second-order parabolic equation subject to nonlocal specifications, Appl. Numer. Math. 52 (2005) 39-62]) with this kind of problems. Other methods got second or fourth order only when k=sh^2, while the new codes got nth order for k=h; therefore, the new schemes require a smaller storage and CPU time employed than other algorithms. We will study the convergence of the new algorithms and finally we will compare the efficiency of the new methods with some well-known numerical examples.
First steps in distributed tangible technologies: a virtual tug of war
Authors: Antony Harfield, Ilkka Jormanainen, Hassan Shujau
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

The paper introduces an example of a 'distributed tangible technology' as a new type of technology that enables children in different physical locations to engage in physical interaction. A virtual tug of war game is an example of a distributed tangible technology that is played by groups of children pulling a rope from two separate locations. The game was launched when teams in Finland and South Africa competed during an international science festival. The paper describes the design and implementation of the tug of war game. It explores the challenges combining tangible user interfaces with distributed computing and distributed technologies to be overcome in future educational applications for children.