ppxscal/embedding_network huggingface dataset:
Contributing to Eclipse: Principles, Patterns, and Plugins
Authors: Erich Gamma, Kent Beck
Venue:  (2003)

Erich Gamma and Kent Beck introduce you quickly, yet thoroughly, to Eclipse, the emerging environment for software development. Instead of simply walking you through the actions you should take, Contributing to Eclipse, with its many sidebars, essays, and forward pointers, guides you through Eclipse. You will not just do. You will also understand.Whether you need to get up to speed immediately or want to better understand the design rationale behind Eclipse, Contributing to Eclipse is the Eclipse resource for you.
An analysis of factors that influence the ability of SMEs to derive benefit in four phases of electronic commerce: 34 Australian case studies
Authors: Stephen B. Chau, Paul Turner
Venue: Managing IT in government business & communities (2003)

This paper builds on research presented by the authors at IRMA 2001. Previous research by Chau and Turner (2001b) adapted the work of Venkatraman (1994) to explore the relationship between the degree of SME organisational transformation and potential benefits derived from e-commerce. The qualitative data explored reveals various factors that influence SME's ability to derive benefit from conducting Web-based e-commerce. A preliminary review suggests that these factors can be distinguished into internal factors (organisational and technological) and external factors (nature of supply chain, level of service provided by third party organisations, industry influence, and government assistance). This paper discusses these factors and their implications for modelling e-business organisational transformation.
Stability of Discrete Vector Problems with the Parametric Principle of Optimality
Authors: S. E. Bukhtoyarov, V. A. Emelichev, Yu. V. Stepanishina
Venue: Cybernetics and Systems Analysis (2003)

The paper presents a survey of analysis of different types of stability in vector (multiple-criteria) combinatorial problem with the parametrized optimality principle. Formulas of &ldquo;stability sphere&rdquo; radius are given along with qualitative characteristics of stability.
Using cognates to align sentences in bilingual corpora
Authors: Michel Simard, George F. Foster, Pierre Isabelle
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

In a recent paper, Gale and Church describe an inexpensive method for aligning bitext, based exclusively on sentence lengths [3]. While this method produces surprisingly good results (a success rate around 96%), even better results are required to perform such tasks as the computer-assisted revision of translations. In this paper, we examine some of the weaknesses of Gale and Church's program, and explain how just a small amount of linguistic knowledge would help to overcome these weaknesses. We discuss how cognates provide for a cheap and reasonably reliable source of linguistic knowledge. To illustrate this, we describe a modification to the program in which the criterion is cognates rather than sentence lengths. Finally, we show how better and more efficient results may be obtained by combining the two criteria length and "cogneteness". Our method can be generalized to accommodate other sources of linguistic knowledge, and experimentation shows that it produces better results than alignments based on length alone, at a minimal cost.
Online Recognition of Chinese Characters: The State-of-the-Art
Authors: Cheng-Lin Liu, Stefan Jaeger, Masaki Nakagawa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Online handwriting recognition is gaining renewed interest owing to the increase of pen computing applications and new pen input devices. The recognition of Chinese characters is different from western handwriting recognition and poses a special challenge. To provide an overview of the technical status and inspire future research, this paper reviews the advances in online Chinese character recognition (OLCCR), with emphasis on the research works from the 1990s. Compared to the research in the 1980s, the research efforts in the 1990s aimed to further relax the constraints of handwriting, namely, the adherence to standard stroke orders and stroke numbers and the restriction of recognition to isolated characters only. The target of recognition has shifted from regular script to fluent script in order to better meet the requirements of practical applications. The research works are reviewed in terms of pattern representation, character classification, learning/adaptation, and contextual processing. We compare important results and discuss possible directions of future research.
Using randomization to make recursive matrix algorithms practical
Authors: Dinh Lê, D. Stott Parker
Venue: Journal of Functional Programming (1999)

Recursive block decomposition algorithms (also known as quadtree algorithms when the blocks are all square) have been proposed to solve well-known problems such as matrix addition, multiplication, inversion, determinant computation, block LDU decomposition and Cholesky and QR factorization. Until now, such algorithms have been seen as impractical, since they require leading submatrices of the input matrix to be invertible (which is rarely guaranteed). We show how to randomize an input matrix to guarantee that submatrices meet these requirements, and to make recursive block decomposition methods practical on well-conditioned input matrices. The resulting algorithms are elegant, and we show the recursive programs can perform well for both dense and sparse matrices, although with randomization dense computations seem most practical. By &lsquo;homogenizing&rsquo; the input, randomization provides a way to avoid degeneracy in numerical problems that permits simple recursive quadtree algorithms to solve these problems.
Harmony: A Desktop Grid for Delivering Enterprise Computations
Authors: Vijay K. Naik, Swaminathan Sivasubramanian, David Bantz, Sriram Krishnan
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

This paper describes Harmony-a grid infrastructure builtusing personal computer resources. Harmony addresses thekey concerns of end users for responsiveness, privacy andprotection by isolating the grid computation in a virtualmachine on the PC. Harmony also addresses the keyconcerns of enterprise IT by automating the configurationand deployment of grid services and by automating theworkload management so as to meet quality of servicegoals. Harmony's layered resource managementarchitecture diverts grid workload to currently underutilized desktop resources. Harmony is designed to handletransactional workload - a key characteristic of commercialapplications. Our implementation is Web Services-based,so the programming model of Harmony is compatible withand familiar to enterprise developers. We believe thatHarmony demonstrates practical exploitation of a hithertounderutilized resource of considerable capability, with thepotential to complement, or even in some cases replace,dedicated server-based resources.
Least squares fits of potentials by using energy and gradient data: vibrational anharmonic spectra for H2CO from DFT calculations
Authors: P. Carbonniere, D. Begue, A. Dargelos, C. Pouchan
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We present a least-squares fitting procedure to obtain a quartic force field by using energy and gradient data arising from B3LYP/cc-pVTZ calculations on a «simplex-sum» of Box and Behnken grid of points. We illustrate and we test for H2CO the quartic force field and the resulting vibrational anharmonic spectra performed from 44 simplex-sum configurations and we compare our results to those obtained by using the classical 168 energy calculations.
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Authors: J. J. M. M. Rutten
Venue: Theoretical Computer Science (2003)

We present a theory of streams (infinite sequences), automata and languages, and formal power series, in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This coalgebraic perspective leads to a unified theory, in which the observation that each of the aforementioned sets carries a so-called final automaton structure, plays a central role. Finality forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions take the shape of what we have called behavioural differential equations, after Brzozowski's notion of input derivative. A calculus is developed for coinductive reasoning about all of the afore mentioned structures, closely resembling calculus from classical analysis.
Top-Down Computation of Partial ROLAP Data Cubes
Authors: Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The precomputation of the different summary views of a data cube is critical to improving the response time of data cube queries for On-Line Analytical Processing (OLAP). The computation of the full data cube, representing all 2d views, has been studied extensively. However, the full cube is often too large to be computed and stored, and for some applications all views are not even required. Hence, it is important to provide efficient methods for the computation of partial data cubes consisting of an arbitrary, user selected, subset of the 2d possible views. In this paper, we study the top-down computation of partial ROLAP data cubes. We present both sequential and parallel methods for top-down partial data cube construction. Our experimental results indicate close to linear performance improvement for partial data cube computation. For example, when selecting 50% of the views our method requires only 55% of the time required to build the full cube, and when selecting 75% of the views our method requires just 82% of the full cube time.
Student empowerment in a survey course
Authors: Don Goelman
Venue: ACM SIGCSE Bulletin (2003)

The author, assigned to teach a new survey course based on guest lecturers, employs some meta-academic strategies to promote student learning.
A computational approach for solving y2 = 1k + 2k + ... +xk
Authors: M. J. Jacobson,  Jr., Á. Pintér, P. G. Walsh
Venue: Mathematics of Computation (2003)

We present a computational approach for finding all integral solutions of the equation y2 = 1k + 2k +...+ xk for even values of k. By reducing this problem to that of finding integral solutions of a certain class of quartic equations closely related to the Pell equations, we are able to apply the powerful computational machinery related to quadratic number fields. Using our approach, we determine all integral solutions for 2 ≤ k ≤ 70 assuming the Generalized Riemann Hypothesis, and for 2 ≤ k ≤ 58 unconditionally.
Integrated Solutions with DB2
Authors: Rob Cutlip, John Medicke
Venue:  (2003)

Integrated Solutions with DB2 by Rob Cutlip and John Medicke Foreword by Chris Wicher/Vice President of Integration, IBM Coroporation Use DB2 to enhance productivity, customer service, and trading relationships-and cutcosts Learn how to exploit technology for the development of complex solutions using patterns andbest practices Understand how DB2, Web services, and messaging infrastructure fit together Leverage DB2 in business intelligence, e-commerce, CRM, pervasive computing, enterpriseapplication integration, and beyond For every DB2 database developer, architect, designer, and managerIBM's DB2 database platform is the foundation for an extraordinary array of highlyintegrated business solutions, ranging from advanced business intelligence and e-commerce toB2B integration and state-of-the-art pervasive computing.Now, two leading IBM solution architects show you how to use DB2 to create flexibleinfrastructures that simplify the construction of any enterprise-class business solution.Learn how to seamlessly integrate DB2, Web servers, development tools, messaginginfrastructure, and other crucial technologies. Then build, step by step, five specificsolutions chosen to address the core challenges facing today's enterprise. Along the way you'lllearn how to use DB2 to improve productivity and customer service, reduce operating costs,strengthen key trading relationships, and more. Leveraging the IBM Patterns for e-business to accelerate the delivery of integrated,Web-enabled solutions Using DB2, WebSphere, and related technologies to integrate applications, information, andportals Exploiting business integration technologies to bring together people, processes, andinformation to create a cohesive solution Creating automated CRM email systems with trigger-induced DB2 UDFs, JavaMail, andJAF Building high-value mobile and pervasive applications with DB2 Everyplace and DB2 SpatialExtender (SE) Delivering dynamic Web services and eSourcing solutions with DB2 XML Extender Architecting and building highly personalized e-commerce systems with DB2 technologiesIf you're ready to leverage the full business value of IBM's DB2 platform, you're ready forIntegrated Solutions with DB2.
Engineering an SQL gateway to IMS
Authors: G. N. Paulley
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Multidatabase systems enable organizations to integrate legacy database systems, and their applications, with newer database technology. One such legacy system is IBM'S Information Management System (IMs), a hierarchical database management system developed in the 1960s. Commercial IMS gateways typically suffer from poor performance and lack essential features needed to support updates. In this paper, we outline the engineering issues of constructing a multi-user IMS gateway that supports both client applications and ad-hoc requests. Our proposed architecture exploits the transaction management services of IMS/TM and the cross-memory services of MVS/ESA. Design features include run-time query optimization using an access plan cache and the use of IMS/TM message processing regions for database access. On the basis of performance and system programming considerations, we also discuss some implementation aspects of the gateway's design.
Complexity-effective instruction queues for high-performance processors
Authors: Aneesh Aggarwal
Venue:  (2003)

Processor performance is highly related to the clock cycle time and Instructions per Cycle (IPC) count. Increase in clock speed has been made possible by improvements in silicon technology and careful processor design. On the other hand, increases in IPC have mainly resulted from using more complex hardware logic on the chip. With the very complex nature of current microprocessors, it is becoming increasingly difficult to further speedup the clock rates. Instruction Queue (IQ) logic lies at the heart of current superscalar processors, and is responsible for issuing multiple instructions in parallel. It is one of the most complex and power hungry modules in out-of-order processors. Having large IQs and issue widths to increase IPC has a negative effect on clock speed. On the other hand, increasing the clock speed by means of deeper pipelining hurts the IPC. In this dissertation, I discuss complexity-effective IQ designs for high performance. IQ complexity is directly related to the IQ size and the processor issue width. Complexity reduction can therefore be achieved (without directly reducing these parameters) by reducing either (i) the effective queue size considered for issue or (ii) the effective number of results used for identifying data-ready instructions. In this regards, I discuss different techniques for reducing the IQ logic complexity. The first technique, that has already been proposed, partitions the IQ into smaller independent IQs (thus reducing the number of instructions considered for issue in each smaller IQ). Unfortunately, such multi-PE reduced IQ complexity processors suffer from a significant limitation that the IPCs obtained with them is low. Hence, I propose a novel technique of instruction replication to remedy this limitation, thus obtaining complexity-effective partitioned IQ designs (i.e. reduced complexity with negligible IPC loss). Other techniques that I propose for reducing IQ complexity use program characteristics to reduce the effective queue size considered for issue and the effective number of results used for identifying data-ready instructions. The new set of complexity-effective IQ designs, that use program characteristics to reduce IQ complexity, significantly reduce the IQ logic delay and power consumption while maintaining the IPC. In the future, with increased number of transistors integrated on the chip, processors can be designed with larger IQs and issue widths. It is imperative that the complexity-effective IQ designs remain effective at larger IQ sizes and issue widths. Hence, I study the scalability of both the partitioned IQs (in multi-PE processors) and the new IQs proposed in the dissertation. My results indicate that conventional partitioned IQs are not scalable. However, partitioned IQs with instruction replication as well as the new IQs (exploiting program behavior) are very scalable.
Using a Layered Approach for Interoperability on the Semantic Web
Authors: Isabel F. Cruz, Huiyong Xiao
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

In this paper, we further develop a proposed layered approach for the Semantic Web. Our objective is to build a specific solution to the problem of providing data interoperability among different databases, so as to allow for schematic data integration. In particular, we solve theproblem of translating queries on a database schema into queries on another database schema, using their relationship with an ontology. We use RDF Schema to model the databases and the ontology. A common vocabulary expresses the mappings between eachdatabase schema and the ontology.
Handling syntactic constraints in a DTD-compliant XML editor
Authors: Y. S. Kuo, Jaspher Wang, N. C. Shih
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations altogether, thus freeing the user from any syntactic concerns. Based on the proposed algorithms and process, we build an XML editor with forms as its user interface.
Panel session: great principles in computing
Authors: Peter J. Denning, Rudolph Darken, Eric Roberts, Mark Guzdial
Venue: ACM SIGCSE Bulletin (2004)

Questions and answers about the great principles framework for computing and its impact on the organization and content of curriculum, with special attention to communicating our field, teaching programming, and appealing to a diverse audience.
Unveiling the transport
Authors: Jeffrey Mogul, Lawrence Brakmo, David E. Lowell, Dinesh Subhraveti, Justin Moore
Venue: ACM SIGCOMM Computer Communication Review (2004)

Traditional application programming interfaces for transport protocols make a virtue of hiding most internal per-connection state. We argue that this information-hiding precludes many potentially useful application features and performance optimizations. We advocate a disciplined, portable, and secure interface that gives applications both "get" and "set" access to transport connection state.
Intelligent access and mobility management in heterogeneous wireless networks using policy
Authors: Ken Murray, Rajiv Mathur, Dirk Pesch
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The next generation of mobile networks will utilise multiple radio access technologies. These heterogeneous wireless networks will enable the user to seamlessly roam between the different access technologies to maintain network connectivity and satisfactory QoS. Network operators will be able to select an access network on the arrival of a new call or handover request. Selecting the most optimal connection and controlling access to the available networks is an important consideration for overall network stability and providing guaranteed QoS. In this paper we propose an intelligent call admission control and mobility management architecture using policy-based management. A call admission policy admits a new user based on the current load and a predefined service mix. A network health monitor continuously updates the residual capacity by observing the quality of the current connections. The mobility management policy focuses on handover control between the available access networks. Mobiles can be selected for forced handover when a network reaches a congested state. A selection policy controls the mobile selection procedure.
State of the art in testing components
Authors: Sami Beydeda, Volker Gruhn
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The use of components in development of complex softwaresystems can surely have various benefits. Their testing,however, is still one of the open issues in software engineering.Both the developer of a component and the developerof a system using components often face the problemthat information vital for certain development tasks isnot available. Such a lack of information has various consequencesto both. One of the important consequences isthat it might not only obligate the developer of a systemto test the components used, it might also complicate thesetests. This article gives an overview of component testingapproaches that explicitly respect a lack of information indevelopment.
Linear stability of TCP/RED and a scalable control
Authors: Steven H. Low, Fernando Paganini, Jiantao Wang, John C. Doyle
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We demonstrate that the dynamic behavior of queue and average window is determined predominantly by the stability of TCP/RED, not by AIMD probing nor noise traffic. We develop a general multi-link multi-source model for TCP/RED and derive a local stability condition in the case of a single link with heterogeneous sources. We validate our model with simulations and illustrate the stability region of TCP/RED. These results suggest that TCP/RED becomes unstable when delay increases, or more strikingly, when link capacity increases. The analysis illustrates the difficulty of setting RED parameters to stabilize TCP: they can be tuned to improve stability, but only at the cost of large queues even when they are dynamically adjusted. Finally, we present a simple distributed congestion control algorithm that maintains stability for arbitrary network delay, capacity, load and topology.
Symbiotic Value of an Embodied Agent in Language Learning
Authors: Dominic W. Massaro
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Our perception and understanding are influenced by a Espeaker's face and accompanying gestures, as well as the actual sound of the speech. Given the value of face-to-face interaction, our persistent goal has been to develop, evaluate, and use animated agents to teach speech and language. Baldi® is an accurate three-dimensional agent appropriately aligned with either synthesized or natural speech. We describe our language-training program, which utilizes Baldi as a tutor, who guides students through a variety of exercises designed to teach vocabulary and grammar, to improve speech articulation, and to develop linguistic and phonological awareness.