ppxscal/embedding_network huggingface dataset:
MPEG: Achievements and Future Projects
Authors: Leonardo Chiariglione
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

A Standards group born in a largely unknown ISO subcommittee in charge of character coding succeeded in carrying the audio-visual industry from the analogue to the digital world. MPEG held its first meeting in May 1988 with an attendance of 15 participants and a single session. The typical attendance today is more than 12 times that number with multiple sessions and a web of joint meetings. MPEG standards are employed in such disparate equipment as Video CD and set the top boxes and used to send pictures and the audio over the Web od digitalaudio by radio. 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
Monitoring smartphones for anomaly detection
Authors: Aubrey-Derrick Schmidt, Frank Peters, Florian Lamour, Christian Scheel, Seyit Ahmet Çamtepe, Sahin Albayrak
Venue: Mobile Networks and Applications (2009)

In this paper we demonstrate how to monitor a smartphone running Symbian operating system and Windows Mobile in order to extract features for anomaly detection. These features are sent to a remote server because running a complex intrusion detection system on this kind of mobile device still is not feasible due to capability and hardware limitations. We give examples on how to compute relevant features and introduce the top ten applications used by mobile phone users based on a study in 2005. The usage of these applications is recorded by a monitoring client and visualized. Additionally, monitoring results of public and self-written malwares are shown. For improving monitoring client performance, Principal Component Analysis was applied which lead to a decrease of about 80% of the amount of monitored features.
A Prefetching Algorithm for Multi-speed Disks
Authors: Seung Woo Son, Mahmut Kandemir
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

Power consumption of disk based storage systems is becoming an increasingly pressing issue for both the commercial and the scientific application domains. Prior work proposed several hardware based approaches to reducing disk power consumption by making use of techniques such as spinning down idle disks and rotating them at lower speeds than the maximum speed possible. While such techniques are certainly very important, it is also critical to consider the influence the software can exercise in shaping the power consumption of disk-intensive application programs. Motivated by this observation, the main goal of this work is to study whether an optimizing compiler can be used for increasing the power benefits that could be obtained from multi-speed disks. Specifically, we propose and experimentally evaluate a compiler-directed energy-aware data prefetching scheme for scientific applications that process disk-resident data sets. This scheme automatically determines the prefetch distances for all disk access instructions, the disk speeds to be employed, and the associated disk layouts (striping parameters) in a unified setting. We implemented the proposed approach within an optimizing compiler framework and conducted experiments with several disk-intensive applications. Our experimental evaluation shows that the proposed approach brings significant reductions in disk energy consumption over a state-of-the-art software-based I/O prefetching mechanism that does not take into account energy consumption explicitly. Our results also show that the energy-aware prefetching scheme does not bring any extra performance penalties and the energy reductions achieved are consistent across a wide spectrum of values of the simulation parameters. We also show that our scheme can be extended to multiple application scenarios using a hierarchical disk layout determination.
Performance comparison of two virtual machine scenarios using an HPC application: a case study using molecular dynamics simulations
Authors: Anand Tikotekar, Hong Ong, Sadaf Alam, Geoffroy Vallée, Thomas Naughton, Christian Engelmann, Stephen L. Scott
Venue: Proceedings of the 3rd ACM Workshop on System-level Virtualization for High Performance Computing (2009)

Obtaining high flexibility to performance-loss ratio is a key challenge of today's HPC virtual environment landscape. And while extensive research has been targeted at extracting more performance from virtual machines, the idea that whether novel virtual machine usage scenarios could lead to high flexibility Vs performance trade-off has received less attention. We, in this paper, take a step forward by studying and comparing the performance implications of running the Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) application on two virtual machine configurations. First configuration consists of two virtual machines per node with 1 application process per virtual machine. The second configuration consists of 1 virtual machine per node with 2 processes per virtual machine. Xen has been used as an hypervisor and standard Linux as a guest virtual machine. Our results show that the difference in overall performance impact on LAMMPS between the two virtual machine configurations described above is around 3%. We also study the difference in performance impact in terms of each configuration's individual metrics such as CPU, I/O, Memory, and interrupt/context switches.
Video News Retrieval Incorporating Relevant Terms Based on Distribution of Document Frequency
Authors: Jun-Bin Yeh, Chung-Hsien Wu
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper presents an approach to video news retrieval within an event by integrating visual and textual features. A set of histogram bins of key frames in a shot is adopted as the visual feature, while the term frequency is used as the textual feature. A term scoring method is proposed to enhance the weights of relevant terms in an event by considering the windowed document frequency distribution. The weight for a given term is determined by mean of the difference between usual and unusual term groups which are quantized by the boxplot method. The first experiment evaluate the performance of the proposed method by giving generated document frequency distributions, while the second experiment gives the desired retrieval results for relevant terms in the real data. It concludes the proposed method can increase the performance of retrieving video news stories within an event using relevant terms.
Simple Mobile Services for IMS
Authors: Andrea Polidoro, Stefano Salsano, Giovanni Bartolomeo
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

In this paper we present an open source platform for mobile services execution and creation that has been ported to work into the IMS architecture. The platform has been developed in the context of the Simple Mobile Services research project and it includes a mobile client called MOVE (Mobile Open and Very Easy) developed using the Java 2 Micro Edition (J2ME) platform. The paper describes the features of the service execution/creation platforms, then it shortly introduces the IMS (IP Multimedia Subsystem), finally it describes the process of porting the Simple Mobile Services architectural elements into the IMS architecture
Foundations of Exact Rounding
Authors: Chee K. Yap, Jihun Yu
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

Exact rounding of numbers and functions is a fundamental computational problem. This paper introduces the mathematical and computational foundations for exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.
Plenary lecture I: a performance analysis of some new Goeken-Johnson methods versus the classical Runge-Kutta methods
Authors: Adrian Ionescu
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The autonomous ordinary differential equation initial-value problems are traditionally solved numerically by using the Runge-Kutta methods. These methods perform multiple evaluations of the function. A few years ago, some new Runge-Kutta methods are introduced by Goeken & Johnson, in which the user will evaluate both the function and derivative. We compare the classical Runge-Kutta methods of orders 3, 4 and 5, and the corresponding new Goeken-Johnson methods. These results (for performance and accuracy) indicate that the new methods are at least comparable if not better than the classical methods.
Omnidirectional edge detection
Authors: Sayed Kamaledin Ghiasi Shirazi, Reza Safabakhsh
Venue: Computer Vision and Image Understanding (2009)

In this paper we propose a new method for extending 1-D step edge detection filters to two dimensions via complex-valued filtering. Complex-valued filtering allows us to obtain edge magnitude and direction simultaneously. Our method can be viewed either as an extension of n-directional complex filtering of Paplinski to infinite directions or as a variant of Canny's gradient-based approach. In the second view, the real part of our filter computes the gradient in the x direction and the imaginary part computes the gradient in the y direction. Paplinski claimed that n-directional filtering is an improvement over the gradient-based method, which computes gradient only in two directions. We show that our omnidirectional and Canny's gradient-based extensions of the 1-D DoG coincide. In contrast to Paplinski's claim, this coincidence shows that both approaches suffer from being confined to the subspace of two 2-D filters, even though n-directional filtering hides these filters in a single complex-valued filter. Aside from these theoretical results, the omnidirectional method has practical advantages over both n-directional and gradient-based approaches. Our experiments on synthetic and real-world images show the superiority of omnidirectional and gradient-based methods over n-directional approach. In comparison with the gradient-based method, the advantage of omnidirectional method lies mostly in freeing the user from specifying the smoothing window and its parameter. Since the omnidirectional and Canny's gradient-based extensions of the 1-D DoG coincide, we have based our experiments on extending the 1-D Demigny filter. This filter has been proposed by Demigny as the optimal edge detection filter in sampled images.
Boosting selection of speech related features to improve performance of multi-class SVMs in emotion detection
Authors: Halis Altun, Gökhan Polat
Venue: Expert Systems with Applications: An International Journal (2009)

This paper deals with the strategies for feature selection and multi-class classification in the emotion detection problem. The aim is two-fold: to increase the effectiveness of four feature selection algorithms and to improve accuracy of multi-class classifiers for emotion detection problem under different frameworks and strategies. Although, a large amount of research has been conducted to determine the most informative features in emotion detection, it is still an open problem to identify reliably discriminating features. As it is believed that highly informative features are more critical factor than classifier itself, recent studies have been focused on identifying the features that contribute more to the classification problem. In this paper, in order to improve the performance of multi-class SVMs in emotion detection, 58 features extracted from recorded speech samples are processed in two new frameworks to boost the feature selection algorithms. Evaluation of the final feature sets validates that the frameworks are able to select more informative subset of the features in terms of class-separability. Also it is found that among four feature selection algorithms, a recently proposed one, LSBOUND, significantly outperforms the others. The accuracy rate obtained in the proposed framework is the highest achievement reported so far in the literature for the same dataset.
Generalized convolution for extraction of image features in the primary domain
Authors: Przemyslaw Korohoda, Adam Dabrowski
Venue: Machine Graphics Vision International Journal (2008)

In this paper, a class of techniques for flexible extraction of image features is proposed. These techniques are based on the convolution type filtering in the primary domain. The mentioned flexibility results from the fact that any discrete transform suitable for the analysis of desired image features (as, e.g., the Karhunen-Loeve transform) may be designed and the filter with the assumed transform-domain properties may be applied straightforwardly in the image (i.e., primary) domain. The proposed solution creates an entirely new approach to image filtering. After recalling the concept referred to by the authors as generalized convolution and extending it to the 2-dimensional case, the theoretical results are illustrated with several examples based on filtering of the test image with filters designed in the Haar, Hadamard and the DCT II domains. Finally, it is explained how the proposed approach indicates several possible ways for further developments towards the design of image-and-feature based tools.
Framed Versus Unframed Two-Dimensional Languages
Authors: Marcella Anselmo, Natasha Jonoska, Maria Madonia
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

In this paper we study a class of factor-closed tiling recognizable languages (FREC) that corresponds to certain symbolic dynamical systems called sofic subshifts. This class of languages is a subclass of the two-dimensional class of tiling recognizable languages, denoted REC. Differently from REC, languages in FREC can be recognized without framing pictures with a special boundary symbol. We study (un)ambiguity properties of FREC in comparison to the ones in REC. We show that a frame surrounding each block provides additional memory that can enforce the size and the content of pictures and can change (un)ambiguity properties. Consequently, we propose several variations of "unambiguity" for languages in FREC which may be better suited to understand this class.
A cognitive model for structuring an introductory programming curriculum
Authors: Charles B. Kreitzberg, Len Swanson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

From its inception the electronic digital computer has been involved in education, although its role has been the subject of some debate. Academically, the computer has been used as a device for conducting or augmenting instruction, as a calculating device adjunctive to courses in engineering and the sciences, and most recently as an object for study in its own right. Increasing attention is now being focused on undergraduate training in computer use, partly as a result of the recommendation of the President's Science Advisory Committee that computing education be provided to all college undergraduates. We can expect that the number of students who undertake incidental study of programming as a part of their undergraduate curricula will continue to increase rapidly.
Flexible estimation of wage distributions in the presence of covariates
Authors: Antonia Febrer, Juan Mora
Venue: Computational Statistics Data Analysis (2009)

An estimator of conditional wage distributions based on a piecewise-linear specification of the conditional hazard function is proposed. Under a minimal set of assumptions, the estimator is flexible enough to capture almost any underlying relationship, and is not affected by the curse of dimensionality. It also allows us to derive estimates of the conditional Lorenz curves and Gini indices. The methodology is used to investigate the wage trends in Spain in 1994-1999. The estimation results provide evidence that there has been strong decreases in both the returns to schooling and the inequality indices for workers with low levels of experience; these decreases may partly be explained by the ''overeducation'' phenomenon, which intensified in this period.
Flexible quantile-based modeling of bivariate financial relationships: The case of ROA ratio
Authors: Javier De Andrés, Manuel Landajo, Pedro Lorca
Venue: Expert Systems with Applications: An International Journal (2009)

Ratios used in financial analysis suffer from several drawbacks, and the tools - ranging from linear least-squares regressions to neural networks - suggested as alternatives also have serious disadvantages. We propose an alternative approach, based on quantile regression techniques, which exploits financial information in a more efficient way, not achievable by conventional tools. Our proposal is applied to the ROA (return on assets) ratio, this being one of the most popular ratios among both economic analysts and researchers. An empirical analysis is carried out on real data. Results indicate that the quantile approach provides a more accurate assessment of the financial position of the firm.
Clock power reduction for virtex-5 FPGAs
Authors: Qiang Wang, Subodh Gupta, Jason H. Anderson
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Clock network power in field-programmable gate arrays (FPGAs) is considered and two complementary approaches for clock power reduction in the Xilinx Virtex-5 FPGA are presented. The approaches are unique in that they leverage specific architectural aspects of Virtex-5 to achieve reductions in dynamic power consumed by the clock network. The first approach comprises a placement-based technique to reduce interconnect resource usage on the clock network, thereby reducing capacitance and power (up to 12%). The second approach borrows the "clock gating" notion from the ASIC domain and applies it to FPGAs. Clock enable signals on flip-flops are selectively migrated to use the dedicated clock enable available on the FPGA's built-in clock network, leading to reduced toggling on the clock interconnect and lower power (up to 28%). Power reductions are achieved without any performance penalty, on average.
Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games
Venue: Network and System Support for Games (2008)

The 2008 Workshop on Network and Systems Support for Games (NetGames) is the seventh in a series of successful events. Since 2002, NetGames has brought together researchers and developers from academia and industry to present new research in understanding current network games, enabling the next generation of network games. NetGames has a tradition of being a true workshop with lively discussion and active participation from all attendees. The NetGames 2008 call for papers attracted 31 submissions. Each submission was carefully reviewed by at least three members of the Technical Program Committee. The reviewing process led to the acceptance of 15 papers (48%). The papers were arranged for presentation into 5 sessions in the following areas: Cheat Detection, Peer-to-Peer, Massively Multiplayer Online Games, Architectures, and Bandwidth and Latency Reduction. There were also 5 papers accepted as posters for inclusion in an interactive poster session. The 2008 workshop was held at in Worcester, Massachusetts, USA. Worcester Polytechnic Institute (WPI) hosted with cooperation from ACM SIGCOMM and ACM SIGMM.
A PSP-Kalman Receiver for Space-Time Trellis Coded OFDM Systems over Time-Varying Block Fading Channels
Authors: Der-Feng Tseng, Chia-Ming Lee
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Space-time trellis coding systems employing orthogonal frequency division multiplexing technique over frequency-selective channels is considered, where fading gains vary within a frame interval. The channel time-evolution of each sub-carrier is modeled by an autoregressive process, while the receiver utilizing a recursive technique combining Kalman filtering with per-survivor processing is studied.
Goal-Oriented Requirements Communication in New Product Development
Authors: Samuel Fricker, Tony Gorschek, Martin Glinz
Venue: Proceedings of the 2008 Second International Workshop on Software Product Management (2008)

Product development organizations often distribute the responsibilities for requirements engineering over several roles. The collaboration of product management, concerned with market needs, and product development, concerned with the technological aspects of a product, is well established. Such shared responsibility provides advantages in the utilization of specific knowledge, skills, and resources. However, the collaboration leads to increased demands on coordination. Novel concepts and models need to be investigated to support such collaborative requirements engineering. In this paper we focus on requirements communication from product management to a development team by proposing and evaluating the model of goal-oriented requirements communication. The model explains how efficiency and effectiveness of requirements communication can be increased and allows the utilization of established requirements engineering knowledge in a new way to address the task of requirements communication.
An Application of Linear Codes to the Problem of Source Coding with Partial Side Information
Authors: Shigeaki Kuzuoka
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper clarifies the adequacy of the linear channel coding approach for the source coding with partial side information at the decoder. A sufficient condition for an ensemble of linear codes which achieves the Wyner's bound is given. Our result reveals that, by combining a good lossy code, an LDPC code ensemble gives a good code for source coding with partial side information at the decoder.
Building more robust multi-agent systems using a log-based approach
Authors: Amy Unruh James Bailey, Kotagiri Ramamohanarao
Venue: Web Intelligence and Agent Systems (2009)

In an agent system, the ability to handle problems and recover from them is important in sustaining stability and providing robustness. We claim that execution logging is essential to support agent system robustness, and that agents should have architectural-level support for logging and recovery methods. We describe an infrastructure-level, default methodology for agent problem-handling, based on logging, and supported by declaratively encoding domain-specific knowledge related to changes in goal status and semantic compensations. Via logging, the approach allows repair of already-completed as well as current goals. We define a language, APLR, to support and constrain incremental specification of problem-handling information, with the agents' problem-handling behaviour increasing in sophistication as more knowledge is added to the system. The approach is implemented by mapping the methodology and domain knowledge to 3APL-like plan rules extended to support logging.