ppxscal/embedding_network huggingface dataset:
On a \mu-Kernel Based System Architecture Enabling Recovery from Rootkits
Authors: Julian B. Grizzard, Henry L. Owen
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

We present a system architecture called spine that supports detection and recovery from many kernel-level and user-level rootkits. The architecture forms a reliable basis for an intrusion recovery system (IRS). The spine architecture is a multi-tiered approach, relying on the integrity of a small µ-kernel based hypervisor for correctness at the base level. Spine vertebrae are positioned at each level in the system in order to overcome the semantic gap in the understanding of system state. We discuss the design of the system, highlighting the main advantages and disadvantages from other approaches. A series of attacks are conducted against the prototype system in order to test for correctness and time to recover. Finally, some system performance benchmarks are presented that show that a small performance penalty is incurred from the increased reliability.
Disabling RFID tags with visible confirmation: clipped tags are silenced
Authors: Günter Karjoth, Paul A. Moskowitz
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

Existing solutions to protect consumer privacy in RFID either put the burden on the consumer or suffer from the very limited capabilities of today's RFID tags. We propose the use of physical RFID tag structures that permit a consumer to disable a tag by mechanically altering the tag in such a way that the ability of a reader to interrogate the RFID tag by wireless mean is inhibited. In "clipped tags", consumers can physically separate the body (chip) from the head (antenna) in an intuitive way. Such a separation provides visual confirmation that the tag has been deactivated. However, a physical contact channel may be used later to reactivate it. Such a reactivation would require deliberate actions on the part of the owner of the RFID tag to permit the reactivation to take place. Thus reactivation could not be undertaken without the owner's knowledge unless the item were either stolen or left unattended. This mechanism enables controlled reuse after purchase, making clipped tags superior to other RFID privacy-enhancing technologies.
Self Distributed Query Region Covering in Sensor Networks
Authors: Ajoy K. Datta, Preethi Linga, Maria Gradinariu, Philippe Raipin-Parvedy
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

In this paper, we design self- novel solutions to the minimal connected sensor cover problem. The concept of self- is used to include fault-tolerant properties like selfcon figuring, self-reconfiguring/self-healing, etc. We present two self-stabilizing, fully distributed, strictly localized, and scalable solutions, and show that these solutions are both self-configuring and self-healing. The proposed solutions are space optimal in terms of the number of states used per node. Another feature of the proposed algorithms is that the faults are contained only within the neighborhood of the faulty nodes. This paper also includes a comparison of the performance of the two proposed solutions in terms of the stabilization time, cover size metrics, and ability to cope with transient and permanent faults.
Development of the Digital Portfolio Environment for both PC and PDA clients
Authors: Kenji Matsuura, Keiji Niki, Masahiko Katayama, Yoneo Yano
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Research on digital portfolio (e-Portfolio) became one of major themes in educational technology research field. Most of the current e-Portfolio proposal works only for rich client such as desktop PC. Now that current ubiquitous learning trend makes paradigm shift gradually, various client application on e- Learning should work on ubiquitous devices such as PDA. Hence, this research project proposes e- Portfolio environment for PDA client in addition to the traditional desktop PC client.
Growth of repetition-free words: a review
Authors: Jean Berstel
Venue: Theoretical Computer Science (2005)

This survey reviews recent results on repetitions in words, with emphasis on the estimations for the number of repetition-free words.
Integer linear programming inference for conditional random fields
Authors: Dan Roth, Wen-tau Yih
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Inference in Conditional Random Fields and Hidden Markov Models is done using the Viterbi algorithm, an efficient dynamic programming algorithm. In many cases, general (non-local and non-sequential) constraints may exist over the output sequence, but cannot be incorporated and exploited in a natural way by this inference procedure. This paper proposes a novel inference procedure based on integer linear programming (ILP) and extends CRF models to naturally and efficiently support general constraint structures. For sequential constraints, this procedure reduces to simple linear programming as the inference process. Experimental evidence is supplied in the context of an important NLP problem, semantic role labeling.
AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks
Authors: Ronggong Song, Larry Korba, George Yee
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

Security, anonymity, and scalability are still important issues for mobile ad hoc network routing protocols. We first expose the limitations of several existing mobile ad hoc network routing protocols with security and anonymity constraints and analyze their scalabilities. Based on the analysis, we propose a new anonymous dynamic source routing protocol (AnonDSR) to provide three levels of security protection. We compare their scalabilities with security constraints, and analyze the new protocol to show it has strong security and anonymity protection, and very good scalability.
A Random Early Expiration Detection Based Buffer Management Algorithm for Real-time Traffic over Wireless Networks
Authors: Yuan Chen, Lemin Li
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Buffer management algorithms need to decrease queue delay as well as to improve throughput. Because of unique issues in wireless channels, providing delay guarantee in wireless networks is much more complex than that of wired networks. We propose a random early expiration detection based buffer management algorithm for real-time traffic over wireless networks. The main idea is to predict whether new arrival packet can reach the receiver under the limit of maximal delay bound, and random discard the packet based on estimate result, so as to prevent invalid transmission, and at meanwhile to decrease queue delay and to reduce expiration probability of following packets. Considering the characters of wireless link such as variable channel condition and having transmission errors, the algorithm is divided into three stages. We also consider the influence on TCP performance in the design.
Atelier « mise en œuvre d'UPnP avec OSGi »
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

This worshop proposes to study the development and the deployment of UPnP devices and UPnP control points with OSGi.
Words derivated from Sturmian words
Authors: Isabel M. Araújo, Véronique Bruyère
Venue: Theoretical Computer Science (2005)

A return word of a factor of a Sturmian word starts at an occurrence of that factor and ends exactly before its next occurrence. Derivated words encode the unique decomposition of a word in terms of return words. Vuillon has proved that each factor of a Sturmian word has exactly two return words. We determine these two return words, as well as their first occurrence, for the prefixes of characteristic Sturmian words. We then characterize words derivated from a characteristic Sturmian word and give their precise form. Finally, we apply our results to obtain a new proof of the characterization of characteristic Sturmian words which are fixed points of morphisms.
IDS RainStorm: Visualizing IDS Alarms
Authors: Kulsoom Abdullah, Chris Lee, Gregory Conti, John A. Copeland, John Stasko
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

The massive amount of alarm data generated from intrusion detection systems is cumbersome for network system administrators to analyze. Often, important details are overlooked and it is difficult to get an overall picture of what is occurring in the network by manually traversing textual alarm logs. We have designed a novel visualization to address this problem by showing alarm activity within a network. Alarm data is presented in an overview where system administrators can get a general sense of network activity and easily detect anomalies. They then have the option of zooming and drilling down for details. The information is presented with local network IP (Internet Protocol) addresses plotted over multiple yaxes to represent the location of alarms. Time on the x-axis is used to show the pattern of the alarms and variations in color encode the severity and amount of alarms. Based on our system administrator requirements study, this graphical layout addresses what system administrators need to see, is faster and easier than analyzing text logs, and uses visualization techniques to effectively scale and display the data. With this design, we have built a tool that effectively uses operational alarm log data generated on the Georgia Tech campus network. The motivation and background of our design is presented along with examples that illustrate its usefulness.
Pedagogic Data as a Basis for Web Service Fault Models
Authors: N. Looker, L. Burd, S. Drummond, J. Xu, M. Munro
Venue: Proceedings of the IEEE International Workshop (2005)

This paper outlines our method for deriving Fault Models for use with our WS-FIT tool that can be used to assess the dependability of SOA. Since one of the major issues with extracting these heuristic rules and Fault Models is the availability of software systems we examine the use of systems constructed through pedagogic activities to provide one source of information.
Co-occurrence Retrieval: A Flexible Framework for Lexical Distributional Similarity
Authors: Julie Weeds, David Weir
Venue: Computational Linguistics (2005)

Techniques that exploit knowledge of distributional similarity between words have been proposed in many areas of Natural Language Processing. For example, in language modeling, the sparse data problem can be alleviated by estimating the probabilities of unseen co-occurrences of events from the probabilities of seen co-occurrences of similar events. In other applications, distributional similarity is taken to be an approximation to semantic similarity. However, due to the wide range of potential applications and the lack of a strict definition of the concept of distributional similarity, many methods of calculating distributional similarity have been proposed or adopted.In this work, a flexible, parameterized framework for calculating distributional similarity is proposed. Within this framework, the problem of finding distributionally similar words is cast as one of co-occurrence retrieval (CR) for which precision and recall can be measured by analogy with the way they are measured in document retrieval. As will be shown, a number of popular existing measures of distributional similarity are simulated with parameter settings within the CR framework. In this article, the CR framework is then used to systematically investigate three fundamental questions concerning distributional similarity. First, is the relationship of lexical similarity necessarily symmetric, or are there advantages to be gained from considering it as an asymmetric relationship? Second, are some co-occurrences inherently more salient than others in the calculation of distributional similarity? Third, is it necessary to consider the difference in the extent to which each word occurs in each co-occurrence type?Two application-based tasks are used for evaluation: automatic thesaurus generation and pseudo-disambiguation. It is possible to achieve significantly better results on both these tasks by varying the parameters within the CR framework rather than using other existing distributional similarity measures; it will also be shown that any single unparameterized measure is unlikely to be able to do better on both tasks. This is due to an inherent asymmetry in lexical substitutability and therefore also in lexical distributional similarity.
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
Authors: Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasman
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Chalcogenide based Phase Change Memory (PCM) is a promising type of non-volatile memory that will possibly replace the currently wide spread flash memory. Current research on PCMs targets the integration, feasibility, and reliability of such memory technology into the widely used CMOS process technology. Such studies identified special failure modes, known as disturbs, that could occur in PCMs. In this paper, we identify these failures and analyze their defective behaviors. Moreover, we develop fault models for such disturbs in addition to faults caused by opens and shorts in the core memory cell. Further, we propose an efficient test algorithm, called March-PC, to detect all faults discussed in this work.
Service Composition Architecture for Programmability and Flexibility in Ubiquitous Communication Networks
Authors: Yuki Yokohata, Yoji Yamato, Michiharu Takemoto, Hiroshi Sunaga
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

This paper addresses a new service composition method suitable for the forthcoming ubiquitous computing era. The latest developments in network computer technology have made various entities connected to the Internet, such as web services, sensors, and home information appliances, accessible to those who want to create their own service capabilities. The architecture we have thus far proposed is a key to achieving the ubiquitous concept, but approaches that spread the use of the architecture are required. We establish the architecture more widely usable in mobile Internet environments and suggest applicable domains for two types of proxy servers to compensate for the shortage of mobile terminal capacities. Practical service examples and business models are also discussed.
Putting statistics into a SIMULA program
Authors: Jacob Palme
Venue: ACM SIGSIM Simulation Digest (1976)

Statements for outputting a trace of what happens during a simulation, and for collecting statistics to be output after the end of the simulation, should not clutter up the main logic of the simulation program.This paper shows with a simple example how a SIMULA program can be structured such that the tracing and statistics and the main logic of the simulation program are partioned into different segments of the program.The paper will, at the same time, show the general facilities which SIMULA has for this kind of program structuring.
Declassification: Transforming Java Programs to Remove Intermediate Classes
Authors: Bernadette Power, G. W. Hamilton
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

This paper presents an optimisation technique which automatically inlines certain classes within their enclosing class. Inlining a class involves inserting the fields and methods of this class into the body of its enclosing class. The enclosing class is the class which declared an instance of the class. The declaration of the inlined class can then be removed from the program. This technique transforms Java programs into an equivalent form, which may be less readable, but is more efficient. The results of the empirical study showed that few classes were found suitable for inlining and that the declassification was not overly successful when optimizing the test programs. One of the advantages of declassification is that it does not result in code bloating. It is thought that further extensions to the declassification technique and an intrinsically object-oriented set of test programs could greatly improve it¿s effectiveness.
Teaching Automated Test Case Generation
Authors: Tsong Yueh Chen, Fei-Ching Kuo, Zhi Quan Zhou
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Software testing is a major approach to software quality assurance, but it is relatively neglected in universities' computing curricula. For students majoring in computer science or software engineering, several basic testing methods need to be taught. These testing methods generate test cases based on either specifications or program code. When introducing the testing methods based on program code, it is not easy to let the students experience automated test case generation due to the lack of supporting tools and limited teaching hours. In this paper we report our experience in teaching this topic with limited resources. The evaluation result indicates that our teaching method is effective and can also be adopted in other computer science / software engineering subjects where similar constraints exist.
Cartesian P-property and Its Applications to the Semidefinite Linear Complementarity Problem
Authors: Xin Chen, Houduo Qi
Venue: Mathematical Programming: Series A and B (2006)

We introduce a Cartesian P-property for linear transformations between the space of symmetric matrices and present its applications to the semidefinite linear complementarity problem (SDLCP). With this Cartesian P-property, we show that the SDLCP has GUS-property (i.e., globally unique solvability), and the solution map of the SDLCP is locally Lipschitzian with respect to input data. Our Cartesian P-property strengthens the corresponding P-properties of Gowda and Song [15] and allows us to extend several numerical approaches for monotone SDLCPs to solve more general SDLCPs, namely SDLCPs with the Cartesian P-property. In particular, we address important theoretical issues encountered in those numerical approaches, such as issues related to the stationary points in the merit function approach, and the existence of Newton directions and boundedness of iterates in the non-interior continuation method of Chen and Tseng [6].
Teaching Three Quality Assurance Techniques in Tandem - Lessons Learned
Authors: Cat Kutay, Muhammad Ali Babar
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

This paper presents our experiences gained in teaching software quality to undergraduate computer science and engineering students at The University of New South Wales. We argue that increasing demand of high quality software makes it imperative to teach a wide variety of skills which are required to deliver quality product or design and implement a quality focused process. We taught three quality improvement techniques to give students a greater appreciation of the range of the techniques available, and their respective strengths and weaknesses. We found it challenging but rewarding to inculcate programming minded students with the skills required to deal with product and process quality related issues. We believe that the experiences gained from this exercise will be valuable to those interested in designing and offering software quality education and training at tertiary level.
Sampling from the Weibull and gamma distributions in GPSS
Authors: Pandu R. Tadikamalla, Thomas J. Schriber
Venue: ACM SIGSIM Simulation Digest (1977)

This paper presents a technique for sampling from the three-parameter Weibull distribution within the context of GPSS, and briefly discusses the routine extension of this technique to the case of sampling from the gamma distribution. The several alternative algorithms which appear in the literature for sampling from these important distributions cannot be implemented directly in GPSS, because they involve such things as evaluation of logarithms and exponentiation, capabilities which GPSS does not currently have. The Weibull sampling technique developed and illustrated here in detail consequently involves creating generalized tables of pertinent functions, then performing lookups in these tables to support the sampling process. Kolmogorov-Smirnov and Chi-square testing of a large variety of samples drawn via this technique support the hypothesis at the 0.05 significance level that the samples were drawn from Weibull populations. The Weibull and gamma distributions are important in describing the behavior of a variety of random phenomena which occur in the fields of inventory theory, queuing theory, reliability studies, and maintenance scheduling. Because of the wide variety of shapes which these distributions can assume, they are also of interest in fitting empirical data which, consistent with the Weibull and gamma distributions, are typically non-negative, skewed, and unimodal. The methodology presented here, although straightforward, has not previously appeared in the literature, and is thought to be of potential interest and utility to a large number of GPSS users.
Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors
Authors: K. A. Mohamed, S. Haag, J. Peltason, F. Dal-Ri, Th. Ottmann
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

We present an effective corollary from our works in pen-gesture technologies, originally intended for conventional digital screen environments, that gives significant influence when expanded into the domain of tabletop displays. By virtue of incorporating angular and velocity-type "trace-features" for pen-gesture cognition into current classical linear-classifiers, we are able to place a greater emphasis not on the similarity of the "visual representation" of the gestures, but rather, on determining exactly from which corners of the table the gestures were conceived. In other words, we can find out which one of the four users around the table is interfacing with the tabletop display at any particular time, and do this without the need for additional sensing paraphernalia. We illustrate this inception by discussing our treatment of "disoriented" pen-gestures with our version of a 'manual' Monopoly board game for the tabletop.
Power from the Edge
Authors: Michael Macedonia
Venue: Computer (2005)

Apple's new iPod video technology may soon leap to cell phones.
Extending Simulink Models With Natural Relations To Improve Automated Model-Based Testing
Authors: Lisa M. Boden, Robert D. Busser, Mark R. Blackburn, Aaron M. Nauman
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The Simulink Model Tester "global assertions" capability developed by the Software Productivity Consortium and T-VEC Technologies is described in this paper. This assertions mechanism incorporates design assumptions or NATural relationships with Simulink models to automatically generate more valid test vectors using the Test Automation Framework. The positive impact this mechanism has on development and testing of Simulink models for the Lockheed Martin Space System's Independent Verification and Validation team is also discussed.