ppxscal/embedding_network huggingface dataset:
Computational topology algorithms for discrete 2-manifolds
Authors: Peter Schroder
Venue:  (2003)

This thesis presents computational topology algorithms for discrete 2-manifolds. Although it is straightforward to compute the genus of a discrete 2-manifold, this topological invariant does not tell us enough for most computer graphics applications where we would like to know: what does the topology look like? Genus is a scalar value with no associated geometric appearance. We can, however, isolate geometric regions of the surface that are topologically interesting. The simplest topologically interesting, and perhaps most intuitive, regions to consider are those with genus equal to one. By isolating and examining such regions we can compute measures to better describe the appearance of relevant surface topology. Thus, this work focuses on isolating handles, regions with genus equal to one, in discrete 2-manifolds. In this thesis, we present novel algorithms guaranteed to identify and isolate handles for various discrete surface representations. Additionally, we present robust techniques to measure the geometric extent of handles by identifying two locally minimal-length non-separating cycles for each handle. We also present algorithms to retain or simplify the topology of a reconstructed surface as desired. Finally, the value of these algorithms is demonstrated through specific applications to computer graphics. For example, we demonstrate how geometric models can be greatly improved through topology simplification both for models represented by volume data or by triangle meshes. Contributions. The contributions of this work include: (1) A robust and efficient method for identifying and isolating handles for discrete 2-manifolds. (2) A method to robustly represent the topology of the surface with an augmented Reeb graph. (3) A robust method to find two locally minimal-length non-separating cycles for each handle. (4) A simple method to simplify the topology for volume data and triangle meshes which preserves the local geometry as much as possible. (5) An out-of-core method for topology simplification for volume data.
Web-Based Support for Managing Large Collections of Software Artefacts
Authors: Cornelia Boldyreff, James Brittle, Chris Korhonen, Phyo Kyaw, Janet Lavery, David Nutter, Stephen Rank
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

There has been a long history of CASE tooldevelopment, with an underlying software repositoryat the heart of most systems. Usually such tools, eventhe more recently web-based systems, are focused onsupporting individual projects within an enterprise oracross a number of distributed sites. Little support formaintaining large heterogeneous collections ofsoftware artefacts across a number of projects hasbeen developed. Within the GENESIS project, this hasbeen a key consideration in the development of theOpen Source Component Artefact Repository(OSCAR). Its most recent extensions are explicitlyaddressing the provision of cross project global viewsof large software collections as well as historicalviews of individual artefacts within a collection. Thelong-term benefits of such support can only berealised if OSCAR is widely adopted and varioussteps to facilitate this are described.
Design and Implementation of High-Performance Memory Systems for Future Packet Buffers
Authors: Jorge García, Jesús Corbal, Llorenç Cerdà, Mateo Valero
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

In this paper we address the design of a future high-speedrouter that supports line rates as high as OC-3072 (160 Gb/s),around one hundred ports and several service classes. Buildingsuch a high-speed router would raise many technological problems,one of them being the packet buffer design, mainly becausein router design it is important to provide worst-case bandwidthguarantees and not just average-case optimizations.A previous packet buffer design provides worst-case bandwidthguarantees by using a hybrid SRAM/DRAM approach. Next-generationrouters need to support hundreds of interfaces (i.e.,ports and service classes). Unfortunately, high bandwidth for hundredsof interfaces requires the previous design to use large SRAMswhich become a bandwidth bottleneck. The key observation wemake is that the SRAM size is proportional to the DRAM accesstime but we can reduce the effective DRAM access time by overlappingmultiple accesses to different banks, allowing us to reduce theSRAM size. The key challenge is that to keep the worst-case bandwidthguarantees we need to guarantee that there are no bank conflictswhile the accesses are in flight. We guarantee bank conflictsby reordering the DRAM requests using a modern issue-queue-likemechanism. Because our design may lead to fragmentationof memory across packet buffer queues, we propose to share theDRAM space among multiple queues by renaming the queue slots.To the best of our knowledge, the design proposed in this paper isthe fastest buffer design using commodity DRAM to be publishedto date.
An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC
Authors: Dong-Ho Lee, Hyoung-Joo Kim
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

The SPY-TEC (Spherical Pyramid-Technique) was proposed as a new indexing method for high-dimensional data spaces using a special partitioning strategy that divides a d-dimensional data space into 2d spherical pyramids. In the SPY-TEC, an efficient algorithm for processing hyperspherical range queries was introduced with a special partitioning strategy. However, the technique for processing k-nearest-neighbor queries, which are frequently used in similarity search, was not proposed. In this paper, we propose an efficient algorithm for processing nearest-neighbor queries on the SPY-TEC by extending the incremental nearest-neighbor algorithm. We also introduce a metric that can be used to guide an ordered best-first traversal when finding nearest neighbors on the SPY-TEC. Finally, we show that our technique significantly outperforms the related techniques in processing k-nearest-neighbor queries by comparing it to the R*-tree, the X-tree, and the sequential scan through extensive experiments.
Transient software fault tolerance through recovery
Authors: Goutam Kumar Saha
Venue: Ubiquity (2003)

A low-cost and effective solution for developing transient fault tolerant application software based on a single-version program
A plan-based analysis of indirect speech acts
Authors: C. Raymond Perrault, James F. Allen
Venue: Computational Linguistics (1980)

We propose an account of indirect forms of speech acts to request and inform based on the hypothesis that language users can recognize actions being performed by others, infer goals being sought, and cooperate in their achievement. This cooperative behaviour is independently motivated and may or may not be intended by speakers. If the hearer believes it is intended, he or she can recognize the speech act as indirect; otherwise it is interpreted directly. Heuristics are suggested to decide among the interpretations.
Structure charts a structured alternative to flowcharts
Authors: C. H. Lindsey
Venue: ACM SIGPLAN Notices (1977)

Conventional flowcharts are a hindrance to structured programming. An alternative notation, which emphasises the <u>nested</u> structure of programs, is proposed. The notation allows for only those <u>goto</u> s which are safe in a structured program. Unbelievers in Structured Programming are advised not to read this paper.
Adaptive dissemination of dynamic information services in an extended data broadcast environment
Authors: Chih-Lin Hu, Ming-Syan Chen
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Considering that most information broadcast services generate data dynamically in practice, we devise in this paper an extended data broadcast mechanism which supports not only the original data broadcast scenario but also the dissemination of dynamic inforamtion services. Furthermore, we design an on-line loan-based slot allocation and feedback technique to tolerate the dynamic changes of broadcast traffic and accordingly perform the adaptation of service classification, bandwidth allocation and broadcast schedule so as to enhance the performance. Our experimental studies show that the extended data broadcast mechanism associated with the loan-based feedback technique is able to achieve a substantial saving in message traffic for dynamic information dissemination in wireless networks.
A Low Voltage, Low Noise CMOS RF Receiver Front-End
Authors: Jie Long, Robert J. Weber
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a low-power, low-voltage radio frequency(RF) receiver front-end implemented in a 0.18µmCMOS process that is intended for 2.4GHz wireless applications.It includes a single-ended low-noise amplifier(LNA) with on-chip spiral inductors and a passive switchingdirect downconversion mixer. The LNA has a simulatednoise figure of 0.75dB and power gain of 12.9dB. With a-30dBm RF input and a 0.45V LO signal, the mixer has asimulated noise figure of 7.8dB, conversion gain of -2.2dB,1-dB compression point of -8dBm, input third-order interceptpoint (IIP3) of 14.4dBm. Comparison between thiswork and others have shown better noise performance andless power dissipation.
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Venue: Annual Symposium on Principles of Programming Languages (2004)

This volume contains the papers presented at POPL'04, the Thirty-First Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. The POPL conference is a forum for presentation of research on the design, foundations, analysis, transformation, implementation and verification of programming languages, programming systems and programming abstractions. This year's conference is in Venice, Italy.A total of 176 full papers were received in response to a call for papers. SIGPLAN policy forbids submission from members of the program committee. Each submission was read and reviewed by at least three members of the program committee, and often supplementary evaluations were solicited from outside experts. During a one day and a half meeting held in Paris, the submissions were discussed by the program committee as a whole, leading to the selection of 29 papers. Each paper was judged according to the originality, clarity, innovation, perceived importance, and appropriateness to the expected audience. Due to the format of the conference and the high number of submissions received, many good papers were not selected.In addition to the contributed papers, the POPL'04 program features two invited talks by Javier Esparza and Davide Sangiorgi, and one award lecture by John C. Reynolds, recipient of the 2004 SIGPLAN Programming Language Achievement Award. The invited speakers were selected by the committee to complement and enhance the program of contributed papers.Although submissions were read and evaluated, the papers that appear in this volume may differ in form and content from the submitted papers. The conference selection process does not constitute full review of the work. It is expected that many of the papers printed here will be revised and submitted to refereed archival journals for publication.
How users determine the quality of a web page
Authors: Karin Quinones Dudziak
Venue:  (2003)

The World Wide Web and search engines are widely used, and getting good results from searches is important. Research has shown that there are measurable, quantitative features of Web pages that relate to the quality of the Web page. There is little existing research that has examined a set of Web pages, rated by representative users, to determine what Web page features may predict users' ratings about the quality of the pages. This is the first study to apply policy capturing, a methodology to capture the cues people use in making judgments or ratings, to determine how a group of representative users made judgments about various Web pages. Search engines could utilize these features in examining Web pages to provide more useful results. The features of the Web pages examined were page length, links, images, keywords per page, and keywords per title. Users rated 40 Web pages on the relevancy, ease of understanding, and trustworthiness of the page in three separate topic areas. Analyses included the amount of variance accounted for, weighting of individual cues, complexity of the decision process, participants' insight into their own rating methodology, and the role of individual difference variables. Free response data were gathered about what other features influenced participants' ratings. Overall, average ratings on the three dependent variables ranged from 60&ndash;70 out of 100. The beta weights and R2 for the independent variables were low to moderate. Keywords were shown to be an important predictor in the page or title depending on the topic area. Links and images were more important for noninformation-centric topics. Most people used one of the five linear cues significantly, and more complex, nonlinear relationships were also found. For example, keywords increased the value of a page up to a point, but beyond that point the benefit decreased (a quadratic relationship). The amount of insight into how decisions were made about pages varied among participants from none to nearly perfect. Many of the variables and results varied significantly by topic area. Policy capturing is a good methodology for examining this issue, but additional Web page features should be tested.
Modeling of point defect formation in silicon monocrystals
Authors: V. A. Zabelin, V. V. Kalaev
Venue: Microelectronic Engineering (2003)

The prediction of characteristics of point defects in silicon crystals is the final goal of numerical simulation of the whole process of growth from the melt, recognized today as a helpful tool in technology optimization. We present an effective numerical model with an accurate description of defect incorporation and evolution in a growing crystal. The model is applied to a 300-mm diameter CZ silicon crystal with an investigation of the sensitivity of the predicted defect characteristics to input parameters.
Native ISS-SystemC Integration for the Co-Simulation of Multi-Processor SoC
Authors: Franco Fummi, Stefano Martini, Giovanni Perbellini, Massimo Poncino
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In a system-level design flow, the transition from a high-level description entry implies the refinement from an untimed, unpartitioned description to a real architecture where applications are executed on a programmable device and interact with ad-hoc hardware components. Simulation of such architectures requires the capability of efficient co-simulation of a model of hardware with a model of the processor.This paper presents two co-simulation methodologies, based on SystemC as hardware modeling language and on an Instruction Set Simulator (ISS) as a model of the processor. The first one works at the SystemC kernel level and exploits potentialities of the GNU suite, whereas the second uses features offered by the operating system running on the ISS.The two methodologies improve co-simulation performance with respect to state-of the art methods, and provide different trade-offs between the simplicity of the programming model, the modeling power, and co-simulation performance.
Current issues in IT education
Authors: Tanya McGill
Venue:  (2003)

Addressing the ongoing quest for teaching excellence in an increasingly technological society, the information presented in this volume addresses how to effectively implement teaching technologies across disciplinary boundaries. The scholarly dimensions of belief, inquiry, argument, and reflection in information systems are presented with attention to educational theories of metacognition, technology literacy, and community informatics. Training for e-business and public agency work are discussed to better equip instructors for the distinctive information needs of these sectors.
Telework effectiveness: task, technology and communication fit perspective
Authors: Bongsik Shin
Venue: Business strategies for information technology management (2003)

We are witnessing rapid growth of inter and intra-organizational telework in many different forms: distributive project teams, telecommuting, mobile work, business to-employee, employee e-business, and virtual corporations. Despite the increasing prevalence of distributive work and its importance in creating business value, our understanding of its success factors is limited. Among many prospective factors, task characteristics, communication quality, and technology support have been mentioned frequently as key components for successfully running telework. Communications quality and technology support seem the direct result of operational design in managing the virtual process; while task characteristics of workers are typically pre-determined, unless they are modified for telework. This paper discusses the implications of chosen variables on telework success from a fit theory perspective. It focuses on examining the implications of two- and three-way alignments among task characteristics, communications quality, and technology support on in a distributive work setting.
Workflow mining: a survey of issues and approaches
Authors: W. M. P. van der Aalst, B. F. van Dongen, J. Herbst, L. Maruster, G. Schimm, A. J. M. M. Weijters
Venue: Data Knowledge Engineering (2003)

Many of today's information systems are driven by explicit process models. Workflow management systems, but also ERP, CRM, SCM, and B2B, are configured on the basis of a workflow model specifying the order in which tasks need to be executed. Creating a workflow design is a complicated time-consuming process and typically there are discrepancies between the actual workflow processes and the processes as perceived by the management. To support the design of workflows, we propose the use of workflow mining. Starting point for workflow mining is a so-called "workflow log" containing information about the workflow process as it is actually being executed. In this paper, we introduce the concept of workflow mining and present a common format for workflow logs. Then we discuss the most challenging problems and present some of the workflow mining approaches available today.
A unified model for metasearch, pooling, and system evaluation
Authors: Javed A. Aslam, Virgiliu Pavlu, Robert Savell
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

We present a unified model which, given the ranked lists of documents returned by multiple retrieval systems in response to a given query, simultaneously solves the problems of (1) fusing the ranked lists of documents in order to obtain a high-quality combined list (metasearch); (2) generating document collections likely to contain large fractions of relevant documents (pooling); and (3) accurately evaluating the underlying retrieval systems with small numbers of relevance judgments (efficient system assessment). Our approach is based on the Hedge algorithm for on-line learning. In effect, our proposed system "learns" which documents are likely to be relevant from a sequence of on-line relevance judgments. In experiments using TREC data, our methodology is shown to outperform standard methods for metasearch, pooling, and system evaluation, often remarkably so.
An intelligent dialogue for online rule based expert systems
Authors: Sascha Mertens, Marius Rosu, Yuliadi Erdani
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

This paper describes a concept for creating free configurable, intelligent behaving web dialogues for rule based expert systems. Free configurable is meant to indicate, that the dialogue module developed with this concept is domain independent and being configurable without needing means of programming. Intelligent means that it in spite of this independency, it can behave in accordance to the expert system's knowledge and the received user inputs.
The constrained longest common subsequence problem
Authors: Yin-Te Tsai
Venue: Information Processing Letters (2003)

This paper considers a constrained version of longest common subsequence problem for two strings. Given strings S1, S2, and P, the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S1 such that P is a subsequence of this lcs. An O(rn2m2) time algorithm based upon the dynamic programming technique is proposed for this new problem, where n, m and r are lengths of S1, S2 and P, respectively.
Creation of flexible graphical user interfaces through model composition
Authors: B. Raphael, G. Bhatnagar, I. F. C. Smith
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Nearly all software products have rigid and predefined interfaces. Users are usually unable to modify or customize features beyond cosmetic aspects. Interface adaptability is important because aspects such as user preferences and task sequences vary widely in engineering, even within specialized domains. A methodology for the creation of adaptable user interfaces using model composition is presented in this paper. User interfaces are generated dynamically through the composition of model fragments that are stored in a fragment library. When fragments are linked to models of physical behavior, interface model composition applications are likely to be easier to extend and maintain than traditional graphical user interfaces. A prototype system within the domain of bridge diagnosis illustrates the potential for practical applications.
Boolean and ternary complementary pairs
Authors: R. Craigen
Venue: Journal of Combinatorial Theory Series A (2003)

A ternary complementary pair, TCP(n, w), is a pair of (0, ± 1)-sequences of length n with zero autocorrelation and weight w. These are of theoretical interest in combinatorics as well as of practical consequence in coding, transmitting and processing various kinds of signals. When one attempts to construct a TCP of given length and weight, the first thing to decide is where to place the zeros, if any. Thus arise Boolean complementary pairs, BP(n, w)--pairs of (0, 1)- sequences of length n with zero autocorrelation over Z2 and a total of w 1's. The unique pair of (0, 1)-sequences having the same support as a TCP(n, w) is a BP(n, w) (but the converse is not necessarily true); thus, Boolean complementary pairs establish candidate zero patterns for ternary complementary pairs. This cleanly separates the construction of ternary complementary pairs into two stages: deciding where to put the zeros, and determining the sign of the nonzero entries. We obtain some necessary conditions for the existence of Boolean complementary pairs. We conduct an exhaustive survey of pairs of small lengths and construct some infinite classes clearly of fundamental importance in the theory. We completely characterize all pairs of even weight and give a product construction for pairs of odd weight that gives a greater variety of new pairs than similar product methods used in the ternary case.
Peer evaluation in an algorithms course
Authors: Mary-Angela Papalaskari
Venue: ACM SIGCSE Bulletin (2003)

Peer evaluation is used in an algorithms course to highlight the importance of good documentation and professional presentation.