ppxscal/embedding_network huggingface dataset:
Next generation data centers: trends and implications
Authors: Rich Friedrich, Jerome Rolia
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

In this talk we will discuss next generation data centers and the important impact they will have upon enterprise applications. Specifically, we will discuss the technical and economical trends motivating the move towards large scale distributed data centers consisting of tens of thousands of servers and hundreds of petabytes of storage. We will explain the roles and advantages of virtual machines and other virtualization technologies in these environments and also explore how they exacerbate the complexity of management and achieving predictable application behavior.To better illustrate issues emerging in such environments we will describe early experiments we conducted with a 1000-processor utility rendering service created for DreamWorks Animation that was used to render the films Shrek II and Madagascar. We will discuss the lessons learned from this experience.Next, we consider the trend towards service oriented architectures for enterprise application platforms. Service orientation provides for more flexible and agile information technology systems but further increases the complexity of management and behavior. We will explore the implications of composing services dynamically using an SOA approach.These trends for enterprise application platforms and the trends towards next generation data centers have helped to drive our current research agenda. Our goal is to enable the flexibility and agility offered by these new technologies while enabling cost effective management, predictable behavior and improved quality of service. We will give an overview of our research on model driven design for enterprise application infrastructure, automated deployment, and operations of distributed application services executing in a virtualized, shared resource pool within these next generation data centers.Finally, we will summarize the implications, challenges, and opportunities posed by these trends on academic and industrial research. In particular, we consider the impact on software performance and software performance engineering and pose important unanswered questions.
Power-efficient prefetching for embedded processors
Authors: Xiaotong Zhuang, Santosh Pande
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

Because of stringent power constraints, aggressive latency-hiding approaches, such as prefetching, are absent in the state-of-the-art embedded processors. There are two main reasons that make prefetching power inefficient. First, compiler-inserted prefetch instructions increase code size and, therefore, could increase I-cache power. Second, inaccurate prefetching (especially for hardware prefetching) leads to high D-cache power consumption because of useless accesses. In this work, we show that it is possible to support power-efficient prefetching through bit-differential offset assignment. We target the prefetching of relocatable stack variables with a high degree of precision. By assigning the offsets of stack variables in such a way that most consecutive addresses differ by 1 bit, we can prefetch them with compact prefetch instructions to save I-cache power. The compiler first generates an access graph of consecutive memory references and then attempts a layout of the memory locations in the smallest hypercube. Each dimension of the hypercube represents a 1-bit differential addressing. The embedding is carried out in as compact a hypercube as possible in order to save memory space. Each load/store instruction carries a hint regarding prefetching the next memory reference by encoding its differential address with respect to the current one. To reduce D-cache power cost, we further attempt to assign offsets so that most of the consecutive accesses map to the same cache line. Our prefetching is done using a one entry line buffer [Wilson et al. 1996]. Consequently, many look-ups in D-cache reduce to incremental ones. This results in D-cache activity reduction and power savings. Our prefetcher requires both compiler and hardware support. In this paper, we provide implementation on the processor model close to ARM with small modification to the ISA. We tackle issues such as out-of-order commit, predication, and speculation through simple modifications to the processor pipeline on noncritical paths. Our goal in this work is to boost performance while maintaining/lowering power consumption. Our results show 12&percnt; speedup and slight power reduction. The runtime virtual space loss for stack and static data is about 11.8&percnt;.
Multi-scale integrated information and telecommunications system (MIITS): first results from a large-scale end-to-end network simulator
Authors: Roman Waupotitsch, Stephan Eidenbenz, James P. Smith, Lukas Kroc
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Performing realistic simulations of Internet packet traffic on a national or global level is a daunting task from both the modeling and the computational perspective. We present the MIITS (Multi-scale Integrated Information and Telecommunications System) tool that implements a novel approach to network simulation and report first scaling results from a realistic Internet scenario. MIITS' end-to-end approach to network simulation relies on modules for (i) accurate network topology and capacity representation, (ii) realistic communication session generation based on the activities of an agent population that is statistically equivalent to the population in a large metropolitan area, (iii) the actual scalable packet-level network simulation that is based on distributed event-driven technology, and (iv) analysis of large amounts of simulation output data. We present a sample simulation of a Los Angeles network as an intermediate step toward the vision of national-level simulation.
The rate of convergence for the cyclic projections algorithm I: angles between convex sets
Authors: Frank Deutsch, Hein Hundal
Venue: Journal of Approximation Theory (2006)

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the "convex feasibility" problem. We study the rate of convergence for the cyclic projections algorithm. The notion of angle between convex sets is defined, which generalizes the angle between linear subspaces. The rate of convergence results are described in terms of these angles.
Multiscale directional filter bank with applications to structured and random texture retrieval
Authors: K. -O. Cheng, N. -F. Law, W. -C. Siu
Venue: Pattern Recognition (2007)

In this paper, multiscale directional filter bank (MDFB) is investigated for texture characterization and retrieval. First, the problem of aliasing in decimated bandpass images on directional decomposition is addressed. MDFB is then designed to suppress the aliasing effect as well as to minimize the reduction in frequency resolution. Second, an entropy-based measure on energy signatures is proposed to classify structured and random textures. With the use of this measure for texture pre-classification, an optimized retrieval performance can be achieved by selecting the MDFB-based method for retrieving structured textures and a statistical or model-based method for retrieving random textures. In addition, a feature reduction scheme and a rotation-invariant conversion method are developed. The former is developed so as to find the most representative features while the latter is developed to provide a set of rotation-invariant features for texture characterization. Experimental works confirm that they are effective for texture retrieval.
Adaptive query processing: dealing with incomplete and uncertain statistics
Authors: David J. Dewitt
Venue:  (2006)

The standard Database Management Systems (DBMS) query processing model picks a single non-adaptive plan and executes it to completion. The chosen plan aims to minimize running time by carefully optimizing the use of secondary storage, memory, and CPU. DBMS optimizers estimate plan costs by using statistics---information describing the datasets, the queries, and the system. When statistics needed to cost plans are not available in the database catalog, the optimizer estimates them by using heuristics, by assuming that some data distributions are uniform or independent, and by using a combination of other possibly estimated statistics or default values. These estimates may contain errors and these errors grow exponentially with the number of estimated statistics derived from other estimated statistics. This may lead to selecting a query plan that is sub-optimal by several orders of magnitude. Having more information in the catalog (e.g., histograms) reduces the problem but does not scale with the number of relations and attributes in the database. In addition, several hardware and software trends are making this hard problem harder. For example, the optimization space is increasing exponentially because there are more operators to consider, larger datasets to manage, and more complex queries to optimize. Thus, optimizers are increasingly more likely to select sub-optimal plans.In the general case, DBMS optimizers may have insufficient information to choose a single, good, non-adaptive query plan. Instead of focusing on providing more information to the optimizer, we propose several Adaptive Query Processing (AQP) techniques as alternatives or extensions to the non-adaptive architecture employed by today's commercial database systems. Our proposals are targeted to: (i) correct or avoid query processing problems due to the use of incorrect and partial information at optimization time and (ii) collect information not available at optimization time and dynamically determine and assign different plans for different subsets of the data. The work presented here complements, extends, or supersedes previous AQP proposals.
Semantic Modeling of Natural Scenes for Content-Based Image Retrieval
Authors: Julia Vogel, Bernt Schiele
Venue: International Journal of Computer Vision (2007)

In this paper, we present a novel image representation that renders it possible to access natural scenes by local semantic description. Our work is motivated by the continuing effort in content-based image retrieval to extract and to model the semantic content of images. The basic idea of the semantic modeling is to classify local image regions into semantic concept classes such as water, rocks, or foliage. Images are represented through the frequency of occurrence of these local concepts. Through extensive experiments, we demonstrate that the image representation is well suited for modeling the semantic content of heterogenous scene categories, and thus for categorization and retrieval.The image representation also allows us to rank natural scenes according to their semantic similarity relative to certain scene categories. Based on human ranking data, we learn a perceptually plausible distance measure that leads to a high correlation between the human and the automatically obtained typicality ranking. This result is especially valuable for content-based image retrieval where the goal is to present retrieval results in descending semantic similarity from the query.
Diagnosis of heart disease using artificial immune recognition system and fuzzy weighted pre-processing
Authors: Kemal Polat, Salih Güneş, Sülayman Tosun
Venue: Pattern Recognition (2006)

This paper presents a novel method for diagnosis of heart disease. The proposed method is based on a hybrid method that uses fuzzy weighted pre-processing and artificial immune recognition system (AIRS). Artificial immune recognition system has showed an effective performance on several problems such as machine learning benchmark problems and medical classification problems like breast cancer, diabetes, liver disorders classification. The robustness of the proposed method is examined using classification accuracy, k-fold cross-validation method and confusion matrix. The obtained classification accuracy is 96.30% and it is very promising compared to the previously reported classification techniques.
Review of "Reviews Vision, by David Marr" San Franclsco: WH Freeman, 1982
Authors: Donald M. Craig
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1983)

David Marr's <u>Vision</u> is jammed with information about what it means to see, both technically and philosophically; it lucidly reports the last ten years of research into the human visual system from the multi-disciplinary perspective of Marr and his colleagues. Workers in human vision tended to have either a neuro-physiological background (as Marr had), or a psychophysical one. In the early seventies Marr reached the conclusion that such disciplines helped to describe rather than explain the behaviour of neural cells or of subjects. He moved to the MIT artificial intelligence lab in 1973, in the hope that, by trying to build an artificial vision system, the fundamental engineering reasons for the structure of the human visual system could be discovered. 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
Integration of GIS, GPS, and optimization technologies for the effective control of parcel delivery service
Authors: Hoon Jung, Keumwoo Lee, Wookwan Chun
Venue: Computers and Industrial Engineering (2006)

An intelligent monitoring and control system for parcel delivery service is described in this paper. To manage pick-up and delivery operations more effectively, geographical information system (GIS), global positioning system (GPS), and wireless communication technologies are applied to the system which consists of three subsystems, pick-up and delivery sequence planning system, pick-up and delivery monitoring system, and PDA execution system. Pick-up and delivery sequence planning system generates routes and schedules for pick-up and delivery using GIS and optimization techniques. Pick-up and delivery monitoring system monitors current positions of vehicles and actual pick-up and delivery results as compared with planned sequences, routes and visit times, while PDA execution system transmits information for vehicles positions and actual pick-up and delivery results using GPS and wireless communication technologies. The intelligent monitoring and control system is currently being used for the pick-up service in a local post office of Korea Post.
Compactly supported functions generated by a polyharmonic operator
Authors: V. M. Kolodyazhny
Venue: Cybernetics and Systems Analysis (2006)

Atomic functions of two and three variables are proposed that are infinitely differentiable compactly supported solutions of functional-differential equations of a special type. Existence theorems and computational procedures are presented for these functions.
Microsoft® Office SharePoint® Server 2007: A Beginner's Guide, 1 edition
Authors: Ron Gilster
Venue:  (2007)

Set up and administer a SharePoint Server 2007 environmentGet started on Microsoft Office SharePoint Server 2007 quickly and easily with help from this step-by-step guide. Using clear instructions, Microsoft Office SharePoint Server 2007: A Beginner's Guide shows you how to set up and configure SharePoint Server, collect and store data, build lists and libraries, and enable enterprise search capabilities. You'll learn how to create portals and Web pages, secure your SharePoint Server 2007 environment, and optimize performance. Microsoft Office 2007 integration techniques are also covered. Install and configure SharePoint Server 2007Secure your SharePoint Server network and dataEasily locate files and folders using the Search featureSimplify data collection using forms and workflowsLogically organize content into lists and librariesMonitor, maintain, and back up your SharePoint Server environmentBuild Web applications and portals from reusable, modular Web PartsImprove efficiency using customized views and metadata schemesSeamlessly integrate with Microsoft Office Outlook 2007Table of contentsPART 1: GETTING STARTEDChapter 1: An Overview of Microsoft Office SharePoint Server 2007Chapter 2: Plan and Configure a MOSS ImplementationChapter 3: MOSS PreinstallationChapter 4: MOSS InstallationChapter 5: Post-Installation ConfigurationPART 2: MOSS ADMINISTRATIONChapter 6: MOSS AdministrationChapter 7: MOSS SecurityChapter 8: MOSS SearchChapter 9: MOSS Document and Record ManagementChapter 10: WorkflowsChapter 11: SharePoint LibrariesChapter 12: SharePoint ListsChapter 13: Monitor MOSS PerformanceChapter 14: MOSS MaintenanceChapter 15: Web PartsChapter 16: SharePoint Views and MetadataPART 3: MOSS AND OFFICE 2007Chapter 17: MOSS and Outlook 2007Chapter 18: MOSS and Word 2007Chapter 19: MOSS and Excel 2007Chapter 20: MOSS and Access 2007Chapter 21: MOSS and Business IntelligenceChapter 22: MOSS and XMLIndex 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
Framework specialization aspects
Authors: André L. Santos, Antónia Lopes, Kai Koskimies
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

Object-oriented frameworks play an important role in different kinds of software, such as product-lines, middleware, GUI components, IDEs, etc. Over the past recent years, fundamentals of framework design stabilized around the adoption of design patterns. However, major difficulties concerning framework learning and usage are still evident, and constitute a burden for those who have to deal with it. This paper proposes an approach that aims to facilitate framework usage, based on the concept of specialization aspect. We show how framework hot-spots can be modularized in terms of specialization aspects, and how these can give support for specializing a framework in a step-wise way. The approach is conservative, in the sense that specialization aspects can be developed for an existing framework "as is". In order to support these claims, a case study has been carried out by applying the technique on the JHotDraw graphical framework.
A commentary on the "New Approach to LP"
Authors: William W. White
Venue: Issue 16 (April 1974) (1974)

Probably the most eventful occurrence at the recent Mathematical Programming Symposium at Stanford was Dr. Hugo Scolnik's presentation of his New Approach to Linear Programming. This approach rapidly became the subject of much discussion, and a somewhat hastily written version (and later an addendum) of the presentation was distributed in response to the general clamor (this material was reproduced in the last issue of this Newsletter). By the end of the symposium the odds seemed to have shifted to the viewpoint that Scolnik may indeed have a major new result.
Kinematic dynamos using constrained transport with high order Godunov schemes and adaptive mesh refinement
Authors: Romain Teyssier, Sébastien Fromang, Emmanuel Dormy
Venue: Journal of Computational Physics (2006)

We propose to extend the well-known MUSCL-Hancock scheme for Euler equations to the induction equation modeling the magnetic field evolution in kinematic dynamo problems. The scheme is based on an integral form of the underlying conservation law which, in our formulation, results in a "finite-surface" scheme for the induction equation. This naturally leads to the well-known "constrained transport" method, with additional continuity requirement on the magnetic field representation. The second ingredient in the MUSCL scheme is the predictor step that ensures second order accuracy both in space and time. We explore specific constraints that the mathematical properties of the induction equations place on this predictor step, showing that three possible variants can be considered. We show that the most aggressive formulations (referred to as C-MUSCL and U-MUSCL) reach the same level of accuracy as the other one (referred to as Runge-Kutta), at a lower computational cost. More interestingly, these two schemes are compatible with the adaptive mesh refinement (AMR) framework. It has been implemented in the AMR code RAMSES. It offers a novel and efficient implementation of a second order scheme for the induction equation. We have tested it by solving two kinematic dynamo problems in the low diffusion limit. The construction of this scheme for the induction equation constitutes a step towards solving the full MHD set of equations using an extension of our current methodology.
Approximation algorithms for facility location problems with a special class of subadditive cost functions
Authors: Adriana F. Gabor, Jan-Kees C. W. van Ommeren
Venue: Theoretical Computer Science (2006)

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1 + ε, 1)-reduction of the facility location problem with subadditive costs to the soft capacitated facility location problem, which implies the existence of a 2(1 + ε)-approximation algorithm. For a special subclass of subadditive functions, we obtain a 2-approximation algorithm by reduction to the linear cost facility location problem.
Data structures and algorithms for simplifying reversible circuits
Authors: Aditya K. Prasad, Vivek V. Shende, Igor L. Markov, John P. Hayes, Ketan N. Patel
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2006)

Reversible logic is motivated by low-power design, quantum circuits, and nanotechnology. We develop a compact representation of small reversible circuits to generate and store optimal circuits for all 40,320 three-input reversible functions, and millions of four-input circuits. This allows implementing a function optimally in constant time for use in the peephole optimization of larger circuits produced by existing techniques, and guarantees that every three-bit subcircuit is optimal. To generate subcircuits, we use a graph-based data structure and algorithms for circuit restructuring. Finally, we demonstrate a suboptimal circuit for which peephole optimization fails.