ppxscal/embedding_network huggingface dataset:
Face detection using discriminating feature analysis and Support Vector Machine
Authors: Peichung Shih, Chengjun Liu
Venue: Pattern Recognition (2006)

This paper presents a novel face detection method by applying discriminating feature analysis (DFA) and support vector machine (SVM). The novelty of our DFA-SVM method comes from the integration of DFA, face class modeling, and SVM for face detection. First, DFA derives a discriminating feature vector by combining the input image, its 1-D Haar wavelet representation, and its amplitude projections. While the Haar wavelets produce an effective representation for object detection, the amplitude projections capture the vertical symmetric distributions and the horizontal characteristics of human face images. Second, face class modeling estimates the probability density function of the face class and defines a distribution-based measure for face and nonface classification. The distribution-based measure thus separates the input patterns into three classes: the face class (patterns close to the face class), the nonface class (patterns far away from the face class), and the undecided class (patterns neither close to nor far away from the face class). Finally, SVM together with the distribution-based measure classifies the patterns in the undecided class into either the face class or the nonface class. Experiments using images from the MIT-CMU test sets demonstrate the feasibility of our new face detection method. In particular, when using 92 images (containing 282 faces) from the MIT-CMU test sets, our DFA-SVM method achieves 98.2% correct face detection rate with two false detections.
Database-intensive process simulation at the Y-12 national security complex
Authors: Reid Kress, Karen Bills, Jack Dixon, Richard Rinehart
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The NNSA's Y-12 National Security Complex is a manufacturing facility operated by BWXT Y-12. Y-12's missions include ensuring the US' nuclear weapons deterrent, storing nuclear materials, and fueling US naval reactors. As a consequence of these missions, Y-12 makes dozens of products, having hundreds of parts, each with many different process steps associated with manufacturing components, building sub-assemblies, or assembling final products. Y-12 also disassembles weapon components to support stockpile reduction efforts and retrieve high-value materials and parts. These efforts must be coordinated not only within the Y-12 complex but also within the nation-wide nuclear weapons complex. Y-12 relies heavily on simulation models to evaluate the impact of plant changes over multiple programs and products, spanning multiple-years, and involving multiple interacting organizations. To maintain these simulations with current data and build and execute them rapidly, Y-12's simulation modeling group relies heavily on database-intensive simulations described in this paper.
Generating surface crack patterns
Authors: Hayley N. Iben, James F. O'Brien
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We present a method for generating surface crack patterns that appear in materials such as mud, ceramic glaze, and glass. To model these phenomena, we build upon existing physically based methods. Our algorithm generates cracks from a stress field defined heuristically over a triangle discretization of the surface. The simulation produces cracks by evolving this field over time. The user can control the characteristics and appearance of the cracks using a set of simple parameters. By changing these parameters, we have generated examples similar to a variety of crack patterns found in the real world. We assess the realism of our results by comparison with photographs of real-world examples. Using a physically based approach also enables us to generate animations similar to time-lapse photography.
The big Mother of all dualities 2: Macaulay bases
Authors: Mar&#x00ed;a Emilia Alonso, Maria Grazia Marinari, Teo Mora
Venue: Applicable Algebra in Engineering, Communication and Computing (2006)

We present some interesting computational applications of Macaulay&#x2019;s notion of inverse systems and Noether equations. In particular, we discuss an algorithm by Macualay which computes the forgotten notion (introduced by Emmy Noether) of reduced irreducible decomposition for ideals of the polynomial ring.
Simulation model for improving the operation of the emergency department of special health care
Authors: Toni Ruohonen, Pekka Neittaanmäki, Jorma Teittinen
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper presents a simulation model which describes the operations in the Emergency Department of Special Health Care at the Central Hospital of Jyv&auml;skyl&auml;, Finland. It can be used to test different process scenarios, allocate resources and perform activity based cost analysis. By using the simulation model we demonstrate a new operational method, which makes the operation of the Emergency Department of Special Health Care more effective. This operational method is called the triage-team method and it has been studied from two different points of view. The results showed that this method improves the operation of the Emergency Department of Special Health Care substantially (over 25%), if it is implemented properly and includes all the necessary tasks.
Open bisimulation for aspects
Authors: Radha Jagadeesan, Corin Pitcher, James Riely
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive reasoning principles aimed at proving equality of aspect programs. The language we study is very small, yet powerful enough to encode mutable references and a range of temporal pointcuts (including cflow and regular event patterns).Examples suggest that our bisimulation principle is useful. For an encoding of higher-order programs with state, our methods suffice to establish well-known and well-studied subtle examples involving higher-order functions with state.Even in the presence of first class dynamic advice and expressive pointcuts, our reasoning principles show that aspect-aware interfaces can aid in ensuring that clients of a component are unaffected by changes to an implementation. Our paper generalizes existing results given for open modules to also include a variety of history-sensitive pointcuts such as cflow and regular event patterns.Our formal techniques and results suggest that aspects are amenable to the formal techniques developed for stateful higher-order programs.
Comparing the performance of object databases and ORM tools
Authors: Pieter van Zyl, Derrick G. Kourie, Andrew Boake
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

The currently popular distributed, n-tiered, object-oriented application architecture provokes many design debates. Designs of such applications are often divided into logical 'tiers' -- usually user interface, business logic and domain object, or data, tiers, each with their own design issues. In particular, the latter contains data that needs to be stored and retrieved from permanent storage. Decisions need to be made as to the most appropriate way of doing this -- the choices are usually whether to use an object database, to communicate directly with a relational database, or to use object-relational mapping (ORM) tools to allow objects to be translated to and from relational form.Most often, depending on the perceived profile of the application, architects make these decisions using rules of thumb derived from particular experience or the design patterns literature. Examples include: object-oriented databases ease programming, relational databases ease report generation and data mining; object-oriented databases are good for navigation around an object model, relational databases are good for sequential processing and complex queries; if you are writing an application from scratch, use an object database, if you need to integrate to various sources of legacy data, use an ORM tool. Although helpful, these rules are often highly context-dependent and are often misapplied.Research into the nature and magnitude of 'design forces' in this area has resulted in a series of benchmarks, intended to allow architects to more clearly understand the implications of design decisions concerning object persistence. In this paper, the performance of selected open source object persistence tools is investigated, to attempt to clarify the myths surrounding the performance of the different options. In particular, we compare Hibernate, representative of the ORM stable, and db4o, representative of object-oriented databases. The OO7 benchmark is used to compare the speed of execution of a suite of typical persistence-related operations in both candidates. We then propose some preliminary explanations of the sometimes surprising results.
A GA-based parameter design for single machine turning process with high-volume production
Authors: Raid Al-Aomar, Ala'a Al-Okaily
Venue: Computers and Industrial Engineering (2006)

This paper presents a Parameter Design (PD) approach that provides near-optimal settings to the process parameters of a single lathe machine with high-volume production. Optimized process parameters include both machining parameters (cutting speed, feed rate, and depth of cut) and production parameters (material order size and inventory safety stock and reorder point). In high-volume production, machining parameters have amplified impacts on the machine performance in terms of productivity (cycle time), reliability (tool life), and product quality (surface finish). In addition, production parameters become critical in high-volume production since they directly impact the overall order fulfillment (production makespan and delivery reliability). Hence, this paper extends the conventional per-part machining cost model into a per-order production cost model by consolidating the production economics of both machining parameters and production controls. Discrete Event Simulation (DES) is utilized to capture the stochastic and dynamic production attributes and to transfer the static machine PD model into a dynamic PD-DES production model. The model is also utilized to accumulate the per-order running cost over production time while incorporating the impacts of process variability in tool life, labor efficiency, machining conditions, order lead time, and demand rate. Using the PD-DES model as a dynamic fitness function, a Simple Genetic Algorithm (SGA) is developed and applied to a CNC lathe machine to determine near-optimal settings to both machining and production process parameters so that the overall per-order production cost is minimized. Results showed effective SGA convergence profile with relatively low number of search generations. Sensitivity analysis with SGA parameters is conducted to demonstrate the search's robustness. The benefits of the per-order cost model are illustrated by repeating the SGA solution using machine productivity as a fitness criterion. The new SGA solution resulted in a better productivity but at a higher per-order cost. Finally, the effectiveness of SGA search is illustrated by outperforming the solutions obtained from two-level and three-level full factorial designs.
Intrusion Detection for Encrypted Web Accesses
Authors: Akira Yamada, Yutaka Miyake, Keisuke Takemori, Ahren Studer, Adrian Perrig
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

As various services are provided as web applications, attacks against web applications constitute a serious problem. Intrusion Detection Systems (IDSes) are one solution, however, these systems do not work effectively when the accesses are encrypted by protocols. Because the IDSes inspect the contents of a packet, it is difficult to find attacks by the current IDS. This paper presents a novel approach to anomaly detection for encrypted web accesses. This approach applies encrypted traffic analysis to intrusion detection, which analyzes contents of encrypted traffic using only data size and timing without decryption. First, the system extracts information from encrypted traffic, which is a set comprising data size and timing for each web client. Second, the accesses are distinguished based on similarity of the information and access frequencies are calculated. Finally, malicious activities are detected according to rules generated from the frequency of accesses and characteristics of HTTP traffic. The system does not extract private information or require enormous pre-operation beforehand, which are needed in conventional encrypted traffic analysis. We show that the system detects various attacks with a high degree of accuracy, adopting an actual dataset gathered at a gateway of a network and the DARPA dataset.
Designing and explaining programs with a literate pseudocode
Authors: Geoffrey G Roy
Venue: Journal on Educational Resources in Computing (JERIC) (2006)

Designing and explaining programs are often difficult tasks, especially when novices are involved. It also concerns more experienced programmers when complex algorithms need to be carefully explained and documented as part of software development.Good practice suggests that code and documentation be tightly coupled; but there are only a few support tools specifically targeted at novices that require this as an integral part of the programming process. We propose a new tool design with this objective in mind: P-Coder gives a flexible descriptive view of the program via pseudocode notation within a graphical tree-structured model, from which the complete algorithm can be specified to retain the informal description integrated with the final code. Thus the code meets some of the key requirements for realizing a literate program.
Using dense storage to solve small sparse linear systems
Authors: Marco Morandini, Paolo Mantegazza
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

A data structure is used to build a linear solver specialized for relatively small sparse systems. The proposed solver, optimized for run-time performance at the expense of memory footprint, outperforms widely used direct and sparse solvers for systems with between 100 and 3000 equations. A multithreaded version of the solver is shown to give some speedups for problems with medium fill-in, while it does not give any benefit for very sparse problems.
DDDAS approaches to wildland fire modeling and contaminant tracking
Authors: Craig C. Douglas, Robert A. Lodder, Richard E. Ewing, Yalchin Efendiev, Guan Qin, Janice Coen, Mauricio Kritz, Jonathan D. Beezley, Jan Mandel, Mohamed Iskandarani, Anthony Vodacek, Gundolf Haase
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We report on two ongoing efforts to build Dynamic Data Driven Application Systems (DDDAS) for (1) short-range forecasting of weather and wildfire behavior from real time weather data, images, and sensor streams, and (2) contaminant identification and tracking in water bodies. Both systems change their forecasts as new data is received. We use one long term running simulation that self corrects using out of order, imperfect sensor data. The DDDAS versions replace codes that were previously run using data only in initial conditions. DDDAS entails the ability to dynamically incorporate additional data into an executing application, and in reverse, the ability of an application to dynamically steer the measurement process.
Computation of arbitrage in frictional bond markets
Authors: Mao-cheng Cai, Xiaotie Deng, Zhongfei Li
Venue: Theoretical Computer Science (2006)

In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of frictions under consideration include fixed and proportional transaction costs, bid-ask spreads, taxes, and upper bounds on the number of units for transaction. We develop a necessary and sufficient condition for the existence of arbitrage. In addition, we obtain some negative result on computational difficulty in general for arbitrage under those frictions: it is NP-complete to identify whether there exists a cash-and-carry arbitrage transaction and it is NP-hard to find an optimal cash-and-carry arbitrage transaction.
Corel Paint Shop Pro X Digital Darkroom
Authors: T. Michael Clark
Venue:  (2006)

Corel Paint Shop Proï¾ X Digital Darkroom is an easy-to-follow, tutorial approach to using Paint Shop Pro in exactly the way home users want to use it - to manipulate your own images in ways that a local photo lab often does to create both practical and comical projects. As you read, you will actually use the program to complete a variety of projects. You'll learn about key Paint Shop Pro tools almost without trying through both traditional and contemporary projects.Indulge in shrinking the kids, performing digital plastic surgery, modifying vehicles, creating creatures the tabloids would love to profile, altering pets, creating trading cards and calendars, and combining images to create once-in-a-lifetime shots. Drop people into places they've never been and challenge Mother Nature with unique perspectives. Createï¾ holiday magic, photo montages, and evenï¾ do some traditional photo manipulation. Author T. Michael Clark provides careful instruction that will allow you, whether you are a novice or experienced Paint Shop Pro user, to complete projects and enjoy your experience with Paint Shop Proï¾ X. 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
Authenticated Broadcast Encryption Scheme
Authors: Chik How Tan, Joseph Chee Ming Teo, Jens-Are Amundsen
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

With the advancement of wireless networks and mobile access devices such as cell phones and PDAs, multimedia services could be offered through wireless broadcast networks to these mobile devices. Therefore, there is a need to securely deliver multimedia content/data to many users over an insecure channel. Broadcast encryption scheme could provide this solution. The first formal study of broadcast encryption scheme is by Fiat and Noar in 1993. Since then, many broadcast encryption schemes have been proposed to improve the efficiency which is measured by three parameters, that is, length of transmission messages, users' storage and computational overhead at a user device. Some broadcast encryption schemes require less users storage, but the length of transmission messages or computation overhead depends on the number of users. In this paper, we proposed an authenticated broadcast encryption scheme which has an additional property than current proposed broadcast encryption schemes, that is, all users can verify who the sender is. The proposed scheme is proved to be secure against chosen ciphertext attacks based on the decision l-bilinear Diffie-Hellman exponent assumption. Furthermore, the simulation results, transmission messages nearly independent of the number of users and reasonable user storage show that the proposed authenticated broadcast encryption scheme is efficient and suitable for mobile devices.
On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme
Authors: Le Trieu Phong, Wakaha Ogata
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

Kurosawa-Desmedt public-key encryption scheme is a variation of Cramer-Shoup public-key encryption schemes, which are the first practical schemes secure against adaptive chosen ciphertext attack (IND-CCA) in standard model. We introduce some variants of Kurosawa-Desmedt public-key encryption scheme which are also IND-CCA secure. Furthermore, the variants are either more efficient or less cryptographic assumptions than the original version.
The modeling architecture for technology, research, and experimentation
Authors: Tom Hurt, Joe McDonnell, Tim McKelvy
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The Modeling Architecture for Technology, Research, and eXperimentation (MATREX) program is the foremost distributed modeling and simulation environment in the US Army, providing a unifying M&S architecture, supporting tools, and infrastructure to ease the integration and use of multi-resolution live, virtual, and constructive (LVC) applications. We present the MATREX program overview and objectives, describe the current state of the architecture, tools, and services, and discuss near-term developmental efforts. We then briefly address two applications of the MATREX environment, namely the application in the Future Combat System Lead Systems Integrator System of System Integration Laboratory, and the Cross Command Collaboration Effort. Finally, we describe the lessons learned in the process, describing the obstacles encountered and the mitigation techniques employed, as well as the program successes.
Excel Annoyances
Authors: Curt Frye, Curtis Frye
Venue:  (2004)

It's the solution to almost all of your electronic organization needs. Need to present a detailed expense report? Try an Excel spreadsheet. Keeping track of a complicated budget? Excel to the rescue. Want to keep tabs on your office football pool? You guessed it. Thanks to its incredible versatility and power, Excel has emerged as more than just a mainstream program; it's now one of the most used applications on the planet. Everyone from run-of-the-mill PC users to leading financial analysts count on Excel to make sense of overflowing data. And to keep up with the overwhelming user demand, three different versions of Excel have hit the market since the debut of Excel 97: Excel 97, 2000, 2002, and 2003. Naturally, each version offers a new slate of next-generation upgrades--and, of course, operating bugs! At last, Excel users have some relief: Excel Annoyances emerged from the suggestions of numerous Excel users who've struggled with these irritating bugs over the years. Written in the popular Annoyances format, this latest O'Reilly helper addresses all of the quirks, bugs, inconsistencies, and hidden features found in each of the four versions. Chances are if someone, somewhere, found a certain step confusing, then it's addressed in Excel Annoyances. Author Curtis D. Frye breaks down the cavalcade of information into several tip-of-the-finger categories such as Entering Data, Formatting, Charting, Printing, and more. If you're one of the millions of people who use Excel, you're sure to find a goldmine of helpful nuggets that you can use to fix the program's most annoying traits. In the end, Excel Annoyances will help you to truly maximize Excel's seemingly limitless potential.
Special Edition Using Microsoft Office Excel 2003
Authors: Patrick Blattner
Venue:  (2003)

Does your life play out in a spreadsheet? Are numbers in columns and rows what make or break you in the work world?If you answered yes to either of these questions, then Special Edition Using Microsoft Office Excel 2003 is the book that will make it all better. Learn quickly and efficiently from a true Excel master using the tried and true Special Edition Using formula for success. Here, you'll find information that's undocumented elsewhere - even in Microsoft's own Help systems. You'll learn from finely crafted, real-life examples built by an author who lives and dies by the integrity of his spreadsheets.Unlike most CDs pasted into the back of computer books, this is one that rivals the book in terms of value. You receive a FREE copy of Woody's Office Power Pack (WOPR) - the #1 enhancement to Office. This software sells for $49.99 and you get it for free here...no strings attached.