ppxscal/embedding_network huggingface dataset:
CS educational research: a meta-analysis of SIGCSE technical symposium proceedings
Authors: David W. Valentine
Venue: ACM SIGCSE Bulletin (2004)

A meta-analysis is performed on the last twenty years of SIGCSE Technical Symposium Proceedings, looking for the kind of CS Educational Research that has been done at the CS1/CS2 level. A six-point taxonomy of articles types is described. It is shown that about one in five of all CS1/CS2 presentations have used some kind of experimental model, albeit "experimental" is defined quite broadly. Over the last ten years both the number of experimental models, and the percentage of experimental models among CS1/CS2 has significantly increased. SIGCSE members are challenged to adopt a research model for their presentations to the Technical Symposium.
Case Generation Using Rough Sets with Fuzzy Representation
Authors: Sankar K. Pal, Pabitra Mitra
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this article, we propose a rough-fuzzy hybridization scheme for case generation. Fuzzy set theory is used for linguistic representation of patterns, thereby producing a fuzzy granulation of the feature space. Rough set theory is used to obtain dependency rules which model informative regions in the granulated feature space. The fuzzy membership functions corresponding to the informative regions are stored as cases along with the strength values. Case retrieval is made using a similarity measure based on these membership functions. Unlike the existing case selection methods, the cases here are cluster granules and not sample points. Also, each case involves a reduced number of relevant features. These makes the algorithm suitable for mining data sets, large both in dimension and size, due to its low-time requirement in case generation as well as retrieval. Superiority of the algorithm in terms of classification accuracy and case generation and retrieval times is demonstrated on some real-life data sets.
American sign language recognition: reducing the complexity of the task with phoneme-based modeling and parallel hidden markov models
Authors: Christian Philipp Vogler
Venue:  (2003)

In this thesis I present a framework for recognizing American Sign Language (ASL) from 3D data. The goal is to develop approaches that will scale well with increasing vocabulary sizes. Scalability is a major concern, because the computational treatment of ASL is a very complex undertaking. Two points particularly stand out: First, ASL is a highly inflected language, resulting in too many appearances of inflectional variants to model them all separately. Second, in ASL events occur both sequentially and simultaneously. Unlike speech recognition, ASL recognition cannot consider all possible combinations of simultaneous events explicitly, because of their sheer number. As a result, the computational treatment of ASL is much more complex than the computational treatment of spoken languages. Reducing the complexity of the task requires a two-pronged approach, which encompasses work on both the modeling and the computational sides. On the modeling side, I tackle the many appearances by breaking the signs down into their constituent phonemes, which are limited in number. I use the Movement-Hold phonological model for ASL as a guideline, and extend the parts of it that are not directly applicable to recognition systems. In addition, I recast it to describe simultaneous events in independent channels, so that it is no longer necessary to consider all their possible combinations. The result is a significant reduction of the modeling complexity. On the recognition side, I pose parallel hidden Markov models (PaHMMs) as an extension to conventional hidden Markov models. I develop a PaHMM recognition algorithm specifically geared toward the properties of sign languages. PaHMMs are the computational counterpart to modeling simultaneous events in independent channels, and allow putting them together on the fly at recognition time, instead of having to consider them a-priori. I validate the modeling approach and the PaHMM recognition algorithm in a pilot study with experiments on 53-sign and 22-sign data sets. In the PaHMM experiments, the independent channels consist of the hand movements of both hands, and the handshape of the strong hand. The results demonstrate the viability of both the phoneme modeling and the description of simultaneous events in independent channels.
Events not equal to GUIs
Authors: Stuart Hansen, Timothy Fossum
Venue: ACM SIGCSE Bulletin (2004)

The event driven paradigm is ubiquitous in modern software. Many texts introduce events when discussing graphical user interfaces, but the event paradigm extends well beyond that domain. Events also play important roles in operating systems, component based systems, reactive systems, middleware, web services and other fields. Computer science educators have an obligation to see that our students thoroughly understand the event paradigm and have some grounding in tools to develop event driven systems. This paper describes an upper division, computer science elective course in event driven programming. The course gives a comprehensive treatment of event driven systems. It appropriately captures the importance of the event paradigm and serves to integrate concepts from several different computing fields, including Programming Languages, Operating Systems, and Software Engineering. It also introduces students to advanced tools and packages designed for developing event driven systems. The course has been taught four times at our institution, having repeatedly received high marks from the students for both its conceptual and technical content.
The design of a configurable, extensible and dynamic notification service
Authors: Roberto S. Silva Filho, Cleidson R. B. de Souza, David F. Redmiles
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Publish/subscribe infrastructures, specifically notification servers, are used in a large spectrum of distributed applications as their basic communication and integration infrastructure. With their recent popularization, notification servers are being developed to support specific application domains. At the same time, general-purpose notification servers provide a large set of functionality for a broad set of applications. With so many options, developers face the dilemma of choosing between application-specific or general-purpose notification servers. In both cases, however, the set of features provided by the servers are usually neither extensible nor configurable, making their customization to specific application domains a difficult task. In this work, a more flexible approach is proposed - a customizable, extensible and dynamic architecture for notification services - which allows the customization of the notification service to different application domains. The extensi-bility model is presented according to the design framework proposed by Rosemblum and Wolf. A preliminary implementation of the prototype is also discussed, as well as configuration examples.
Cycle-Accurate Energy Model and Source-Independent Characterization Methodology for Embedded Processors
Authors: Syed Saif Abrar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The available techniques for embedded softwareenergy estimation either provide unusable average-caseresults or require prohibitively complex hardware setupsfor cycle-accurate results. This paper introduces a newmethodology for high-level software energy estimation forembedded systems. The methodology produces cycle-accurateresults independent of the energycharacterization process. The executed instructions as wellas the transitions on the wires are taken into considerationfor estimating the energy. This allows tradeoff between theaccuracy and the complexity of the model. Themethodology is generic and makes no assumptions aboutthe measurement techniques or the architecture of theprocessor. The introduced methodology also allowssuccessive improvements in the estimation accuracy witheach step towards final silicon. The embeddedARM7TDMI RISC processor is modeled with thismethodology and the errors are found to be less than 10%.For energy optimization, the model provides excellentrelative accuracy too.
How practice matters: a relational view of knowledge sharing
Authors: Carsten Østerlund, Paul Carlile
Venue: Communities and Technologies (2003)

This paper addresses the issue of knowledge sharing practices in complex organizations. The authors propose that a refined understanding of the relational thinking underpinning practice theories is required if we want to further our comprehension of knowledge sharing and distinguish existing approaches. Knowledge sharing, we argue, is defined by the specific differences and dependencies in practices existing within or across communities. Changes in those differences and dependencies leads to the formation of new knowledge. Specifying the differences, dependencies and changes provides the first analytical step in understanding knowledge sharing as it takes shape in and across communities of practice. The authors apply this relational perspective to probe the discrepancies and complementarities among three seminal approaches to knowing within and across communities of practice.
Extending distributed system specifications
Authors: Ferhat Khendek
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

In this paper, we describe an approach for extending distributed system specifications. The approach consists of building a new specification Snew by adding a new behavior described by a specification Sadded to a specification Sold with preservation of the properties of Sold and Sadded. Snew has all the properties of Sold and Sadded, if Snew can do whatever Sold (and Sadded) can do, and it does not block where Sold (or Sadded) does not block. Our approach is described in terms of Labeled Transition Systems, and it is applicable for a wide range of specification languages.
Similarity analysis on government regulations
Authors: Gloria T. Lau, Kincho H. Law, Gio Wiederhold
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Government regulations are semi-structured text documents that are often voluminous, heavily cross-referenced between provisions and even ambiguous. Multiple sources of regulations lead to difficulties in both understanding and complying with all applicable codes. In this work, we propose a framework for regulation management and similarity analysis. An online repository for legal documents is created with the help of text mining tool, and users can access regulatory documents either through the natural hierarchy of provisions or from a taxonomy generated by knowledge engineers based on concepts. Our similarity analysis core identifies relevant provisions and brings them to the user's attention, and this is performed by utilizing both the hierarchical and referential structures of regulations to provide a better comparison between provisions. Preliminary results show that our system reveals hidden similarities that are not apparent between provisions based on node content comparisons.
Program representation and behavioural matching for localizing similar code fragments
Authors: Kostas Kontogiannis
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Reverse engineering focuses on the development of tools and techniques for understanding unfamiliar code. The main objective in design recovery is to understand program behavior. In order to understand the behavioral aspects of a program, concepts of language semantics and flow analysis can be used. In this paper we consider a program representation method in which communication of a code fragment with the rest of the system represents its behavior. Code fragments are viewed as objects capable of using resources and updating variables. Program similarity between simple code fragments can be proven in terms of the structure and the information residing in the nodes of program description trees. Program description trees are labeled trees in which nodes represent either code fragments or actions encoding the communication of a code fragment. Recognition and control algorithms for plan instance localization and recognition are investigated in order to assist partial design recovery when no complete recognition is possible. Finally, we discuss the underlying " Goal-Question-Analysis-Action" strategy for modeling the design recovery.
QEPCAD B: a program for computing with semi-algebraic sets using CADs
Authors: Christopher W. Brown
Venue: ACM SIGSAM Bulletin (2003)

This report introduces QEPCAD, B, a program for computing with real algebraic sets using cylindrical algebraic decomposition (CAD). QEPCAD B both extends and improves upon the QEPCAD system for quantifier elimination by partial cylindrical algebraic decomposition written by Hoon Hong in the early 1990s. This paper briefly discusses some of the improvements in the implementation of CAD and quantifier elimination via CAD, and provides somewhat more detail on extensions to the system that go beyond quantifier elimination. The author is responsible for most of the extended features of QEPCAD B, but improvements to the basic CAD implementation and to the SACLIB library on which QEPCAD is based are the results of many people's work, including: George E. Collins, Mark J. Encarnaci&oacute;n, Hoon Hong, Jeremy Johnson, Werner Krandick, Richard Liska, Scott McCallum, Nicolas Robidoux, and Stanly Steinberg. Source code, documentation and installation instructions for QEPCAD B are all available at www.cs.usna.edu/~qepcad.
Length-Limited Variable-to-Variable Length Codes For High-Performance Entropy Coding
Authors: Joshua Senecal, Mark Duchaineau, Kenneth I. Joy
Venue: Proceedings of the Conference on Data Compression (2004)

Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high-performance encoding is needed. We present our work on a practical implementation of fast entropy coders for binary messages utilizing only bit shifts andtable lookups. To limit code table size we limit our code lengths with a typeof variable-to-variable (VV) length code created from source string merging.We refer to these codes as "merged codes". With merged codes it is possibleto achieve a desired level of speed by adjusting the number of bits read fromthe source at each step. The most efficient merged codes yield a coder witha worst-case inefficiency of 0.4%, relative to the Shannon entropy. Using ahybrid Golomb-VV Bin Coder we are able to achieve a compression ratio thatis competitive with other state-of-the-art coders, at a superior throughput.
Speed Estimation for an Induction Motor Using the Extended Kalman Filter
Authors: Salomón Chávez Velázquez, Rubén Alejos Palomares, Alfredo Nava Segura
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This article describes the Discretized ExtendedKalman Filter for speed estimation of a squirrel-cageinduction motor. The filter is an observer for linearand non-linear systems and is based on the stochasticintromission, in others words, noise. There is amathematical basis that yields excellent simulation andreal-time results. It shows that the filter is an excellentestimator for measurements and non- measurementstates because in addition to the speed estimation wecould estimate other variables like the magnetic flux.There are simulation results with Direct TorqueControl where the speed accuracy is one of the mostimportant characteristics of filtering. The tune-up isone milestone to obtain the estimation and severalrules are proposed. Finally, this paper suggests theon-line estimation to ensure that the motor is fullyrepresented.
A computational theory of goal-directed style in syntax
Authors: Chrysanne DiMarco, Graeme Hirst
Venue: Computational Linguistics (1993)

The problem of style is highly relevant to computational linguistics, but current systems deal only superficially, if at all, with subtle but significant nuances of language. Expressive effects, together with their associated meaning, contained in the style of a text are lost to analysis and absent from generation.We have developed an approach to the computational treatment of style that is intended to eventually incorporate three selected components---lexical, syntactic, and semantic. In this paper, we concentrate on certain aspects of syntactic style. We have designed and implemented a computational theory of goal-directed stylistics that can be used in various applications, including machine translation, second-language instruction, and natural language generation.We have constructed a vocabulary of style that contains both primitive and abstract elements of style. The primitive elements describe the stylistic effects of individual sentence components. These elements are combined into patterns that are described by a stylistic meta-language, the abstract elements, that define the concordant and discordant stylistic effects common to a group of sentences. Higher-level patterns are built from the abstract elements and associated with specific stylistic goals, such as clarity or concreteness. Thus, we have defined rules for a syntactic stylistic grammar at three interrelated levels of description: primitive elements, abstract elements, and stylistic goals. Grammars for both English and French have been constructed, using the same vocabulary and the same development methodology. Parsers that implement these grammars have also been built.The stylistic grammars codify aspects of language that were previously defined only descriptively. The theory is being applied to various problems in which the form of an utterance conveys an essential part of meaning and so must be precisely represented and understood.
Newsgroup Crowds and AuthorLines: Visualizing the Activity of Individuals in Conversational Cyberspaces
Authors: Fernanda B. Viégas, Marc Smith
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

We discuss the design, implementation and evaluation of two related visualizations of authors'activities in Usenet newsgroups. Current Usenet news browsers focus on messages and thread structures while disregarding valuable information about the authors of messages and the participants of the various discussions. Newsgroup Crowds graphically represents the population of authors in a particular newsgroup. Authors are displayed according to the number of messages they contribute to each thread and the number of different days they appear in the space, illustrating and contrasting the interaction patterns of participants within the newsgroup. AuthorLines visualizes a particular author's posting activity across all newsgroups over a period of one year. This visualization reveals temporal patterns of threadinitiation and reply that can broadly characterize the roles authors play in Usenet. We report the results of a user study that explored the value of these interfaces for developing high-level awareness of the activity and population in these conversational spaces. We suggest that interfaces that convey information about the social histories of populations and individuals may support better selection and evaluation of newsgroup content.
Superscaled security
Authors: Rebecca T. Mercuri
Venue: Communications of the ACM (2004)

Exponential increases in computational speed, memory capacity, and bandwidth impose futuristic security demands and challenges.
Parallel switch-level simulation for VLSI
Authors: R. B. Mueller-Thuns, D. G. Saab, J. A. Abraham
Venue: Proceedings of the conference on European design automation (1991)

Switch-level simulation is widely used in the design verification process of Very Large Scale Integrated (VLSI) MOS circuits. In this paper, we present methods for accelerating switch-level simulation by mapping it onto general purpose parallel computers. Our target machines are medium-grain multiprocessors (shared memory or message passing machines) and we only consider model parallel computation, where the model of the design to be simulated is partitioned among processors. We introduce efficient strategies for circuit partitioning as well as the corresponding simulation algorithms. In our approach, we try to minimize the total number of synchronizations between processors, as well as ensure portability and scalability. A preprocessor and simulator were implemented and good performance was obtained for a set of benchmarks. The problem of tight coupling between processors that evaluate a strongly connected component in the circuit in a distributed fashion is highlighted.
NSDF: a computer network system description framework and its application to network security
Authors: Juan M. Estévez-Tapiador, Pedro García-Teodoro, Jesús E. Díaz-Verdejo
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In this work a general framework, termed NSDF, for describing network systems is proposed. Basic elements of this scheme are entities and the relationships established between them. Both entities and relationships are the basis underlying the concept of system state. The dynamics of a network system can be conceived of as a trajectory in the state space. The term action is used to describe every event which can produce a transition from one state to another.These concepts (entity, relationship, state, and action) are enough to construct a model of the system. Evolution and dynamism are easily captured, and it is possible to monitor the behaviour of the system. With the aim of illustrating the use of the proposed framework, a network state description language derived from NSDF, termed RENDL, is also specified.An immediate application of this framework concerns the network security field. It is shown that concepts like security policing of the site, insecure states, intrusive activities and intrusion response mechanisms can be modelled well. Thus, some imprecise terms used in the security context can be expressed in a uniform, precise way within this framework. Formalizing the above concepts allows us to introduce a generic model to classify currently presented taxonomies related to intrusive activities in network systems. This provides a general context for a better understanding of security flaws and how to develop effective defenses.
Towards Peer-To-Peer Double Auctioning
Authors: Zoran Despotovic, Jean-Claude Usunier, Karl Aberer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

P2P systems constitute nowadays an increasingly important part of the online world that needs or will soon need all kinds of e-commerce services and applications that are normally available today on client-server platforms. When designing new e-commerce solutions in P2P particular attention must be paid to masking autonomy of the peers and the lack of any central authorities as two most important problems. In this paper we explore possibilities to bring e-commerce into P2P and propose a double auctioning mechanism that does not rely on the existence of central authorities, auctioneer in particular, and is amenable to implementation in P2P environments. The mechanism has good economic properties such as, for example, fast convergence towards efficient trading through intuitive and simple bidding strategies.