ppxscal/embedding_network huggingface dataset:
ABF++: fast and robust angle based flattening
Authors: Alla Sheffer, Bruno Lévy, Maxim Mogilnitsky, Alexander Bogomyakov
Venue: ACM Transactions on Graphics (TOG) (2005)

Conformal parameterization of mesh models has numerous applications in geometry processing. Conformality is desirable for remeshing, surface reconstruction, and many other mesh processing applications. Subject to the conformality requirement, these applications typically benefit from parameterizations with smaller stretch. The Angle Based Flattening (ABF) method, presented a few years ago, generates provably valid conformal parameterizations with low stretch. However, it is quite time-consuming and becomes error prone for large meshes due to numerical error accumulation. This work presents ABF plus; plus;, a highly efficient extension of the ABF method, that overcomes these drawbacks while maintaining all the advantages of ABF. ABF++ robustly parameterizes meshes of hundreds of thousands and millions of triangles within minutes. It is based on three main components: (1) a new numerical solution technique that dramatically reduces the dimension of the linear systems solved at each iteration, speeding up the solution; (2) a new robust scheme for reconstructing the 2D coordinates from the angle space solution that avoids the numerical instabilities which hindered the ABF reconstruction scheme; and (3) an efficient hierarchical solution technique. The speedup with (1) does not come at the expense of greater distortion. The hierarchical technique (3) enables parameterization of models with millions of faces in seconds at the expense of a minor increase in parametric distortion. The parameterization computed by ABF++ are provably valid, that is they contain no flipped triangles. As a result of these extensions, the ABF++ method is extremely suitable for robustly and efficiently parameterizing models for geometry-processing applications.
Self-Adaptive Scheduler Parameterization via Online Simulation
Authors: Barry Lawson, Evgenia Smirni
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Although thoroughly investigated, job scheduling for high-end parallel systems remains an inexact science, requiring significant experience and intuition from system administrators to properly configure batch schedulers. Production schedulers provide many parameters for their configuration, but tuning these parameters appropriately can be very difficult - their effects and interactions are often nonintuitive. In this paper, we introduce a methodology for automating the difficult process of job scheduler parameterization. Our proposed methodology is based on using past workload behavior to predict future workload, and on online simulations of a model of the actual system to provide on-the-fly suggestions to the scheduler for automated parameter adjustment. Detailed performance comparisons via simulation using actual supercomputing traces indicate that out methodology consistently outperforms other workload-aware methods for scheduler parameterization.
Shape understanding system: Visual intelligence tests: Research Articles
Authors: Zbigniew Les, Magdalena Les
Venue: International Journal of Intelligent Systems (2005)

Understanding is based on a large number of highly varied abilities called intelligence that can be measured. In this paper understanding abilities of the shape understanding system (SUS) are tested based on the methods used in intelligence tests. These tests are formulated as tasks given to the system and performance is compared with the human performance of these tasks. The main novelty of the presented method is that the process of understanding is related to the visual concept represented as a symbolic name of the possible class of shapes. The visual concept is one of the ingredients of the concept of the visual object (the phantom concept) that makes it possible to perform different tasks that are characteristic for visual understanding. The presented results are part of the research aimed at developing the shape understanding method that would be able to perform complex visual tasks connected with visual thinking. The shape understanding method is implemented as the shape understanding system. &copy; 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 799&ndash;826, 2005.
The CACHe project: its work and outcomes
Authors: Nicholas Lambert
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The CACHe Project at Birkbeck, University of London, was established in 2002 and is now entering its final year. This paper details CACHe's work in archiving the early days of British computer arts, from their origins in the 1960s to the beginning of the 1980s. Its goals are to investigate and recover this history, thereby confirming its cultural and aesthetic legitimacy. The principal archival resources of the CACHe project are also described. Its outcomes are assessed in terms of its funding by the Arts and Humanities Research Board (AHRB) and possible future projects to emerge from it.
Book review: Developing and Managing Expert Systems by David S. Prerau (Addison Wesley)
Venue: ACM SIGART Bulletin (1990)

This book provides a step by step approach to developing and managing expert systems. The text thoroughly covers all of the proven techniques used in each step of the development process and provides very pragmatic advice covering typical problems faced with building expert systems. One common weakness of many business oriented expert systems texts is that they provide a general listing of expert system examples and usually end up focusing on system that the typical business person cannot relate to. A case in point is Waterman's A Guide to Expert Systems and James Martin's Expert Systems: A Tutorial. Both texts are adequate beginner texts, but Waterman devotes too much attention to Prospector, and expert system for geologists, while Martin provides a lengthy overview of different systems that are available. These exhaustive lists, with descriptions of various expert systems, in a multitude of fields, usually overwhelm the reader with triviality. This information is quickly outdated and rarely provides the reader with any lasting knowledge. 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
HotSwap-Transparent Server Failover for Linux
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

HotSwap is a program that provides transparent failover for existing UNIX servers without modification or special hardware. HotSwap runs two instances of a server on independent machines in sync, so that if either machine fails, the other may assume control without breaking TCP connections or losing application state. Replication and failover is transparent to both clients and servers. Servers are not aware that a backup replica is maintaining state. Clients are unaware that a backup server has taken over from a failed master. This system is applicable to a wide variety of common servers including Java, Apache, and PostgreSQL and other servers that may have no other mechanisms for fault tolerance.
Hyperplane Grouping and Pipelined Schedules: How to Execute Tiled Loops Fast on Clusters of SMPs
Authors: Maria Athanasaki, Aristidis Sotiropoulos, Georgios Tsoukalas, Nectarios Koziris, Panayiotis Tsanakas
Venue: The Journal of Supercomputing (2005)

This paper proposes a novel approach for the parallel execution of tiled Iteration Spaces onto a cluster of SMP PC nodes. Each SMP node has multiple CPUs and a single memory mapped PCI-SCI Network Interface Card. We apply a hyperplane-based grouping transformation to the tiled space, so as to group together independent neighboring tiles and assign them to the same SMP node. In this way, intranode (intragroup) communication is annihilated. Groups are atomically executed inside each node. Nodes exchange data between successive group computations. We schedule groups much more efficiently by exploiting the inherent overlapping between communication and computation phases among successive atomic group executions. The applied non-blocking schedule resembles a pipelined datapath, where group computation phases are overlapped with communication ones, instead of being interleaved with them. Our experimental results illustrate that the proposed method outperforms previous approaches involving blocking communication or conventional grouping schemes.
A QoS Multicast Routing Protocol for Mobile Ad-Hoc Networks
Authors: Li Layuan, Li Chunlin
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper presents a hierarchical QoS multicast routing protocol (HQMRP) for mobile ad-hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed HQMRP scheme, each local node just only needs to maintain local multicast routing information and/or summary information of other clusters (or domains), but does not requires any global ad hoc network states to be maintained. The HQMRP also allows that an ad-hoc group member can join/leave the multicast group dynamically, and supports multiple QoS constraints. The paper presents. The proof of correctness and complexity analysis of the protocol. The performance measures of HQMRP are evaluated using simulation. The studies show that HQMRP can provide an available approach to QoS multicast routing for mobile ad-hoc networks.
MicroCore: mapping genome expression to cell pathways and networks: Conference Reviews
Authors: Manish Patel, Sylvia Nagl
Venue: Comparative and Functional Genomics (2004)

The MicroCore toolkit is a suite of analysis programs for microarray and proteomics data that is open source and programmed exclusively in Java. MicroCore provides a flexible and extensible environment for the interpretation of functional genomics data through visualization. The first version of the application (downloadable from the MicroCore website: ), implements two programs&mdash;PIMs ( <und>p</und>rotein <und>i</und>nteraction <und>m</und>aps) and MicroExpress&mdash;and is soon to be followed by an extended version which will also feature a fuzzy k-means clustering application and a Java-based R plug-in for microarray analysis. PIMs and MicroExpress provide a simple yet powerful way of graphically relating large quantities of expression data from multiple experiments to cellular pathways and biological processes in a statistically meaningful way. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Self-Managing Systems: A Control Theory Foundation
Authors: Yixin Diao, Joseph L. Hellerstein, Sujay Parekh, Rean Griffith, Gail Kaiser, Dan Phung
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The high cost of operating large computing installations has motivated a broad interest in reducing the need for human intervention by making systems self-managing. This paper explores the extent to which control theory can provide an architectural and analytic foundation for building self-managing systems, either from new components or layering on top of existing components. Further, we propose a deployable testbed for autonomic computing (DTAC) that we believe will reduce the barriers to addressing key research problems in autonomic computing. The initial DTAC architecture is described along with several problems that it can be used to investigate.
GUIDE-ME: graphical user interface for the design of mixed interactive environment based on the ASUR notation
Authors: Joël Viala, Emmanuel Dubois, Philip D. Gray
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

In this paper we present GUIDE-ME, Graphical User Interface for the DEsign of Mixed interactive Environment, a graphical tool to the design and the description of mixed systems also called ubiquitous systems. Based on the ASUR notation, that supports the description and the reasoning of mixed systems during the design phase, GUIDE-ME offers graphical editing capabilities for the manipulation of this notation. GUIDE-ME opens up new perspectives in terms of combinations of this notation with other HCI design methods and tools. To illustrate this, we present the links we established between GUIDE-ME and ASURSim, a platform supporting the simulation of the interaction of a mobile user in mixed 3D environment.
Temperature prediction of rolling tires by computer simulation
Authors: Yeong-Jyh Lin, Sheng-Jye Hwang
Venue: Mathematics and Computers in Simulation (2004)

A numerical procedure has been applied for investigating the temperature distribution in a smooth tread bias tire of a light truck, operated under different speeds, pneumatic pressures, and loading conditions. Prior to simulation by the finite element analysis, two separate sets of testing, namely dynamic mechanical testing and material testing, have been conducted in relation to the evaluation of hysteresis (H) and total strain energy (Used), respectively. Hysteresis loss energy is given as (H × Used) and considered to relate directly to heat generation rate. Temperature rise is assumed to be due to the energy dissipation from periodic deformation. This dissipation of energy may be equated to be the primary heat generation source. Hysteresis energy loss is used as a bridge to link the strain energy density to the heat source in rolling tires; temperature distribution of rolling tires may be obtained by the steady-state thermal analysis. The above procedure has been shown to facilitate the simulation of the temperature distribution in the rolling tire.An efficient computational process is being introduced to decrease the time for coupled 3D dynamic rolling simulation of tire. Temperature rise under different conditions is discussed with reference to the results of other published studies.
Performance Evaluation of Secure Concurrency Control Algorithm for Multilevel Secure Distributed Database Systems
Authors: Navdeep Kaur, Rajwinder Singh, A. K. Sarje, Manoj Misra
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Majority of the research in multilevel secure database management systems (MLS/DBMS) focuses primarily on centralized database systems. However, with the demand for higher performance and higher availability, database systems have moved from centralized to distributed architectures, and the research in multilevel secure distributed database management systems (MLS/DDBMS) is gaining more and more prominence. Concurrency control is an integral part of database systems. Secure concurrency control algorithms proposed in literature achieve correctnessand security at the cost of declined performance of high security level transactions. These algorithms infringe the fairness in processing transactions at different security levels. Though the performance of different concurrency control algorithms have been explored extensively for centralized multilevel secure database management systems but to the best of author's knowledge the relative performance of transactions at different security levels using different secure concurrency control algorithm for MLS/DDBMS has not been reported yet. To fill this gap, this paper presents a detailed simulation model of a distributed database system and investigates the performance price paid for maintaining security with concurrency control in a distributed database system. The paper investigates the relative performance of transactions at different security levels.
A Survey on Data Compression in Wireless Sensor Networks
Authors: Naoto Kimura, Shahram Latifi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Wireless sensor networks (WSNs) are resource constraint: limited power supply, bandwidth for communication, processing speed, and memory space. One possible way of achieve maximum utilization of those resource is applying data compression on sensor data. Usually, processing data consumes much less power than transmitting data in wireless medium, so it is effective to apply data compression before transmitting data for reducing total power consumption by a sensor node. However, existing compression algorithms are not applicable for sensor nodes because of their limited resource. Therefore, some of compression algorithms, which have been specifically designed for WSNs, are presented in this paper: Coding by Ordering, Pipelined In-Network Compression, low-complexity video compression, and Distributed Compression.
Frequency&ndash;voltage cooperative CPU power control: A design rule and its application by feedback prediction
Authors: Keisuke Toyama, Satoshi Misaka, Kazuo Aisaka, Toshiyuki Aritsuka, Kunio Uchiyama, Koichiro Ishibashi, Hiroshi Kawaguchi, Takayasu Sakurai
Venue: Systems and Computers in Japan (2005)

Frequency&ndash;voltage cooperative power control (FVC) is a powerful method to reduce the CPU power consumption of a program during execution, because it utilizes the information on the software workload dynamically. In this paper, we first show through a mathematical analysis the design rule to determine the necessary frequencies and its effect. Then we show experimental results of implementing an FVC with a feedback algorithm on MPEG-4 video and MP3 audio decoders with two sets of frequency and voltage. The FVC gave a 72&percnt; reduction in CPU power consumption during execution. In addition, we show a &ldquo;Cool-Start&rdquo; method that begins the FVC at a lower frequency and improves the power reduction effect. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 39&ndash;48, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20263
Beyond the C++ Standard Library
Authors: Björn Karlsson
Venue:  (2005)

Introducing the Boost libraries: the next breakthrough in C++ programmingBoost takes you far beyond the C++ Standard Library, making C++ programming more elegant, robust, and productive. Now, for the first time, a leading Boost expert systematically introduces the broad set of Boost libraries and teaches best practices for their use.Writing for intermediate-to-advanced C++ developers, Björn Karlsson briefly outlines all 58 Boost libraries, and then presents comprehensive coverage of 12 libraries you're likely to find especially useful. Karlsson's topics range from smart pointers and conversions to containers and data structures, explaining exactly how using each library can improve your code. He offers detailed coverage of higher-order function objects that enable you to write code that is more concise, expressive, and readable. He even takes you "behind the scenes" with Boost, revealing tools and techniques for creating your own generic libraries.Coverage includes Smart pointers that provide automatic lifetime management of objects and simplify resource sharing Consistent, best-practice solutions for performing type conversions and lexical conversions Utility classes that make programming simpler and clearer Flexible container libraries that solve common problems not covered by the C++ Standard Library Powerful support for regular expressions with Boost.Regex Function objects defined at the call site with Boost.Bind and Boost.Lambda More flexible callbacks with Boost.Function Managed signals and slots (a.k.a. the Observer pattern) with Boost.SignalsThe Boost libraries are proving so useful that many of them are planned for inclusion in the next version of the C++ Standard Library. Get your head start now, with Beyond the C++ Standard Library.© Copyright Pearson Education. All rights reserved.
Comparison results for solving preconditioned linear systems
Authors: Wen Li
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper we present some comparison theorems between two different modified Gauss-Seidel (MGS) methods. The second preconditioning based on the first preconditioning is also discussed in this paper.
Geoinformation modeling of wind-induced surges on the northern-eastern Caspian Sea
Authors: B. B. Ismailova
Venue: Mathematics and Computers in Simulation (2004)

Shallow north part of the Caspian Sea is part of the most important region of the Caspian Sea. The Northeast part. especially its coastal zone, is unexplored areas of the Caspian Sea. In last years the north part of the Caspian Sea became one of the main sources of pollution of the whole sea. For this reason it is necessary to investigate wind-induced level variations of water at northeast coast of Caspian sea and to reveal ecological damage.The role of mathematical modeling rather increases on the background of the shorted data because it allows numerical experiments in areas, there is not enough or at all not covered the measure data with significant expenditures.To solve the task there has been used the system equation theory of sallow water. Using this method has allowed to study storms of fluctuation in areas, where are absent measurements to simulate catastrophic storms of a situation and to determinate of zones of possible flooding of coast with various marks of a background sea level to make a real and forecast maps of flooding, and also to definite to region of the zones of flooding and maximal marks storm surges.
The CodeSurfer Software Understanding Platform
Authors: Paul Anderson, Mark Zarins
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

CodeSurfer is a tool that provides a wide range of program understanding capabilities by exposing the results of a static-semantic analysis to the user in novel and interesting ways. The tool performs a number of whole-program analyses, including pointer analysis, and creates a system dependence graph for the program. The user can browse these dependences through the GUI in a manner akin to surfing the web. An open architecture fosters the development of plugins that can extend the basic functionality. These include tools for reasoning about the paths through the program, and for software assurance.
Secure OLSR
Authors: Fan Hong, Liang Hong, Cai Fu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Mobile Ad hoc Networks (MANET) is a new networking paradigm for wireless hosts. Because of infrastructureless, self-organization, dynamic topology and openness of wireless links, the routing security problem in MANET is more seriously than in wired networks. Optimized Link State Routing (OLSR)[1] is proposed by IETF's MANET Group at 2003. In OLSR, neighbor detection is not invulnerable when two bad nodes perform wormhole attack. Further more, OLSRýs security cannot simply rely on IPSec, because OLSR's packets are often broadcasted and IPsec provides end-to-end security. In this paper, we propose a solution to secure OLSR, which apply the wormhole detective mechanism and authentication to strengthen the neighbor relationship establishment, and use hash-chain and digital signature to protect the routing packets.