ppxscal/embedding_network huggingface dataset:
Automated Japanese Essay Scoring System: Jess
Authors: Tsunenori Ishioka, Masayuki Kameda
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

We have developed on automated Japanese essay scoring system named jess.The system evaluates an essay from three features: (1) Rhetoric - ease of reading, diversity of vocabulary, percentage of big words (long, difficult words), and percentage of passive sentences, (2) Organization - characteristics associated with the orderly presentation of ideas, such as rhetorical features and linguistic cues, (3) Contents - vocabulary related to the topic, such as relevant information and precise or specialized vocabulary.The final evaluated score is calculated by deducting from a perfect score assigned by a learning process using editorials and columns from the Mainichi Daily News newspaper. A diagnosis for the essay is also given.Our system does not need any essays graded by human experts.
SABER: smart analysis based error reduction
Authors: Darrell Reimer, Edith Schonberg, Kavitha Srinivas, Harini Srinivasan, Bowen Alpern, Robert D. Johnson, Aaron Kershenbaum, Larry Koved
Venue: ACM SIGSOFT Software Engineering Notes (2004)

In this paper, we present an approach to automatically detect high impact coding errors in large Java applications which use frameworks. These high impact errors cause serious performance degradation and outages in real world production environments, are very time-consuming to detect, and potentially cost businesses thousands of dollars. Based on 3 years experience working with IBM customer production systems, we have identified over 400 high impact coding patterns, from which we have been able to distill a small set of pattern detection algorithms. These algorithms use deep static analysis, thus moving problem detection earlier in the development cycle from production to development. Additionally, we have developed an automatic false positive filtering mechanism based on domain specific knowledge to achieve a level of usability acceptable to IBM field engineers. Our approach also provides necessary contextual information around the sources of the problems to help in problem remediation. We outline how our approach to problem determination can be extended to multiple programming models and domains. We have implemented this problem determination approach in the SABER tool and have used it successfully to detect many serious code defects in several large commercial applications. This paper shows results from four such applications that had over 60 coding defects.
ACT/1: a tool for information systems prototyping
Authors: R. E. A. Mason, T. T. Carey, A. Benjamin
Venue: Proceedings of the workshop on Rapid prototyping (1982)

This paper introduces an application development methodology whereby interactive screen oriented applications are simulated in scenarios, and then prototyped. This methodology, termed "architecture-based", allows users and developers to quickly reach agreement on precise specifications of a system. The paper describes the essential features of this methodology, and relates the methodology to similar techniques proposed by others. It then describes ACT/1, a program product which is specifically designed for developing such scenarios, and for translating the specified application systems into prototypes and then into working production programs. The relationship of the methodology to some concepts discussed at the Software Engineering Symposium on Rapid Prototyping is briefly discussed.
Dynamic analysis of the arrow distributed protocol
Authors: Fabian Kuhn, Roger Wattenhofer
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Arrow is a prominent distributed protocol which globally orders requests initiated by the nodes in a distributed system. In this paper we present a dynamic analysis of the Arrow protocol. We prove that Arrow is O(log D)-competitive, where D is the diameter of the spanning tree on which Arrow operates. In addition, we show that our analysis is almost tight by proving that for all trees the competitive ratio of Arrow is Ω(log D/log log D).
Incremental evaluation of schema-directed XML publishing
Authors: Philip Bohannon, Byron Choi, Wenfei Fan
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

When large XML documents published from a database are maintained externally, it is inefficient to repeatedly recompute them when the database is updated. Vastly preferable is incremental update, as common for views stored in a data warehouse. However, to support schema-directed publishing, there may be no simple query that defines the mapping from the database to the external document. To meet the need for efficient incremental update, this paper studies two approaches for incremental evaluation of ATGs [4], a formalism for schema-directed XML publishing. The reduction approach seeks to push as much work as possible to the underlying DBMS. It is based on a relational encoding of XML trees and a nontrivial translation of ATGs to SQL 99 queries with recursion. However, a weakness of this approach is that it relies on high-end DBMS features rather than the lowest common denominator. In contrast, the bud-cut approach pushes only simple queries to the DBNS and performs the bulk of the work in middleware. It capitalizes on the tree-structure of XML views to minimize unnecessary recomputations and leverages optimization techniques developed for XML publishing. While implementation of the reduction approach is not yet in the reach of commercial DBMS, we have implemented the bud-cut approach and experimentally evaluated its performance compared to recomputation.
High level language debugging with a compiler
Authors: Jeanne Ferrante
Venue: ACM SIGPLAN Notices (1983)

In this paper, we start from the basic premise of wanting an interactive high level language debugger, and we explore the possibilities of achieving this using a compiler. We outline the functional capabilities desired, and suggest means of achieving them using a compiler. Most of these entail requirements on the compiler, and our suggestions may be viewed as justification for modularizing compiler design.
Short note: molecular docking: An example of grid enabled applications
Authors: Erwin Tantoso, Habibah A. Wahab, Huah Yong Chan
Venue: New Generation Computing (2004)

The molecular docking web interface was developed to execute Autodock3.05 molecular docking program in the Grid environment. The nature of the application which allows the whole docking jobs to be broken up into multiple small independent tasks, has the potential of utilizing the availability of the Grid computing. Using the web interface, the whole docking procedures can be automated from the start to the end. Automation includes the preparation of the target receptor, creation of parameter files (gpf and dpf), calculation of grid energy, and docking of molecules. Once the job is split into small tasks, the tasks are submitted to Globus GRAM that submits the tasks to the resources available in the Grid environment. The execution of the grid-enabled AutoDock 3.05 is tested and the results showed that the process of molecular docking are faster compared if the execution is run on sequential computing resources.
Real-Time Simulation of Small-Scale Impact Debris Using Hierarchical Particle Systems
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

Impact between polygonal meshes is ubiquitous in any animated graphical system and the results of this impact need to be visualized if realism is to be maintained. Mesh destruction and deformation can be computationally expensive to perform on arbitrary meshes, and are therefore not suited to real-time, interactive requirements. We present a system for modelling small-scale debris generated by the collision of arbitrary polygonal meshes, based on hierarchical particle systems. The technique automatically generates debris characteristics by sampling the mesh and texture parameters at the point of impact. We sacrifice physical realism to achieve interactiveperformance rates, focussing instead on visual realism based on empirical measurement. We present promising results, at little computational cost, making the technique useful as a compliment to mesh destruction techniques or as a stand-alone debris system for real-time applications where physical accuracy is not paramount.
BlobTree Trees
Authors: Callum Galbraith, Peter MacMurchy, Brian Wyvill
Venue: Proceedings of the Computer Graphics International (2004)

In recent years several methods for modeling botanicaltrees have been proposed. The geometry and topology oftree skeletons can be well described by L-systems; however,there are several approaches to modeling smooth surfacesto represent branches, and not all of the observed phenomenacan be represented by current methods. Many tree typesexhibit non-smooth features such as branch bark ridges andcollars.In this research a hierarchical implicit modeling systemis used to produce models of branching structures thatcapture smooth branching, branch collars and branch barkridges. The BlobTree provides several techniques to controlthe combination of primitives, allowing both smooth andnon-smooth effects to be intuitively combined in a singleblend volume. Irregular effects are implemented using PreciseContact Modeling, Constructive Solid Geometry andspace warping. We show that smooth blends can be obtained,without noticeable bulging, using summation of distancebased implicit surfaces. L-systems are used to createthe branching structure allowing botanically based simulationsto be used as input.
Handwriting Analysis of Pre-Hospital Care Reports
Authors: Robert Milewski, Venu Govindaraju
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Emergency health care facilities lack automated medical form recognition systemsnecessary for efficient epidemiological and health surveillance analysis. The task is to extracthandwritten text from the New York State (NYS) Pre-Hospital Care Report (PCR) anddetermine its ASCII translation. Our approach hybridizes image processing and semanticlexicon pruning to compensate for the otherwise enormous lexicon size. In this paper weexpand on our IEEE CBMS 2001 paper [Automated Reading and Mining of Pre-hospital Care Reports][Medical Word Recognition Using a Computational Semantic Lexicon], which provided a conceptual overview, by probing into our recognizer design and performance measurements.
Weibull Based Analytical Waveform Model
Authors: Chirayu S. Amin, Florentin Dartu, Yehea I. Ismail
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Current CMOS technologies are characterized by interconnectlines with increased relative resistance w.r.t. driver outputresistance. Designs generate signal waveshapes that are verydifficult to model using a single parameter model such as thetransition time. In this paper, we present a simple and robustparameter analytical expression for waveform modeling based onthe Weibull cumulative distribution function. The Weibull modelaccurately captures the variety of waveshapes without introducingsignificant runtime overhead and produces results with less than5% error. We also present a fast and simple algorithm to convertwaveforms obtained by circuit simulation to the Weibull model. Amethodology for characterizing gates for the new model is alsopresented. Simulation results for many single and multiple inputgates show errors well below 5%. Our model can be used in amixed environment where some signals may still be characterizedby a single parameter.
Print quality measurements for high-speed electrophotographic printers
Authors: J. L. Crawford, C. D. Elzinga, R. Yudico
Venue: IBM Journal of Research and Development (1984)

Described here are some of the characteristics that make electrophotographic printing esthetically pleasing, and the use of a recently developed computer-controlled scanner for measuring those characteristics. New print quality measurements are described (for example, measurements of modulation, image gray-scale fidelity, and tangential-edge roughness) that allow the monitoring of the advanced printing functions made possible by all-point addressability. The requirements for and implementation of the scanner are discussed. Also discussed are the effects and limitations on print quality measurement resolution imposed by the algorithms used and the scanner; the effect of light scatter hy the paper; and the usefulness of the print quality measurements as an aid in making design trade-off decisions and in manufacturing control.
Generation of Geometrical Patterns Based on Coloured Pixels Using Computer Graphics
Authors: Amer Salman, Rula Salman
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Graphic primitives were looked at as a base to create geometrical patterns. For the last few years the authors have used computer graphics to generate, study and analyse a very large collection of geometrical patterns. The paper is based on this experience. First, a classification system was developed for the existing patterns based on graphic primitives. All patterns generated by this system have been based upon polyline, curve, calligraphy, tile or a mixture of these elements. Secondly, a new recipe was developed using pixels associated with colours. This is called Coloured Pixel, which is the new element that we have used to develop our geometric patterns. The final art product will have a new look that is different from the others. It is interesting to say that the produced image could be classified to any one of the seventeen crystallographic patterns.
A variant of a public key cryptosystem based on Goppa Codes
Authors: John P. Jordan
Venue: ACM SIGACT News (1983)

This paper suggests a way in which an interesting Public Key Cryptosystem based on Goppa Codes introduced by R. J. McEliece can be modified and used in a classical way to yield several advantages. The primary benefit is that the rate of the code (or data expansion reciporocal) can be increased by approximately 75%. Secondly (for public key and classical versions), by using a polynomial with no linear or repeated factors instead of an irreducible one to generate the Goppa Code, the code parameters remain the same and the decoding apparatus can be used to test candidate generators. Lastly, a wider range of transformations is made possible. No degradation in security is incurred.
The quantum adiabatic optimization algorithm and local minima
Authors: Ben W. Reichardt
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The quantum adiabatic optimization algorithm uses the adiabatic theorem from quantum physics to minimize a function by interpolation between two Hamiltonians. The quantum wave function can sometimes tunnel through significant obstacles. However it can also sometimes get stuck in local minima, even for fairly simple problems. An initial Hamiltonian which insufficiently mixes computational basis states is analogous to a poorly mixing Markov transition rule. We study a physical system -- the Ising quantum chain with alternating sector interaction defects, but constant transverse field -- which is equivalent to applying the quantum adiabatic algorithm to a particular SAT problem. We prove that for a constant range of values for the transverse field, the spectral gap is exponentially small in the sector length. Indeed, we prove that there are exponentially many eigenvalues all exponentially close to the ground state energy. Applying the adiabatic theorem therefore takes exponential time, even for this simple problem.
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
Authors: Philippe Baptiste, Baruch Schieber
Venue: Journal of Scheduling (2003)

We study the scheduling situation where n tasks, subjected to release dates and due dates, have to be scheduled on m parallel processors. We show that, when tasks have unit processing times and either require 1 or m processors simultaneously, the minimum maximal tardiness can be computed in polynomia time. Two algorithms are described. The first one is based on a linear programming formulation of the problem while the second one is a combinatorial algorithm. The complexity status of this "tall/small" task scheduling problem P|ri, pi = 1, sizei ∈ {1,m}|Tmax was unknown before, even for two processors.
An integrated modelling approach for the representation and embodiment of engineering systems with standard components
Authors: J. Hicks, J. Culley
Venue: Engineering with Computers (2004)

In today&#x2019;s global markets the commercial success of a product, however defined, is highly dependent upon the rapid and efficient transformation of an engineering system from a design schema to a fully embodied optimal solution. The ability of the designer to achieve this is severely frustrated by the analytically intensive and time-consuming aspects of embodying a concept. This is particularly the case where standard components have to be considered. This paper presents a new modelling approach that supports the designer during the transformation of a concept to an embodied solution. This modelling approach provides for the representation of conceptual schemas and their subsequent embodiment with standard components from third-party electronic representations. The modelling strategies and associated software issues for representing a mechanical system, handling the interactions between components and incorporating the governing representations for the design and selection of individual components are discussed. The process of constructing a system model, specifying the desired performance characteristics and the process of system resolution are also described. The paper concludes with an industrial case study which is used to demonstrate the capabilities and potential of the new approach for supporting the embodiment of systems and the important task of design synthesis.
Time optimal software pipelining of loops with control flows
Authors: Han-Saem Yun, Jihong Kim, Soo-Mook Moon
Venue: International Journal of Parallel Programming (2003)

Software pipelining is widely used as a compiler optimization technique to achieve high performance in machines that exploit instruction-level parallelism. However, surprisingly, there have been few theoretical or empirical results on time optimal software pipelining of loops with control flows. In this paper, we present three new theoretical and practical contributions for this under-investigated problem. First, we propose a necessary and sufficient condition for a loop with control flows to have an optimally software-pipelined program. We also present a decision procedure to compute the condition. As part of the formal treatment of software pipelining, we propose a new formalization of software pipelining. Second, we present two software pipelining algorithms. The first algorithm computes an optimal solution for every loop satisfying the condition, but may run in exponential time. The second algorithm computes optimal solutions efficiently for most (but not all) loops satisfying the condition. The former one proves the sufficiency of the condition and the latter one suggests a practical optimal software pipelining algorithm. Third, we present experimental results which strongly indicate that achieving the time optimality in the software-pipelined programs is a viable goal in practice with reasonable hardware support.
From Ubiquitous Computing to Ubiquitous Intelligence
Authors: P. W. Warren
Venue: BT Technology Journal (2004)

If computers could be as commonplace as the written word, our everyday world would be transformed. That was the vision, announced over a decade ago, of the computer visionary Mark Weiser. In Weiser's world computers would be ubiquitous and we would interact with them almost subconsciously. This vision is currently developing, but has still some way to go. Yet Weiser's vision can be extended further, with intelligence embedded in objects ranging from mechanical components to tins. This paper outlines a future which embraces Weiser's vision but goes beyond it to a world of such intelligent devices interacting autonomously, for the benefit of people but often without human intervention. Opportunities exist, in particular for those who develop the new applications and the complex systems which support them. For the general public the greatest fearwhich needs to be allayed is a loss of privacy.
Manufacturing-Aware Physical Design
Authors: Puneet Gupta, Andrew B. Kahng
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Ultra-deep submicron manufacturability impacts physicaldesign (PD) through complex layout rules and large guardbands for process variability; this creates new requirements for new manufacturing-aware PD technologies. The firstpart of this tutorial reviews PD complications and methodology changes - notably in the detailed routing arena - that arise from subwavelength lithography and deep-submicronmanufacturing (antennas, metal planarization and mask-wafer mismatch). Process variations and their sources are taxonomized for modeling and simulation. A framework ofdesign for cost and value is described. The second part covers yield-constrained optimizations in PD, especially "beyond corners" approaches that escape today's pessimistic or even incorrect corner-based approaches. Statistical timingand noise analyses enable optimization of parametric yieldand reliability. Yield-aware cell libraries and "analog" design rules (as opposed to "digital", 0/1 rules) can help designers explore yield-cost tradeoffs, especially for low-volumeparts. We then examine performance impact-limited fill insertion which goes beyond mere capacitance rules. Modeling, objectives, and filling strategies are discussed. Finally,we discuss current and near-term prospects for the overall design-to-manufacturing PD methodology. Key aspects include better integrations with analysis and manufacturing interfaces, as well as cost-benefit tradeoffs for "regular"layout structures that are likely beyond 90nm, cost optimizations for low-volume production, and the role of robust and/or stochastic optimization in PD.
The Compositional Far Side of Image Computation
Authors: Chao Wang, Gary D. Hachtel, Fabio Somenzi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Symbolic image computation is the most fundamental computationin BDD-based sequential system optimization and formal verification.In this paper, we explore the use of over-approximationand BDD minimization with donýt cares during image computation.Our new method, based on the partitioned representation ofthe transition relation, consists of three phases: First, the model istreated as a set of loosely coupled components, and over-approximateimages are computed to minimize the transition relation ofeach component. A refined overall image is then computed usingthe simplified transition relation. Finally, the exact image isobtained by a clipping operation that recovers all previous over-approximations.Since BDD minimization employs constraints on thenext-state variables of the transition relation, instead of the customaryconstraints on the present-state variables, we call the resultingmethod far side image computation.The new method can be implemented on top of any image computationalgorithm that is based on the partitioned transition relation.(For example, IWLS95, MLP, and Fine-Grain.)We demonstrate the effectiveness of our approach by experimentson models ranging from easy to hard: The new method wins significantlyover the best known algorithms so far in both CPU timeand memory usage, especially on the hard models.