ppxscal/embedding_network huggingface dataset:
Greedy bidding strategies for keyword auctions
Authors: Matthew Cary, Aparna Das, Ben Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Claire Mathieu, Michael Schwarz
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN?allWe consider greedy bidding strategies for a repeated auction on a single keyword, where in each round, each player chooses some optimal bid for the next round, assuming that the other players merely repeat their previous bid. We study the revenue, convergence and robustness properties of such strategies. Most interesting among these is a strategy we call the balanced bidding strategy (BB): it is known that BB has a unique fixed point with payments identical to those of the VCG mechanism. We show that if all players use the BB strategy and update each round, BB converges when the number of slots is at most 2, but does not always converge for 3 or more slots. On the other hand, we present a simple variant which is guaranteed to converge to the same fixed point for any number of slots. In a model in which only one randomly chosen player updates each round according to the BB strategy, we prove that convergence occurs with probability 1.We complement our theoretical results with empirical studies.
On weighted Lebesgue function type sums
Authors: Ying Guang Shi
Venue: Journal of Approximation Theory (2007)

Let I be a finite or infinite interval and d@m a measure on I. Assume that the weight function w(x)>0, w^'(x) exists, and the function w^'(x)/w(x) is non-increasing on I. Denote by @?"k's the fundamental polynomials of Lagrange interpolation on a set of nodes x"1=1 is defined byS"n(x)=@?k=ij(x-x"k)@?"k(x)w(x)/w(x"k)^s.In this paper the exact lower bounds of S"n(x) on a ''big set'' of I and @!"IS"n(x)d@m(x) are obtained. Some applications are also given.
Improved Logistic Regression Approach to Predict the Potential Distribution of Invasive Species Using Information Theory and Frequency Statistics
Authors: Hao Chen, Lijun Chen, Thomas P. Albright, Qinfeng Guo
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The Predictive models of the potential distribution of invasive species are important for managing the growing invasive species crises. However, for most species absence data are not available. Presented with the challenge of developing a model based on presence-only information, we developed an improved logistic regression approach using Information Theory and Frequency Statistics to produce a relative suitability map. Logistic regression model selection was based on Akaike's Information Criterion (AIC). Based on the weighted average model we provided the quantile statistics method to compartmentalize the relative habitat-suitability in native ranges. Finally, we used the model and the compartmentalize criterion developed in native ranges to "project" onto exotic ranges to predict the invasive species' potential distribution.
Fast algorithm for the 3D DCT
Authors: O. Alshibami
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The three-dimensional discrete cosine transform (3D DCT) has been used in many 3D applications such as video coding and compression. Many fast algorithms have been developed for the calculation of the 1D DCT. These algorithms are then used for the calculation of the 3D DCT using the row-column approach. However, 3D algorithms involve fewer arithmetic operations and can be faster. The 3D decimation-in-frequency vector-radix algorithm (3D DIF VR), for the 3D DCT-II, is developed and its arithmetic complexity analysed and compared to similar algorithms. In comparison with the familiar row-column approach, the 3D vector-radix reduces the number of multiplications significantly while keeping the number of additions the same and hence can be used for fast 3D image and video coding and compression.
An interdisciplinary approach to the pre-engineering curriculum
Authors: P. Zenor, J. Fukai, R. Knight, N. Madsen
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

We describe the approach being used at Auburn University to design a two year, team taught, well coordinated sequence that will integrate topics in calculus and calculus based courses in the typical pre-engineering curriculum. The sequence will integrate topics normally covered in calculus, vector calculus, linear algebra, differential equations, introductory physics, and engineering courses such as statics, dynamics, thermodynamics, and circuits so that transitions from the geometry and analysis of mathematics to the principles of physics to the engineering applications will appear seamless. Common ideas in mathematics, physics, and engineering will be presented with mutually supporting viewpoints in a timely and mutually reinforcing way.
Regular embeddings of Kn,n where n is a power of 2. I: Metacyclic case
Authors: Shao-Fei Du, Gareth Jones, Jin Ho Kwak, Roman Nedela, Martin Škoviera
Venue: European Journal of Combinatorics (2007)

A 2-cell embedding of a graph in an orientable closed surface is called regular if its automorphism group acts regularly on arcs of the embedded graph. The aim of this and of the associated consecutive paper is to give a classification of regular embeddings of complete bipartite graphs K"n","n, where n=2^e. The method involves groups G which factorize as a product XY of two cyclic groups of order n so that the two cyclic factors are transposed by an involutory automorphism. In particular, we give a classification of such groups G. Employing the classification we investigate automorphisms of these groups, resulting in a classification of regular embeddings of K"n","n based on that for G. We prove that given n=2^e (for e>=3), there are, up to map isomorphism, exactly 2^e^-^2+4 regular embeddings of K"n","n. Our analysis splits naturally into two cases depending on whether the group G is metacyclic or not.
A Power and Area Efficient Maximum Likelihood Detector Implementation for High Throughput MIMO Systems
Authors: J. H. Han, A. T. Erdogan, T. Arslan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A maximum likelihood detector (MLD) is presented for 4x4 QPSK Multiple-input multiple-output (MIMO) systems. A hybrid methodology combining precomputation of norm values followed with the transformation of the maximum likelihood algorithm is applied in order to achieve an efficient MLD implementation, in which 16 norm values are concurrently computed for high throughput while maintaining power and area efficiency. The MLD implementation results are compared with a conventional MLD in area and power. Simulation results demonstrate that the proposed MLD can achieve up to 74 Mbps throughput at a clock speed of 14 7MHz.
How does an online game based learning environment promote students' intrinsic motivation for learning natural science and how does it affect their
Authors: Mei-Jen Kuo
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

In this study, mixed research methods were adopted to examine the online game-based learning environment for" Go Go Bugs." The purpose of this study was to determine if an online game-based learning environment can engage and motivate students to learn more natural science by using game features than the control group, which had the same learning environment, but no game features. This experiment examined the engagement by participants' frequencies of returning to the learning environment after school hours, within a time period of two weeks. The results of the comparison of pre- and post- surveys showed significant improvement in increasing participants' interest in learning natural science in a game-based learning environment over that of the non-game-based learning environment. Both quantitative and qualitative results from this study indicated that this game-based learning environment successfully motivated participants in exploring natural science and engaging in the learning activities. However, there was no significant result showing that the game-based learning environment improves students' learning achievement more than with the non-game-based learning environment.
Learning independent components on the orthogonal group of matrices by retractions
Authors: Simone Fiori
Venue: Neural Processing Letters (2007)

Neural independent component learning algorithms based on optimization on manifolds have attracted interest in the neural network community. In the past years, we have developed learning algorithms specialized for the orthogonal group of matrices as parameters manifold. Here, we sketch a view of these algorithms by the help of `retractions' on manifolds.
Using emotion in games: emotional flowers
Authors: Regina Bernhaupt, Andreas Boldt, Thomas Mirlacher, David Wilfinger, Manfred Tscheligi
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

It can be argued that one of the main reasons for playing games is to achieve an emotional reaction of the player. To be surprised, happy, angry or anxious - to perceive different emotional states - is one of the main reasons to play games. The "Emotional Flowers" game harnesses the player's emotions as the primary means for the game interaction. Within the game the player's facial expression of emotion is used to control the growth of a flower. Multiple players can play "Emotional Flowers" simultaneously. The main idea is to grow the flower as fast as possible based on positive emotions like happiness and surprise. Flowers of all participants within the game are additionally displayed on an ambient display in a public area. This influences not only emotions by the user, but also has an effect on social interactions within the group of players. In this paper, we present design, implementation and evaluation of the "Emotional Flowers" game.
Lattice-based discriminative training for large vocabulary speech recognition
Authors: V. Valtchev
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes a framework for optimising the parameters of a continuous density HMM-based large vocabulary recognition system using a maximum mutual information estimation (MMIE) criterion. To limit the computational complexity arising from the need to find confusable speech segments in the large search space of alternative utterance hypotheses, word lattices generated from the training data are used. Experiments are presented on the Wall Street journal database using up to 66 hours of training data. These show that lattices combined with an improved estimation algorithm makes MMIE training practicable even for very complex recognition systems and large training sets. Furthermore, experimental results show that MMIE training can yield useful increases in recognition accuracy.
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Venue: Conference on Programming Language Design and Implementation (2007)

The ACM SIGPLAN Conference on Programming Language and Design has its roots in the 1979 Symposium on Compiler Construction, and has grown to be the premiere conference in its area. While computer science has matured to include many other subfields, the core area PLDI represents needs to remain vital and current. The difficult job of the program committee in 2007, and the selection of a record number of papers, is a welcome sign of this vitality. . In my role as General Chair, I would like to thank our Program Chair, Professor Kathryn McKinley, Tutorial Chair, Professor Michelle Mills Strout, Poster Chair, Stephen Fink, and Submissions Chair, Maria Jump, as well as our program committee members, for their excellent job. I also acknowledge the strong organizational support from ACM and my assistant Cheryl Eng. Finally, I'd like to reflect on two defining moments in our community this year. Two giants in the area of programming languages, Joseph Goguen and Ken Kennedy, passed away, and our community mourns their passing. More joyously, the A.M. Turing Award this year goes to one of the founders of our area, Frances Allen, for "contributions that fundamentally improved the performance of computer programs in solving problems, and accelerated the use of high performance computing." We honor and celebrate Fran's achievements at FCRC and PLDI 2007.
Hierarchical Phrase-Based Translation
Authors: David Chiang
Venue: Computational Linguistics (2007)

We present a statistical machine translation model that uses hierarchical phrases---phrases that contain subphrases. The model is formally a synchronous context-free grammar but is learned from a parallel text without any syntactic annotations. Thus it can be seen as combining fundamental ideas from both syntax-based translation and phrase-based translation. We describe our system's training and decoding methods in detail, and evaluate it for translation speed and translation accuracy. Using BLEU as a metric of translation accuracy, we find that our system performs significantly better than the Alignment Template System, a state-of-the-art phrase-based system.
Knowledge discovery in computer network data: a security perspective
Authors: Carey Priebe
Venue:  (2007)

From a security perspective, computer network data is analyzed largely for two purposes: to detect known structures, and to identify previously unknown structures. As an example of the former, it is considered standard procedure to filter network traffic for previously identified viruses in order to prevent infection and to reduce virus spread. As an example of the latter, security researchers may want to search datasets in order to identify and discover previously unknown relationships or structures in the data, such as intrusions into a network by an external hacker. However, among other limitations, traditional methods of network data analysis are insufficient when processing large volumes of network traffic, do not allow for the discovery of local structures, do not visualize high-dimensional data in meaningful ways, and do not allow user input during search iterations. We present the development, analysis, and testing of a new framework for the analysis of network traffic data. In particular, and among others, the framework addresses the following questions: How is network traffic represented in high-dimensional space? (normalized graph Laplacians); How can we extract features from the data? (flow-based feature extraction); How to embed high-dimensional representations in low dimensions? (Laplacian Eigenmaps); How to intuitively visualize low-dimensional structures? (Fiedler Space projections); How to address scaleability concerns? (proximity computation, partitioning, and eigenpair computation approximations); How can the user be involved in the search? (iterative denoising applied to network data); How might this framework be used on empirical network data? (application to computer network intrusion data, backscatter data, and computer network application data). As such, this work presents theoretical as well as practical contributions, and these results are discussed within the context of traditional methods and techniques. Thus, due to its theoretical and applied benefits of visualizing and classifying a variety of unsupervised, heterogeneous, high-dimensional computer network traffic datasets, we feel that Iterative Denoising can be a unifying technology for protection, detection, and response groups coordinating around a network security monitoring system.
Global Sensitivity Analysis of Predictor Models in Software Engineering
Authors: Stefan Wagner
Venue: Proceedings of the Third International Workshop on Predictor Models in Software Engineering (2007)

Predictor models are an important tool in software projects for quality and cost control as well as management. There are various models available that can help the software engineer in decision-making. However, such models are often difficult to apply in practice because of the amount of data needed. Sensitivity analysis offers provides means to rank the input factors w.r.t. their importance and thereby reduce and optimise the measurement effort necessary. This paper presents an example application of global sensitivity analysis on a software reliability model used in practice. It describes the approach and the possibilities offered.
Integration of the product realization process into engineering curricula
Authors: C. E. Przirembel, D. L. Evans, H. R. MacKenzie, C. W. Tan
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. One of the major reasons which has been given for the U.S. loss of global economic competitiveness is a perceived weakness in the design and manufacturing of competitive products. One significant step to rectify this problem is to effectively educate engineering graduates in the product realization process (PRP). For the purpose of this paper, PRP encompasses the full product life cycle, from customer needs, design and manufacturing, to eventual disposal or recycling of the product. The specific objective of this NSF project is to develop resource materials for engineering educators which will assist them to effectively integrate all aspects of PRP into appropriate engineering curricula. The project team consists of nationally recognized industry and university leaders in design education and practice.
Control system for precise power laser measurement
Authors: Jaroslav Kadlec, Radimir Vrba
Venue: Proceedings of the Second International Conference on Systems (2007)

This paper describes steps involved in a designing of a control system for precise power laser measurement. Main goal of this research consists in developing precise laser driver and measurement system for power laser measurement. This control system can be used in various type of measuring applications for instance measuring of distance, pressure and temperature. Control system allows precise driving of two different laser diodes independently on each other with measuring of emitting optical power and includes photodiode for power optical sensing
Cost-efficient multiplier-less FIR filter structure based on modified DECOR transformation
Authors: I-Hsien Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We propose a new design approach to implement an FIR filter using canonical sign digit (CSD) multipliers based on modified decorrelating transformation (MDECOR). The direct CSD approach will introduce serious quantization errors since the distribution of CSD numbers is very non-uniform. The proposed MDECOR transformation provides a systematic solution to reduce the dynamic range effectively. By combining the proposed MDECOR transformation followed by CSD quantization, we can avoid the aforementioned quantization problem. As a result, we do not need to employ additional non-zero bits to compensate for the distortion caused by direct CSD quantization, which helps to save the number of adders in VLSI implementations. Furthermore, the MDECOR transformation offers more freedom in the filter design. It can achieve high-precision performance under the same hardware complexity as the direct CSD approach. Our simulation results show that we can save 20% of the number of adders compared with the direct CSD approach.
Three-dimensional reconstruction of specular micro-surfaces in typical electronic manufacturing
Authors: Ronald Chi-Kit Chung
Venue:  (2006)

As the electronic industry advances rapidly, the dimensions of the semiconductor products keep on being shrunk and that leads to more stringent requirement on process control and quality assurance. In particular, area array packages like BGA, CSP, flip chips, wafer bumping and wafer-level packaging need to have the 3D quality of some micro-surfaces inspected accurately and efficiently. An example of the micro-surfaces is the solder bumps for direct die-to-die bonding, which are of size as small as 60 to 600 microns in diameter. However, the tiny size and often highly specular and textureless nature of the surfaces make the inspection difficult. In addition, the size of the inspection system is required to be small so as to minimize restraint, on the operation of the various moving parts involved in the manufacturing process. In this thesis, I propose a new methodology for reconstructing micro-surfaces in 3D. The mechanism is based upon the familiar concept of binary structured-light, projection, but adapted, for the purpose of greatly reducing the system size, from the traditional setup of an array of multiple light sources to one with a single light source. The mechanism consists of a single light source in combination with a binary grating for projecting a binary pattern onto the target surface, and of a camera for capturing image of the illuminated scene. By shifting the binary grating in space and in every drifting taking a separate image of the illuminated surface, each position on the illuminated surface will be attached with a string of binary code over the sequence of captured images. With a suitable design of the binary grating, the binary code string can be made unique for each bump surface position, allowing exact correspondence between the binary pattern and image data, and subsequently 3D determination through triangulation. With such a bright-or-dark world for each image position, the issues of image saturation, image noise, and textureless nature of the target surfaces are avoided. In the mechanism the inspection speed is governed by the number of needed images which also equals the number of spatial shiftings of the grating. This thesis also addresses how the grating, as well as its spatial shifting, can be designed optimally for minimizing this image number for faster inspection speed. An optimal solution to shifting strategy optimization is proposed that is applicable to any pattern on the fringe grating. A design method is also introduced for optimal pattern design, which has higher efficiency than brute-force searching. To reduce image number furthermore, bit-pairing codification mechanism and color-encoded pattern are proposed and verified to be more efficient. Experimental results with image data of a variety of objects have positively demonstrated the feasibility of the proposed methodology.
Teaching design while constructing a 100-watt audio amplifier
Authors: J. Joseph
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Juniors in their first semester take the first course in electronics viz. Electronics I. Gradually they are exposed to the concepts of design while learning about semiconductors, bipolar junction transistors, field effect transistors, and different types of amplifiers including class-B push-pull amplifiers. Three weeks before the end of the semester, they start designing a 100 watt audio amplifier. On completing the design, it is constructed using power transistors and other components. The amplifiers are evaluated by the instructor for power output and fidelity. During the whole process, students go through several additional cycles of learning which could not have been imparted in the typical recitation environment. This paper discusses those topics and the indirect reward the instructor receives while observing the students successfully complete their work. 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