ppxscal/embedding_network huggingface dataset:
Providing Seamless Mobility in Wireless Networks Using Autonomic Mechanisms
Authors: John Strassner, Barry Menich, Walter Johnson
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Existing wireless networks have little in common, as they are designed around vendor-specific devices that use specific radio access technologies to provide particular functionality. Next generation networks seek to integrate wide-area and local-area wireless systems in order to provide seamless services to the end user. This would provide freedom of movement between indoor/outdoor and metropolitan/enterprise coverage while maintaining continuity of applications experience. Seamless Mobility is an experiential architecture, predicated on providing mechanisms that enable a user to accomplish his or her tasks without regard to technology. This paper examines how autonomic mechanisms can satisfy some of the challenges in realizing seamless mobility solutions.
Tool Support for Continuous Quality Control
Authors: Florian Deissenboeck, Elmar Juergens, Benjamin Hummel, Stefan Wagner, Benedikt Mas y Parareda, Markus Pizka
Venue: IEEE Software (2008)

Over time, software systems suffer gradual quality decay and therefore costs can rise if organizations fail to take proactive countermeasures. Quality control is the first step to avoiding this cost trap. Continuous quality assessments help users identify quality problems early, when their removal is still inexpensive; they also aid decision making by providing an integrated view of a software system's current status. As a side effect, continuous and timely feedback helps developers and maintenance personnel improve their skills and thereby decreases the likelihood of future quality defects. To make regular quality control feasible, it must be highly automated, and assessment results must be presented in an aggregated manner to avoid overwhelming users with data. This article offers an overview of tools that aim to address these issues. The authors also discuss their own flexible, open-source toolkit, which supports the creation of dashboards for quality control.
An Efficient Anonymous Credential System
Authors: Norio Akagi, Yoshifumi Manabe, Tatsuaki Okamoto
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

This paper presents an efficient anonymous credential system that includes two variants. One is a system that lacks a credential revoking protocol, but provides perfect anonymity-unlinkability and computational unforgeability under the strong Diffie-Hellman assumption. It is more efficient than existing credential systems with no revocation. The other is a system that provides revocation as well as computational anonymity-unlinkability and unforgeability under the strong Diffie-Hellman and decision linear Diffie-Hellman assumptions. This system provides two types of revocation simultaneously: one is to blacklist a user who acted wrong so that he can no longer use his credential, and the other is identifying a user who acted wrong from his usage of credential. Both systems are provably secure under the above-mentioned assumptions in the standard model.
SHARE-A Eulogy to Cooperative Effort
Authors: Paul Armer
Venue: IEEE Annals of the History of Computing (1980)

Whenever someone asks about SHARE, the first question is usually "What do the initials mean?" The answer is that SHARE is a name and not a set of initials. The second question is usually "Just what is SHARE?" SHARE has been frequently described as a "users' cooperative." It is made up of most of the organizations who have, or plan on getting, an IBM Type 704 EDPM. Like any cooperative, SHARE was formed to be of service to its members. Its aim is to eliminate, as much as possible, redundant effort expended in using the 704. It seeks to accomplish this aim by promoting cooperation and communication among installations that use the 704.
Motivating Students through On-Line Competition: An Analysis of Satisfaction and Learning Styles
Authors: Luisa M. Regueras, Elena Verdú, María J. Verdú, María Á. Pérez, Juan P. Castro, María F. Muñoz
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

The Bologna model pursues to improve the quality of Higher Education and, in turn, human resources across Europe. One of the action lines of the Bologna Process is the promotion of the attractiveness of the European Higher Education Area (EHEA). In this context, motivated students are a key element. Motivation can be reached in a number of different ways, one of which is explored in this paper, and consists in the use of active e-learning methodologies to force students to compete among themselves during their learning process. The relationship between motivation and competition is analysed through a number of hypotheses focusing on elements such as the level of satisfaction of students with different learning styles (competitive, collaborative...) when using the competitive active e-learning tool called QUESTournament. This system has been used in several University courses belonging to different degrees and diplomas taught at the University of Valladolid (Spain). Data collected from these experiences are analysed and discussed.
Self-localization Using Odometry and Horizontal Bearings to Landmarks
Authors: Matthias Jüngel, Max Risler
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

On the way to the big goal - the game against the human world champion on a real soccer field - the configuration of the soccer fields in RoboCup has changed during the last years. There are two main modification trends: The fields get larger and the number of artificial landmarks around the fields decreases. The result is that a lot of the methods for self-localization developed during the last years do not work in the new scenarios without modifications. This holds especially for robots with a limited range of view as the probability for a robot to detect a landmark inside its viewing angle is significantly lower than on the old fields. On the other hand the robots have more space to play and do not collide as often as on the small fields. Thus the robots have a better idea of the courses they cover (odometry has higher reliability). This paper shows a method for self-localization that is based on bearings to horizontal landmarks and the knowledge about the robots movement between the observation of the features.
Entropy Regularized LPBoost
Authors: Manfred K. Warmuth, Karen A. Glocer, S. V. Vishwanathan
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algorithm for doing this. It maximizes the soft margin by solving a linear programming problem. While it performs well on natural data, there are cases where the number of iterations is linear in the number of examples instead of logarithmic.By simply adding a relative entropy regularization to the linear objective of LPBoost, we arrive at the Entropy Regularized LPBoost algorithm for which we prove a logarithmic iteration bound. A previous algorithm, called SoftBoost, has the same iteration bound, but the generalization error of this algorithm often decreases slowly in early iterations. Entropy Regularized LPBoost does not suffer from this problem and has a simpler, more natural motivation.
Volterra Algorithm for Modelling Sea Surface Current Circulation from Satellite Altimetry Data
Authors: Maged Marghany, Mazlan Hashim, Arthur P. Cracknell
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper was utilized a new approach for modelling sea surface current from JASON-1 satellite altimetry data. This was based on utilizing of the Volterra series expansion in order to transform the time series satellite altimetry data into a real ocean surface current. Thus,the basic equation of hydrodynamic has been solved by second order Volterra model. Then, the Volterra kernel inversion used to obtain the sea surface current velocity. The finite element model of Lax-Wendorff schemes used which was based on triangular space-time elements to map the spatial current variation in the South China Sea over different monsoon periods. In situ sea surface current measurements were collected along the east coast of peninsular Malaysia by using electromagnetic current meters. The study shows that the maximum current magnitude of 1.2 m/s was occurred during the northeast monsoon period as compared to other monsoon periods. The main noticeable feature was an existence of anticlockwise eddy in the Gulf of Thailand. The results also shows a good correlation between in situ current measurements and the Volterra-Lax-Wendrof scheme with high R2 of 0.91. It can be said that Volterra-Lax-Wendrof scheme can be used as numerical scheme for modelling sea surface current from altimetry data.
Four Editions and Eight Publishers: A History of the Encyclopedia of Computer Science
Authors: Anthony Ralston
Venue: IEEE Annals of the History of Computing (2004)

Since the publication of the first edition in 1976, the Encyclopedia of Computer Science has been the standard one-volume reference work in computer science. Surprisingly for a successful book (the fourth edition was published in 2000), the Encyclopedia has been owned by eight different publishers since 1971. This article relates the salient facts in the history of the Encyclopedia and the vicissitudes experienced during the preparation of the four editions.
Real-Valued LCS Using UNDX for Technology Extraction
Authors: Setsuya Kurahashi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper proposes a new method of developing a process response model from continuous time-series data. Chemical and/or biotechnical plants always generate a large amount of time series data. However, since conventional process models are described as a set of control models, it is difficult to explain complicated and active plant behaviors. To uncover complex plant behaviors, the method consists of the following phases: (1) Reciprocal correlation analysis; (2) Process response model; (3) Extraction of a workflow; (4) Extraction of control rules of real-valued data. The main contribution of the research is to establish a method to mine a set of meaningful control rules from a Learning Classifier System using UNDX(Unimodal Normal Distribution Crossover) for real-valued data. The proposed method has been applied to an actual process of a biochemical plant and has shown its validity and effectiveness.
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
Authors: Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Thorup and Zwick, in the seminal paper [Journal of ACM, 52(1), 2005, pp 1-24], showed that a weighted undirected graph on n vertices can be preprocessed in subcubic time to design a data structure which occupies only subquadratic space, and yet, for any pair of vertices, can answer distance query approximately in constant time. The data structure is termed as approximate distance oracle. Subsequently, there has been improvement in their preprocessing time, and presently the best known algorithms [4,3] achieve expected O(n2) preprocessing time for these oracles. For a class of graphs, these algorithms indeed run in &theta;(n2) time. In this paper, we are able to break this quadratic barrier at the expense of introducing a (small) constant additive error for unweighted graphs. In achieving this goal, we have been able to preserve the optimal size-stretch trade offs of the oracles. One of our algorithms can be extended to weighted graphs, where the additive error becomes 2 &middot;wmax(u,v) - here wmax(u,v) is the heaviest edge in the shortest path between vertices u, v.
Reasoning about Substitute Choices and Preference Ordering in e-Services
Authors: Sybren Kinderen, Jaap Gordijn
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

e-Services are just like normal services, but can be ordered and provisioned via the Internet completely. Increasingly, these e-services are offered as a multi-supplier bundle of elementary services. How to automatically compose and prioritize these multi-supplier e-service bundles is considered as a key problem. In this paper, we present the e 3 service ontology to represent a multi-supplier e-service catalogue from a consumer need perspective. Then, we use this ontology to reason about alternative e-service bundles satisfying a particular need, and to prioritize the found bundles using the consumer benefits they provide. The ontology and the reasoning process are illustrated by a case study in the Dutch telecommunication industry.
Shared Context for Knowledge Distribution: A Case Study of Collaborative Taggings
Authors: Jason J. Jung
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Many existing knowledge management systems have been employing blogging services which is capable of providing various services to people. However, content delivering service among bloggers is not taking into account context (or semantics) of the contents, so that the service can spread irrelevant information into blogs. In order to solve this problem, this study proposes a blog context overlay network architecture for context matching between blogs. It is referred to as detecting "shared" context Thus, we can identify a community of practice (CoP) on blogosphere, with respect to contexts. As a result, newly generated knowledge can be proactively diffused to the blogs of which context is relevant to the knowledge, before the bloggers' queries are asked.
MATA: A Tool for Aspect-Oriented Modeling Based on Graph Transformation
Authors: Jon Whittle, Praveen Jayaraman
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

This paper describes MATA (Modeling Aspects Using a Transfor-mation Approach), a UML aspect-oriented modeling tool that uses graph transformations to specify and compose aspects. Graph transformations provide a unified approach for aspect modeling. The methods presented here can be applied to any modeling language with a well-defined metamodel. This paper, however, focuses on UML class diagrams, sequence diagrams and state diagrams. MATA takes a different approach to aspect-oriented modeling since there are no explicit join points. Rather, any model element can be a join point and composition is a special case of model transformation. We illustrate MATA on structural and behavioral models for a cell phone example.
In Vivo Evaluation of a Guidance System for Computer Assisted Robotized Needle Insertion Devoted to Small Animals
Authors: Stephane A. Nicolau, Luis Mendoza-Burgos, Luc Soler, Didier Mutter, Jacques Marescaux
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

To improve therapy research against cancer, we propose a robotized computer assisted system for needle insertion devoted to the small animal. The system is composed of a robotic arm on which the needle is attached and two cameras rigidly linked. It needs a preoperative CT acquisition in which the biologist defines an entry point and the target he wants to reach. The needle guidance is ensured by a visual servoing and the needle is registered in the CT frame using radio-opaque markers stuck beforehand on the small animal.Biologists estimate that such a system can be beneficial if the time preparation per animal remains below 15 minutes and if the insertion accuracy is within 1 mm. Several error sources can be identified : the error due to the system only, the organ repositioning error (due to breathing motions) and the error induced by the needle insertion.In this paper, we report an evaluation on living rats of the system error and of the organ repositioning error. Encouraging results show that a global accuracy of 0.9 mm may be reached with an acceptable preparation time.
Computational Atlases of Severity of White Matter Lesions in Elderly Subjects with MRI
Authors: Stathis Hadjidemetriou, Peter Lorenzen, Norbert Schuff, Susanne Mueller, Michael Weiner
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

MRI of cerebral white matter may show regions of signal abnormalities. These changes may be associated with hypertension, inflammation, or ischemia, as well as altered brain function. The goal of this work has been to construct computational atlases of white matter lesions that represent both their severity as well as the frequency of their occurrence in a population to achieve a better classification of white matter disease. An atlas is computed with a pipeline that uses 4T FLAIR and 4T T1-weighted (T1w) brain images of a group of subjects. The processing steps include intensity correction, lesion extraction, intra-subject FLAIR to T1w rigid registration, and seamless replacement of lesions in T1w images with synthetic white matter texture. Subsequently, the T1w images and lesion images of different subjects are registered non-rigidly to the same space. The decrease in T1w intensities is used to obtain severity information. Atlases were constructed for two groups of subjects, elderly normal controls or with mild cognitive impairment, and subjects with cerebrovascular disease. The lesion severities of the two groups have a significant statistical difference with the severity in the atlas of cerebrovascular disease being higher.
Analyzing Context-Free Grammars Using an Incremental SAT Solver
Authors: Roland Axelsson, Keijo Heljanko, Martin Lange
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some finite length: inclusion, intersection, universality, equivalence, and ambiguity. These are in (co)-NP and thus solvable by a reduction to the (un-)satisfiability problem for propositional logic. We present such encodings --- fully utilizing the power of incrementat SAT solvers --- prove correctness and validate this approach with benchmarks.
How Rude Are You?: Evaluating Politeness and Affect in Interaction
Authors: Swati Gupta, Marilyn A. Walker, Daniela M. Romano
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Recent research on conversational agents emphasises the need to build affective conversational systems with social intelligence. Politeness is an integral part of socially appropriate and affective conversational behaviour, e.g. consider the difference in the pragmatic effect of realizing the same communicative goal with either "Get me a glass of water mate!" or "I wonder if I could possibly have some water please?" This paper presents POLLy (Politeness for Language Learning), a system which combines a spoken language generator with an artificial intelligence planner to model Brown and Levinson's theory of politeness in collaborative task-oriented dialogue, with the ultimate goal of providing a fun and stimulating environment for learning English as a second language. An evaluation of politeness perceptions of POLLy's output shows that: (1) perceptions are generally consistent with Brown and Levinson's predictions for choice of form and for discourse situation, i.e. utterances to strangers need to be much more polite than those to friends; (2) our indirect strategies which should be the politest forms, are seen as the rudest; and (3) English and Indian native speakers of English have different perceptions of politeness.
Incremental Development of a Distributed Real-Time Model of a Cardiac Pacing System Using VDM
Authors: Hugo Daniel Macedo, Peter Gorm Larsen, John Fitzgerald
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

The construction of formal models of real-time distributed systems is a considerable practical challenge. We propose and illustrate a pragmatic incremental approach in which detail is progressively added to abstract system-level specifications of functional and timing properties via intermediate models that express system architecture, concurrency and timing behaviour. The approach is illustrated by developing a new formal model of the cardiac pacemaker system proposed as a "grand challenge" problem in 2007. The models are expressed using the Vienna Development Method (VDM) and are validated primarily by scenario-based tests, including the analysis of timed traces. We argue that the insight gained using this staged modelling approach will be valuable in the subsequent development of implementations, and in detecting potential bottlenecks within suggested implementation architectures.