ppxscal/embedding_network huggingface dataset:
Adaptive techniques for unstructured nested meshes
Authors: Miguel A. Padrón, José P. Suárez, Ángel Plaza
Venue: Applied Numerical Mathematics (2004)

The purpose of this paper is twofold. First we introduce improved versions of our algorithms for refining and coarsening 2D and 3D nested triangular and tetrahedral grids, and secondly the application of these algorithms in the simulation of 2D and 3D problems, is demonstrated. A key idea of the algorithms is the use of the topological concept of the skeleton of a triangulation in two or three dimensions in order to reduce the dimension of the refinement problem in a natural hierarchic manner.Improved skeleton based refinement (SBR) algorithms and their counterpart, the skeleton based derefinement (SBD) algorithms are described in this study. The algorithms are fully automatic and are applied here to a 2D boundary value problem, a 3D approximation problem with a large gradient, a geometric shape modeling problem and a simulation evolution problem in 3D.
Customizing the Microsoft .NET Framework Common Language Runtime (Pro-Developer (Paperback))
Authors: Steven Pratschner
Venue:  (2005)

Get advanced programming techniques and guidelines to exploit the flexibility and customizability of the common language runtime for a variety of applications, from databases to cell phones. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Retrieval of images of man-made structures based on projective invariance
Authors: Rajashekhar, Subhasis Chaudhuri, Vinay P. Namboodiri
Venue: Pattern Recognition (2007)

In this paper we propose a geometry-based image retrieval scheme that makes use of projectively invariant features. Cross-ratio (CR) is an invariant feature under projective transformations for collinear points. We compute the CRs of point sets in quadruplets and the CR histogram is used as the feature for retrieval purposes. Being a geometric feature, it allows us to retrieve similar images irrespective of view point and illumination changes. We can retrieve the same building even if the facade has undergone a fresh coat of paints! Color and textural features can also be included, if desired. Experimental results show a favorably very good retrieval accuracy when tested on an image database of size 4000. The method is very effective in retrieving images having man-made objects rich in polygonal structures like buildings, rail tracks, etc.
Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths
Authors: Janardhan R. Iyengar, Paul D. Amer, Randall Stewart
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Concurrent multipath transfer (CMT) uses the Stream Control Transmission Protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. We identify three negative side-effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved: (1) unnecessary fast retransmissions by a sender; (2) overly conservative congestion window (cwnd) growth at a sender; and (3) increased ack traffic due to fewer delayed acks by a receiver. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects. Presented with several choices as to where a sender should direct retransmissions of lost data, we propose five retransmission policies for CMT. We demonstrate spurious retransmissions in CMT with all five policies and propose changes to CMT to allow the different policies. CMT is evaluated against AppStripe, which is an idealized application that stripes data over multiple paths using multiple SCTP associations. The different CMT retransmission policies are then evaluated with varied constrained receive buffer sizes. In this foundation work, we operate under the strong assumption that the bottleneck queues on the end-to-end paths used in CMT are independent.
Some notes on self
Authors: G. Gobbi, M. Maiocchi
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1978)

The fundamental role played by software documentation is well known, not only as necessary product description, but also as a tool for communication among programmers and as a tool for distribution of know-how.
PDF Reference Version 1.6 (5th Edition)
Venue:  (2004)

The FDA requires that drug approvals be submitted in this format, and U.S. federal courts request that it be used for electronic case filing. We're talking, of course, about PDF (or Portable Document Format), and with more than 600 million copies of its reader (Adobe Acrobat) downloaded, and governments and enterprises around the world using it to streamline document management, chances are you'll be called to develop for it as well. This comprehensive reference makes sure you're ready! Containing all of the info from previous editions, plus new material on what's been added to PDF Version 1.5, this essential guide makes a highly technical subject accessible and intelligible. You'll find complete coverage of all major aspects of the formatï¾¿imaging model, architecture, syntax, graphics, operators, fonts, and rendering--as well as highly readable explanations of its interactive and multimedia features, transparency capabilities, intellectual property issues, and more. The first and last word on the most current PDF spec from the people who know it best: Adobe! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fabrication of micro-gas chromatograph columns for fast chromatography
Authors: Abhinav Bhushan, Dawit Yemane, Dan Trudell, Edward B. Overton, Jost Goettert
Venue: Microsystem Technologies (2006)

Gas chromatography (GC) is one of the most widespread techniques used in laboratories as a way to separate and analyze complex mixtures of volatile and semi-volatile compounds. The main advantage of miniaturization of these systems is the increased performance due to the reduced time for analysis and reduced fabrication cost of the complex pneumatic flow system. In this paper advanced design ideas and fabrication processes to facilitate integration of the sample concentrator and the column will be presented. Using the LIGA process, 0.5- and 2-m-long, 50-&#x03bc;m-wide, and up to 600-&#x03bc;m-high aspect ratio metal GC separation columns with on-chip integrated sample injection and detection were fabricated. Initial experiments of coating these high aspect ratio columns show promising results when compared to simple tubular columns.
Contour interpolation with bounded dihedral angles
Authors: Sergey Bereg, Minghui Jiang, Binhai Zhu
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

In this paper, we present the first nontrivial theoretical bound on the quality of the 3D solids generated by any contour interpolation method. Given two arbitrary parallel contour slices with n vertices in 3D, let &alpha; be the smallest angle in the constrained Delaunay triangulation of the corresponding 2D contour overlay, we present a contour interpolation method which reconstructs a 3D solid with the minimum dihedral angle of at least &alpha;/8. Our algorithm runs in O(nlogn) time where n is the size of the contour overlay.We also present a heuristic algorithm that optimizes the dihedral angles of a mesh representing a surface in 3D.
Modeling emergency care in hospitals: a paradox - the patient should not drive the process
Authors: Andrew M. Hay, Edwin C. Valentin, Rienk A. Bijlsma
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The objective in the creation of domain specific discrete event simulation environments is to facilitate model development in the chosen domain. In the creation of such environments, there has been a tendency to adopt a factory based world view. In this paper, we describe an approach to the creation of a generic modeling environment in the healthcare domain that breaks away from the conventional entity driven request for resource. Our approach has enabled us to create models of emergency care in four UK NHS hospitals that reflect more realistically the way emergency care is actually delivered. It appears, paradoxically, that in simulating emergency care, it is best if the patient does not come first.
Convergence of Runge-Kutta methods applied to linear partial differential-algebraic equations
Authors: K. Debrabant, K. Strehmel
Venue: Applied Numerical Mathematics (2005)

We apply Runge-Kutta methods to linear partial differential-algebraic equations of the form Aut(t,x) + B(uxx(t,x) + rux(t,x)) + Cu(t,x)=f(t,x), where A, B, C ∈ Rn,n and the matrix A is singular. We prove that under certain conditions the temporal convergence order of the fully discrete scheme depends on the time index of the partial differential-algebraic equation. In particular, fractional orders of convergence in time are encountered. Furthermore we show that the fully discrete scheme suffers an order reduction caused by the boundary conditions. Numerical examples confirm the theoretical results.
Discrete global descent method for discrete global optimization and nonlinear integer programming
Authors: Chi-Kong Ng, Duan Li, Lian-Sheng Zhang
Venue: Journal of Global Optimization (2007)

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method.
Object-Oriented and Classical Software Engineering, 7 edition
Authors: Stephen R. Schach
Venue:  (2006)

Integrating case studies to show the object oriented approach to software engineering, Object-Oriented and Classical Software Engineering, 7/e presents an excellent introduction to software engineering fundamentals, covering both traditional and object-oriented techniques. The coverage of both Agile processes and Open Source Software has been considerably expanded. In addition, the Osbert Oglesby running case study has been replaced with a new case study on the Martha Stockton Greengage Foundation. The new study highlights even more aspects of the Unified Process. The book’s unique organization remains in place, with Part I covering underlying software engineering theory, and Part II presenting the more practical life cycle. Complementing this well-balanced approach is the straightforward, student-friendly writing style, through which difficult concepts are presented in a clear, understandable manner. The new seventh edition provides an extensive updating of this classic software engineering text! Table of contentsPart One Introduction to Software Engineering 1 The Scope of Software Engineering 2 Software Life-Cycle Models 3 The Software Process 4 Teams 5 The Tools of the Trade 6 Testing 7 From Modules to Objects 8 Reusability and Portability 9 Planning and EstimatingPart Two The Workflows of the Software Life Cycle 10 Requirements 11 Classical Analysis 12 Object-Oriented Analysis 13 Design 14 Implementation 15 Postdelivery Maintenance 16 More on UMLAppendix A Term Project: Osric's Office Appliances and DecorAppendix B Software Engineering ResourcesAppendix C Requirements Workflow: The MSG Foundation Case StudyAppendix D Structured Systems Analysis: The MSG Foundation Case StudyAppendix E Analysis Workflow: The MSG Foundation Case StudyAppendix F Software Project Management Plan: The MSG Foundation Case StudyAppendix G Design Workflow: The MSG Foundation Case StudyAppendix H Implementation Workflow: The MSG Foundation Case Study (C++ Version)Appendix I Implementation Workflow: The MSG Foundation Case Study (Java Version)Appendix J Test Workflow: The MSG Foundation Case Study
Contexts as communicating theories
Authors: Christo Dichev
Venue: AI Communications (1997)

In this paper we address the issue related to modeling some aspects of contextual reasoning. A particular class of multicontext systems is proposed with a single bridge rule linking any two communicating contexts. The proposed approach of contextual reasoning is illustrated by sketching how two first order logics can be accommodated to the contextual framework. Some concepts such as kernel and imported part of contexts are defined, reflecting the distinction between the &ldquo;self&dash;generated&rdquo; and the communicated facts and providing a ground for defining a particular subclass of importing contexts. In order to support a larger &ldquo;repertoire&rdquo; of contexts a set of operators for combining contexts into compound structures is introduced, thus defining an algebra of contexts. The notion of compound context reflects the intuition that depending on the problem, interaction between contexts involves variety of dynamic context formations.
Recent results on wavelet bases on the interval generated by GP refinable functions
Authors: Laura Gori, Laura Pezza, Francesca Pitolli
Venue: Applied Numerical Mathematics (2004)

In this paper, we present two different classes of refinable functions, wavelets and their duals on a bounded interval with the aim of giving a few applications. In both cases the starting point is the family of GP refinable functions on R. The performances exhibited by the mentioned two classes are compared each other, as well as with the B-spline case.
Applying 3D human model in a posture recognition system
Authors: Bernard Boulay, Francois Brémond, Monique Thonnat
Venue: Pattern Recognition Letters (2006)

This paper proposes an approach to recognise human postures in video sequences, which combines a 2D approach with a 3D human model. The 3D model is a realistic articulated human model which is used to obtain reference postures to compare with test postures. Several 2D approaches using different silhouette representations are compared with each other: projections of moving pixels on the reference axis, Hu moments and skeletonisation. We are interested in a set of specific postures which are representative of typical video understanding applications. We describe results for recognition of general postures (e.g. standing) and detailed postures (e.g. standing with one arm up) in ambiguous/optimal viewpoint with good/bad segmented silhouette to show the effectiveness of our approach.
Fabrication of a spiral microcoil using a 3D-LIGA process
Authors: Harutaka Mekaru, Shinji Kusumi, Noriaki Sato, Masami Shimizu, Michiru Yamashita, Osamu Shimada, Tadashi Hattori
Venue: Microsystem Technologies (2006)

LIGA processes have been developed generally in the 2.5D world. We introduced techniques of 3D X-ray lithography and worm injection molding with a unscrewing release mechanism, and succeeded in the development to three dimensions of LIGA process. We called this technology 3D-LIGA process, and came to be able to fabricate the plastic molded product with a spiral microstructure. Furthermore, we succeeded in the trial production of a spiral microcoil using 3D-LIGA process and metallization technique combining flat and smooth electroplating with a leveling agent and an isotropic chemical etching. The diameter of this microcoil was 0.5&#x00a0;mm and the length was 1&#x00a0;mm. The width of the Cu coil line was 10&#x00a0;&#x03bc;m, and the pitch was 20&#x00a0;&#x03bc;m. Moreover, we measured characteristics of this microcoil as an inductor. The inductance and the quality factor at the frequency of 1&#x00a0;GHz were 91&#x00a0;nH and 5.8, respectively. This is the first time successful fabrication of an electric device with a 3D form like a spiral microcoil using the 3D-LIGA process has been achieved.
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Authors: Jason Cong, Kirill Minkovich
Venue: Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays (2007)

Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based Boolean matching formulation (SAT-BM-M) [11]. The principal improvement was achieved by deriving the SAT formulation using the implicant instead of minterm representation of the function to be matched. This enables our BM formulation to create a SAT problem of size O (as opposed to O(m•2k) in the original formulation, where n is the number of inputs to the function, k is the size of the LUT, and m is the number of implicants, which is much smaller than 2 n and experimentally found to be around 3 . Using the new BM formulation, and considering 10-input functions, we can show an almost 3x run time improvement and can solve 5.6x more problems than the SAT-based BM formulation in [11]. Moreover, using this improved Boolean matching formulation, we implemented (as a proof of concept) a FPGA resynthesis tool, called RIMatch, which was able to reduce the number of LUTs produced by ZMap by 10% on the MCNC benchmarks.
Denormalization strategies for data retrieval from data warehouses
Authors: Seung Kyoon Shin, G. Lawrence Sanders
Venue: Decision Support Systems (2006)

In this study, the effects of denormalization on relational database system performance are discussed in the context of using denormalization strategies as a database design methodology for data warehouses. Four prevalent denormalization strategies have been identified and examined under various scenarios to illustrate the conditions where they are most effective. The relational algebra, query trees, and join cost function are used to examine the effect on the performance of relational systems. The guidelines and analysis provided are sufficiently general and they can be applicable to a variety of databases, in particular to data warehouse implementations, for decision support systems.
Learning probabilistic models of cis-regulatory modules that represent logical and spatial aspects
Authors: Keith Noto, Mark Craven
Venue: Bioinformatics (2007)

Motivation: The process of transcription is controlled by systems of factors which bind in specific arrangements, called cis-regulatory modules (CRMs), in promoter regions. We present a discriminative learning algorithm which simultaneously learns the DNA binding site motifs as well as the logical structure and spatial aspects of CRMs. Results: Our results on yeast datasets show better predictive accuracy than a current state-of-the-art approach on the same datasets. Our results on yeast, fly and human datasets show that the inclusion of logical and spatial aspects improves the predictive accuracy of our learned models. Availability: Source code is available at http://www.cs.wisc.edu/~noto/crm Contact: noto@cs.wisc.edu
A Comprehensive Introduction to Object-Oriented Programming with Java, 1 edition
Authors: C. Thomas Wu
Venue:  (2007)

A Comprehensive Introduction to Object-Oriented Programming with Java provides an accessible and technically thorough introduction to the basics of programming using java. The text takes a truly object-oriented approach. Objects are used early so that students think in objects right from the beginning. The text focuses on showing students a consistent problem solving approach. Table of contents0 Introduction to Computers and Programming Languages1 Introduction to Object-Oriented Programming and Software Development2 Getting Started with Java3 Numerical Data4 Defining Your Own Classes - Part 15 Selection Statements6 Repetition Statements7 Defining Your Own Classes - Part 28 Exceptions and Assertions9 Characters and Strings10 Arrays and Collections11 Sorting and Searching12 File Input and Output13 Inheritance and Polymorphism14 GUI and Event-Driven Programming15 Recursive Algorithms16 Memory Allocation Schemes and Linked Data Structures17 Generics and Type Safety18 List ADT19 Stack ADT20 Queue ADT
International workshop performance evaluation - origins and directions
Authors: Günter Haring, Christoph Lindemann, Martin Reiser
Venue: ACM SIGARCH Computer Architecture News (1998)

Performance Evaluation is a discipline of Computer Science for some thirty years. It seems time to take stock of what we were doing. That is, provide answers to the following questions:&bull; What are its scientific contributions?&bull; What is its relevance in industry and business?&bull; What is its standing in academia?&bull; Where is the field headed?&bull; What are its success stories and failures?&bull; What are its current burning questions?
A knowledge-driven model to personalize e-learning
Authors: Chao Boon Teo, Robert Kheng Leng Gay
Venue: Journal on Educational Resources in Computing (JERIC) (2006)

This article highlights basic issues that have hindered e-learning systems from becoming the revolutionary force it could be for education. While current systems aim to foster significant improvements in learning, this article argues that most systems are still limited to just being online repositories. This and the lack of learning personalization has become a topic for research. A knowledge-driven model to personalize e-learning is proposed in this article. A novel methodology for eliciting and personalizing tacit knowledge is presented. We focus on describing the complex information processing in terms of knowledge, rather than the details of its implementation.
Creating a Presentation in PowerPoint: Visual QuickProject Guide
Authors: Tom Negrino
Venue:  (2004)

PowerPoint is nearly ubiquitous in today's world--in business settings, of course, but in schools and universities, clubs and organizations--almost everywhere you turn. It's not a difficult tool to use, but the presentations people create in PowerPoint range widely in quality--dazzling or dull, enlivening or enervating. Now, to help users deliver high-quality presentations, even when they're short on time, is this smart, concise guide designed to take them from standing start to stellar finish on their first presentations. Rather than cover every last option PowerPoint offers, author Tom Negrino steps readers through on a single, basic presentation, showing them the quickest, easiest, most effective way to communicate their ideas. Each short lesson builds a component of a basic presentation, from creating slides, formatting charts and tables, incorporating sound and video, creating transitions, and adding a bit of polish to their debut presentations. Friendly, step-by-step instructions and large, full-color screen shots make the information instantly accessible.
Striped Smith--Waterman speeds database searches six times over other SIMD implementations
Authors: Michael Farrar
Venue: Bioinformatics (2007)

Motivation: The only algorithm guaranteed to find the optimal local alignment is the Smith--Waterman. It is also one of the slowest due to the number of computations required for the search. To speed up the algorithm, Single-Instruction Multiple-Data (SIMD) instructions have been used to parallelize the algorithm at the instruction level. Results: A faster implementation of the Smith--Waterman algorithm is presented. This algorithm achieved 2--8 times performance improvement over other SIMD based Smith--Waterman implementations. On a 2.0 GHz Xeon Core 2 Duo processor, speeds of >3.0 billion cell updates/s were achieved. Availability: http://farrar.michael.googlepages.com/Smith-waterman Contact: farrar.michael@gmail.com