ppxscal/embedding_network huggingface dataset:
FLUX interconnection networks on demand
Authors: Stamatis Vassiliadis, Ioannis Sourdis
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2007)

In this paper, we introduce the FLUX interconnection networks, a scheme where the interconnections of a parallel system are established on demand before or during program execution. We present a programming paradigm which can be utilized to make the proposed solution feasible. We perform several experiments to show the viability of our approach and the potential performance gain of using the most suitable network configuration for a given parallel program. We experiment on several case studies, evaluate different algorithms, developed for meshes or trees, and map them on ''grid''-like or reconfigurable physical interconnection networks. Our results clearly show that, based on the underlying network, different mappings are suitable for different algorithms. Even for a single algorithm different mappings are more appropriate, when the processing data size, the number of utilized nodes or the hardware cost of the processing elements changes. The implication of the above is that changing interconnection topologies/mappings (dynamically) on demand depending on the program needs can be beneficial.
Balanced Graph Partitioning
Authors: Konstantin Andreev, Harald Racke
Venue: Theory of Computing Systems (2006)

We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In particular we require that for a parameter &#x03bd; &#x2265; 1, no component contains more than &#x03bd; &#x00b7; n/k of the graph vertices.For k = 2 and &#x03bd; = 1 this problem is equivalent to the well-known Minimum Bisection problem for which an approximation algorithm with a polylogarithmic approximation guarantee has been presented in [FK]. For arbitrary k and &#x03bd; &#x2265; 2 a bicriteria approximation ratio of O(log n) was obtained by Even et al. [ENRS1] using the spreading metrics technique.We present a bicriteria approximation algorithm that for any constant &#x03bd; > 1 runs in polynomial time and guarantees an approximation ratio of O(log1.5n) (for a precise statement of the main result see Theorem 6). For &#x03bd; = 1 and k &#x2265; 3 we show that no polynomial time approximation algorithm can guarantee a finite approximation ratio unless P = NP.
Microsoft SQL Server(TM) 2005 Analysis Services Step by Step (Step by Step (Microsoft))
Authors: Reed Jacobson, Stacia Misner
Venue:  (2006)

Your hands-on, practical guide to Microsoft® SQL Server™ 2005 Analysis Services. Get started using Business Intelligence tools that simplify data analysis and with this popular, learn-by-doing tutorial. Includes data sets and sample code on CD.
An extended self-organizing map network for market segmentation: a telecommunication example
Authors: Melody Y. Kiang, Michael Y. Hu, Dorothy M. Fisher
Venue: Decision Support Systems (2006)

Kohonen's self-organizing map (SOM) network is an unsupervised learning neural network that maps an n-dimensional input data to a lower dimensional output map while maintaining the original topological relations. The extended SOM network further groups the nodes on the output map into a user specified number of clusters. In this research effort, we applied this extended version of SOM networks to a consumer data set from American Telephone and Telegraph Company (AT&T). Results using the AT&T data indicate that the extended SOM network performs better than the two-step procedure that combines factor analysis and K-means cluster analysis in uncovering market segments.
Comparative implementation of two fusion schemes for multiple complementary FLIR imagery classifiers
Authors: Pierre Valin, Francois Rhéaume, Claude Tremblay, Dominic Grenier, Anne-Laure Jousselme, íloi Bossé
Venue: Information Fusion (2006)

Several classifiers for forward looking infra-red imagery are designed and implemented, and their relative performance is benchmarked on 2545 images belonging to 8 different ship classes, from which 11 attributes are extracted. These are a Bayes classifier, a Dempster-Shafer classifier ensemble in which specialized classifiers are optimized to return a single ship class, a k-nearest neighbor classifier, and an optimized neural net classifier. Two different methods are then studied to fuse the results of selected subsets of these classifiers. The first method consists of using the outputs of various classifiers as inputs to a second neural net fuser. The second method consists of converting the outputs of these classifiers into masses for use in a Dempster-Shafer fuser. In both approaches, the fused classifier achieves better results than the best classifier for any given class.
Windows XP Annoyances for Geeks, 2nd Edition
Authors: David A. Karp
Venue:  (2004)

Offering dozens of on-target tips, workarounds, and warnings, Windows XP Annoyances for Geeks allows users to improve their overall experience with the popular XP operating system. And now, with this updated edition, users can also expect detailed coverage of the newly released Service Pack 2 (SP2) technology, which provides protection against viruses, hacker, and worms. It's the ultimate resource for the ever-expanding Windows XP market.
iPhoto 6 for Mac OS X (Visual QuickStart Guide)
Authors: Adam C. Engst
Venue:  (2006)

Need to learn iPhoto 6 fast? Try a Visual QuickStart! This best-selling reference's visual format and step-by-step, task-based instructions will have you up and running with this great iLife 06 application in no time. Best-selling author and instructor Adam Engst uses crystal-clear instructions, full-color illustrations, and friendly prose to introduce you to everything from importing, tagging, editing, and perfecting images to creating slideshows and photo albums to easy online Web publishing. You'll also learn about everything new in iPhoto 6, including enhanced editing and special effects, calendars and cards, photocasting, and more!
Designing Network Security, Second Edition
Authors: Merike Kaeo
Venue:  (2003)

A practical guide to creating a secure network infrastructure Understand basic cryptography and security technologies Identify the threats and common attacks to a network infrastructure Learn how to create a security policy Find out how to recover from a security breach Study specific implementation scenarios for securing your network environment Learn about advances in security technologiesDesigning Network Security, Second Edition, is a practical guide designed to help you understand the fundamentals of securing your corporate network infrastructure. This book takes a comprehensive look at underlying security technologies, the process of creating a security policy, and the practical requirements necessary to implement a corporate security policy.You will gain a thorough understanding of basic cryptography, the most widely deployed security technologies, and key emerging security technologies. You will be able to guide the architecture and implementation of a security policy for a corporate environment by knowing possible threats and vulnerabilities and understanding the steps required to perform a risk management assessment. Through the use of specific configuration examples, you will learn about the features required in network infrastructure equipment to implement the given security policy, including securing the internal corporate infrastructure, Internet access, and the remote access environment.This new edition includes coverage of new security features including SSH on routers, switches, and the PIX(r) Firewall; enhancements to L2TP and IPSec; Cisco(r) LEAP for wireless networks; digital certificates; advanced AAA functionality; and Cisco Intrusion Detection System features and products. Additional practical examples include current security trends using VPN, wireless, and VoIP networking examples.This book is part of the Networking Technology Series from Cisco Press(r), which offers networking professionals valuable information for constructing efficient networks, understanding new technologies, and building successful careers.
Talk Is Cheap: Switching to Internet Telephones
Authors: James E. Gaskin
Venue:  (2005)

Fed up with the high tolls charged by your ordinary telephone service? If you're itching to cut the copper cord with your costly, traditional phone service, you need Talk is Cheap, the new, easy-to-understand guide to understanding and using Voice over Internet Protocol (VoIP) and other Internet telephone options. Technologies such as VoIP are gaining a great deal of attention these days as more people switch from standard telephone service to phone service via the Internet. But while the cost savings are outstanding, there are some issues with Internet telephony that you should know about. Are the connections reliable? Is the quality comparable? Will it include 911 services? James Gaskin's Talk is Cheap addresses these issues and many more by explaining how to make the switch and what the tradeoffs will be if you opt for Internet telephony over traditional phone services. Talk is Cheap focuses on the increasingly popular services from Vonage, which uses VoIP, and Skype--a free service that operates as a peer-to-peer (P2P) network with the ability to turn any PC, Mac, or Pocket PC into a telephone. The book explains your options; explores the background behind, the workings of, and differences between VoIP and P2P networks; and discusses the advantages and drawbacks of both technologies (including service offerings, quality, capabilities, completion rates, and more). Talk is Cheap then goes into detail on what you can expect in Internet service from traditional phone companies such as Verizon and AT&T. In addition, you will learn more advanced techniques, including how to turn your Palm or Pocket PC into an Internet phone and how to work with Wi-Fi phones and videophones. A straightforward, quick introduction to the ins and outs of using Internet telephone services, this book provides everything you need to make informed telephone decisions--whether you're thinking about the switch from traditional phone service or have already made it and want to get the most out of your new Internet telephone.
A robust method for detecting facial orientation in infrared images
Authors: Shiqian Wu, Lijun Jiang, Shoulie Xie, Allen C. B. Yeo
Venue: Pattern Recognition (2006)

This paper studies the problem of determining facial orientation without correspondences in distortion-related infrared images. To improve estimation accuracy and reduce sensitivity to noise and unavoidable error, a simple and robust method based on the single linkage clustering is proposed to simultaneously detect inlier set and estimate orientation angle under contaminated data. An iterative strategy is adopted to avoid random choice of link distance in the single linkage clustering. The experimental results indicate that the proposed method is substantially superior to the moment method. This method can also be extended to detect arbitrary objects with mirror symmetrical or nearly symmetrical property.
C Primer Plus (5th Edition)
Authors: Stephen Prata
Venue:  (2004)

The new classic! C Primer Plus, now in its 5th edition, has been revised to include over 20 new programming exercises, newly improved examples and the new ANSI/ISO standard, C99. Task-oriented examples will teach you the fundamentals of C programming. From extended integer types and compound literals to Boolean support and variable-length arrays, you will learn to create practical and real-world applications with C programming. Review questions and programming exercises at the end of each chapter will reinforce what you have learned. This friendly and easy-to-use self-study guide will help you understand the fundamentals of this core programming language. 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
Special Edition Using Microsoft Windows XP Home (3rd Edition) (Special Edition Using)
Authors: Robert Cowart, Brian Knittel
Venue:  (2004)

The only Windows XP Home book readers need! Windows 95/98/Me users rejoice! Finally, the stability of Windows NT/2000 in an operating system built for the home and small business user - Windows XP has answered many prayers. Don't be fooled, however. If you think there was a lot to learn when the world jumped from DOS to Windows 95, then you're really in for it if you make the leap from 9x/Me to XP unprepared. Let this proven bestseller be your guide. This edition covers all of the updates to Windows XP since it was released, including Service Packs 1 and 2, and Reloaded.
Computer organization for allowing dynamic user microprogramming
Authors: Richard T. Thomas
Venue: ACM SIGMICRO Newsletter (1973)

The concept of allowing the computer user to modify the virtual machine being emulated by a microprogram controlled computer is not new. Schemes for implementing this typically include the definition of a standard virtual machine (the <u>base machine</u>) in read-only control storage, and the provision of some writable memory to contain user-written microroutines for the duration of the user job. Alternation of a computer instruction set by the temporary addition of microroutines to the system repertoire for emulation of new instructions is known as <u>dynamic user microprogramming</u>.
Constraint-based geolocation of internet hosts
Authors: Bamba Gueye, Artur Ziviani, Mark Crovella, Serge Fdida
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Geolocation of Internet hosts enables a new class of location-aware applications. Previous measurement-based approaches use reference hosts, called landmarks, with a well-known geographic location to provide the location estimation of a target host. This leads to a discrete space of answers, limiting the number of possible location estimates to the number of adopted landmarks. In contrast, we propose Constraint-Based Geolocation (CBG), which infers the geographic location of Internet hosts using multilateration with distance constraints to establish a continuous space of answers instead of a discrete one. However, to use multilateration in the Internet, the geographic distances from the landmarks to the target host have to be estimated based on delay measurements between these hosts. This is a challenging problem because the relationship between network delay and geographic distance in the Internet is perturbed by many factors, including queueing delays and the absence of great-circle paths between hosts. CBG accurately transforms delay measurements to geographic distance constraints, and then uses multilateration to infer the geolocation of the target host. Our experimental results show that CBG outperforms previous geolocation techniques. Moreover, in contrast to previous approaches, our method is able to assign a confidence region to each given location estimate. This allows a location-aware application to assess whether the location estimate is sufficiently accurate for its needs.
Manage Your Money and Investments with Microsoft Excel
Authors: Peter Aitken
Venue:  (2005)

Sure you want to save money. We all do. But saving money is sometimes easier said than done. Did you know that there is a program probably already installed on your computer that can help you manage your money better? It's Microsoft Excel, part of the Microsoft Office suite. Manage Your Money and Investments with Excel can help you take control of your finances with Excel. Learn how to: Perform basic financial calculations. Track and analyze investments. Compare mutual fund options. Manage mortgages, loans, and escrow accounts. Balance checking accounts and manage credit card debt. Track your net worth.The CD-ROM includes free template spreadsheets for Excel. These easy-to-use, professionally designed spreadsheets will help you perform all these tasks and more. The formulas and charts are already included in each spreadsheet. All that you have to do is plug in your information. Discover new ways to make money-saving decisions and manage your finances with Manage Your Money and Investments with Excel.
Dynamic Assignment of Gaussian Components in Modelling Speech Spectra
Authors: Parham Zolfaghari, Hiroko Kato, Yasuhiro Minami, Atsushi Nakamura, Shigeru Katagiri, Roy Patterson
Venue: Journal of VLSI Signal Processing Systems (2006)

In this paper, we describe a parametric mixture model for modelling the resonant characteristics of the vocal tract where Gaussian distributions are used to model spectral frequency regions. A mixtures of Gaussian (MoG) based parametrisation scheme is used for modelling a smoothed representation of the spectra. This smoothing procedure removes all signal periodicity from the spectra allowing highly natural analysis, manipulation and synthesis of speech. The goal of this parametrisation scheme is to ease the correspondence between the resonant characteristics of the vocal tract and the parametric distributions and modelling the spectrum with an appropriate number of parameters. Previously, a maximum likelihood (ML) approach to this parametrisation scheme was introduced. However, this approach has inherent local optima problems. Noting that, a relatively small class of Gaussian densities can approximate a large class of distributions, we propose a new scheme whereby starting with a large number of distributions in the mixture, we systematically reduce their number and re-approximate the densities in the mixture based on a distance criterion. The Kullback-Leibler (KL) distance was found to allow optimal MoG solutions to the spectra. Furthermore, a fitness measure based on KL information is used to provide a figure for estimating the model order in representing formant-like features. The proposed model is subjectively evaluated and is shown to reduce the number of Gaussian with an appreciable loss in the quality of the re-synthesised speech.
Executable biology
Authors: Jasmin Fisher, Thomas A. Henzinger
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Computational modeling of biological systems is becoming increasingly common as scientists attempt to understand biological phenomena in their full complexity. Here we distinguish between two types of biological models --- mathematical and computational--- according to their different representations of biological phenomena and their diverse potential. We call the approach of constructing computational models of biological systems Executable Biology, as it focuses on the design of executable computer algorithms that mimic biological phenomena. We give an overview of the main modeling efforts in this direction, and discuss some of the new challenges that executable biology poses for computer science and biology. We argue that for executable biology to reach its full potential as a mainstream biological technique, formal and algorithmic approaches must be integrated into biological research, driving biology towards a more precise engineering discipline.
Tribe: a simple virtual class calculus
Authors: Dave Clarke, Sophia Drossopoulou, James Noble, Tobias Wrigstad
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presence of mutually dependent classes. This paper presents Tribe, a type system which generalises and simplifies other formalisms of such mechanisms, by treating issues which are inessential for soundness, such as the precise details of dispatch and field initialisation, as orthogonal to the core formalism. Tribe can support path types dependent simultaneously on both classes and objects, which is useful for writing library code, and ubiquitous access to an object's family, which offers family polymorphism without the need to drag around family arguments. Languages based on Tribe will be both simpler and more expressive than existing designs, while having a simpler type system, serving as a useful basis for future language designs.
A halfbaked idea about a set of register transfer primitives: (part 1)
Authors: Reiner W. Hartenstein
Venue: ACM SIGMICRO Newsletter (1973)

In vol. 1, No. 1 of SIGMICRO newsletter a message from the editor (Harold W.Lawson jr.) says"...If you have a subject area in which you would care to expound, or just try a halfbaked idea out for size, send a copy in, it doesn't have to be the polished (?) paper seen in a Spring or Fall Joint Conference ...". Just such a halfbaked idea I am going to present in the following sheets and I would be happy to get critical feedback from the readers of this "not polished" paper. About some details I feel, that they are new. But if you, dear attentive reader, know more about it, than it would be nice of you, to drop a line for me.
PTK: A novel depth buffer-based shape descriptor for three-dimensional object retrieval
Authors: Geogios Passalis, Theoharis Theoharis, Ioannis A. Kakadiaris
Venue: The Visual Computer: International Journal of Computer Graphics (2006)

The increase in availability and use of digital three-dimensional (3D) synthetic or scanned objects, makes the availability of basic database operations, such as retrieval, necessary. Retrieval methods are based on the extraction of a compact shape descriptor; the challenge is to design a shape descriptor that describes the original object in sufficient detail to make accurate 3D object retrieval possible. Building on previous work, this paper proposes a novel depth buffer-based shape descriptor (called PTK) that encompasses symmetry, eigenvalue-related weighting and an object thickness related measure to provide an accuracy surpassing previous state-of-the-art methods. An evaluation of the novel method&#x2019;s parameters and a direct comparison to other approaches are carried out using publicly available and widely used databases.