ppxscal/embedding_network huggingface dataset:
Architectures and algorithms for video compression with a focus on affine motion
Authors: Roman Czeslaw Kordasiewicz
Venue:  (2007)

Video compression is a constantly evolving and diverse field of study, and with every passing day it is more prevalent in our daily lives through digital television and DVDs. As the technology matures along with the audience, there is an expectation of higher video quality, which inevitably leads to demands for better video compression standards. In this dissertation we address several ideas important for existing and future video compression standards. These ideas are approached from several dimensions; hardware architectures, theory, algorithms, and implementation. This varied approach is used to give a more complete picture of problems and possible solutions to improve video compression. We begin our discussion of possible ways to improve video compression, by first presenting area and speed constrained architecture designs of the transform and quantization blocks in H.264. These designs are implemented in programmable logic and in custom hardware. Moreover a programmable system on a chip design is also described and various synthesis results are analyzed and compared. Once hardware designs for an existing video standard are presented, we focus our attention on future video standards. This is done such that we can explore the theoretical and algorithmic problems of video compression. In the theoretical work, we begin by developing a mathematical relationship between affine motion vector quantization step sizes and difference macroblock energy. This relationship turns out to be quadratic in nature, and it is verified and analyzed. In addition, a video coder using affine motion vectors is modified to use our model, and as a result we attain a compression performance comparable to that obtained with limited exhaustive searching, but at a far smaller computational cost. Affine motion vector (AMV) quantization, is naturally followed by the discussion of AMV encoding. Since AMVs have six coefficients their encoding is different from the standard translational motion vector encoding. We extend the idea of a context-type and we define a context type simulation. With the use of this simulation we determine joint context-coder solutions, which are then implemented in a video coder and significant compression improvements are demonstrated. It is often difficult to compute the AMVs, and their quantization and encoding is complicated. That is why for the near future, affine motion based on translational motion estimation may be most likely implemented. To address this point, we develop affine motion prediction method based on translational motion vectors. This new prediction strategy has a low computational cost and its potential video quality improvement in high motion scenes is significant as it is demonstrated. To make this new prediction strategy practical, we address all of the important issues related to adapting this strategy in existing block based video coders.
PDST: a peer database simulation tool for data sharing systems
Authors: Md Mehedi Masud, lluju Kiringa
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

At present there are many simulation tools developed in order to simulate a peer-to-peer (P2P) system. All the tools are dedicated to P2P content distribution systems, simulate network systems for measuring the efficiency of the networks, and file sharing systems. In the last few years, steady progress has been made in research on various issues related to peer database systems. However, there is no software tool for evaluating a peer database system in a large P2P network. In this paper, we present a software tool that can simulate a peer database system in a large P2P network. The tool provides different facilities, for example, generates peers, databases with synthetic data, acquaintances, and mappings between peers. The tool also provides a general framework for executing queries and updates in a peer database system.
Novel Features for Automated Lung Function Diagnosis in Spontaneously Breathing Infants
Authors: Steffen Leonhardt, Vojislav Kecman
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

A comparative analysis of 14 classic and 23 novel mathematical features for diagnosing lung function in infants is presented. The data set comprises tidal breathing flow volume loops of 195 spontaneously breathing infants aged 3 to 24 months, with 9 known breathing problems (diseases). The data set is sparse. Diagnostic power was evaluated using support vector machines featuring both polynomial and Gaussian kernels in a rigorous experimental setting (100 runs for random splits of data into the training set (90% of data) and test set (10% of data)). Novel features achieve lower error rates than the old ones.
Automatic Recognition of Spontaneous Emotions in Speech Using Acoustic and Lexical Features
Authors: Khiet P. Truong, Stephan Raaijmakers
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

We developed acoustic and lexical classifiers, based on a boosting algorithm, to assess the separability on arousal and valence dimensions in spontaneous emotional speech. The spontaneous emotional speech data was acquired by inviting subjects to play a first-person shooter video game. Our acoustic classifiers performed significantly better than the lexical classifiers on the arousal dimension. On the valence dimension, our lexical classifiers usually outperformed the acoustic classifiers. Finally, fusion between acoustic and lexical features on feature level did not always significantly improve classification performance.
Ossabest: a comprehensive itest project for middle and high school teachers and students
Authors: Ashraf Saad, Lei He, Joy Reed, Edward Strauser, Patrick Hannigan
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

OssaBEST is a three-year NSF-funded project to prepare middle and high school teachers and students to use advanced information technologies and integrate them into daily classroom activities. The project comprises two information technology tracks, namely, a sensors track and a multimedia track. The activities and deliverables of both tracks are centered on Ossabaw Island, Georgia's third largest barrier island and the state's first heritage preserve. The ultimate goal of the project is to motivate and enable a larger number of students to pursue computing careers such as information technology, computer science or related science, technology, engineering and mathematics (STEM) fields.
A Generalised Entropy Based Associative Model
Authors: Masahiro Nakagawa
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In this paper, a generalised entropy based associative memory model will be proposed and applied to memory retrievals with analogue embedded vectors instead of the binary ones in order to compare with the conventional autoassociative model with a quadratic Lyapunov functionals. In the present approach, the updating dynamics will be constructed on the basis of the entropy minimization strategy which may be reduced asymptotically to the autocorrelation dynamics as a special case. From numerical results, it will be found that the presently proposed novel approach realizes the larger memory capacity even for the analogue memory retrievals in comparison with the autocorrelation model based on dynamics such as associatron according to the higher-order correlation involved in the proposed dynamics.
Quality of service in wireless LAN
Authors: Fozia Hameed, Imran Ahmad
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

The current Quality of Service (QoS) standard for wireless networks from the widely used 802.11e family is IEEE 802.11e. The scope of this standard is to enhance the existing 802.11 Media Access Control (MAC) so as to improve and manage QoS, to expand support for LAN applications with QoS requirements and provide classes of service. This standard also provides improvements in the capabilities and efficiency of the protocol. This paper presents a review on QoS in Wireless LAN. In this paper original 802.11 was discussed from QoS point of view. Methods, which are used to enhance QoS, are elaborated. Other features of 802.11e are pointed and QoS related standards are discussed.
Service identification and modeling for service oriented architecture applications
Authors: Min Je Cho, Hyung Rim Choi, Hyun Soo Kim, Soon Goo Hong, Yavuz Keceli, Jae Young Park
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

SOA (Service Oriented Architecture) is not a new concept, indeed it is a software design method which is the combination and enhanced version of various existing software methods. It is rapidly gaining ground, especially as a method to solve the common problems of software re-usability and inter-compatibility. For this reason, SOA is considered to be the optimum alternative for responding the new changes in the business environment. For the successful implementation of a SOA-based system, the composition of the services is essential, and service identification and modeling is the essential starting point of successful implementation of SOA systems. On the other hand, it is a fact that there are neither any standards nor standardized methods for business service modeling. Thus this study proposes a service identification and modeling method for deducting services that fit system purposes, and deducts actual services for agent-based purchase management systems.
A Dynamic Bayesian Network to Represent a Ripening Process of a Soft Mould Cheese
Authors: Cédric Baudrit, Pierre-Henri Wuillemin, Mariette Sicard, Nathalie Perrot
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Available knowledge to describe food processes has been capitalized from different sources, is expressed under different forms and at different scales. To reconstruct the puzzle of knowledge by taking into account uncertainty, we need to combine, integrate different kinds of knowledge. Mathematical concepts such that expert systems, neural networks or mechanistic models reach operating limits. In all cases, we are faced with the limits of available data, mathematical formalism and the limits of human reasoning. Dynamical Bayesian Networks (DBNs) are practical probabilistic graphic models to represent dynamical complex systems tainted with uncertainty. This paper presents a simplified dynamic bayesian networks which allows to represent the dynamics of microorganisms in the ripening of a soft mould cheese (Camembert type) by means of an integrative sensory indicator. The aim is the understanding and modeling of the whole network of interacting entities taking place between the different levels of the process.
Finite Matters
Authors: Lilja Øvrelid
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

This paper investigates the effect of a set of verbal features in data-driven dependency parsing of Swedish. Following an error analysis of a baseline parser, we show that the addition of information on verbal features such as tense and voice can give significant improvements over this baseline and, in particular, in the analysis of syntactic arguments. We furthermore show the importance of the binary property of finiteness for the parsing of Scandinavian and demonstrate that highly similar effects may be achieved with automatically acquired information.
Application of RBF Neural Network to Simplify the Potential Based Optimization
Authors: Kanjian Zhang, Chunbo Feng
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A policy iteration approach to optimal control problems for a class of nonlinear stochastic dynamic system is introduced. Some parameters and nonlinearities of the system are not required to be known a-priori. An optimality equation is developed based on performance potential. The potential can be estimated by a sample path, and then it is approximated by RBF neural network. As a result, an on-line algorithm is proposed by using a sample path of the given control system.
Emergence of the Academic Computing Clouds
Authors: Kemal A. Delic, Martin Anthony Walker
Venue: Ubiquity (2008)

Computational grids are very large-scale aggregates of communication and computation resources enabling new types of applications and bringing several benefits of economy-of-scale. The first computational grids were established in academic environments during the previous decade, and today are making inroads into the realm of corporate and enterprise computing. Very recently, we observe the emergence of cloud computing as a new potential super structure for corporate, enterprise and academic computing. While cloud computing shares the same original vision of grid computing articulated in the 1990s by Foster, Kesselman and others, there are significant differences. In this paper, we first briefly outline the architecture, technologies and standards of computational grids. We then point at some of notable examples of academic use of grids and sketch the future of research in grids. In the third section, we draw some architectural lines of cloud computing, hint at the design and technology choices and indicate some future challenges. In conclusion, we claim that academic computing clouds might appear soon, supporting the emergence of Science 2.0 activities, some of which we list shortly.
A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
Authors: S. Evangelista, C. Pajault, J. F. Pradat-Peyre
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows in ordinary Petri nets are well known, computing a generative family of positive flows in colored net remains an open problem. We propose in this paper a pragmatic approach that allows us to define an algorithm that computes a generative family of particular but useful positive flows in a large subclass of colored nets: the simple well-formed nets.
Simulating Mechanism of Brain Injury During Closed Head Impact
Authors: Omar Halabieh, Justin W. Wan
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

In this paper, we study the mechanics of the brain during closed head impact via numerical simulation. We propose a mathematical model of the human head, which consists of three layers: the rigid skull, the cerebrospinal fluid and the solid brain. The fluid behavior is governed by the Navier-Stokes equations, and the fluid and solid interact together according to the laws of mechanics. Numerical simulations are then performed on this model to simulate accident scenarios. Several theories have been proposed to explain whether the ensuing brain injury is dominantly located at the site of impact (coup injury) or at the site opposite to it (contrecoup injury). In particular, we investigate the positive pressure theory, the negative pressure theory, and the cerebrospinal fluid theory. The results of our numerical simulations together with pathological findings show that no one theory can explain the mechanics of the brain during the different types of accidents. We therefore highlight the accident scenarios under which each theory presents a consistent explanation of brain mechanics.
Rotating Capacitor and a Transient Electric Network
Authors: Haiduke Sarafian, Nenette Sarafian
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The authors designed a rotating parallel-plate capacitor; one of the plates is assumed to turn about the common vertical axis through the centers of the square plates. We insert this capacitor into a series with a resistor, forming a RC circuit. We analyze the characteristics of charging and discharging scenarios on two different parallel tracks. On the first track we drive the circuit with a DC power supply. On the second track, we drive the circuit with an AC source.The analyses of the circuits encounter non-linear differential equations. We format the underlying equations into their generic forms. We then apply Mathematica [1], NDSolve to solve them. This work is an example showing how with the help of Mathematica one is able to augment the scope of the traditional studies.
Curricula Modeling and Checking
Authors: Matteo Baldoni, Cristina Baroglio, Elisa Marengo
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this work, we present a constrained-based representation for specifying the goals of "course design", that we call curricula model, and introduce a graphical language, grounded into Linear Time Logic, to design curricula models which include knowledge of proficiency levels. Based on this representation, we show how model checking techniques can be used to verify that the user's learning goal is supplied by a curriculum, that a curriculum is compliant to a curricula model, and that competence gaps are avoided.
CWSC4EC: how to employ context, web service, and community in enterprise collaboration
Authors: Khouloud Boukadi, Chirine Ghedira, Sodki Chaari, Lucien Vincent, Emad Bataineh
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Web services are becoming an essential support for inter-enterprise collaborative business process. Nevertheless, in spite of the crucial progress in Web service technologies there is some shortage especially in the discovery and selection phase. In fact, Web services are selected based on functional criteria. But, in the case of business process collaboration there is a need to consider more pragmatic criteria such as context parameters. In this work we present a framework for collaboration process creation. It enables Web services selection based on contextual description. For this end, we present a novel categorization for the context suitable to the inter-enterprise collaboration. The context categorization is represented using a flexible and dynamic ontology-based model. In order to enhance Web service selection and to improve the manageability of a high number of Web services, we use the community concept in order to gather specific domain Web services. The presented framework uses abstract templates called Goal templates to insure an abstract description of required web services. Goal templates gather both functional and contextual parameters used to select suitable services.
Genetic Algorithm as a Tool for Stock Market Modelling
Authors: Urszula Markowska-Kaczmar, Halina Kwasnicka, Marcin Szczepkowski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The paper describes the model of virtual stock market which is evolved by a genetic algorithm. The model consists of cooperating Agents that imitate behaviour of real investors. They act on the virtual market buying or selling stocks. The aim of the model is to generate stocks prices on a virtual market that are similar to real ones for a short period of time. Each Agent is described by its unique characteristics which determine his performance. The details of the model are presented in the paper. The applied genetic algorithm is generic one. Its main components such as: an individual, genetic operators and fitness function are described here, as well. The results of experiments investigating the role of genetic algorithm parameters are presented in the paper. Agent's ability to predict the quotations values are presented and analysed. Future plans referring to the further development of the system are presented at the end of the paper.
Leveraging ubiquitous computing with a cognitive behavior modification strategy to improve the performance of students with emotional and behavioral disorders
Authors: Daniel J. Gulchak
Venue:  (2008)

The purpose of this study was to investigate the effects of self-monitoring math productivity and accuracy using a handheld computer on the performance and on-task behavior of students. Six students age 11-13 with emotional and behavioral disorders participated in the study. A single subject withdrawal design was employed with students, beginning intervention in pairs. Students were taught to self-correct their math work at the end of each session, then use a handheld computer to record and graph their performance. Two conditions were presented to the students: self-monitoring alone, and self-monitoring with reinforcement through an existing token economy system. Only one student made initial gains in performance when self-monitoring was used in isolation. However, when combined with reinforcement, all students demonstrated academic and behavioral improvements. The results indicated that students could successfully use a handheld computer to self-monitor their performance and this led to concurrent improvements in behavior. Implications for classroom teachers are discussed and future research with handheld computers is recommended. 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
A Novel Asynchronous Software Cache Implementation for the Cell-BE Processor
Authors: Jairo Balart, Marc Gonzalez, Xavier Martorell, Eduard Ayguade, Zehra Sura, Tong Chen, Tao Zhang, Kevin O'Brien, Kathryn O'Brien
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

This paper describes the implementation of a runtime library for asynchronous communication in the Cell BE processor. The runtime library implementation provides with several services that allow the compiler to generate code, maximizing the chances for overlapping communication and computation. The library implementation is organized as a Software Cache and the main services correspond to mechanisms for data look up, data placement and replacement, data write back, memory synchronization and address translation. The implementation guarantees that all those services can be totally uncoupled when dealing with memory references. Therefore this provides opportunities to the compiler to organize the generated code in order to overlap as much as possible computation with communication. The paper also describes the necessary mechanism to overlap the communication related to write back operations with actual computation. The paper includes the description of the compiler basic algorithms and optimizations for code generation. The system is evaluated measuring bandwidth and global updates ratios, with two benchmarks from the HPCC benchmark suite: Stream and Random Access.