ppxscal/embedding_network huggingface dataset:
Highly Efficient Face Detection in Color Images
Authors: Tse-Wei Chen, Chi-Sun Tang, Shao-Yi Chien
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

A highly efficient algorithm for image-based face detection is proposed in this paper, whose features include a fast and regular search method, a local histogram equalization of face candidates, and a frontal face classifier. Experimental results show that the proposed algorithm works efficiently with different types of images. Besides, the average detection rate is 92%, and the required execution time is about 90ms/frame.
Remarks on a cyclotomic sequence
Authors: Wilfried Meidl
Venue: Designs, Codes and Cryptography (2009)

We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al. (IEEE Trans Inforem Theory 51: 1849---1853, 2005). First we determine the linear complexity of a natural generalization of this binary sequence to arbitrary prime fields. Secondly we consider k-error linear complexity and autocorrelation of these sequences and point out certain drawbacks of this construction. The results show that the parameters for the sequence construction must be carefully chosen in view of the respective application.
A Topic Modeling Approach and Its Integration into the Random Walk Framework for Academic Search
Authors: Jie Tang, Ruoming Jin, Jing Zhang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In this paper, we propose a unified topic modeling approach and its integration into the random walk framework for academic search. Specifically, we present a topic model for simultaneously modeling papers, authors, and publication venues. We combine the proposed topic model into the random walk framework. Experimental results show that our proposed approach for academic search significantly outperforms the baseline methods of using BM25 and language model, and those of using the existing topic models (including pLSI, LDA, and the AT model).
In polite company: rules of play in five Facebook games
Authors: Elizabeth Losh
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Applications developed for the popular social network site Facebook frequently take the form of online games, but designers need to consider the conventions governing politeness, aggression, reciprocity, and obligation carefully in both online and face-to-face communities when structuring the rules of game play in the context of highly formalized and conceptualized social networks. In particular, the combination of egalitarian mechanisms for "friending" across generational and class lines and extremely hierarchical systems of ranking on leaderboards among particular cohorts can make it a challenging environment for creating sustained and synergistic game play.
Slot allocation algorithms in centralized scheduling scheme for IEEE 802.16 based wireless mesh networks
Authors: Shenghai Liu, Suili Feng, Wu Ye, Hongcheng Zhuang
Venue: Computer Communications (2009)

In IEEE 802.16 based wireless mesh networks (WMNs), TDMA (Time Division Multiple Access) is employed as the channel access method and only TDD (Time Division Duplex) is supported and there are no clearly separate downlink and uplink subframes in the physical frame structure. As the uplink and downlink traffic has different characteristics in that the uplink traffic decentralizes in each MSS (Mesh Subscriber Station) and the downlink traffic centralizes in the MBS (Mesh Base Station), different scheduling methods should be taken in the uplink and downlink. This paper presents a uniform slot allocation algorithm which is suitable for both uplinks and downlinks. To achieve higher spatial reuse and greater throughput and to avoid switching frequently between receiving and transmitting within two adjacent time slots when a relay node forwards traffic, different link selection criteria are taken into account when allocating slots for uplinks and downlinks. A combined uplink and downlink slot allocation algorithm is proposed for further improving the spatial reuse and network throughput. The proposed algorithms are evaluated by extensive simulations and the results show that it has good performance in terms of spatial reuse and network throughput. To the best of the authors' knowledge, this work is the first one that considers combined uplink and downlink slot allocation on the centralized scheduling scheme in IEEE 802.16 based WMNs.
Efficient Method to Generate an Energy Efficient Schedule Using Operation Shuffling
Authors: Yuki Kobayashi, Murali Jayapala, Praveen Raghavan, Francky Catthoor, Masaharu Imai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Clustering L0 buffers is effective for energy reduction in the instruction memory caches of embedded VLIW processors. However, the efficiency of the clustering depends on the schedule of the target application. For improving the energy efficiency of L0 clusters, an operation shuffling is proposed, which explores assignment of operations for each cycle, generates various schedules, and evaluates them to find an energy efficient schedule. This approach can find energy efficient schedules, however, it takes a long time to obtain the final result. In this paper, we propose a new method to directly generate an energy efficient schedule without iterations of operation shuffling. In the proposed method, a compiler schedules operations using the result of the single operation shuffling as a constraint. We propose some optimization algorithms to generate an energy efficient schedule for a given L0 cluster organization. The proposed method can drastically reduce the computational effort since it performs the operation shuffling only once. The experimental results show that comparable energy reduction is achieved by using the proposed method while the computational effort can be reduced significantly over the conventional operation shuffling.
A congruence rule format for name-passing process calculi
Authors: Marcelo Fiore, Sam Staton
Venue: Information and Computation (2009)

We introduce a GSOS-like rule format for name-passing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a natural behavioural equivalence-a form of open bisimilarity-is a congruence.
Tracking by an Optimal Sequence of Linear Predictors
Authors: Karel Zimmermann, Jiří Matas, Thomáš Svoboda
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We propose a learning approach to tracking explicitly minimizing the computational complexity of the tracking process subject to user-defined probability of failure (loss-of-lock) and precision. The tracker is formed by a Number of Sequences of Learned Linear Predictors (NoSLLiP). Robustness of NoSLLiP is achieved by modeling the object as a collection of local motion predictors - object motion is estimated by the outlier-tolerant Ransac algorithm from local predictions. Efficiency of the NoSLLiP tracker stems from (i) the simplicity of the local predictors and (ii) from the fact that all design decisions - the number of local predictors used by the tracker, their computational complexity (i.e. the number of observations the prediction is based on), locations as well as the number of Ransac iterations are all subject to the optimization (learning) process. All time-consuming operations are performed during the learning stage - tracking is reduced to only a few hundreds integer multiplications in each step. On PC with 1xK8 3200+, a predictor evaluation requires about 30 microseconds. The proposed approach is verified on publicly-available sequences with approximately 12000 frames with ground-truth. Experiments demonstrates, superiority in frame rates and robustness with respect to the SIFT detector, Lucas-Kanade tracker and other trackers.
Theoretical Analysis of Bit Error Probability for 4-State Convolutional Code with Max-Log MAP Decoding
Authors: Hideki Yoshikawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, a theoretical analysis of bit error probability for 4-state convolutional code with Max-Log-maximum a posteriori probability (MAP) decoding is presented. This technique employs an iterative calculation of probability density function of the state metric per one transition, and gives the exact bit error probability for all signal-to-noise power ratio.
Research and design of test question database management system based on the three-tier structure
Authors: Aimin Yang, Junping Wu, Lixia Wang
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

With the further development of computer and network technology, the test question database on the network has been gradually applied in schools and universities, which positively reduces the work volume of teachers and demonstrates a proper way to test students. This paper will introduce a design method of test question database management system based on the three-tier B/S structure, analyze the features of the test question database structure, and expatiate the grouping algorithmic calculation focusing on the main control parameters of knowledge points and question type data. The application of this system not only improves the work efficiency of teachers, but also positively boosts the teaching reform.
Combining evolutionary and stochastic gradient techniques for system identification
Authors: Konstantinos Theofilatos, Grigorios Beligiannis, Spiridon Likothanassis
Venue: Journal of Computational and Applied Mathematics (2009)

In the present contribution, a novel method combining evolutionary and stochastic gradient techniques for system identification is presented. The method attempts to solve the AutoRegressive Moving Average (ARMA) system identification problem using a hybrid evolutionary algorithm which combines Genetic Algorithms (GAs) and the Least Mean Squares LMS algorithm. More precisely, LMS is used in the step of the evaluation of the fitness function in order to enhance the chromosomes produced by the GA. Experimental results demonstrate that the proposed method manages to identify unknown systems, even in cases with high additive noise. Furthermore, it is observed that, in most cases, the proposed method finds the correct order of the unknown system without using a lot of a priori information, compared to other system identification methods presented in the literature. So, the proposed hybrid evolutionary algorithm builds models that not only have small MSE, but also are very similar to the real systems. Except for that, all models derived from the proposed algorithm are stable.
Distributed network and multiprocessing minicomputer state-of-the-art capabilities
Authors: Douglas J. Theis
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Today's minicomputer and midicomputer state-of-the-art provides two basic types of capabilities for users to evaluate for their applications. The two categories are: &bull; Distributed Networking Systems &bull; Multiprocessing Architectures with High Speed Busses, Shared Main Memory and Shared Disk Systems
A robust scheme for distributed speech recognition over loss-prone packet channels
Authors: Angel M. Gómez, Antonio M. Peinado, Victoria Sánchez, Jose L. Carmona
Venue: Speech Communication (2009)

In this paper, we propose a whole recovery scheme designed to improve robustness against packet losses in distributed speech recognition systems. This scheme integrates two sender-driven techniques, namely, media-specific forward error correction (FEC) and frame interleaving, along with a receiver-based error concealment (EC) technique, the weighted Viterbi algorithm (WVA). Although these techniques have been already tested separately, providing a significant increase of performance in clean acoustic environments, in this paper they are jointly applied and their performance in adverse acoustic conditions is evaluated. In particular, a noisy speech database and the ETSI Advanced Front-end are used, while the dynamic features, which play an important role in adverse acoustic environments, and their confidences for the WVA algorithm are examined. In order to solve the issue of mixing two sender-driven techniques (both causing a delay) whose direct composition causes an increase of the global latency, we propose a double stream scheme which limits the latency to the maximum delay of both techniques. As a result, with very few overhead bits and a very limited delay, the integrated scheme achieves a significant improvement in the performance of a DSR system over a degraded transmission channel, both in clean and noisy acoustic conditions.
Is There a Market for Web Services?
Authors: Christine Legner
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Web services are expected to foster the creation of networks of specialists which expose their digital services over the internet for the dynamic discovery of services by other organizations. Given this vision, the question arises whether and how Web services will be traded in the future. Based on a longitudinal study of commercial Web services directories and registries, this paper analyzes the market structure, the role of intermediaries and the Web services offering. The study suggests that the Web services market faces a rather slow evolution with a significant shakeout in 2006. More recently, an increasing professionalization can be observed given that commercial Web services specialists emerge and Web services directories are relaunched. The paper draws conclusions on the future market development and discusses analogies to the newer mashup-oriented service directories.
Creating a multi-discipline gaming curriculum: avoiding mistakes, missteps, and growing pains
Authors: Paul Diefenbach
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

While the number of game development programs has grown drastically over the past 5 years, there is still relatively little information on the development and rapid growth of these programs. At Drexel University, game development has grown from a few unrelated, area-specific courses to now be a truly multi-discipline, multi-course sequence which unifies the foundation skills of several departments and colleges across the university. Yet there have been numerous challenges and changes during the 4-year creation of this sequence. This paper documents the growth of our program and the problems that we encountered and our solutions for addressing them in a hope to provide a roadmap for other institutions.
Liuliu Pangpang
Authors: Yachi Peng, Maowei Yu, Woo sok Jang, Sue Gyeong Syn, SeungJoo Kim
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

Liuliu Pangpang is an interactive optical illusion. A projected floor dynamically tilts like a see-saw in different directions when people interact with it. Balls on the floor move according to natural physical laws. The floor's directions and angles are influenced by the locations and numbers of viewers. The game-like environment encourages viewers to explore body movements and interact with each other. For more information: deproject.com/liupang
Optical matrix elements in tight-binding approach of hydrogenated Si nanowires
Authors: A. Miranda, R. Vázquez, A. Díaz-Méndez, M. Cruz-Irisson
Venue: Microelectronics Journal (2009)

The dependence of the imaginary part of the dielectric function on the quantum confinement within two different schemes: intra-atomic and interatomic optical matrix elements are applied and compared. The optical spectra of Si nanowires are studied by means of a semi-empirical sp3s* tight-binding supercell model. The surface dangling bonds are passivated by hydrogen atoms. The results show that although the intra-atomic matrix elements are small in magnitude, the interference between these terms and the interatomic matrix elements contributes with nearly 25% of the total absorption. Thus, a quantitative treatment of nanostructures may not be possible without the inclusion of intra-atomic matrix elements.
Perl Fundamentals, 1 Pap/Dvdr edition
Authors: Peter J. Scott
Venue:  (2009)

Perl Fundamentals Peter Scott The Basic Elements of Perl Every Developer Should Learn 4+ Hours of Video Instruction In this unique video package, renowned Perl author and speaker Peter Scott takes you through the fundamental elements of the Perl 5 language so that you have a strong foundation for creating robust Perl programs and learning more advanced aspects of the language. Even if youve never run a Perl program before, youll learn what you need to know to get started on every popular platform. Scott advances through the language in a logical progression, from the basics of printing strings to the use of regular expressions for pattern matching and text manipulation. In between, he covers the core components of the language, demonstrating through many examples exactly how each one works. In the final lesson, he shows the power of Perls objects and modules for writing web programs. A uniquely valuable aspect of this video is Scotts demonstrations of many common pitfalls and how to avoid them. Youll learn a carefully crafted subset of the language that enables you to create powerful, robust programs while avoiding the traps that can result from learning Perl in the wrong sequence. These practical, easy-to-use videos allow you to get the multimedia experience of a live instructor at your own pacewhenever you want. You get the benefit of Scotts expertise as a decade-long Perl trainer and author of Perl Medic and Perl Debugged at your fingertips, so you can get started on mastering Perl. After a few hours with this DVD, you will be gaining entry into the market of thousands of jobs managing millions of lines of Perl, the worlds most popular scripting language. Looking for a better way to master todays rapidly changing technologies? Want expert help, but dont have the time or energy to read a book? Cant find classroom training worth the money? Discover LiveLessons: self-paced, personal video instruction from the worlds leading experts. LiveLessons are video courses, on DVD with a book supplement, that are organized into bite-sized, self-contained sessionsyoull learn key skills in as little as 15 minutes! Each session begins with well-defined learning objectives so you know exactly what you will learn in the lesson. Follow along as your instructor shows exactly how to get great results in your real-world environment. Peter Scott is the author of Perl Medic (2004) and Perl Debugged (2001), both from Addison-Wesley. A graduate of Cambridge University and former Jet Propulsion Laboratory developer, hes been a Perl trainer since 1998 and taught Perl at top institutions as well as at prominent conferences such as the Open Source Conference and Software Development Expo. He lives in the Pacific Northwest with his wife Grace, two cats, and a loud parrot, and enjoys kayaking. System Requirements Operating System: Windows 98, 2000, XP, Vista, or Mac OS X Multimedia: DVD drive, 1280 x 960 or higher display, and sound card with speakers Computer: 500MHz or higher, 128MB RAM or more
Model-Driven Integration and Management of Data Access Objects in Process-Driven SOAs
Authors: Christine Mayr, Uwe Zdun, Schahram Dustdar
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

In most process-driven and service oriented architectures (SOA), services need to access data stored in a database using database transactions. This is typically done using Data Access Objects (DAOs), but so far the integration of the business process, service, and DAO concepts is not well defined. As a consequence, when the number of services in a SOA grows, the number of DAOs can increase considerably and become hard to manage. In addition to this technical issue, business processes have to be highly adaptable to both functional and technical requirements. We propose a model-driven approach for integrating and managing DAOs in process-driven SOAs. We present a set of models providing different views tailored to the requirements of various stakeholders, such as business experts, database designers, database developers, etc. In process-driven SOAs, process activities running in a process-engine invoke services. We adapt these process flows to model a sequence of DAOs within a service. A DAO repository is used to manage DAOs more efficiently and to improve software reuse in database transaction development. The repository provides functionalities to create, update, retrieve, and delete database transactions. As our view-based models can flexibly be adapted to project requirements, our approach also aims at enhancing maintainability and increasing software development productivity.
Workflows and e-Science: An overview of workflow system features and capabilities
Authors: Ewa Deelman, Dennis Gannon, Matthew Shields, Ian Taylor
Venue: Future Generation Computer Systems (2009)

Scientific workflow systems have become a necessary tool for many applications, enabling the composition and execution of complex analysis on distributed resources. Today there are many workflow systems, often with overlapping functionality. A key issue for potential users of workflow systems is the need to be able to compare the capabilities of the various available tools. There can be confusion about system functionality and the tools are often selected without a proper functional analysis. In this paper we extract a taxonomy of features from the way scientists make use of existing workflow systems and we illustrate this feature set by providing some examples taken from existing workflow systems. The taxonomy provides end users with a mechanism by which they can assess the suitability of workflow in general and how they might use these features to make an informed choice about which workflow system would be a good choice for their particular application.
Dynamic prediction of collection yield for managed runtimes
Authors: Michal Wegiel, Chandra Krintz
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers and include managed runtime environments (MREs). In this paper, we investigate techniques to improve cooperation between these layers and the hardware to increase the efficacy of automatic memory management in MREs. General-purpose MREs commonly implement parallel and/or concurrent garbage collection and employ compaction to eliminate heap fragmentation. Moreover, most systems trigger collection based on the amount of heap a program uses. Our analysis shows that in many cases this strategy leads to ineffective collections that are unable to reclaim sufficient space to justify the incurred cost. To avoid such collections, we exploit the observation that dead objects tend to cluster together and form large, never-referenced, regions in the address space that correlate well with virtual pages that have not recently been referenced by the application. We leverage this correlation to design a new, simple and light-weight, yield predictor that estimates the amount of reclaimable space in the heap using hardware page reference bits. Our predictor allows MREs to avoid low-yield collections and thereby improve resource management. We integrate this predictor into three state-of-the-art parallel compactors, implemented in the HotSpot JVM, that represent distinct canonical heap layouts. Our empirical evaluation, based on standard Java benchmarks and open-source applications, indicates that inexpensive and accurate yield prediction can improve performance significantly.