ppxscal/embedding_network huggingface dataset:
Effective peer assessment for learning computer programming
Authors: Jirarat Sitthiworachart, Mike Joy
Venue: ACM SIGCSE Bulletin (2004)

Peer assessment is a technique that has been successfully employed in a variety of academic disciplines, and which is considered to be effective in developing student's higher cognitive skills. In this paper, we consider the results of applying novel web-based technology to the delivery of peer assessment in the context of an undergraduate computer programming course, and discuss the benefits of this approach.
FleXPath: flexible structure and full-text querying for XML
Authors: Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank Pandit
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Querying XML data is a well-explored topic with powerful database-style query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for querying XML documents is full-text search on textual content. In this paper, we study fundamental challenges that arise when we try to integrate these two querying paradigms.While keyword search is based on approximate matching, XPath has exact match semantics. We address this mismatch by considering queries on structure as a "template", and looking for answers that best match this template and the full-text search. To achieve this, we provide an elegant definition of relaxation on structure and define primitive operators to span the space of relaxations. Query answering is now based on ranking potential answers on structural and full-text search conditions. We set out certain desirable principles for ranking schemes and propose natural ranking schemes that adhere to these principles. We develop efficient algorithms for answering top-K queries and discuss results from a comprehensive set of experiments that demonstrate the utility and scalability of the proposed framework and algorithms.
Privacy preserving electronic surveillance
Authors: Keith B. Frikken, Mikhail J. Atallah
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

Can protocols make privacy concerns no longer clash with security imperatives, by satisfying both? The former seems to preclude the widespread collection and sharing of data about individuals and their activities, whereas the latter (especially national security and law enforcement) seems to require it. This paper gives a step in the direction of satisfying both, by giving protocols that make the data-sharing about individuals and their actions conditional on these individuals being already on a list of known suspects, deadbeats, criminals, etc. More formally, if we call U the set of all identities, S the subset of U for which monitoring is authorized, Alice the monitoring agency (that alone knows S), Bob any of the data-collection entities, p ε U the identity whose activity Bob has just observed, then the outcome of the protocol is that Alice learns the activity of p if and only if p ε S, and Bob does not learn anything about the membership of p in S.
Frame-to-Frame Coherent Halftoning in Image Space
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

We present an interactive technique for generatinghalftoning animations in image space. We specificallyconsider a halftoning approach that uses screening methodsto achieve shading, brightness, and texture by placingvarying patterns. Our technique transports the screeningpatterns in a frame-to-frame coherent manner accordingto the velocity of each fragment on the imageplane. We show how the algorithm is mapped toprogrammable graphics hardware to achieve interactiveframe rates. Our approach can be used for anyscreening-based halftoning technique, and therefore differentnon-photorealistic image-space rendering styles, includingdithering, screening, stippling, and hatching, canbe utilized to generate real-time frame-to-frame coherentanimations.
Co-Validation Environment for Memory Card Compatibility Test: A Case Study
Authors: Chankin Park, Seungmo Cho, Jaewook Lee, Hyungjun Park
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

As diverse memory cards based on NAND flash memory are getting popularity with consumer electronics such as digital camera, camcorder and MP3 player, the compatibility problems between a newly developed memory card and existent host systems have become a main obstacle to time-to-market delivery of product. The common practice for memory card compatibility test is to use a real host system as a test bed. As an improved solution, an FPGA-based prototyping board can be used for emulating jost systems. However, the above approaches require a long set-up time and have limitations in representing various host and device systems. In this paper, we propose a co-validation environment for compatibility test between memory card and host system using formal modeling based on Esterel language and co-simulation methodology. Finally, we demonstrate the usefullness of the proposed environment with a case study of real memory card development.
Visual Inventory Inspection Using Optical Character Recognition
Authors: Chong Kuan Meng, Yuwaldi Away
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper presents a research on developing a visual inspection of character base image for automatic inventory control system by using an optical image processing method. Usually, bar code method has been used as an input device for inventory control system. However, data or information that included in a bar code may not sufficient for the purpose of inventory controlling. Therefore, for the purpose of efficiency, character recognition for label stock in inventory controlling system will be an advantage in providing extra information regarding stock in industrial computing. This system derives from 2 major parts. The first part is used to extract the area of stock label in a grayscale picture, and then try to recognize the text inside a label. Whereas the second part, it record the in-out activities of an inventory using the information from the first part. Research for the recognition system is concentrate on the capital letters and the numbers only.
Internet safety in emerging educational contexts
Authors: Jocelyn Wishart
Venue: Computers Education (2004)

Concern has arisen for the safety of children using the Internet to support their education outside the school context. Inappropriate material such as pornography, inflammatory and racist writings can be accessed both by accident and with deliberate intent to view. Children are also perceived to be at risk from approaches by strangers, particularly in web-based chat rooms.A survey of the international literature in this area highlighted worldwide concern for the safety of young Internet users and it was generally agreed that schools have a fundamental role in ensuring their safety. The survey findings indicated that a thorough audit of Internet Safety teaching and practices was a vital stage in examining these practices and informing future planning.This paper reports on the consequent audit of Internet Safety practices in over 500 schools from 27 Local Education Authorities (LEAs) across England, commissioned by Becta and conducted during the Summer term 2002. Independent, state and special schools were included in the survey at both primary and secondary levels. ICT advisors from the sampled LEAs and representatives of Internet Safety organisations were also invited to complete a linked questionnaire.A number of recommendations for Internet Safety teaching, in particular, ensuring that children are aware of safe practices for surfing the Internet in less regulated contexts outside the school, will be presented based on the evidence gathered in the survey.Additionally emerging concerns for Internet Safety practices in schools such as the technical and moral difficulties of filtering Internet access via mobile technologies will be highlighted.
Test of ACW-gradient optimisation algorithm in computation of an optimal control policy for achieving acceptable nitrate concentration of greenhouse lettuce
Authors: Stefan C. de Graaf, Johannes D. Stigter, Gerrit van Straten
Venue: Mathematics and Computers in Simulation (2004)

The adjustable control-variation weight (ACW)-gradient method proposed by Weinreb [Optimal Control with Multiple Bounded Inputs, Department of Electrical Engineering, Stanford University, Stanford, 1985, p. 148] is put to the test in finding optimal control laws for an optimisation problem with bounds on the inputs and terminal state constraints, presented by Ioslovich and Seginer [Acceptable nitrate concentraion of greenhouse lettuce: an optimal control policy for temperature, plant spacing and nitrate supply, in: Proceedings of the Agricontrol 2000, Wageningen, The Netherlands, IFAC, Wageningen University and Research Centre, Royal Dutch Institute of Engineers, 2000]. By making certain assumptions they derived properties of the solution in an analytic way. Here, it is shown that the numerical ACW-gradient algorithm is capable of finding solutions without making additional assumptions.
Representing composites in conceptual modeling
Authors: Graeme Shanks, Elizabeth Tansley, Ron Weber
Venue: Communications of the ACM (2004)

Using an object or entity class to represent a composite provides straightforward answers, making this approach superior to the use of relationship classes or associations.
IDAP: A Tool for High Level Power Estimation of Custom Array Structures
Authors: Mahesh Mamidipaka, Kamal Khouri, Nikil Dutt, Magdy Abadir
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

While array structures are a significant source of power dissipation,there is a lack of accurate high-level power estimatorsthat account for varying array circuit implementationstyles. We present a methodology and a tool, the ImplementationDependent Array Power (IDAP) estimator, that modelpower dissipation in SRAM based arrays accurately basedon a high-level description of the array, parameterized bythe array operations, the implementation styles, and varioustechnology dependent parameters. The methodologyis generic and the IDAP tool has been validated on industrialdesigns across a wide variety of array implementationsin the e500 processor core. For these industrial designs,IDAP generates high-level estimates for dynamic power dissipationthat are highly accurate with an error margin ofless than 22.2% of detailed (layout extracted) SPICE simulations.
Real exhibitions in a virtual museum
Authors: G. Lepouras, A. Katifori, C. Vassilakis, D. Charitos
Venue: Virtual Reality (2004)

When creating a virtual environment open to the public a number of challenges have to be addressed. The equipment has to be chosen carefully in order to be be able to withstand hard everyday usage, and the application has not only to be robust and easy to use, but has also to be appealing to the user, etc. The current paper presents findings gathered from the creation of a multi-thematic virtual museum environment to be offered to visitors of real world museums. A number of design and implementation aspects are described along with an experiment designed to evaluate alternative approaches for implementing the navigation in a virtual museum environment. The paper is concluded with insights gained from the development of the virtual museum and portrays future research plans.
DANCE: Dynamic Application Oriented Network Services
Authors: Bernd Reuther, Dirk Henrici, Markus Hillenbrand
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The explicit usage of protocols in applications is common practice, but restricts the provided communication service. The dynamic utilization of more suitable protocols or taking into account specific user requirements is either hard to realize or even impossible. This work introduces a model which provides a service oriented view to a communication sub system. Its goal is to find the most suitable service provider. Therefore, service providers are selected dynamically at run time. This enables to take into account the requirements of both the application and the user as well as information about the current platform and network environment. Thus applications are able to benefit from uncommon protocols wherever such protocols make sense and are available. Otherwise standard protocols will be used.
Algorithms for Association Study Design Using a Generalized Model of Haplotype Conservation
Authors: Russell Schwartz
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correlated variants, may provide a means of reducing the difficulty of the data analysis problems involved. The field to date has been dominated by methods based on the "haplotype block" hypothesis, which assumes discrete population-wide boundaries between conserved genetic segments, but there is strong reason to believe that haplotype blocks do not fully capture true haplotype conservation patterns. In this paper, we address the computational challenges of using a more flexible, block-free representation of haplotype structure called the "haplotype motif" model for downstream analysis problems. We develope algorithms for htSNP selection and missing data inference using this more generalized model of sequence conservation. Application to a dataset from the literature demonstrates the practical value of these block-free methods.
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)
Authors: Shiming Dong, Eileen Kraemer
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Phylogenetic trees are used to represent the evolutionary history of a set of species. Comparison of multiple phylogenetic trees can help researchers find the common classification of a tree group, compare tree construction inferences or obtain distances between trees. We present TreeAnalyzer, a freely available package for phylogenetic tree comparison. A MAST (Maximum Agreement Subtree) algorithm is implemented to compare the trees. Additional features of this software include tree comparison, visualization, manipulation, labeling, and printing. Availability: http://www.cs.uga.edu/~eileen/TreeAnalyzer
Distributed Multimedia Objects in Peer-to-Peer Networks
Authors: Kenichi Watanabe, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Multimedia objects are distributed and replicated in peer-to-peer (P2P) networks since the objects are cached, downloaded, and personalized in local peer computers. Thus, various types of replicas of objects are in nature distributed in various types and large number of peer computers. An application has to find target peer computers which support objects with enough quality of service (QoS) required. We discuss a new type of flooding algorithm to find target peers based on charge concept so that areas where target peers are expected to exist are more deeply searched. In addition, we discuss how to obtain access rights and ask other peers to manipulate objects.
Solving fractional packing problems in Oast(1/ε) iterations
Authors: D. Bienstock, G. Iyengar
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We adapt a method proposed by Nesterov [16] to design an algorithm that computes ε-optimal solutions to fractional packing problems by solving O*(ε-1 √Kn) separable convex quadratic programs, where K is the maximum number of non-zeros per row and n is the number of variables. We also show that the quadratic program can be approximated to any degree of accuracy by an appropriately defined piecewise-linear program. For the special case of the maximum concurrent flow problem on a graph G =(V,E) with rational capacities and demands we obtain an algorithm that computes an Ε-optimal flow by solving O*(ε-1 K3/2|E| √|V| (log 1/ε+ LU + LD)) shortest path problems, where K is the number of commodities, and LU, LD are, respectively, the number of bits needed to store the capacities and demands. We also show that the complexity of computing a maximum multicommodity flow is O*(1/εlog2(1/ε)). In contrast, previous algorithms required Ω(ε-2) iterations.
Morphologic Non-Word Error Detection
Authors: Stephane Bressan, Riky Irawan
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Writing and sending e-mails and short messages (SMS) has become one of the most pervasive activities in our daily life. Whether emails from our computers, short messages from our portable phones or both from our portable digital assistants, there is no occasion that does not deserve a text message: "Dear Colleagues, please find attached to this email ... ", "C U at 9pm?", "Forget to turn return DVD", etc. Many have warned that the typos, misspellings, grammatical errors and other linguistic indelicacies, which are commonly accepted in these messages, are announcing the decadence of human languages and communication. One answer to these reservations and critics is to provide the tools for the automatic detection and correction of such errors. In this paper, we are interested in the problem of the detection of non-words. We propose and evaluate two families of new methods based on extended n-grams and morphemes, respectively. We show that most methods we propose yield a better performance than the state of the art technique.
Resolution of referring expressions in a Korean multimodal dialogue system
Authors: Harksoo Kim, Jungyun Seo
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2003)

Referring expressions in multimodal dialogues have different aspects compared to those in language-only dialogues. They often refer to the items signified by either a gesture or visual means. In this article we classify referring expressions into two types (i.e., a deictic reference and an anaphoric reference), and propose two general methods to resolve these referring expressions. One method is a simple mapping algorithm that can find items referred with/without pointing gestures on a screen. The other is the centering algorithm with a dual cache model, to which Walker's centering algorithm is extended for a multimodal dialogue system. The extended algorithm is appropriate for resolving various anaphoric references in a multimodal dialogue. In the experiments, the proposed system correctly resolved 376 out of 405 referring expressions in 40 dialogues (0.54 referring expressions per utterance) showing 92.84 percent correctness.
Formal Specification and Verification of the SET/A Protocol with an Integrated Approach
Authors: Vitus S. W. Lam, Julian Padget
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

In this paper, we specify the SET/A protocol which is an agent-based payment protocol for credit card transactions in UML statechart diagrams. Then we translate them into the NuSMV language and analyze the payment protocol using the NuSMV model checker. Although the payment protocol satisfies desired properties including data integrity and deadlock freedom in the absence of an agent failure, a failure analysis reveals that not all desired properties are satisfied when the agent crashes. The agent may fail while it is travelling to a merchantýs server or when it is running in the merchantýs server. To ensure that a transaction is resilient to the agent failure, an extended SET/A protocol is proposed. Whenever a timeout occurs, the cardholder sends an inquiry request to the merchant directly for finding out the transaction result. Our work contributes the e-commerce field by using an integrated approach for modelling and analyzing the SET/A protocol.
Introduction to topical issue on non-impact printing technologies
Authors: R. A. Myers, J. C. Tamulis
Venue: IBM Journal of Research and Development (1984)

In this paper, we present an overview of the technologies of importance in computer output printing, providing a background for the succeeding papers in this issue. IBM workers have played a key role in the evolution of computer printer from a few marginally reliable complex mechanisms to an industry which today counts annual sales of over ten billion dollars worldwide. Thus, in this necessarily brief description of the different technologies we mention those in which the IBM role was particularly noteworthy, with specific mention of machines which brought the technologies to the marketplace.
Investigating the Effect of Expert Ranking of Use Cases for Design Inspection
Authors: Dietmar Winkler, Michael Halling, Stefan Biffl
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Inspection is an important approach to reduce defects in software engineering artifacts. Reading techniques such as Usage-Based Reading (UBR) can focus inspector attention on specific types of defects (missing and wrong information) and specific defect severity classes (critical, important and not important defects). For empirical investigation the replication of experiments can help increase the confidence in results. This paper presents a large-scale external experiment replication in the UBR family of experiments in an academic environment. Additionally to experiment replication we introduce a new reading technique variant UBR-ir to investigate the impact of expert know-how with ranking of use cases on the number and severity of defects found. Main results of the study are: (a) UBR expert know-how had significant effects on inspection effort distribution, effectiveness, and efficiency; (b) the share of false positives was higher for checklist-based reading (CBR) than for all UBR variants; and (c) both UBR variants perform significantly better than CBR, possibly due to the active guidance of use cases.
Multisensor fire observations
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

From space, we can understand fires in ways that are impossible from the ground. New Earth-observing satellites capture the significant impact of fires on our planet. This animation moves from a sequence of global fires in 2002 to continental and close-up views of three significant fires in the western United States in the summer of that year, the Hayman fire, the Rodeo-Chediski fire, and the Biscuit fire. Particular emphasis is made on the correlation of measurements from different satellite sensors. These sensors show many atmospheric and terrestrial phenomena that influence or are influenced by the occurrence of fires on Earth. Copyright held by creator.
Checkpointing of Control Structures in Main Memory Database Systems
Authors: L. Wang, Z. Kalbarczyk, R. K. Iyer, H. Vora, T. Chahande
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper proposes an application-transparent,low-overhead checkpointing strategy for maintaining consistencyof control structures in a commercial main memorydatabase (MMDB) system, based on the ARMOR (AdaptiveReconfigurable Mobile Object of Reliability) infrastructure.Performance measurements and availability estimates showthat the proposed checkpointing scheme significantly enhancesdatabase availability (an extra nine in improvementcompared with major-recovery-based solutions) while incurringonly a small performance overhead (less than 2% in atypical workload of real applications).