ppxscal/embedding_network huggingface dataset:
ITACA: An integrated toolbox for the automatic composition and adaptation of Web services
Authors: Javier Camara, Jose Antonio Martin, Gwen Salaun, Javier Cubo, Meriem Ouederni, Carlos Canal, Ernesto Pimentel
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Adaptation is of utmost importance in systems developed by assembling reusable software services accessed through their public interfaces. This process aims at solving, as automatically as possible, mismatch cases which may be given at the different interoperability levels among interfaces by synthesizing a mediating adaptor. In this paper, we present a toolbox that fully supports the adaptation process, including: (i) different methods to construct adaptation contracts involving several services; (ii) simulation and verification techniques which help to identify and correct erroneous behaviours or deadlocking executions; and (iii) techniques for the generation of centralized or distributed adaptor protocols based on the aforementioned contracts. Our toolbox relates our models with implementation platforms, starting with the automatic extraction of behavioural models from existing interface descriptions, until the final adaptor implementation is generated for the target platform.
Chameleon hashes without key exposure based on factoring
Authors: Wei Gao, Xue-Li Wang, Dong-Qing Xie
Venue: Journal of Computer Science and Technology (2007)

Chameleon hash is the main primitive to construct a chameleon signature scheme which provides nonrepudiation and non-transferability simultaneously. However, the initial chameleon hash schemes suffer from the key exposure problem: non-transferability is based on an unsound assumption that the designated receiver is willing to abuse his private key regardless of its exposure. Recently, several key-exposure-free chameleon hashes have been constructed based on RSA assumption and SDH (strong Diffie-Hellman) assumption. In this paper, we propose a factoring-based chameleon hash scheme which is proven to enjoy all advantages of the previous schemes. In order to support it, we propose a variant Rabin signature scheme which is proven secure against a new type of attack in the random oracle model.
Analysis of the effect of Headline News in financial market through text categorisation
Authors: Satoru Takahashi, Hiroshi Takahashi, Kazuhiko Tsuda
Venue: International Journal of Computer Applications in Technology (2009)

In this paper, we analyse the relation between stock-price returns and Headline News. Headline News is a very important source of information in asset management and is sent in large quantities every day. We study the effect of more than 13,000 Headline News sent from Jiji Press. We classify Headline News into three types using text categorisation and analyse the reaction of a stock-price return to each types of news. From our research, we figure out following issues: (1) we make the text categorisation system that has about 80&#37; of classification accuracy, (2) this system can extract effective information to stock-price returns from Headline News and (3) such information is more effective to the small firms.
Validating Integrity for the Ephemerizer's Protocol with CL-Atse
Authors: Charu Arora, Mathieu Turuani
Venue: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration (2009)

It is usually very difficult in Computer Science to make an information "disappear" after a certain time, once it has been published or mirrored by servers world wide. This, however, is the goal of the IBM ephemerizer's protocol by Radia Perlman. We present in this paper the general structure of the CL-Atse protocol analysis tool from the AVISPA's tool-suite, and symbolic analysis of the ephemerizer's protocol and its extensions using CL-Atse. This protocol allows transmitting a data which retrieval is guarantied to be impossible after a certain time. We show that this protocol is secure for this property plus the secrecy of the data, but is trivially non secure for its integrity. We model a standard integrity check as a first extension to this protocol, which is natural and close to common usage, and we present a second extension for integrity that is much less obvious and deeply integrated in the structure of the ephemerizer's protocol. Then, we show that while the first extension guaranty the basic integrity property under certain conditions, the second one is much stronger and allows faster computations.
Real-Time Face Tracking for Context-Aware Computing
Authors: Bogdan Raducanu, Jordi Vitrià
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

The use of context can be a very relevant cue for computer vision-based systems, in order to eliminate a lot of ambiguity and uncertainty, otherwise inherent, in the human-computer interaction. Despite of the fact that its obvious importance is widely acknowledged, the great majority of the systems nowdays still lack of this capability. In this paper, we propose faces as a primary contextual information for person detection and present face tracking as a basic procedure for context-driven focus of attention applications. Our proposal was implemented in a combined system, by integrating a motion-based approach (Particle Filter) and a model-based approach (Ada-Boost).
A Rendering Method for 3D Origami Models Using Face Overlapping Relations
Authors: Yohsuke Furuta, Jun Mitani, Yukio Fukui
Venue: Proceedings of the 10th International Symposium on Smart Graphics (2009)

When we construct a model of origami (a model of a folded sheet of paper) in a computer, it is usual to represent the model as a set of polygons having zero thickness. One of the typical characteristics of origami is that there are many instances where multiple faces are located on a same plane. In these cases, the usual z-buffer rendering method fails as multiple faces have the same depth. Furthermore, many penetrations between faces located close to each other frequently occur when the origami is folded almost flat. However, it is difficult to remove all such penetrations with moving or fixing the geometry of the model. In this paper, we propose a new rendering method that solves these problems one at a time by using the OR matrix. This is a matrix constructed from a crease pattern, and it represents the overlapping relation between every two faces.
WIKI government: a public sector innovation
Authors: Beth Noveck
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Technology can bring an innovation to government. We present "Wiki Government" that uses WIKI technology to design a collaborative democratic government which allows public decision making through public participation. This public sector innovation invites the public to participate in the patent examination process. The Peer-to-Patent project radically transformed its review process by allowing anyone with Internet access to collaborate with the agency in reviewing patent applications. The design challenges the team faced in creating software to distill online collaboration into useful expertise are discussed.
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
Authors: Shaheen Fatima, Michael Wooldridge, Nicholas R. Jennings
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This paper analyzes bilateral multi-issue negotiation between self-interested agents. Specifically, we consider the case where issues are divisible, there are time constraints in the form of deadlines and discount factors, and the agents have different preferences over the issues. Given these differing preferences, it is possible to reach Pareto-optimal agreements by negotiating all the issues together using a package deal procedure (PDP). However, finding equilibrium strategies for this procedure is not always computationally easy. In particular, if the agents' utility functions are nonlinear, then equilibrium strategies may be hard to compute. In order to overcome this complexity, we explore two different solutions. The first is to use the PDP for linear approximations of the given nonlinear utilities. The second solution is to use a simultaneous procedure (SP) where the issues are discussed in parallel but independently of each other. We then compare these two solutions both in terms of their computational properties (i.e., time complexity of computing an approximate equilibrium and the associated error of approximation) and their economic properties (i.e., the agents' utilities and social welfare of the resulting outcome). By doing so, we show that an approximate equilibrium for the PDP and the SP can be found in polynomial time. In terms of the economic properties, although the PDP is known to generate Pareto optimal outcomes, we show that, in some cases, which we identify, the SP is better for one of the two agents and also increases the social welfare.
Theoretical models for work function control (Invited Paper)
Authors: Kenji Shiraishi
Venue: Microelectronic Engineering (2009)

We have studied Fermi level pinning (FLP) of Hf-based high-k gate stacks based on thermodynamics based on an O vacancy model. Our study shows that FLP cannot be avoided when the system is under thermal equilibrium. O exposure to aim O vacancy elimination is not effective, since O vacancy elimination condition is equivalent to the Si substrate oxidation which leads to the increase in Equivalent oxide thickness (EOT). We also studied the mechanism of FLP induced by the reduction with H"2 anneal. FLP with H"2 anneal is governed by the O vacancy annihilation reaction by reducing SiO"2 interface layer. Based on these considerations, we propose some recipes for obtaining band-edge-work-function metals.
Bregman distances and Chebyshev sets
Authors: Heinz H. Bauschke, Xianfu Wang, Jane Ye, Xiaoming Yuan
Venue: Journal of Approximation Theory (2009)

A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in Euclidean spaces a closed set is Chebyshev if and only if the set is convex. In this paper, from the more general perspective of Bregman distances, we show that if every point in the space has a unique nearest point in a closed set, then the set is convex. We provide two approaches: one is by nonsmooth analysis; the other by maximal monotone operator theory. Subdifferentiability properties of Bregman nearest distance functions are also given.
Evaluation of global system state thanks to local phenomenona
Authors: Contet Jean-Michel, Gechter Franck, Gruer Pablo, Koukam Abder
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

This paper presents a new approach for the evaluation of a system's global state properties. The approach is intented for the application to reactive multiagent system (RMAS) and adresses the evaluation of emergent properties such as global stabilisation. This approach is inspired by statistical physics and thermodynamics, as a way to link the microscopic and a macroscopic points of view. It gives an important role to partition function Z as defined in statistical physics. From this mathematical function can be extracted indicators that represent the global evaluation of the system state based on local phenomena. In this paper, the approach is put into practice by considering a classical reactive multiagent system: bird flocks simulation. The methodology was applied to analyze system stability. Experimental results obtained with a multiagent simulation platform are presented.
An artificial neural network model for the lifetime estimation of wood poles supporting the overhead Hellenic electrical distribution network
Authors: C. A. Christodoulou, D. S. Oikonomou, P. M. Kyrtsopoulos, L. Ekonomou, N. Harkiolakis
Venue: Proceedings of the 10th WSEAS international conference on Neural networks (2009)

Lifetime estimation of power system components is a very important issue for electrical power utilities, since the maintenance scheduling and the replacement decisions are mainly based on such studies. Wood poles may account for about one third of the material costs, and further costs occur due to pole replacements throughout the life time of an overhead distribution line. The Hellenic electrical distribution networks are basically supported with the use of wood poles. Outages due to ageing, degradation or broken wood poles may infer significant costs due to repair and loss of energy to consumers. Therefore the estimation of the life expectancy and the production of survival curve for in-service wood poles are essential. In this paper an artificial neural network (ANN) method is developed and presented for the lifetime estimation of the wood poles supporting the Hellenic electrical overhead distribution network. Actual recorded input and output data collected from the Hellenic distribution network are used for the ANN training. The ANN model is applied on in-service wood poles from several areas of Hellas presented very accurate results concerning their condition. The proposed methodology intends to minimize the life-cycle cost of inspection and refurbishment of wood poles in the distribution network of Hellas, something that is really important in the new competitive and liberating Hellenic electrical energy market.
Dynamic Neural Network-Based Fault Detection and Isolation for Thrusters in Formation Flying of Satellites
Authors: Arturo Valdes, K. Khorasani, Liying Ma
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

The objective of this paper is to develop a dynamic neural network-based fault detection and isolation (FDI) scheme for satellites that are tasked to perform a formation flying mission. Specifically, the proposed FDI scheme is developed for Pulsed Plasma Thrusters (PPT) that are considered to be used in satellite's Attitude Control Subsystem (ACS). By using the relative attitudes of satellites in the formation our proposed "High Level" fault diagnoser scheme can detect a pair of thrusters that are faulty. This high level diagnoser however cannot isolate the faulty satellite in the formation. Towards this end, a novel "Integrated" dynamic neural network (DNN)-based FDI scheme is proposed to achieve both fault detection and fault isolation of the formation flying of satellites. This methodology involves an "optimal" fusion of the "High Level" FDI scheme with a DNN-based "Low Level" FDI scheme that was recently developed by the authors. To demonstrate the FDI capabilities of our proposed schemes various fault scenarios are simulated and a comparative study among the techniques is performed.
From Research and Development to Field Application: Collaboration Between Laboratory and Service Organization For Online Professional Education
Authors: D. Michael Anderson, Penelope A. Lantz
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Health Media Lab, an R & D firm, and The Alzheimer's Association, a large voluntary organization, are collaborating to create an online course to train supervisory nurses in dementia care staff supervision. This paper discusses this collaboration as an example of how researchers and service organizations can work toward mutually beneficial goals: the creation and evaluation of innovative educational materials, as well as their dissemination from laboratory to field use.
Design and Implementation of Metadata System in PetaShare
Authors: Xinqi Wang, Tevfik Kosar
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

As the size of scientific and commercial datasets grows, it becomes imperative that an expressive metadata framework to be developed to facilitate access to the semantics of the data. However, the drive to enhance expressiveness and maximize performance often turns out to be contradictory. Hence, the design of metadata framework needs to take into consideration many factors in order to achieve balance between expressive power and performance. In this paper, we discuss the metadata framework developed for PetaShare and explain the design and implementation decisions we made in the process.
Design and implementation of an agent home scheme strategy for prefetch-based DSM systems
Authors: Hsiao-Hsi Wang, Kuan-Ching Li, Ssu-Hsuan Lu, Chun-Chieh Yang, Jean-Luc Gaudiot
Venue: International Journal of Parallel Programming (2008)

In recent years, cluster computing has been widely investigated and there is no doubt that it can provide a cost-effective computing infrastructure by aggregating computational power, communication, and storage resources. Moreover, it is also considered to be a very attractive platform for low-cost supercomputing. Distributed shared memory (DSM) systems utilize the physical memory of each computing node interconnected in a private network to form a global virtual shared memory. Since this global shared memory is distributed among the computing nodes, accessing the data located in remote computing nodes is an absolute necessity. However, this action will result in significant remote memory access latencies which are major sources of overhead in DSM systems. For these reasons, in order to increase overall system performance and decrease this overhead, a number of strategies have been devised. Prefetching is one such approach which can reduce latencies, although it always increases the workload in the home nodes. In this paper, we propose a scheme named Agent Home Scheme. Its most noticeable feature, when compared to other schemes, is that the agent home distributes the workloads of each computing nodes when sending data. By doing this, we can reduce not only the workload of the home nodes by balancing the workload for each node, but also the waiting time. Experimental results show that the proposed method can obtain about 20% higher performance than the original JIAJIA, about 18% more than History Prefetching Strategy (HPS), and about 10% higher than Effective Prefetch Strategy (EPS).
Interactive chroma keying for mixed reality
Authors: Nicholas Beato, Yunjun Zhang, Mark Colbert, Kazumasa Yamazawa, Charles E. Hughes
Venue: Computer Animation and Virtual Worlds (2009)

In Mixed Reality (MR) applications, immersion of virtual objects in captured video contributes to the perceived unification of two worlds, one real, one synthetic. Since virtual actors and surround may appear both closer and farther than real objects, compositing must consider spatial relationships in the resulting world. Chroma keying, often called blue screening or green screening, is one common solution to this problem. This method is under-constrained and most commonly addressed through a combination of environment preparation and commercial products. In interactive MR domains that impose restrictions on the video camera hardware, such as in experiences using video see-through (VST) head-mounted displays (HMD), chroma keying becomes even more difficult due to the relatively low camera quality, the use of m ltiple camera sources (one per eye), and the required processing speed. Dealing with these constraints requires a fast and affordable solution. In our approach, we precondition the chroma key by using principal component analysis (PCA) to obtain usable alpha mattes from video streams in real-time on commodity graphics processing units (GPUs). In addition, we demonstrate how our method compares to off-line commercial keying tools and how it performs with respect to signal noise within the video stream. Copyright &copy; 2009 John Wiley & Sons, Ltd. In Mixed Reality applications that use video see-through head-mounted display technology, blue-screening often identifies locations where virtual content should interact with the real environment. We propose a semi-automated, noise-tolerant algorithm capable of interactively keying video signals on a GPU. We show that our method, based on principle components analysis, produces alpha mattes comparable to commercial off-line solutions.
Relative localization with 2-hop neighborhood
Authors: Christopher J. Mallery, Sirisha Medidi, Muralidhar Medidi
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Localization is the process in which nodes in a wireless sensor network self-determine their positions in the network. While there are many effective mathematical techniques for solving the problem of localization, most are not suitable for the resource-constrained distributed environment of sensor networks. We propose ANIML an iterative, range-aware relative localization technique for wireless sensor networks that requires no anchor nodes. ANIML restricts itself to the use of only local 1- and 2-hop neighbor information, avoiding the need for information flooding and thus controlling cascading ranging errors that bedevil other localization techniques. While least-squares minimization is a mathematically simple constraint optimization technique, utilizing 1- and 2-hop neighbor information as constraints, ANIML provides better localization without the need for more sophisticated error control and/or global information. We implemented ANIML in ns-2 and conducted extensive experimentation to evaluate its performance. Experimental results show that ANIML provides robust localization and scales well.
The Internet Financing Illusion: A Diary of Global Scams
Authors: Vincent Panettiere
Venue:  (2007)

Millions of people have been the victims of Internet scams in recent years. The Internet Financing Illusion explores one businessmans personal journey through the perplexing and often dark world of cyberspace and profiles the faceless financial scam artists who lurk behind keyboards and computer screens. In 1999, Vincent Panettiere started searching for ways to finance his film production company. More than two hundred leads and several months later, he was unwittingly thrust into an Internet adventure that would consume his life. Anamika Biswas of Kolkata, India, said she had $33 billion to invest in several companies located in the United States, Bermuda, Canada, and Australia. For most of 2003, this twenty-four-year-old woman led Panettiere and approximately twenty other individuals and businesses with the precision of a military commander leading the enemy into a blind canyon. In this powerful and cautionary tale, Panettiere includes the actual e-mails he exchanged with Biswas in order to help others recognize the inconsistencies, lies, and manipulative text that Internet scam artists use to lure their victims. The Internet Financing Illusion delivers firsthand information and invaluable guidance to keep you scam-proof in cyberspace. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player