ppxscal/embedding_network huggingface dataset:
Noun phrase recognition with tree patterns
Authors: András Hócza
Venue: Acta Cybernetica (2004)

This paper offers a method for the noun phrase recognition of Hungarian natural language texts based on machine learning methods. The approach learns noun phrase tree patterns described by regular expressions from an annotated corpus. The tree patterns are completed with probability values using error statistics. The noun phrase recognition parser tries to find the best-fitting trees for a sentence using backtracking technique. The results are used in an information extraction toolchain.
Logic Circuits Testing for Transient Faults
Authors: Smita Krishnaswamy, Igor L. Markov, John P. Hayes
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Transient faults are becoming an increasingly serious concern for logic circuits. They can be caused by thermal neutrons, present at all altitudes, and by other types of ionizing radiation, especially in aerospace applications and nuclear engineering. In this paper we examine issues related to detection of transient errors. The difficulty in testing for transient errors is that they are not always present. Test vectors need to be repeated a number of times in order to detect a fault. We show how to compute a measure for the detectability of transient faults with respect to specific test vectors. This is done using a matrix-based gate-fault model known as the probabilistic transfer matrix model. Using this detectability measure we derive methods to generate multisets of tests to verify probability distributions of faults and detect abnormalities in circuit behavior. Applications of this method include detection of increased atmospheric radiation in terms of its impact on circuits, and testing for process variation that increases the susceptibility of a circuit to transient errors.
Bases of Motifs for Generating Repeated Patterns with Wild Cards
Authors: Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

Motif inference represents one of the most important areas of research in computational biology, and one of its oldest ones. Despite this, the problem remains very much open in the sense that no existing definition is fully satisfying, either in formal terms, or in relation to the biological questions that involve finding such motifs. Two main types of motifs have been considered in the literature: matrices (of letter frequency per position in the motif) and patterns. There is no conclusive evidence in favor of either, and recent work has attempted to integrate the two types into a single model. In this paper, we address the formal issue in relation to motifs as patterns. This is essential to get at a better understanding of motifs in general. In particular, we consider a promising idea that was recently proposed, which attempted to avoid the combinatorial explosion in the number of motifs by means of a generator set for the motifs. Instead of exhibiting a complete list of motifs satisfying some input constraints, what is produced is a basis of such motifs from which all the other ones can be generated. We study the computational cost of determining such a basis of repeated motifs with wild cards in a sequence. We give new upper and lower bounds on such a cost, introducing a notion of basis that is provably contained in (and, thus, smaller) than previously defined ones. Our basis can be computed in less time and space, and is still able to generate the same set of motifs. We also prove that the number of motifs in all bases defined so far grows exponentially with the quorum, that is, with the minimal number of times a motif must appear in a sequence, something unnoticed in previous work. We show that there is no hope to efficiently compute such bases unless the quorum is fixed.
Using resources from the web in computer science courses
Authors: Amruth N. Kumar, Lawrence D'Antonio, Frank P. Ford, Deborah Knox, Linda Wilkens, Richard Wyatt
Venue: Journal of Computing Sciences in Colleges (2004)

In under ten years, the World Wide Web has become an integral part of our everyday lives. During this time, it has also affected education in various ways, serving as a resource as well as a medium for instruction. How has the Web affected Computer Science education? What kinds of resources are available on the Web to support Computer Science courses? How can these resources be located? How can the resources be used in a traditional course? What are the pedagogical merits of using these resources, and what are the pitfalls? These are some of the questions that will be examined in this panel. The panelists will also share their experiences using such resources and list some recommendations for using them. The audience will be invited to introduce the resources they use and share their experiences at the end of the panel.
A Preconditioner for the FETI-DP Formulation with Mortar Methods in Two Dimensions
Authors: Hyea Hyun Kim, Chang-Ock Lee
Venue: SIAM Journal on Numerical Analysis (2004)

In this paper, we consider a dual-primal FETI (FETI-DP) method for elliptic problems on nonmatching grids. The FETI-DP method is a domain decomposition method that uses Lagrange multipliers to match solutions continuously across subdomain boundaries in the sense of dual-primal variables. We use the mortar matching condition as the continuity constraints for the FETI-DP formulation. We construct a preconditioner for the FETI-DP operator and show that the condition number of the preconditioned FETI-DP operator is bounded by $$C \max_{i=1,\ldots,N} \{ \left(1+\log\left( H_i / h_i \right)\right)^2 \}, $$ where $H_i$ and $h_i$ are sizes of domain and mesh for each subdomain, respectively, and $C$ is a constant independent of $H_i$'s and $h_i$'s. We allow jumps of coefficients of elliptic problems across subdomain boundaries. Numerical results are included.
INTEREST DRIVEN EXPLORATION OF AN INFORMATION SPACE
Authors: J. M. Slack, C. Conati
Venue: ACM SIGCHI Bulletin (1991)

This study will develop a model of the implementation process based on empirical evidence gathered from participants in that process as that process unfolds over a 12- to 18-month period. Previous research in organizational behavior and technology in organizations indicates that implementation may be a cyclical process of mutual adjustments of the organization to the technology and the technology to the organization. As a technology is found by members of the organization to be difficult to use or inadequate for their use, the design of that technology might be altered to render it more useable and useful. And, as that changed technology is put into use, alterations to the organization's structure might be required to optimize its use. It is this process of mutual adaptation which will serve as the focal point of this investigation.
Refinement Laws for Verifying Library Subroutine Adaptation
Authors: Colin Fidge, Peter Robinson, Steve Dunne
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

In Component-Based Software Engineering programs are constructed from pre-defined software library modules. However, if the libraryýs subroutines do not exactly match the programmerýs requirements, the subroutinesý code must be adapted accordingly. For this process to be acceptable in safety or mission-critical applications, where all code must be proven correct, it must be possible to verify the correctness of the adaptations themselves. In this paper we show how refinement theory can be used to model typical adaptation steps and to define the conditions that must be proven to verify that a library subroutine has been adapted correctly.
Invariant aspects in M-commerce environments
Authors: Jari Veijalainen
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Mobile phones and other small and powerful portable devices have revolutionized personal communication and affected the lifestyles of the people in the industrialized world. Following credible estimates, in a few years there will over two - billions of such portable devices in use. An emerging trend is the electronic commerce performed using mobile terminals over wireless networks, often called mobile commerce or M-commerce. Mobile commerce environments are characterized by high complexity, including myriads of technical and organizational aspects. This property makes it difficult to distinguish the more fundamental issues, structures, and concepts in mobile commerce from the hype. To capture the fundamental aspects and objects of mobile commerce environments, we have developed a model. It covers fundamental structures and persistent entities of the M-commerce environment, as well as their relationships. Rather than providing technical details of M-commerce environments, our aim is to model invariant properties that will evidently persist for years to come. Making use of the abstraction capabilities provided by the object-oriented approach, the model is represented by OO structure diagrams.Structurally, we distinguish four spheres of concern: Regulatory Frameworks, Business Models, Enabling Technologies, and the Global Infrastructure. These are dependent on each other, but have a relative independence and development logic that is different in each sphere of concern. In addition, the development logic is different in different regions of the world. The leading Regulatory Areas are currently Far-East (Japan, South Korea), Europe (European Union), and USA. These are analyzed in the light of a few examples.The material on which the keynote is mainly based has been published in [1] and [2].
Scalable NIC-based Reduction on Large-scale Clusters
Authors: Adam Moody, Juan Fernandez, Fabrizio Petrini, Dhabaleswar K. Panda
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Many parallel algorithms require efficient reduction collectives. In response, researchers have designed algorithms considering a range of parameters including data size, system size, and communication characteristics. Throughout this past work, however, processing was limited to the host CPU. Today, modern Network Interface Cards (NICs) sport programmable processors with substantial memory, and thus introduce a fresh variable into the equation. In this paper, we investigate this new option in the context of large-scale clusters. Through experiments on the 960-node, 1920-processor ASCI Linux Cluster (ALC) at Lawrence Livermore National Laboratory, we show that NIC-based reductions outperform host-based algorithms in terms of reduced latency and increased consistency. In particular, in the largest configuration tested - 1812 processors - our NIC-based algorithm summed single-element vectors of 32-bit integers and 64-bit floating-point numbers in 73 µs and 118 µs, respectively. These results represent respective improvements of 121% and 39% over the production-level MPI library.
Analog-to-digital converter based on single-electron tunneling transistors
Authors: Chaohong Hu, Sorin Dan Cotofana, Jianfei Jiang, Qiyu Cai
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

A novel single-electron tunneling transistors (SETTs) based analog-to-digital converter (ADC) is proposed in this paper. The scheme we propose fully utilizes Coulomb oscillation effect, can properly operate at T > 0 K, and only a capacitive divider (built with 2n - 2 capacitors) and n pairs of complementary SETTs are required for an n-bit ADC implementation. When compared with other state-of-the-art SET based ADCs our method provides the most compact solution measured in terms of circuit elements and has a potential advantage in terms of conversion speed. To illustrate the operation of the proposed scheme, a 4-bit ADC is demonstrated at 10K by means of simulation.
CDSS: Secure Distribution of Software Installation Media Images in a Heterogeneous Environment
Authors: Ted Cabeen, Job Bogan
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

CDSS is a framework for the distribution of software installation media images and their contents over multiple file sharing protocols. The CDSS system provides a unique isolated server instance for every accessing user, even when another instance of that server is already running. CDSS uses the Linux host-based firewall system to transparently redirect inbound connections from each user to his specific server instance. By doing so, multiple users can access the CDSS server over the same protocol on the standard port without requiring any special configuration by the user. Each user can only communicate with the server instance that was started explicitly for him and that has been automatically configured by CDSS to allow access only to the files that he has requested.CDSS is currently implemented as a collection of web and shell scripts that run on Linux servers that support the IPTables and IPChains firewalling systems. CDSS currently supports image distribution via the following protocols: HTTP, FTP, TFTP, NFS, SMB, and AppleShare IP. CDSS can share any filesystem image file stored on the server as well as the individual contents of those images that the server can loopback-mount.
A cultural systems approach to collaboration in art & technology
Authors: Stephen Jones
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In this paper I take a wider, cultural theory based, view than is usual in the literature of collaboration and its role in creativity. I will explore the nature of the collaborative interaction as a cybernetic process and draw on the systems theoretic approaches of Burnham's systems aesthetics, Wiener's cybernetics, Deleuze and Guattari's machinic phylum and Maturana and Varela's autopoiesis to build up a cultural framework of the interactive behaviours between individuals that constitute collaboration. I then canvass some actual historical collaborations as well as my own personal experience as both an artist working in Art & Technology and as a technologist working for many other artists. I will also look at some of the empirical work that has been done on collaboration and explore how it and the historical and personal experiences fit into the structure of interactive relations that the cultural systems approach has brought out.
MARio: mobility-adaptive routing using route lifetime abstractions in mobile ad hoc networks
Authors: Yong Wang, Margaret Martonosi, Li-Shiuan Peh
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

Mobile Ad hoc NETworks (MANETs) often have fast-changing and unpredictable mobility. This is especially true for recently emerging mobile sensor networks [7] and delay tolerant networks [2], where extreme network conditions are prevalent. To better adjust to such network conditions, we propose to deconstruct the underlying node mobility into a set of abstractions that can be readily leveraged for driving dynamic routing decisions. In particular, we investigate the feasibility of using route lifetime to abstract mobility. Through extensive simulations on DSR, we demonstrate up to 31% improvement in packet delivery rate and 53% improvement in average end-to-end packet latency, using our proposed route prefetch and decay techniques that leverage knowledge of route lifetimes.
Combining Requirements Engineering Techniques " Theory and Case Study
Authors: Li Jiang, Armin Eberlein, Behrouz H. Far
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The selection of requirements engineering (RE) techniques during software project development is a challenge for most developers. One of the reasons is that there is a great lack of requirements engineering education in most academic programs, so software developers have to learn requirements engineering practices on the job. This can easily result in the selection of techniques that are ill-suited for a particular project, as the selection is based on personal preference rather than on the characteristics of the project. Very little research has been done in the area of technique selection based on project attributes. This paper describes research into the selection and combination of RE techniques as well as a case study that applied the selection process to an industrial software project.
Control of the angular motion of a semiactive bundle of bodies relying on the estimates of nonmeasurable coordinated obtained by Kalman filtration methods
Authors: V. G. Borisov, A. S. Ermilov, T. V. Ermilova, V. M. Sukhanov
Venue: Automation and Remote Control (2005)

It is shown that for the formation of effective control of the motion of flexible objects defined below in the form of the semiactive bundle of bodies, there is a need for the information on the coordinates of a " rigid" and an "elastic" component of the total motion, which usually defy the direct measurement. Issues of the use of the Kalman filtration are treated for the estimation aboard (in flight conditions) of modal-physical coordinates (MP coordinates) of the angular motion of deformable space vehicles (DSVs) belonging to the class of mechanical systems under consideration. With the methods of mathematical modeling, a high rate and a high accuracy of the estimation of MP coordinates are displayed, which are necessary for the use of the resulting estimates in the problem of control over the class of objects under consideration in real time. A procedure is suggested for the correction of the basic algorithm of orientation, which affords the stability of the angular motion of an object with an essentially nonrigid structure.
The Art of Computer Virus Research and Defense
Authors: Peter Szor
Venue:  (2005)

"Of all the computer-related books I've read recently, this one influenced my thoughts about security the most. There is very little trustworthy information about computer viruses. Peter Szor is one of the best virus analysts in the world and has the perfect credentials to write this book."-Halvar Flake, Reverse Engineer, SABRE Security GmbHSymantec's chief antivirus researcher has written the definitive guide to contemporary virus threats, defense techniques, and analysis tools. Unlike most books on computer viruses, The Art of Computer Virus Research and Defense is a reference written strictly for white hats: IT and security professionals responsible for protecting their organizations against malware. Peter Szor systematically covers everything you need to know, including virus behavior and classification, protection strategies, antivirus and worm-blocking techniques, and much more.Szor presents the state-of-the-art in both malware and protection, providing the full technical detail that professionals need to handle increasingly complex attacks. Along the way, he provides extensive information on code metamorphism and other emerging techniques, so you can anticipate and prepare for future threats.Szor also offers the most thorough and practical primer on virus analysis ever published-addressing everything from creating your own personal laboratory to automating the analysis process. This book's coverage includes Discovering how malicious code attacks on a variety of platforms Classifying malware strategies for infection, in-memory operation, self-protection, payload delivery, exploitation, and more Identifying and responding to code obfuscation threats: encrypted, polymorphic, and metamorphic Mastering empirical methods for analyzing malicious code-and what to do with what you learn Reverse-engineering malicious code with disassemblers, debuggers, emulators, and virtual machines Implementing technical defenses: scanning, code emulation, disinfection, inoculation, integrity checking, sandboxing, honeypots, behavior blocking, and much more Using worm blocking, host-based intrusion prevention, and network-level defense strategies © Copyright Pearson Education. All rights reserved.
A note on the Relationship Between Covert Channels and Application Verification
Authors: David Slater
Venue: ACM SIGSAC Review (1987)

The purpose of this paper is to present a warning that covert channels even at very low bandwidths can be a significant threat in conjuction with sufficiently sophisticated "trojan horses".According to DOD 5200,28-STD (the orange book) covert channels with a bandwidth of under 1 bit per ten seconds need not even be audited in a trusted system.While this seems reasonable it is easy to imagine scenarios where covert channels with a flow rate much lower than this may indeed compromise vital information, if the process from which the flow originates is an intelligent trojan horse.Consider the following scenario: A trusted multi-level secure strategic logistics system with a trojan horse which is an expert system capable of detecting whether there are troop and supply movements planned, which would allow offensive action within the next week. A convert channel with the rate of one bit per day, which each day transmits this information from the expert trojan horse to an insecure process would certainly be of great value in strategic planning.In summary, when considering the maximum bandwidth requirements on convert channels, it is necessay to consider this in line with the type of information available to processes running at the higher security levels, and the degree of trust that one has in these applications.
Design of Robust PID Controller With Disturbance Rejection For Motor Using Immune Algorithm
Authors: Dong Hwa Kim, Jae Hoon Cho
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this paper, design approach of PID controller with rejection function against external disturbance in motor control system is proposed using immune algorithm. Up to the present time, PID Controller has been used to operate for AC motor drive because of its implementational advantages in practice and simple structure. However, it is not easy to achieve an optimal PID gain with no experience, since the gain of the PID controller has to be manually tuned by trial and error in the industrial world. To design disturbance rejection function, disturbance rejection conditions based on H_¿ are illustrated and to decide the performance of response for the designed PID controller, an ITSE (Integral of time weighted squared error) is used. Hence, parameters of PID controller are selected by immune algorithm to obtain the required response.
Developing Secure Transcoding Intermediary for SVG Medical Images within Peer-to-Peer Ubiquitous Environment
Authors: Sabah M. A. Mohammed, Jinan A. W. Fiaidhi
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

This work is intended to be an objective introduction to the topic of secure image transcoding for ubiquitous P2P environments. The focus of the article is on the "XMLization" (or computer imaging in XML) in general, and SVG in particular. This article develop a framework for achieving such goal using the JXTA delivery infrastructure, the Batik or the XSL APIs for transcoding and the XML Encryption based on lightweight encipherment techniques. The ultimate goal is development of a comprehensive secure medical imaging delivery system which can work effectively for ubiquitous and P2P environment.
SPIN! Data mining system based on component architecture
Authors: Alexandr Savinov
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The SPIN! data mining system has a component-based architecture, where each component encapsulates some specific functionality such as a data source, an analysis algorithm or visualization. Individual components can be visually linked within one workspace for solving different data mining tasks. The SPIN! friendly user interface and flexible underlying component architecture provide a powerful integrated environment for executing main tasks constituting a typical data mining cycle: data preparation, analysis, and visualization.