ppxscal/embedding_network huggingface dataset:
Editorial
Authors: Richard Bird
Venue: Journal of Functional Programming (1999)

To some readers functional pearls may seem like London buses: you can wait ages for one and then two or three come along at once. In the following pages you will find no less than three pearls for your enjoyment and instruction. There are a number of others a little way down the road, so I trust that your pleasure will continue for some time yet.If my calculations are correct, twenty-seven pearls have been published in the eight and a half years since JFP was inaugurated. There was something of a desert in 1994 and 1995, but since January 1997 they have been appearing in virtually every issue. When I was asked to contribute a regular column to JFP in 1990, the general idea was for something in style that was a mixture of Jon Bentley's Programming Pearls column for the Communications of the ACM, and Martin Rem's Small Programming Exercises section in the Science of Computer Programming. Articles could be on any subject, but they had to be polished, preferably short, and to show something of the unique opportunities a functional perspective could offer to the study of computing. In my own case that usually meant the use of functional notation to derive programs from their specifications, to optimise them, and to reason about their properties in an equational style. Over the years it has emerged that a functional approach is also extremely attractive in the presentation of ideas about data structures, and some very intriguing pearls have been about the use of elegant data structures to achieve efficiency. But there have also been pearls about particular applications, like parsing, pretty-printing, theorem proving, and unification. In fact, practically every area of computing science can benefit from the clarity and brevity a functional approach can offer. That is why I believe the importance of the subject goes beyond the activity of simply writing code in a functional language.I knew from the outset that I wasn't going to write all of the pearls, and believed that other contributors would soon emerge. Fortunately, I was right: I have written about a third, but some twenty contributors have composed the rest. Authors like writing pearls perhaps because they like responding to the opportunities and challenges provided by the format. All pearls are refereed (including my own), and there is often a fair amount of polishing as a result of the reviewing stage. I would like to record my gratitude to the authors of the pearls so far published (Stephen Adams, Lennart Augustsson, Koen Claessen, Martin Erwig, Jeremy Gibbons, Ralf Hinze, Rob Hoogerwoord, Gerard Huet, Graham Hutton, Patrik Jansson, Johan Jeuring, Andrew Kennedy, Jamie Leifer, Doug Mcllroy, Eric Meijer, Chris Okasaki, Mikael Rittri, Colin Runciman, Bernard Sufrin, Dan Synek) and to ask them, and others, to continue in their good work.
Signed kernel modules
Authors: Greg Kroah-Hartman
Venue: Linux Journal (2004)

Crypto techniques give device drivers a new security check.
Derivation of signal flow for switch-level simulation
Authors: David T. Blaauw, Daniel G. Saab, Junsheng Long, Jacob Abraham
Venue: Proceedings of the conference on European design automation (1990)

This paper presents a new algorithm for deriving the direction of signal flow in MOS circuits. The algorithm detects so-called unidirectional transistors. In a unidirectional transistor, signal flow is restricted to one direction during switch-level simulation, without compromising the simulation results. The algorithm uses a static analysis of the switch-level characteristics of the circuit, such as the transistor strengths and node capacitor sizes. It was implemented and used in the simulation of a large, commercial microprocessor. For this processor, 98.5% of the transistors were determined to be unidirectional by the algorithm. The simulation time for this processor decreased significantly when unidirectional transistors were detected.
Kids and the internet: a developmental summary
Authors: Miki Baumgarten
Venue: Computers in Entertainment (CIE) (2003)

When planning and developing successful internet programs for children, it is vital to clearly understand and carefully consider kids' innate developmental capabilities and proclivities. It is necessary to keep in mind that children of different ages have vastly different physical, cognitive, and psycho-social characteristics, as well as disparate interests, likes, dislikes, and fears. A four-year old child may not posses the manual dexterity to operate a complex internet game; an eight-year old's growing ability to reason logically gives him the opportunity to take part in strategy-based activities and contests; twelve-year old preteens may be put off by a topic they believe to be "uncool." The following article provides a brief summary of the developmental stages of children and young teens -- from age two to age fourteen -- and the relationship of these stages to kids' use of electronic media. This summary is based on research in the areas of child development, psychology, education, and technology.
Understanding human behavior from motion imagery
Authors: Mubarak Shah
Venue: Machine Vision and Applications (2003)

Computer vision is gradually making the transition from image understanding to video understanding. This is due to the enormous success in analyzing sequences of images that has been achieved in recent years. The main shift in the paradigm has been from recognition followed by reconstruction (shape from X) to motion-based recognition. Since most videos are about people, this work has focused on the analysis of human motion. In this paper, I present my perspective on understanding human behavior.Automatically understanding human behavior from motion imagery involves extraction of relevant visual information from a video sequence, representation of that information in a suitable form, and interpretation of visual information for the purpose of recognition and learning about human behavior.Significant progress has been made in human tracking over the last few years. As compared with tracking, not much progress has been made in understanding human behavior, and the issue of representation has largely been ignored. I present my opinion on possible reasons and hurdles for slower progress in understanding human behavior, briefly present our work in tracking, representation, and recognition, and comment on the next steps in all three areas.
3D visualization of unsteady 2D airplane wake vortices
Authors: Kwan-Liu Ma, Z. C. Zheng
Venue: Proceedings of the conference on Visualization '94 (1994)

Air flowing around the wing tips of an airplane forms horizontal tornado-like vortices that can be dangerous to following aircraft. The dynamics of such vortices, including ground and atmospheric effects, can be predicted by numerical simulation, allowing the safety and capacity of airports to be improved. In this payer, we introduce three-dimensional techniques for visualizing time-dependent, two-dimensional wake vorte computations, and the hazard strength of such vortices near the ground. We describe a vortex core tracing algorithm and a local tiling method to visualize the vortex evolution. The tiling method converts time-dependent, two-dimensional vortex cores into three-dimensional vortex tubes. Finally, a novel approach is used to calculate the induced rolling moment on the following airplane at each grid point within a region near the vortex tubes and thus allows three-dimensional visualization of the hazard strength of the vortices.
Linear types and approximation
Authors: Michael Huth, Achim Jung, Klaus Keimel
Venue: Mathematical Structures in Computer Science (2000)

We study continuous lattices with maps that preserve all suprema rather than only directed ones. We introduce the (full) subcategory of FS-lattices, which turns out to be &ast;-autonomous, and in fact maximal with this property. FS-lattices are studied in the presence of distributivity and algebraicity. The theory is extremely rich with numerous connections to classical Domain Theory, complete distributivity, Topology and models of Linear Logic.
A plan for research toward computer-aided instruction with natural English, teachnical memorandum, TM-3623
Authors: Robert S. Simmons, Harry F. Silberman
Venue: ACM SIGCUE Outlook (1970)

A research program was planned to develop a first, experimental computer-assisted instruction system that would permit interaction with students in a subset of natural English. At the base of this system was a model of cognition that would represent the knowledge content of the material to be taught and the student's current knowledge of it. A comparison of the model of student current knowledge and the model of the material to be taught offered a basis for feeding back appropriate information to the student to move him toward the eventual training goal. The research was planned in two concurrent phases. The first developed language processing technology based on Protosynthex III. The second used tutorial studies to discover appropriate methods for training the students. The first appendix consists of material outlining the Cognitive Structure Model for Verbal Understanding, and the second is a Sample of the Minimal Lesson Structure. (Author/GO).
A dual trench gate emitter switched thyristor (DTG-EST) with dual trench gate electrode and different gate oxide thickness
Authors: Dae Won Kim, Man Young Sung, Ey Goo Kang
Venue: Microelectronic Engineering (2003)

In this paper, the dual trench gate emitter switched thyristor (DTG-EST) with dual trench gate electrode is proposed for improving snap-back effect which leads to a lot of problems in device applications. The parasitic thyristor which is inherent in the conventional EST is completely eliminated in this structure, allowing higher maximum controllable current densities for ESTs. The dual trench gate allows homogenous current distribution in the EST and preserves the unique feature of the gate controlled current saturation of the thyristor current. The conventional EST exhibits snap-back with anode voltage and current density of 2.73 V and 35 A/cm2, respectively. The proposed DTG-EST exhibits snap-back with anode voltage and current density of 0.96 V and 100 A/cm2, respectively. The saturated anode current density of the proposed DTG-EST at an anode voltage 9.6 V is 2388 A/cm2. The characteristics of the 600 V forward blocking DTG-EST obtained from two-dimensional numerical simulations (MEDICI) is described and compared with that of a conventional EST and a vertical trench gate EST.
Developing information appliance design tools for designers
Authors: Steve Gill
Venue: Personal and Ubiquitous Computing (2003)

As more products become computer-embedded, designers need to consider both the hardware and interface. Traditional design processes and design tools focus on hardware aspects, and so new methods and techniques must be investigated and developed. The aim of this study is to investigate new design models for designing computer-embedded products. In particular, it focuses on ways by which designers can be assisted in problem identification, exploration and evaluation of design solutions by using a rapid interface prototyping technique. The technique is based on a widely used general presentation software application. It can be used to develop fully functional prototypes of computer embedded products without electronic engineering skills.
Trans-world haptic collaboration
Authors: Chris Gunn, Matthew Hutchins, Matt Adcock, Rhys Hawkins
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This sketch describes a collaborative virtual environment application involving haptic interaction over long Internet distances. We have developed algorithms to accommodate significant latency for certain applications, notably in the medical domain. The results have shown that we can manipulate simulated human body organs, as well as guide each other's 'hands' (and shake hands!) over 22,000 km.
A Java implemented key collision attack on the data encryption standard (DES)
Authors: John Loughran, Tom Dowling
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

A Java implementation of a key collision attack on DES suggested by Eli Biham, [1], is discussed. Storage space minimization and fast searching techniques to speed up the attack are described. We also demonstrate the suitability of Java for large data cryptographic attacks and illustrate the extensive cryptographic features of the language.
Planned Object Duplication Strategies in Dynamic PRR Meshes
Authors: Michael K. Bradshaw, Arnold L. Rosenberg, Don Towsley
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

In recent years there has been considerable research on new Distributed Hash Tables (DHTs), improvements on existing DHTs, and DHT-enabled systems. However, little of it focuses on their differences [11]. To this purpose we introduce a simple modeling framework that allows us to mathematically model the search costs of most classes of DHTs. To illustrate the usefulness of this framework, we examine a class of DHTs, which includes Tapestry and Pastry, that we call Dynamic PRR Meshes (DPMs). In particular we examine how planned object duplication (POD) strategies affect the search costs of DPMs that employ them. We introduce 3 new DPMs that employ different POD strategies and compare them with the POD strategies that Tapestry and Pastry use. Through our model we discover cyclic behaviors in search costs over the number of nodes present in the DPM, the effects of variability in the underlying network and provide comparisons of the performance of all 5 DPMs.
Service learning models connecting computer science to the community
Authors: Carol Traynor, Maria McKenna
Venue: ACM SIGCSE Bulletin (2003)

Service learning is an educational experience that enables students to apply material learned in the classroom by volunteering in a real-world situation. This paper provides a brief review of service learning and describes two models that the computer science department at Saint Anselm College implemented successfully.
On detecting differences between groups
Authors: Geoffrey I. Webb, Shane Butler, Douglas Newlands
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Understanding the differences between contrasting groups is a fundamental task in data analysis. This realization has led to the development of a new special purpose data mining technique, contrast-set mining. We undertook a study with a retail collaborator to compare contrast-set mining with existing rule-discovery techniques. To our surprise we observed that straightforward application of an existing commercial rule-discovery system, Magnum Opus, could successfully perform the contrast-set-mining task. This led to the realization that contrast-set mining is a special case of the more general rule-discovery task. We present the results of our study together with a proof of this conclusion.
Parsing some constrained grammar formalisms
Authors: K. Vijay-Shanker, David J. Weir
Venue: Computational Linguistics (1993)

In this paper we present a scheme to extend a recognition algorithm for Context-Free Grammars (CFG) that can be used to derive polynomial-time recognition algorithms for a set of for-malisms that generate a superset of languages generated by CFG. We describe the scheme by developing a Cocke-Kasami-Younger (CKY)-like pure bottom-up recognition algorithm for Linear Indexed Grammars and show how it can be adapted to give algorithms for Tree Adjoining Grammars and Combinatory Categorial Grammars. This is the only polynomial-time recognition algorithm for Combinatory Categorial Grammars that we are aware of.The main contribution of this paper is the general scheme we propose for parsing a variety of formalisms whose derivation process is controlled by an explicit or implicit stack. The ideas presented here can be suitably modified for other parsing styles or used in the generalized framework set out by Lang (1990).
Design of far-field and near-field broadband beamformers using eigenfilters
Authors: Simon Doclo, Marc Moonen
Venue: Signal Processing (2003)

This paper discusses two novel non-iterative design procedures based on eigenfilters for designing broadband beamformers with an arbitrary spatial directivity pattern for an arbitrary microphone configuration. In the conventional eigenfilter technique a reference frequency-angle point is required, whereas in the eigenfilter technique based on a TLS (total least squares) error criterion, no reference point is required. It is shown how to design broadband beamformers in the far-field, near-field and mixed near-field far-field of the microphone array. Both eigenfilter techniques are compared with other broadband beamformer design procedures (least-squares, maximum energy array, non-linear criterion). It will be shown by simulations that among the considered non-iterative design procedures the TLS eigenfilter technique has the best performance, i.e. best resembling the performance of the non-linear design procedure but having a significantly lower computational complexity.
Answering Queries Addressed to Several Databases According to a Majority Merging Approach
Authors: Laurence Cholvy, Christophe Garion
Venue: Journal of Intelligent Information Systems (2004)

The general context of this work is the problem of merging data provided by several sources which can be contradictory. Focusing on the case when the information sources do not contain any disjunction, this paper first defines a propositional modal logic for reasoning with data obtained by merging several information sources according to a majority approach. Then it defines a theorem prover to automatically deduce these merged data. Finally, it shows how to use this prover to implement a query evaluator which answers queries addressed to several databases. This evaluator is such that the answer to a query is the one that could be computed by a classical evaluator if the query was addressed to the merged databases. The databases we consider are made of an extensional part, i.e. a set of positive or negative ground literals, and an intensional part i.e. a set of first order function-free clauses. A restriction is imposed to these databases in order to avoid disjunctive data.
Fully scalable subband/wavelet coding
Authors: John W. Woods
Venue:  (2003)

Due to the growth and success of the Internet and wireless communication, as well as increasing demand for multimedia services, streaming media over the Internet and mobile/wireless channels has drawn tremendous attention from both academia and industry. The MPEG-21 Part 7: Digital Item Adaptation (DIA) is being standardized to achieve the key goal of multimedia delivery: To be created and shared, always with the agreed/contracted quality, reliability, and flexibility. Scalable coding is a both effective and efficient solution for this purpose. By embedding lower resolution or quality bitstreams into higher resolution or quality bitstreams, scalable coding is a new approach to represent and prioritize data. DIA can be easily realized by selectively transmitting sub-bitstreams. In this thesis, a fully scalable video coding algorithm with combined temporal, spatial and quality scalability is designed. Since subband/wavelet coding inherently provides multi-resolution representation, a motion compensated 3D (spatiotemporal) subband/wavelet transform is utilized to realize temporal and spatial scalability. Motion compensated temporal filtering (MCTF) plays an essential role in this 3D transform. It influences coding efficiency and also temporal scalability, since temporal low frequency subbands will be the embedded lower frame rate videos. I introduce sub-pixel accurate MCTF with lifting scheme. The lifting scheme makes it easy to introduce sub-pixel accuracy into MCTF, while retaining perfect reconstruction. We observed significant improvement up to 1/8 pixel accuracy at CIF resolution. I also design a pixel-based detection algorithm to locate the real to-be-covered and uncovered pixels. Poorly connected blocks are detected and converted to I blocks to protect the lower frame rate videos free from motion artifacts. Bidirectional MCTF is also realized to increase coding efficiency. An entropy coder EZBC is incorporated to encode generated subband coefficients. Based on these techniques, I develop a complete video coding system MC-EZBC, matching the requirements of MPEG-21 DIA. MC-EZBC includes three parts: Pre-encoder, transcoder/extractor and decoder. In the pre-encoder, a 3-D transform naturally partitions video data into a range of spatiotemporal resolutions and precision levels. The transcoder/extractor truncates bitstreams based on the user preferences and network properties. At the receiver, the decoder decodes the received bitstream. Such a coding system provides high coding efficiency, and flexibility and computational simplicity in transcoding.
The Western Edge: some recent electronic music from Western Australia
Authors: Lindsay Vickery
Venue: Organised Sound (2001)

A survey is presented of developments in recent Western Australian electronic music, focusing on the geographical influence on local composers' work. The article follows specific cases of practitioners in the fields of Sound Art (Alan Lamb and Hannah Clemen), Live Electronics (Cathie Travers and the electronic music quartet Magnetic Pig), Interactive Electronics (Jonathan Mustard and Lindsay Vickery) and Noise/Lo Fi Electronics (Cat Hope and Lux Mammoth).
The Automorphism Groups of Steiner Triple Systems Obtained by the Bose Construction
Authors: G. J. Lovegrove
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

The automorphism group of the Steiner triple system of order v &equiv; 3 (mod 6), obtained from the Bose construction using any Abelian Group G of order 2s + 1, is determined. The main result is that if G is not isomorphic to Z3n &times; Z9m, n &ge; 0, m &ge; 0, the full automorphism group is isomorphic to Hol(G) &times; Z3, where Hol(G) is the Holomorph of G. If G is isomorphic to Z3n &times; Z9m, further automorphisms occur, and these are described in full.
E-learning is a social tool for e-commerce at tertiary institutions
Authors: Marlon Parker
Venue: The economic and social impacts of e-commerce (2003)

This chapter sets out to inform the reader about the background of e-Learning. It starts with a brief introduction to the concept of e-Learning, presenting a compelling case why institutions implement e-Learning and describes the difference between technology-delivered e-Learning and technology-enhanced e-Learning. The discussion includes some advantages and disadvantages of technology-enhanced e-Learning and then examines some learner, facilitator and technology aspects of technology-enhanced e-Learning. It continues with a brief discussion on technology-enhanced e-Learning at the Cape Technikon.This project further assesses the perceptions of learners using an online survey to address the issues and concerns that learners experienced with regard to technology-enhanced e-Learning. This chapter also inspects the efficiency usage of e-Learning tools within a technology-enhanced e-Learning environment and concludes with some significant findings of the survey, which includes the importance of computer literacy, interaction and communication in the technology-enhanced e-Learning environment.