ppxscal/embedding_network huggingface dataset:
Diagnosis and planning with resource constraints
Authors: Leslie Pack Kaelbling
Venue:  (2003)

Consider the task of selecting actions that move a complex physical system such as a spacecraft from its current state to a state that achieves a set of desired goals. In practice, this task is complicated by the possibility of failures. When failures occur, the system enters an unanticipated state and subsequent actions may not have the expected effect. The exact state of the system may not be directly observable, and some goals may become unachievable. Intuitively, we desire actions that move the system from states it's likely to occupy to a state that achieves all goals that remain achievable. This work consists of novel diagnosis algorithms for determining the likely states of a system even when failures are not immediately observable, and novel planning algorithms for achieving as many goals as possible even when the initial state of the system is not exactly known. If computation time is restricted, the quality of the diagnoses and plans produced degrades gracefully. Results are presented on examples from the domain of spacecraft control and the planning literature. The diagnosis algorithms generate approximate belief states for a relevant class of partially observable Markov decision processes with very large state spaces. The algorithms incrementally generate an approximate belief We efficiently maintain a partial belief state when it remains consistent with observations and revisit past assumptions about the system's evolution when required by delayed evidence of a failure. Conformant planning is the problem of generating a plan that moves a system from any of a number of possible initial states to a goal state. The dominant approach considers the effects of actions in all states simultaneously. In this work, we find a plan for one possible state and incrementally extend it to work in all states. We move beyond conformant plans to optimize the goals a plan achieves and the initial states it considers according to user priorities. Thus we find good plans even when no conformant plan exists due to system failures, or none can be found due to limited computation.
Defending Embedded Systems Against Buffer Overflow via Hardware/Software
Authors: Zili Shao, Qingfeng Zhuge, Yi He, Edwin H. -M. Sha
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Buffer overflow attacks have been causing serious securityproblems for decades. With more embedded systemsnetworked, it becomes an important research problem todefend embedded systems against buffer overflow attacks.In this paper, we propose the Hardware/Software AddressProtection (HSAP) technique to solve this problem. We firstclassify buffer overflow attacks into two categories (stacksmashing attacks and function pointer attacks) and thenprovide two corresponding defending strategies. In ourtechnique, hardware boundary check method and functionpointer XOR method are used to protect a system againststack smashing attacks and function pointer attacks, respectively.Although the focus of the HSAP technique is on embeddedsystems because of the availability of hardware support,we show that the HSAP technique can be applied toany type of processors to defend against buffer overflow attacks.We use four classes of processors to illustrate thatthe applicability of our technique is independent of architectures.We experiment with our HSAP technique in ARMEvaluator-7T simulation development environments. Theresults show that our HSAP technique can defend a systemagainst more types of buffer overflow attacks with littleoverhead than the previous work.
An Element Rotation Algorithm for Multi-bit DAC Nonlinearities in Complex Bandpass \Delta\SigmaAD Modulators
Authors: Hao San, Haruo Kobayashi, Shinya Kawakami, Nobuyuki kuroiwa
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a technique for improving the resolutionof complex bandpass \Delta\SigmaADCs which are used forwireless communication systems.Oversampling and noise-shapingare used to achieve high accuracy of a \Delta\SigmaAD modulator.However when a multi-bit DAC is used inside a modulator,nonlinearities of the DAC are not noise-shaped andthe SNR of the \Delta\SigmaADC degrades.For the conversion ofcomplex intermediate frequency (IF) input signals, a complexbandpass \Delta\SigmaAD modulator can provide superior performanceto a pair of real bandpass \Delta\SigmaAD modulators ofthe same order.This paper proposes a new noise-shapingalgorithm - implemented by adding simple digital circuitry - toreduce the effects of nonlinearities in multi-bit DACs ofcomplex bandpass \Delta\SigmaAD modulators.We have performedsimulation with MATLAB to verify the effectiveness of thealgorithm, and the results show that the proposed algorithmcan improve the SNR of a complex bandpass \Delta\SigmaADC withnonlinear internal multi-bit DACs.
A Remark on the Szarek&ndash;Talagrand Theorem
Authors: S. Alesker
Venue: Combinatorics, Probability and Computing (1997)

A sharper form of the Szarek&ndash;Talagrand &lsquo;isomorphic&rsquo; version of the Sauer&ndash;Shelah lemma is proved. Also we prove an analogous &lsquo;isomorphic&rsquo; version of the Karpovsky&ndash;Milman lemma, which is a generalization of that due to Sauer and Shelah.
SCRUPLE: a reengineer's tool for source code search
Authors: Santanu Paul
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

For software maintainers and reengineers confronted with the task of locating an interesting section of source code, a slow, painstaking scan of the source code using grep like tools is often the only available option. Similar problems arise in code optimization and program understanding. To alleviate the situation, we have in the past proposed a scheme for defining pattern languages using which one can specify interesting code features [13]. This paper addresses the automatic detection of source code sections that fit patterns described using such languages. We have built prototypes of our runtime system for C and PL/AS (an IBM internal programming language). The key to efficient, automatic search lies in the representations of the source code and the pattern being searched. A domain-independent pattern detection algorithm based on these representations is described. A prototype of the system was also built to search for simple patterns in English text, which demonstrates the generality of the pattern language concept as well as the underlying pattern detection mechanism.
Using software testing to move students from trial-and-error to reflection-in-action
Authors: Stephen H. Edwards
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Introductory computer science students rely on a trial and error approach to fixing errors and debugging for too long. Moving to a reflection in action strategy can help students become more successful. Traditional programming assignments are usually assessed in a way that ignores the skills needed for reflection in action, but software testing promotes the hypothesis-forming and experimental validation that are central to this mode of learning. By changing the way assignments are assessed--where students are responsible for demonstrating correctness through testing, and then assessed on how well they achieve this goal--it is possible to reinforce desired skills. Automated feedback can also play a valuable role in encouraging students while also showing them where they can improve.
The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA
Authors: John H. Reif
Venue: Natural Computing: an international journal (2003)

We provide designs for the first autonomous DNA nanomechanical devices that execute cycles of motion without external environmental changes. These DNA devices translate along a circular strand of ssDNA and rotate simultaneously. The designs use various energy sources to fuel the movements, include (i) ATP consumption by DNA ligase in conjunction with restriction enzyme operations, (ii) DNA hybridization energy in trapped states, and (iii) kinetic (heat) energy. We show that each of these energy sources can be used to fuel random bidirectional movements that acquire after n steps an expected translational deviation of O(&radic;n). For the devices using the first two fuel sources, the rate of stepping is accelerated over the rate of random drift due to kinetic (heat) energy. Our first DNA device, which we call walking DNA, achieves random bidirectional motion around a circular ssDNA strand by use of DNA ligase and two restriction enzymes. Our other DNA device, which we call rolling DNA, achieves random bidirectional motion without use of DNA ligase or any restriction enzyme, and instead using hybridization energy. We also describe how to modify the design for the rolling DNA device to include a ``latching mechanism'' that fixes the wheels position at specified location along the road, so as to provide for overall unidirectional translational movement.
Orthogonal quadruple systems and 3-frames
Authors: William B. Muse, K. T. Phelps
Venue: Journal of Combinatorial Theory Series A (2003)

Orthogonal quadruple systems are defined and investigated. Orthogonal quadruple systems with an additional nesting property are shown to provide a new construction of 3-frames F(3,4, n{2}) (Design Codes Cryptogr. 4 (1994) 5). Constructions for pairs of nested orthogonal quadruple systems are provided. Applications to 2-resolvable Steiner quadruple systems and highly nonlinear functions are discussed.
SOM: feature extraction from patient discharge summaries
Authors: D. J. Tufts-Conrad, A. N. Zincir-Heywood, D. Zitner
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In each Canadian province, hospitals collect information, at discharge, on the hospital stay of each patient. The information is collected in the form of a patient discharge abstract (PDA) and sent to the Canadian Institute for Health Information. The Patient Discharge Abstract uses the ICD-10-CA code standard to outline the assigned diagnoses for the patient's condition and the procedures that were performed. One compulsory piece of information in the Patient Discharge Abstract is the identification of the "most responsible diagnosis" (MRDx) -- that diagnosis considered to be the most significant condition of the patient that caused the greatest length of stay in hospital. This research investigates the potential for automating the process of feature extraction from a narrative patient discharge summary to support the classification of the MRDx for a Patient Discharge Abstract. Unsupervised neural networks -- Self-Organizing Maps (SOM) -- are effective for classification tasks based on noisy input patterns. Here a hierarchical architecture of SOMs is used to identify semantic similarities encoded in the original information and visualize the characteristics of an MRDx.
Global software alliances: the challenge of 'standardization'
Authors: Sundeep Sahay
Venue: Scandinavian Journal of Information Systems (2003)

Global Software Alliances (GSAs) are a relatively new organizational form that firms are increasingly adopting to meet their software development needs. These relationships are fraught with complexity given the temporal, spatial and cultural separation of the firm contracting out the software development work and the firm doing the development. In this paper, we focus on the challenge of standardization that contributes significantly to the ongoing complexity. The nature of the standardization problem is elaborated, and the tensions that are associated in their implementation are analyzed. A key implication arising from the paper is the need to broaden the technical focus on standards that have existed in prior research, and to give increased emphasis on management practices. Latour's idea of "circulating reference" is introduced to analyze the question of "what is lost, what is gained, and what remains invariant in the process of translation?"
Case study: the design of CBC4Kids' StoryBuilder
Authors: Alissa Antle
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

This paper describes the design of an online collaborative storytelling environment for children aged 8--10. The project balances children's needs to have flexible creative environments [22] with the desire of a public broadcaster to publish quality user-generated content that showcases Canadian stories. This paper outlines five key practices that contributed to the successful design of StoryBuilder. Ninety-five children were involved in the project using a combination of informant-based and user-centred iterative design techniques. Examination and observation of oral storytelling activities and behaviors, technology-based creativity tools and storytelling styles formed the basis for the remaining design practices.
Why project courses sometimes widen the experience gap among students
Authors: Lecia J. Barker, Kathy Garvin-Doxas
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Choices by students and faculty about their roles in group learning activities can result in students not learning new skills/knowledge. Faculty must be cautious about how students are grouped and should educate students about group roles to avoid problems.
The theory behind the economic role of managing the strategic alignment of organizations while creating new markets
Authors: Sam Lubbe
Venue: The economic and social impacts of e-commerce (2003)

Over the past couple of years, the Internet has taken off and organizations will soon reap economic benefits on it. E-commerce will therefore hopefully emerge as an efficient yet effective mode of creating new markets although most managers still doubt the economic impact and profitability it has. Enabled by global telecommunication networks and the convergence of computing, telecom, entertainment and publishing industries, e-commerce is supplanting (may be replacing) traditional commerce. In the process, it is creating new economic opportunities for today's businesses, creating new market structures. Managers of tomorrow must therefore understand what e-commerce is; how the approach to this concept will be; and how it will affect the economic position of the organization.These questions are asked: What is the return on investment (ROI) on e-commerce? What is the effect of e-commerce on the strategic alignment of the organization? In addition, what is the economic effect of the strategic alignment on the organization? This paper explains the economic impact of e-commerce and how it can be used to create new markets and to improve the strategic alignment of the organization.
Septic fields with discriminant &#x00B1;2a3b
Authors: John W. Jones, David P. Roberts
Venue: Mathematics of Computation (2003)

We classify septic number fields which are unramified outside of {∞, 2, 3} by a targeted Hunter search; there are exactly 10 such fields, all with Galois group S7. We also describe separate computations which strongly suggest that none of these fields come from specializing septic genus zero three-point covers.
Techniques for accurate performance evaluation in architecture exploration
Authors: George Hadjiyiannis, Srinivas Devadas
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

We present a system that automatically generates a cycle-accurate and bit-true instruction level simulator (ILS) and a hardware implementation model given a description of a target processor. An ILS can be used to obtain a cycle count for a given program running on the target architecture, while the cycle length, die size, and power consumption can be obtained from the hard-ware implementation model. These figures allow us to accurately and rapidly evaluate target architectures within an architecture exploration methodology for system-level synthesis.In an architecture exploration scheme, both the ILS and the hardware model must be generated automatically, else a substantial programming and hardware design effort has to be expended in each design iteration. Our system uses the Instruction Set Description language to support the automatic generation of the ILS and the hardware synthesis model, as wall as other related tools.
Steganography: historical development and applications at the undergraduate level
Authors: Hector Rosario
Venue:  (2003)

Steganography is the study and implementation of methods applied to conceal the existence of messages. It is usually considered a sister discipline of watermarking, which is the study of techniques concerned with copyright and ownership protection. Together they form the academic and technological discipline known as information hiding. This study presents a comprehensive review of the ancient and modern history of steganography, as well as various mathematical aspects behind some of the methods used to communicate covertly through digital media. We begin by presenting a comprehensive survey of the history of steganography and then investigate several techniques of steganography and steganalysis from a pedagogical perspective. Although the monograph particularly focuses on steganography, an introduction to watermarking is included at the end for completion purposes. We believe that mathematical science majors will benefit from this exposition as it is expected that the technical part of the monograph will serve as an ancillary source in an undergraduate level course on steganography. We recommend students enter such a course with some knowledge of Discrete Mathematics, one course on Abstract Algebra, and two courses on Calculus, which should have enabled them to develop an acceptable level of mathematical maturity. A population that we believe will be particularly well served is that of prospective secondary mathematics teachers, as we believe this monograph provides an opportunity to learn contemporary applications of mathematics with substantial content with which to enrich classroom instruction&mdash;a highly imperative aspect in the training of these professionals.
Practical metaprogramming
Authors: James R. Cordy, Medha Shukla
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Metaprogramming is the process of specifying generic software source templates from which classes of software components, or parts thereof, can be automatically instantiated to produce new software components. Metaprograms are specified in an annotated by-example style accessible to ordinary programmers of the source language. Annotations are in the form of Prolog-like predicates that specify the conditions under which different parts of the source template are to be instantiated. Instantiation of a source component is done by specifying facts about the new application in a database, from which the appropriate instance of the metaprogram is automatically inferred using Prolog-style deduction.This paper describes a practical metaprogramming system being developed as part of the ITRC Software Life Cycle Technology project, which utilizes source transformation to implement all phases of the metaprogramming process. Metaprograms are automatically transformed into TXL (Tree Transformation Language) source transformation tasks that automatically implement the instantiation process using TXL. Examples are shown of the use of metaprogramming in automatically deriving C language glue routines that allow Prolog programs to access the GL graphics library.
Human communication via data networks
Authors: Murray Turoff
Venue: ACM SIGCAS Computers and Society (1973)

There are two major reasons why you should learn something about computer conferencing. Delphi techniques, and other data network communication modes.One is that the capacity for group interaction, and one's own efficiency in communicating with others, can be significantly enhanced with a well-conceived conferencing system. We have learned this through direct experience in communication regarding the wage and price 1.2 and in system design work.The second reason, to be developed later in some detail, regards cost. Economics already favors computerized conferencing, even for fairly small groups, within organizations that have computers and terminals. As mini-system and terminal costs decline, and digital data networks come into wide use, we should by the late seventies find this communications mode to be quite commonplace.
Improving Multicast Tree Construction in Static Ad Hoc Networks
Authors: Aleksi Penttinen, Jorma Virtamo
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

We consider wireless multicast tree construction for energyefficiency. We introduce a novel algorithm, IncrementalShortest Path Tree (ISPT), to generate source-based multicasttrees and analyse its performance. Additionally, thepotential of further improvements in the tree constructionis addressed comparing the performance of the algorithmwith the results from a simulated annealing optimisation.
Near PS-compact L-subsets
Authors: Shi-Zhong Bai
Venue: Information Sciences: an International Journal (2003)

In this paper, the new concept of near PS-compactness in L-topological spaces is introduced. It is defined for any L-subset. Its characterizations and topological properties are systematically studied. And the relationship is exposed between near PS-compactness and PS-compactness, and also fuzzy compactness.
Cryptanalysis of anonymous channel protocol for large-scale area in wireless communications
Authors: A. M. Barbancho, A. Peinado
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The authentication and anonymous channel protocol for large-scale area in wireless communications proposed in [Proc. Sixth IEEE Symposium on Computers and Communications (ISCC'01), 3-5 (2001) 36] by Lin-Jan is analyzed, proving that it is not secure. More precisely, fake anonymous channel tickets can be easily generated allowing nonauthorized users to be validated by the Visiting Network. Unlike it was claimed in [Proc. Sixth IEEE Symposium on Computers and Communications (ISCC'01), 3-5 (2001) 36], the security of this protocol does not rely on the difficulty of computing discrete logarithms over the finite field GF(p), p being a prime.
"MICRO-ED" an educational support system for the disabled child
Authors: A. G. Cartwright
Venue: Issue 24 (October 1978) (1978)

A major characteristic of any support equipment for the young developing child should be flexibility, particularly in the educational sphere where the needs of a given child are constantly changing as his intellect develops. The MicroEd system described creates such flexibility by exploiting the microprocessor as a control unit. An infinitely expandable library of user programmes is made accessible, via a common transmission line, to a variety of displays and switch inputs situated around the school. A phototype display unit consisting of a matrix of lamps so controlled has just begun clinical use and applications to the areas of communication, assessment, education and recreation are immediately apparent.