ppxscal/embedding_network huggingface dataset:
Proceedings of the 8th annual conference on Innovation and technology in computer science education
Authors: Vassilios Dagdilelis, Maya Satratzemi
Venue: Annual Joint Conference Integrating Technology into Computer Science Education (2003)

We are pleased to present the proceedings of the annual ITiCSE Conference, the eighth in a series of international conferences that began in 1996 in Barcelona. During these years, ITiCSE conferences have created a long tradition in advancing research in the field of Computer Science Education and strengthening collaboration among researchers from all over the world. The quantitative and qualitative characteristics of ITiCSE 2003 give us a strong indication that this conference will continue that fine tradition.This year ITiCSE is hosted in Thessaloniki, a city of great and long history. In addition to the high quality technical program, the conference will also provide you with social events that will exhibit the life and the history of Thessaloniki and the region of Macedonia. With the planned Sunday and Monday receptions, the Tuesday banquet, the farewell party, and the excursions we hope that you will have the opportunity to make "new friends" and get a taste of Greek cuisine and hospitality.The conference program contains three invited speakers, three tutorials, exhibits, posters, demonstrations, forty-four papers in two parallel tracks, three panels, and a session of Tips & Techniques.We are extremely honored to have as invited speakers three prominent computer scientists whose contribution to education has been enormous. Maria Klawe, the President of ACM, is giving the opening keynote address. Christos H. Papadimitriou, recipient of the Knuth Prize in 2002, is giving the second day keynote address. Donald E. Knuth, winner of the ACM Alan Turing Award in 1974 and the IEEE Jon von Neumann award in 1995, is giving the closing keynote address.ITiCSE conferences are characterized as multinational, and this year's participants are coming from 16 different countries. However, many countries with an exceptional research activity won't be present. We hope that future ITiCSE conferences will attract even more papers from various countries, because we believe that the coexistence of colleagues from different countries with different scientific and cultural backgrounds can produce new collaborations and research projects.This year, 129 full papers were submitted and 44 of them were finally selected for the conference. The decision process was very hard since we had to leave out some exceptional papers. The number of posters this year increased, and 55 will be presented in this conference. Faithful to the ITiCSE tradition, we offer Working Groups as well as other forms of communication such as Demos, Tutorials and Tips and Techniques, which play an important role to the dissemination of ideas and thoughts and also help bring researchers and scientists together in a more informal manner.We hope that the ITiCSE 2003 will become part of the ITiCSE tradition.Dear colleagues and collaborators, welcome to ITiCSE 2003!
Politics, accountability, and governmental information systems
Authors: Bruce Rocheleau
Venue: Public information technology: policy and management issues (2003)

Information systems are becoming more involved in politics due to the growth of the World Wide Web, electronic government, and the increasing digitization of information of all kinds. Many information management specialists lack knowledge and experience about how to deal with political aspects of information management, and consequently they are ineffective. This chapter shows how important political issues are to information managers and illustrates strategies that can be useful in dealing with political issues. I provide several examples of how inattention to the political aspects of managing information systems can result in problems and disasters. The chapter covers both internal and external politics. Information managers have to deal with many internal politically-charged tasks such as the structuring of information management, purchasing information systems, managing personnel in this era of digital communication, and struggles over the sharing of information within organizations. External information management issues are also becoming important such as demands for online accountability information, the development of websites, issues over access to information, and interorganizational issues including disputes over turf.
Energy Model Based Macrocell Placement for Wirelength Minimization
Authors: Stelian Alupoaei, Srinivas Katkoori
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We propose a new iterative approach that models thewirelength minimization problem as a minimum (potential)energy problem.The cell energy is the sum of the netenergy (analogous to the spring elastic energy) and theoverlap potential energy (analogous to the gravitationalpotential energy).Energy-based model is shown to be superiorto the force-directed model.
The dynamic simultaneous multithreaded processor
Authors: Ben (Il-Beom) Lee
Venue:  (2003)

This dissertation investigates diverse techniques to support multithreading in modern high performance processors. The mechanisms studied expand the architecture of a high performance superscalar processor to control efficiently the interaction between software-controlled and hardware-controlled multithreading. Additionally, dynamic speculative mechanisms are proposed to exploit thread-level-parallelism (TLP) and instruction-level-parallelism (ILP) on a Simultaneous Multithreading (SMT) architecture. First, the hybrid multithreaded execution model is discussed. This model combines software-controlled multithreading with hardware support for efficient context switching and thread scheduling. A thread scheduling technique called set scheduling is introduced and its impact on the overall performance is described. An analytical model of the hybrid multithreaded execution is developed and validated by simulation. Through stochastic simulation, we find that the application of the hybrid multithreaded execution model results in higher processor utilization than traditional software-controlled multithreading. Next, in the main part of this dissertation, a new architecture is proposed: the Dynamic Simultaneous Multithreading (DSMT) processor. In this architecture, multiple threads are identified and created speculatively at runtime without compiler help. Subsequently, a SMT processor core executes those threads. The performance of a DSMT processor was evaluated with a new execution-driven simulator developed specifically for the purpose. Our experimental results based on simulation show that DSMT architecture has very good potential to improve SMT processor's performance when there is only a single task available for execution.
On K&ouml;the sequence spaces and linear logic
Authors: Thomas Ehrhard
Venue: Mathematical Structures in Computer Science (2002)

We present a category of locally convex topological vector spaces that is a model of propositional classical linear logic and is based on the standard concept of K&ouml;the sequence spaces. In this setting, the &lsquo;of course&rsquo; connective of linear logic has a quite simple structure of a commutative Hopf algebra. The co-Kleisli category of this linear category is a cartesian closed category of entire mappings. This work provides a simple setting in which typed &lambda;-calculus and differential calculus can be combined; we give a few examples of computations.
Development of a task model for the analysis and retrieval of statistical data
Authors: Peter N. Hyland
Venue: Computing information technology: the human side (2003)

This chapter explores the task of retrieving and analysing statistical data from external sources, such as national statistical agencies, government departments, the World Bank, etc. Although external statistical data (ESD) is widely used in planning, decision-making and project evaluation, the process of gathering and analysing such data is poorly understood. This chapter describes the usability testing of a prototype Statistical Information System (SIS) and uses the data gathered during that testing to develop an initial task model for retrieving and analysing ESD. The proposed task model would be useful in the development of improved Statistical Information Systems, particularly those intended for use by casual or ad hoc users.
Integrating Runtime Assertions with Dynamic Types: Structuring a Derivation from an Incomputable Specification
Authors: Paul A. Bailes, Colin J. M. Kemp
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

An inherent incomputability in the specification of afunctional language extension that combines assertionswith dynamic type checking is isolated in an explicitderivation from mathematical specifications. Thecombination of types and assertions (into "dynamicassertion-types" - DATs) is a significant issue since,because the two are congruent means for programcorrectness, benefit arises from their better integration incontrast to the harm resulting from their unnecessaryseparation. However, projecting the "set membership"view of assertion-checking into dynamic types results insome incomputable combinations. Refinement of thespecification of DAT checking into an implementation byrigorous application of mathematical identities becomesfeasible through the addition of a "best-approximate"pseudo-equality that isolates the incomputable componentof the specification. This formal treatment leads to animproved, more maintainable outcome with furtherdevelopment potential.
Lagrangians of Hypergraphs
Authors: J. M. Talbot
Venue: Combinatorics, Probability and Computing (2002)

How large can the Lagrangian of an r-graph with m edges be? Frankl and F&uuml;redi [1] conjectured that the r-graph of size m formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs of size m. We prove the first &lsquo;interesting&rsquo; case of this conjecture, namely that the 3-graph with (t3) edges and largest Lagrangian is [t](3). We also prove that this conjecture is true for 3-graphs of several other sizes.For general r-graphs we prove a weaker result: for t sufficiently large, the r-graph of size (tr) supported on t + 1 vertices and with largest Lagrangian, is [t](r).
Creating animation for presentations
Authors: Douglas Earl Zongker
Venue:  (2003)

In recent years the use of computer-generated slides to accompany live presentation has become increasingly common. There is a potential for using computer graphics to increase the effectiveness of this type of presentation. The hardware for generating and projecting complex scenes and animation is in place, yet few efforts have been made in creating software to fully utilize these capabilities. This dissertation presents a system, called SLITHY, for giving live presentations accompanied by rich animated slides. This system has been developed and refined through several iterations of creating animated talks, then trying to simplify the authoring process by improving the system itself. We show some examples of presentations we've created with the system, as well as some from outside users who have used our system to present their own work. As we repeated the design cycle, we were also learning what types of animation were best suited for use in presentation. In this work we summarize our accumulated experience as a set of presentation animation principles. It is certainly possible to use animation poorly, but we believe that having a set of broadly applicable guidelines can assist presentation authors in applying these new tools in ways that enhance rather than detract from their subject matter.
Regularity estimates for elliptic boundary value problems in Besov spaces
Authors: Constantin Bacuta, James H. Bramble, Jinchao Xu
Venue: Mathematics of Computation (2003)

We consider the Dirichlet problem for Poisson's equation on a nonconvex plane polygonal domain Ω. New regularity estimates for its solution in terms of Besov and Sobolev norms of fractional order are proved. The analysis is based on new interpolation results and multilevel representations of norms on Sobolev and Besov spaces. The results can be extended to a large class of elliptic boundary value problems. Some new sharp finite element error estimates are deduced.
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
Authors: Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
Venue: SIAM Journal on Computing (2004)

We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, $\lambda$, is at least 0.42 and that the capacity of every backoff protocol is at most 0.42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0.531, also hold for every acknowledgment-based protocol.
The bitmap-based feature selection method
Authors: Wei-Chou Chen, Ming-Chun Yang, Shian-Shyong Tseng
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

CBR(Case-Based Reasoning) is a problem solving technique that reuses past cases and experiences to find a solution to current problems. A critical issue in case-based reasoning is to select the correct and enough features to represent a case. However, this task is difficult to carry out since such knowledge is often exhaustively captured and cannot be represented successfully. In this paper, the new, efficient feature selection method originated from bitmap indexing and rough set techniques will be proposed. The bitmap-based feature selection method is proposed for discovering the optimal feature sets for decision-making problems. And the corresponding indexing and selecting algorithms for such feature selection method are also proposed. Finally, some experiments and comparisons are given and the result shows the efficiency and accuracy of our proposed method.
Automatic generation of MPEG-7 compliant XML document for motion trajectory descriptor in sports video
Authors: Yi Haoran, Deepu Rajan, Chia Liang-Tien
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

The MPEG-7 standard is a step towards standardizing the description of multimedia content so that quick and efficient identification of relevant content can be facilitated, together with efficient management of information. The description definition language (DDL) is a schema language to represent valid MPEG-7 descriptors and description schemes. MPEG-7 instances are XML documents that conform to a particular MPEG-7 schema, as expressed in the DDL and that describe audiovisual content. In this paper, we pick one of the visual descriptors related to motion in a video sequence, viz., motion trajectory. It describes the displacements of objects in time, where an object is defined as a spatiotemporal region or set of spatiotemporal regions. We present a method of automatically extracting trajectories from video sequences and generating an XML document that conforms to the MPEG-7 schema. We use sports videos in particular, because the trajectories are very random and the robustness of our algorithm can be demonstrated. The MPEG-7 XM software is a working tool that enables the checking of the relative performance of various algorithms. Insofar as the motion trajectory is concerned, the current version of XM(version 5.5) takes the formatted key-point list of the already segmented object as inputs and outputs the trajectory as an XML document. However, we go a step further by developing an automatic trajectory extraction algorithm that produces motion blobs, which are then tracked to generate the trajectory, which in turn is output as an XML document.
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes
Authors: V. S. Lebedev
Venue: Problems of Information Transmission (2003)

A binary code is called a (w, r) cover-free code if it is the incidence matrix of a family of sets where the intersection of any w of the sets is not covered by the union of any other r sets. Such a family is called a (w, r) cover-free family. We obtain a new recurrent inequality for the rate of (w, r) cover-free codes, which improves previously known upper bounds on the rate.
Affine Invariant Flows in the Beltrami Framework
Authors: Nir Sochen
Venue: Journal of Mathematical Imaging and Vision (2004)

We analyze the role of different invariant principles in image processing and analysis. A distinction between the passive and active principles is emphasized, and the geometric Beltrami framework is shown to incorporate and explain some of the known invariant flows e.g. the equi-affine invariant flow for hypersurfaces. It is also demonstrated that the new concepts put forward in this framework enable us to suggest new invariants namely the case where the codimension is greater than one.
Architecture of the XL C++ browser
Authors: Shahram Javey, Kin'ichi Mitsui, Hiroaki Nakamura, Tsuyoshi Ohira, Kazu Yasuda, Kazushi Kuse, Tsutomu Kamimura, Richard Helm
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

In this paper we describe the high-level architecture for a distributed static analyzer for the C++ programming language. Key features of this technology are its support for semantic queries -- queries that make use of the C++ semantics to interpret information about programs; its use of rules for describing the relations between the program symbols; and its capability to browse remote databases across a network.
Functionally partitioned module-based programmable architecture for wireless base-band processing
Authors: Simon Leung, Adam Postula
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

A specialised reconfigurable architecture is targeted at wireless base-band processing. It is built to cater for multiple wireless standards. It has lower power consumption than the processor-based solution. It can be scaled to run in parallel for processing multiple channels. Test resources are embedded on the architecture and testing strategies are included.This architecture is functionally partitioned according to the common operations found in wireless standards, such as CRC error correction, convolution and interleaving. These modules are linked via Virtual Wire Hardware modules and route-through switch matrices. Data can be processed in any order through this interconnect structure. Virtual Wire ensures the same flexibility as normal interconnects, but the area occupied and the number of switches needed is reduced.The testing algorithm scans all possible paths within the interconnection network exhaustively and searches for faults in the processing modules. The testing algorithm starts by scanning the externally addressable memory space and testing the master controller. The controller then tests every switch in the route-through switch matrix by making loops from the shared memory to each of the switches. The local switch matrix is also tested in the same way. Next the local memory is scanned. Finally, pre-defined test vectors are loaded into local memory to check the processing modules.This paper compares various base-band processing solutions. It describes the proposed platform and its implementation. It outlines the test resources and algorithm. It concludes with the mapping of Bluetooth and GSM base-band onto the platform.
Learning to develop GUIs in Java using closed labs
Authors: Chuck Leska
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This paper reviews an experiment in which a closed lab was used to deliver instruction on developing graphic user interfaces, GUIs, within a CS 1 course using Java
MARS: A Statistical Semantic Parsing and Generation-Based Multilingual Automatic tRanslation System
Authors: Yuqing Gao, Bowen Zhou, Zijian Diao, Jeffrey Sorensen, Michael Picheny
Venue: Machine Translation (2002)

We present MARS (Multilingual Automatic tRanslation System), a research prototype speech-to-speech translation system. MARS is aimed at two-way conversational spoken language translation between English and Mandarin Chinese for limited domains, such as air travel reservations. In MARS, machine translation is embedded within a complex speech processing task, and the translation performance is highly effected by the performance of other components, such as the recognizer and semantic parser, etc. All components in the proposed system are statistically trained using an appropriate training corpus. The speech signal is first recognized by an automatic speech recognizer (ASR). Next, the ASR-transcribed text is analyzed by a semantic parser, which uses a statistical decision-tree model that does not require hand-crafted grammars or rules. Furthermore, the parser provides semantic information that helps further re-scoring of the speech recognition hypotheses. The semantic content extracted by the parser is formatted into a language-independent tree structure, which is used for an interlingua based translation. A Maximum Entropy based sentence-level natural language generation (NLG) approach is used to generate sentences in the target language from the semantic tree representations. Finally, the generated target sentence is synthesized into speech by a speech synthesizer.Many new features and innovations have been incorporated into MARS: the translation is based on understanding the meaning of the sentence; the semantic parser uses a statistical model and is trained from a semantically annotated corpus; the output of the semantic parser is used to select a more specific language model to refine the speech recognition performance; the NLG component uses a statistical model and is also trained from the same annotated corpus. These features give MARS the advantages of robustness to speech disfluencies and recognition errors, tighter integration of semantic information into speech recognition, and portability to new languages and domains. These advantages are verified by our experimental results.
Compression of scan-digitized Indian language printed text: a soft pattern matching technique
Authors: U. Garain, S. Debnath, A. Mandal, B. B. Chaudhuri
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

In this paper, a new compression scheme is presented for Indian Language (IL) textual document images. Since OCR technology for IL scripts is not matured enough, transcription of these documents into digital domain needs new techniques that achieve high degree of compression as well as suitable methods to perform various operations like document indexing, retrieval, etc. The proposed method is essentially based on symbolic compression technique, which has been realized with an efficient segmentation-based clustering approach. A soft pattern-matching technique has been implemented using two different feature sets that co-operate each other to build an efficient prototype library. Experiments have been done for documents printed in Devnagari (Hindi) and Bangla scripts, two mostly used script in Indian sub-continent. Test results show that the proposed technique outperforms several standard methods like CCITT Group-4, JBIG, etc. which are frequently used for compression of document images.
Distributed mobile multi-user urban simulation
Authors: Clodagh Rossi, Alan Cummins, Carol O'Sullivan
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This sketch gives an overview of the completed and ongoing research involved in developing a 3D multi-user environment on low-end mobile devices.