ppxscal/embedding_network huggingface dataset:
Enhancing computer graphics through machine learning: a survey
Authors: Jonathan Dinerstein, Parris K. Egbert, David Cline
Venue: The Visual Computer: International Journal of Computer Graphics (2006)

Machine learning has experienced explosive growth in the last few decades, achieving sufficient maturity to provide effective tools for sundry scientific and engineering fields. Machine learning provides a firm theoretical foundation upon which to build techniques that leverage existing data to extract interesting information or to synthesize more data.In this paper we survey the uses of machine learning methods and concepts in recent computer graphics techniques. Many graphics techniques are data-driven; however, few graphics papers explicitly leverage the machine learning literature to underpin, validate, and develop their proposed methods. This survey provides novel insights by casting many existing computer graphics techniques into a common learning framework. This not only illuminates how these techniques are related, but also reveals possible ways in which they may be improved. We also use our analysis to propose several directions for future work.
An evolution-based tabu search approach to codebook design
Authors: Shih-Ming Pan, Kuo-Sheng Cheng
Venue: Pattern Recognition (2007)

This paper presents an evolution-based tabu search approach (ETSA) to design codebooks with smaller distortion values in vector quantization. In the ETSA, there is no need for users to determine the size of a tabu memory and to specifically define a set of tabu restrictions and a set of aspiration criteria. During iterations, only the best solution visited is memorized as a tabu point in the search space and the distance from each trial solution to the tabu point is an important factor in the fitness evaluation. In population competition, the new fitness function plays the roles of the tabu restrictions and the aspiration criteria. Based on the new fitness function and a parallel evolutionary mechanism, the ETSA can prevent premature convergence and eventually find a good solution. Seven grayscale images are used to test the performance of the ETSA. Experimental results show that the ETSA performs better than several existing algorithms in terms of the distortion and robustness measures.
Halo 2 Hacks: Tips & Tools for Finishing the Fight
Authors: Stephen Cawood
Venue:  (2005)

Even if you've finished Halo 2 in Legendary Mode, you're not done with this game. Not by a long shot. You know there's a lot more you can squeeze out of Halo 2, and with the clever hacks we have in store, you'll turn the game into a whole new experience. Halo 2 Hacks is the creation of consummate gamer and Microsoft insider Stephen Cawood, an original member of the Halo 2 beta test team. He's got it all, whether you're into single or multiplayer games, a level 25 or above, or even a complete n00b. If you are a beginner, you may not yet appreciate that Halo 2 for Xbox is the biggest game to hit the galaxy. Ten million copies have already sold, including 2.4 million on the first day it hit the shelf. So you're in good company, even if you've never played its predecessor, Halo: Combat Evolved. Pick up this book and you'll be able to fully appreciate the Halo 2 universe.Halo 2 Hacks is packed with a horde of great hacks for weapons, levels, vehicles, game play and mods. You'll learn how to perform expert tricks, exploit glitches and find Halo 2 Easter Eggs - including the famous skulls. And discover all the nooks and crannies you didn't even suspect were there. Each hack has a thermometer icon to indicate its relative complexity, whether it's a beginner, moderate, or expert hack. Each one stands on its own, so you can either read the book from cover to cover, or jump around until you see a hack you want to try.This title was created with the help of numerous gamers from the Halo community. Whether it was a trick, a glitch or a mod, Cawood went straight to the source and gathered all of the necessary information to help you complete the hack. The mod section of the book features contributions from Grenadiac, MrMurder, Iron_Forge, GTJuggler, The Swamp Fox, and many more. Halo 2 Hacks also features a foreword by Ducain (the admin for HighImpactHalo.org), Louis Wu (the admin for Halo.Bungie.org) and Grenadiac (the admin for HaloMods.com).For all the brave souls who want to learn how to trick Halo 2 into running the hacks and mods of their choice, Halo 2 Hacks is a must read. Roughly half of this title is dedicated to creating your own Halo 2 mods. If you're a fan of tricking, glitching or modding, then this is the book for you. But only for gamers who think they're worthy of the distinction. 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
Solving the small sample size problem in face recognition using generalized discriminant analysis
Authors: Peg Howland, Jianlin Wang, Haesun Park
Venue: Pattern Recognition (2006)

The goal of face recognition is to distinguish persons via their facial images. Each person's images form a cluster, and a new image is recognized by assigning it to the correct cluster. Since the images are very high-dimensional, it is necessary to reduce their dimension. Linear discriminant analysis (LDA) has been shown to be effective at dimension reduction while preserving the cluster structure of the data. It is classically defined as an optimization problem involving covariance matrices that represent the scatter within and between clusters. The requirement that one of these matrices be nonsingular restricts its application to datasets in which the dimension of the data does not exceed the sample size. For face recognition, however, the dimension typically exceeds the number of images in the database, resulting in what is referred to as the small sample size problem. Recently, the applicability of LDA has been extended by using the generalized singular value decomposition (GSVD) to circumvent the nonsingularity requirement, thus making LDA directly applicable to face recognition data. Our experiments confirm that LDA/GSVD solves the small sample size problem very effectively as compared with other current methods.
Interdata now makes own power supplies
Authors: Stanley Habib
Venue: ACM SIGMICRO Newsletter (1974)

OCEANPORT, N. J., JANUARY 24, 1974 -- Interdata, Inc., leading minicomputer manufacturer, announced today it bad begun the manufacture of its own 25 and 50-amp multiple output power supplies.
Ajax on Java
Authors: Steve Olson
Venue:  (2007)

This practical guide shows you how to make your Java web applications more responsive and dynamic by incorporating new Ajaxian features, including suggestion lists, drag-and-drop, and more. Java developers can choose between many different ways of incorporating Ajax, from building JavaScript into your applications "by hand" to using the new Google Web Toolkit (GWT).Ajax on Java starts with an introduction to Ajax, showing you how to write some basic applications that use client-side JavaScript to request information from a Java servlet and display it without doing a full page reload. It also presents several strategies for communicating between the client and the server, including sending raw data, and using XML or JSON (JavaScript Object Notation) for sending more complex collections of data.The book then branches out into different approaches for incorporating Ajax, which include:The Prototype and script.aculo.us Javascript libraries, the Dojo and Rico libraries, and DWRIntegrating Ajax into Java ServerPages (JSP) applicationsUsing Ajax with StrutsIntegrating Ajax into Java ServerFaces (JSF) applicationsUsing Google's GWT, which offers a pure Java approach to developing web applications: your client-side components are written in Java, and compiled into HTML and JavaScriptAjax gives web developers the ability to build applications that are more interactive, more dynamic, more exciting and enjoyable for your users. If you're a Java developer and haven't tried Ajax, but would like to get started, this book is essential. Your users will be grateful.
Robust speaker identification based on selective use of feature vectors
Authors: Soonil Kwon, Shrikanth Narayanan
Venue: Pattern Recognition Letters (2007)

A new method for speaker identification that selectively uses feature vectors for robust decision-making is described. Experimental results, with short speech segments ranging from 0.25 to 2s, showed that our method consistently outperforms other approaches yielding relative improvements of 20-51% and 15-30% over baseline GMM and the LDA-GMM systems, respectively.
Confidence-based classifier design
Authors: Mingkun Li, Ishwar K. Sethi
Venue: Pattern Recognition (2006)

In this paper, a new classifier design methodology, confidence-based classifier design, is proposed to design classifiers with controlled confidence. This methodology is under the guidance of two optimal classification theories, a new classification theory for designing optimal classifiers with controlled error rates and the C.K. Chow's optimal classification theory for designing optimal classifiers with controlled conditional error. The new methodology also takes advantage of the current well-developed classifier's probability preserving and ordering properties. It calibrates the output scores of current classifiers to the conditional error or error rates. Thus, it can either classify input samples or reject them according to the output scores of classifiers. It can achieve some reasonable performance even though it is not an optimal solution. An example is presented to implement the new methodology using support vector machines (SVMs). The empirical cumulative density function method is used to estimate error rates from the output scores of a trained SVM. Furthermore, a new dynamic bin width allocation method is proposed to estimate sample conditional error and this method adapts to the underlying probabilities. The experimental results clearly demonstrate the efficacy of the suggested classifier design methodology.
The Factor-2 Sign Detection Algorithm using a core function for RNS numbers
Authors: M. Abtahi, P. Siy
Venue: Computers Mathematics with Applications (2007)

The determination of the sign of RNS (Residue Number System) numbers is not a trivial task. In this work, we have proposed an algorithm called the ''Factor-2 Sign Detection Algorithm'' for this purpose. This algorithm uses the core value of a RNS number to determine its sign. On the basis of the core values, two areas are defined as ambiguous and unambiguous. The sign of a RNS number with its core in an unambiguous area can be determined immediately but if the core of a RNS number is in an ambiguous area, it may require two to several iterations of the algorithm to determine its sign.
The XTREM power and performance simulator for the Intel XScale core: Design and experiences
Authors: Gilberto Contreras, Margaret Martonosi, Jinzhang Peng, Guei-Yuan Lueh, Roy Ju
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

Managing power concerns in microprocessors has become a pressing research problem across the domains of computer architecture, CAD, and compilers. As a result, several parameterized cycle-level power simulators have been introduced. While these simulators can be quite useful for microarchitectural studies, their generality limits how accurate they can be for any one chip family. Furthermore, their hardware focus means that they do not explicitly enable studying the interaction of different software layers, such as Java applications and their underlying runtime system software. This paper describes and evaluates XTREM, a power-simulation tool tailored for the Intel XScale microarchitecture. In building XTREM, our goals were to develop a microarchitecture simulator that, while still offering size parameterizations for cache and other structures, more accurately reflected a realistic processor pipeline. We present a detailed set of validations based on multimeter power measurements and hardware performance counter sampling. XTREM exhibits an average performance error of only 6.5&percnt; and an even smaller average power error: 4&percnt;. The paper goes on to present an application study enabled by the simulator. Namely, we use XTREM to produce an energy consumption breakdown for Java CDC and CLDC applications. Our simulator measurements indicate that a large percentage of the total energy consumption (up to 35&percnt;) is devoted to the virtual machine's support functions.
Capacity and Coverage Tradeoff in WCDMA Environments with Repeaters Deployment
Authors: M. Garcia-Lozano, L. Alonso, F. Casadevall, S. Ruiz
Venue: Wireless Personal Communications: An International Journal (2007)

This work derives the analytic expression of the feasibility condition for the uplink of a WCDMA mobile communications system with repeaters deployment in a multiservice environment with a general heterogeneous layout. In particular, a compact closed expression for the admission region is presented, suitable for a system where the users belong to an arbitrary number of different service classes. A tradeoff between capacity and coverage arises and it has been analysed both theoretically and by means of simulations. Different parameters are shown to have a major impact and their adjustment is discussed.
Mastering Perl
Authors: Brian Foy
Venue:  (2007)

This is the third in O'Reilly's series of landmark Perl tutorials, which started with Learning Perl, the bestselling introduction that taught you the basics of Perl syntax, and Intermediate Perl, which taught you how to create re-usable Perl software. Mastering Perl pulls everything together to show you how to bend Perl to your will. It convey's Perl's special models and programming idioms. This book isn't a collection of clever tricks, but a way of thinking about Perl programming so you can integrate the real-life problems of debugging, maintenance, configuration, and other tasks you encounter as a working programmer. The book explains how to: Use advanced regular expressions, including global matches, lookarounds, readable regexes, and regex debuggingAvoid common programing problems with secure programming techniquesProfile and benchmark Perl to find out where to focus your improvementsWrangle Perl code to make it more presentable and readableSee how Perl keeps track of package variables and how you can use that for some powerful tricksDefine subroutines on the fly and turn the tables on normal procedural programming.Modify and jury rig modules to fix code without editing the original sourceLet your users configure your programs without touching the codeLearn how you can detect errors Perl doesn't report, and how to tell users about themLet your Perl program talk back to you by using Log4perlStore data for later use in another program, a later run of the same program, or to send them over a networkWrite programs as modules to get the benefit of Perl's distribution and testing tools Appendices include "brian's Guide to Solving Any Perl Problem" to improve your troubleshooting skills, as well as suggested reading to continue your Perl education. Mastering Perl starts you on your path to becoming the person with the answers, and, failing that, the person who knows how to find the answers or discover the problem.
Introduction to Information Systems, 13 edition
Authors: James A. O'Brien, George Marakas
Venue:  (2005)

O’Brien’s Introduction to Information Systems 13e continues to reflect the movement toward enterprise-wide business applications. George Marakas from the University of Kansas joins as a co-author on this new edition. New real world case studies correspond with this curriculum shift. The text’s focus is on teaching the general business manager how to use and manage the most current IT technologies such as the Internet, Intranets, and Extranets for enterprise collaboration, and how IT contributes to competitive advantage, reengineering business processes, problem solving, and decision-making. Table of contentsBrief ContentsModule I Foundation Concepts1 Foundations of Information Systems in BusinessSECTION I: Foundation Concepts: Information Systems in BusinessSECTION II: Foundation Concepts: The Components of Information Systems2 Competing with Information TechnologySECTION I: Fundamentals of Strategic AdvantageSECTION II: Using Information Technology for Strategic AdvantageModule II Information Technologies3 Computer HardwareSECTION I: Computer Systems: End User and Enterprise ComputingSECTION II: Computer Peripherals: Input, Output, and Storage Technologies4 Computer SoftwareSECTION I: Application Software: End User ApplicationsSECTION II: System Software: Computer System Management5 Data Resource ManagementSECTION I: Technical Foundations of Database ManagementSECTION II: Managing Data Resources6 Telecommunications and NetworksSECTION I: The Networked EnterpriseSECTION II: Telecommunications Network AlternativesModule III Business Applications7 Electronic Business SystemsSECTION I: Enterprise Business SystemsSECTION II: Functional Business Systems8 Electronic Commerce SystemsSECTION I: Electronic Commerce FundamentalsSECTION II: e-Commerce Applications and Issues9 Decision Support SystemsSECTION I: Decision Support in BusinessSECTION II: Artificial Intelligence Technologies in BusinessModule IV Development Processes10 Developing Business/IT Solutions SECTION I: Developing Business Systems SECTION II: Implementing Business SystemsModule V Management Challenges11 Security and Ethical Challenges SECTION I: Security, Ethical, and Societal Challenges of IT SECTION II: Security Management of Information Technology12 Enterprise and Global Management of Information Technology SECTION I: Managing Information Technology SECTION II: Managing Global ITReview Quiz AnswersSelected ReferencesGlossary for Business ProfessionalsName IndexCompany IndexSubject Index
Acceleration of direct volume rendering with programmable graphics hardware
Authors: Hacer Yal&#x0131;m Kele&#x015f;, Alphan Es, Veysi &#x0130;&#x015f;ler
Venue: The Visual Computer: International Journal of Computer Graphics (2006)

We propose a method to accelerate direct volume rendering using programmable graphics hardware (GPU). In the method, texture slices are grouped together to form a texture slab. Rendering non-empty slabs from front to back viewing order generates the resultant image. Considering each pixel of the image as a ray, slab silhouette maps (SSMs) are used to skip empty spaces along the ray direction per pixel basis. Additionally, SSMs contain terminated ray information. The method relies on hardware z-occlusion culling and hardware occlusion queries to accelerate ray traversals. The advantage of this method is that SSMs are created on the fly by the GPU without any pre-processing. The cost of generating the acceleration structure is very small with respect to the total rendering time.
On a restricted cross-intersection problem
Authors: Peter Keevash, Benny Sudakov
Venue: Journal of Combinatorial Theory Series A (2006)

Suppose A and B are families of subsets of an n-element set and L is a set of s numbers. We say that the pair (A, B) is L-cross-intersecting if |A ∩ B| ∈ L for every A ∈ A and B ∈ B. Among such pairs (A,B) we write PL(n) for the maximum possible value of |A||B|. In this paper we find an exact bound for PL(n) when n is sufficiently large, improving earlier work of Sgall. We also determine P{2}(n) and P{1, 2}(n) exactly, which respectively confirm special cases of a conjecture of Ahlswede, Cai and Zhang and a conjecture of Sgall.
Response
Authors: W. I. Thacker, G. W. Gorsline
Venue: ACM SIGMICRO Newsletter (1979)

Within the context of our study; that is, the direct substitution of a pure rational scheme for a floating point scheme of arithmetic and storage within an extant FORTRAN system with no changes to the compiler (and thus to the storage space available for a single numerical quantity), we continue to claim that our results are valid. We again wish to note that our investigation was limited to the pure rational scheme using the same storage space available to a floating point scheme.
Parameterized congruences in ACL2
Authors: David Greve
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

Support for congruence-based rewriting is built into ACL2. This capability allows ACL2 to treat certain predicate relations "just like equality" under appropriate conditions and allows specific theorems involving those equivalence relations to be used as rewrite rules to guide the simplification process. Although this has proven to be an extremely powerful capability, it comes with limitations. One significant limitation is that equivalence relations cannot be parameterized. This precludes one very natural application of congruences: their use in reasoning about arbitrary modulus arithmetic. We have developed a technique for emulating parameterized congruence-based rewriting on a stock ACL2 system using binding hypotheses and bind-free. We have also developed a library (nary) that provides a means of expressing and utilizing such congruences with a high degree of automation. We demonstrate the application of this library to problems in modular arithmetic and other similar domains.
A dynamic topological sort algorithm for directed acyclic graphs
Authors: David J. Pearce, Paul H. J. Kelly
Venue: Journal of Experimental Algorithmics (JEA) (2007)

We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against the three main alternatives over a large number of random DAGs. The results show our algorithm is the best for sparse digraphs and only a constant factor slower than the best on dense digraphs.
An Efficient Publicly Verifiable Mix-Net for Long Inputs
Authors: Jun Furukawa, Kazue Sako
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

We propose here the first efficient publicly verifiable hybrid mix-net. Previous publicly verifiable mix-net was only efficient for short ciphertexts and was not suitable for mixing long messages. Previous hybrid mix-net can mix long messages but did not have public verifiability. The proposed scheme is efficient enough to treat large scale electronic questionnaires of long messages as well as voting with write-ins, and offers public verifiability of the correctness of the tally. The scheme is provably secure if we assume random oracles, semantic security of a one-time symmetric-key cryptosystem, and intractability of decision Diffie-Hellman problem. This paper is the full version of the extended abstract appeared in FC 2006 [10].
Logic-based approaches to information fusion
Authors: Eric Grégoire, Sébastien Konieczny
Venue: Information Fusion (2006)

This survey covers recent contributions from the artificial intelligence research literature about logic-based information fusion. First, the main current approaches dealing with the standard propositional logic formalism are presented and compared. Then, techniques for fusing weighted belief bases are discussed. Finally, relationships between propositional information fusion and related areas such as belief revision and multi-agent negotiation are mentioned. d.