ppxscal/embedding_network huggingface dataset:
Prototyping Interactive and Personalized IPTV-Services on Top of Open IMS Infrastructures
Authors: Oliver Friedrich, Robert Seeliger, Adel Al-Hezmi, Christian Riede, Stefan Arbanowski
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

In this paper a proof of concept infrastructure for the delivery of standardized IMS-based IPTV services driven by the IPTV enabled Open IMS Playground at Fraunhofer FOKUS will be presented. The so called Media Interoperability Lab represents one of the world's first real world test beds for these kind of services. This has been achieved by actively guiding the different SDOs work with a focus on ETSI TISPAN. On top of this framework different personalized and interactive services have been implemented to show the predominance and advantages of IMS-based IPTV solutions compared to other mainly black box approaches.
OpenMP-based parallelization on an MPCore multiprocessor platform - A performance and power analysis
Authors: H. Blume, J. von Livonius, L. Rotenberg, T. G. Noll, H. Bothe, J. Brakensiek
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

In this contribution, the potential of parallelized software that implements algorithms of digital signal processing on a multicore processor platform is analyzed. For this purpose various digital signal processing tasks have been implemented on a prototyping platform i.e. an ARM MPCore featuring four ARM11 processor cores. In order to analyze the effect of parallelization on the resulting performance-power ratio, influencing parameters like e.g. the number of issued program threads have been studied. For parallelization issues the OpenMP programming model has been used which can be efficiently applied on C-level. In order to elaborate power efficient code also a functional and instruction level power model of the MPCore has been derived which features a high estimation accuracy. Using this power model and exploiting the capabilities of OpenMP a variety of exemplary tasks could be efficiently parallelized. The general efficiency potential of parallelization for multiprocessor architectures can be assembled.
An ACO Inspired Strategy to Improve Jobs Scheduling in a Grid Environment
Authors: Marilena Bandieramonte, Antonella Stefano, Giovanni Morana
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Scheduling is one of the most crucial issue in a grid environment because it strongly affects the performance of the whole system. In literature there are several algorithms that try to obtain the best performance possible for the specified requirements; taking into account that the issue of allocating jobs on resources is a combinatorial optimization problem, NP-hard in most cases, several heuristics have been proposed to provide good performance. In this work an algorithm inspired to Ant Colony Optimization theory is proposed: this algorithm, named Aliened Ant Algorithm, is based on a different interpretation of pheromone trails.The goodness of the proposed algorithm, in term of load balancing and average queue waiting time, has been evaluated by mean of a vast campaign of simulations carried out on some real scenarios of a grid infrastructure.
DCAF: An MPEG-21 Dynamic Content Adaptation Framework
Authors: Anastasis A. Sofokleous, Marios C. Angelides
Venue: Multimedia Tools and Applications (2008)

Universal Multimedia Access aims at providing a gratifying end user-experience by either adapting the content, be it static or dynamic, to suit the usage environment or adapting the usage environment, be it client- or server-centric, to suit content. This paper presents our MPEG-21 Dynamic Content Adaptation Framework, acronym DCAF, which uses a fusion of Genetic Algorithms and Strength Pareto Optimality to adapt content in order to suit the usage environment.
Local/Global Phenomena in Geometrically Generated Graphs
Authors: Ross M. Richardson
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

We study a geometric random tree model which is a variant of the FKP model proposed in [1]. We choose vertices v 1, ..., v n in some convex body uniformly and fix a point . We then build our tree inductively, where at time t we add an edge from v t to the vertex in v 1, ..., v t ¿ 1 which minimizes for i < t, where ¿> 0. We categorize an edge v i ¿v j in this graph as local or global depending on the edge length relative to the distance from v i to . It is shown that for ¿ bounded away from 1 either all edges are local or all are global a.a.s. However, as ¿¿1 we show that in fact the number of local and global edges are asymptotically balanced.
Workspace Environment for Collaboration in Small Software Development Organization
Authors: Deepti Mishra, Alok Mishra
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

Effective collaboration and communication are important contributing factors to achieve success in agile software development projects. The significance of workplace environment and tools are immense in effective commun-ication, collaboration and coordination between people performing software development. In this paper, we have illustrated how workplace environment, collaboration, improved communication, and coordination facilitated towards excellent productivity in a small-scale software development organization.
Feistel Networks Made Public, and Applications
Authors: Yevgeniy Dodis, Prashant Puniya
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing "cryptographically strong" permutations from corresponding "cryptographically strong" functions. Up to now, all usages of the Feistel Network, including the celebrated Luby-Rackoff's result, critically rely on (a) the (pseudo)randomness of round functions; and (b) the secrecy of (at least some of) the intermediate round values appearing during the Feistel computation. Moreover, a small constant number of Feistel rounds was typically sufficient to guarantee security under assumptions (a) and (b). In this work we consider several natural scenarios where at least one of the above assumptions does not hold, and show that a constant, or even logarithmic number of rounds is provably insufficient to handle such applications, implying that a new method of analysis is needed.On a positive side, we develop a new combinatorial understanding of Feistel networks, which makes them applicable to situations when the round functions are merely unpredictable rather than (pseudo)random and/or when the intermediate round values may be leaked to the adversary (either through an attack or because the application requires it). In essence, our results show that in any such scenario a super-logarithmic number of Feistel rounds is necessary and sufficient to guarantee security.Of independent interest, our technique yields a novel domain extension method for messages authentication codes and other related primitives, settling a question studied by An and Bellare in CRYPTO 1999.
Effect of the Number of Grooves on Flow Characteristics around a Circular Cylinder with Triangular Grooves
Authors: Y. Yamagishi, M. Oki
Venue: Journal of Visualization (2005)

In the flow around a circular cylinder, a sudden decrease in the mean drag coefficient occurs at a high Reynolds number, but the same phenomenon occurs at a lower Reynolds number in the case where there exist grooves or roughness on the cylinder surface. In this paper, in order to make clear the flow characteristics around a cylinder with 20, 26 and 32 triangular grooves, the mean drag coefficient, pressure distribution, velocity distribution and turbulence intensity distribution were measured. Moreover, the flow around the cylinder was analyzed by applying the RNG k - ε turbulent model, and the surface flow pattern was investigated using the oil-film technique. From these results, it was found that a sudden decrease in the mean drag coefficient of a cylinder with 32 triangular grooves occurs at a lower Reynolds number compared with 20 and 26 triangular grooves.
Identifying Architectural Change Patterns in Object-Oriented Systems
Authors: Xinyi Dong, Michael W. Godfrey
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

As an object-oriented system evolves, its architecture tends to drift away from the original design. Knowledge of how the system has changed at coarse-grained levels is key to understanding the de facto architecture, as it helps to identify potential architectural decay and can provide guidance for further maintenance activities. However, current studies of object-oriented software changes are mostly targeted at the class or method level. In this paper, we propose a new approach to modeling object-oriented software changes at coarse-grained levels. We take snapshots of an object-oriented system, represent each version of the system as a Hybrid Model, and detect software changes at coarse-grained level by comparing two hybrid models. Based on this approach, we further identify a collection of change patterns, which help interpret how system changes at the architecture level. Finally, we present an exploratory case study to show how our approach can help maintainers capture and better comprehend architectural evolution of object-oriented software systems.
Ranking nonnormal p-norm trapezoidal fuzzy numbers with integral value
Authors: Chi-Chi Chen, Hui-Chin Tang
Venue: Computers Mathematics with Applications (2008)

This paper considers the ranking fuzzy numbers with integral value, proposed by Liou and Wang, for the nonnormal p-norm trapezoidal fuzzy numbers. Two interesting special cases of p-norm trapezoidal fuzzy numbers are the well-known triangular and trapezoidal fuzzy numbers. For the nonnormal fuzzy numbers, the differences exist among the membership functions for the triangular, trapezoidal and p-norm trapezoidal fuzzy numbers. These differences can affect their left, right and total integral values, so we establish the relationship between these three types of fuzzy numbers.
GAKREM: A novel hybrid clustering algorithm
Authors: Cao D. Nguyen, Krzysztof J. Cios
Venue: Information Sciences: an International Journal (2008)

We introduce a novel clustering algorithm named GAKREM (Genetic Algorithm K-means Logarithmic Regression Expectation Maximization) that combines the best characteristics of the K-means and EM algorithms but avoids their weaknesses such as the need to specify a priori the number of clusters, termination in local optima, and lengthy computations. To achieve these goals, genetic algorithms for estimating parameters and initializing starting points for the EM are used first. Second, the log-likelihood of each configuration of parameters and the number of clusters resulting from the EM is used as the fitness value for each chromosome in the population. The novelty of GAKREM is that in each evolving generation it efficiently approximates the log-likelihood for each chromosome using logarithmic regression instead of running the conventional EM algorithm until its convergence. Another novelty is the use of K-means to initially assign data points to clusters. The algorithm is evaluated by comparing its performance with the conventional EM algorithm, the K-means algorithm, and the likelihood cross-validation technique on several datasets.
A Class-Specific Optimizing Compiler
Authors: Michael D. Sharp, Steve W. Otto
Venue: Scientific Programming (1993)

Class-specific optimizations are compiler optimizations specified by the class implementor to the compiler. They allow the compiler to take advantage of the semantics of the particular class so as to produce better code. Optimizations of interest include the strength reduction of class:: array address calculations, elimination of large temporaries, and the placement of asynchronous send/recv calls so as to achieve computation/communication overlap. We will outline our progress towards the implementation of a C++ compiler capable of incorporating class-specific optimizations.
Integrating Theories and Techniques for Program Modelling, Design and Verification
Authors: Bernard K. Aichernig, He Jifeng, Zhiming Liu, Mike Reed
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

This submission presents our understanding of the Grand Challenge and propose an agenda on how we will position our research to contribute to this world-wide collaborative research project.
Software Prototyping using the SETL Programming Language
Authors: P. Kruchten
Venue: IEEE Software (1984)

With increased computational power available, programming languages can now balance efficiency with expressivity. This flexibility improves rapid prototyping of complex design changes.
Underwater communications and AUVs: from the arctic to the equator and other places before, after and in between
Authors: Hanumant Singh
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

From the early days of the Autonomous Ocean Sampling Networks (AOSN) researchers have tried to exploit the synergies that exist between underwater navigation, communications and adaptive control. Over the last ten years we have made slow but steady progress in this regard. In this talk, we examine the role of underwater communications in the context of use on Autonomous Underwater Vehicles (AUVs). In particular this talk is based on our work with the Seabed, Jaguar and Puma AUVs and their use in studies aimed marine archaeology, habitat characterization, coral reef ecology, hydrothermal vent studies and arctic operations. Based on user requirements we highlight cases where acoustic communications were used for vehicle health related telemetry, vehicle navigation and telemetry, telemetry of sensor scalar data for adaptive surveys, telemetry of vehicle imagery and multiple vehicles operations.
A Grouped Network Video Conference System Based on JMF in Collaborative Design Environment
Authors: Pengfei Zeng, Yongping Hao, Yubin Song, Yongxian Liu
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Based on requirement of real-time network video conference for computer supported collaborative product design in Web environment, a pure software multi-user video conference system of the similarity B/S structure was developed. JMF was adopted to achieve system development. Transmission and control of multimedia data were implemented by the streaming media technology of transport and control in conference process. By way of using Real-time Transport Protocol (RTP) and Real-time Transport Control Protocol (RTCP), the performance and quality of conference data streams were dynamic monitored. Streaming media reception and send services of conference process were achieved by programming mechanisms of JMF RTP. Based-on Java Bean, Servlet and Applet program design languages, the system framework and client browser program design were completed, integration with Product Data Management (PDM) system was implemented. The system provides a multimedia supporting platform for knowledge exchange and sharing in collaborative design process.
Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points
Authors: Giovanna D'Agostino
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

In this paper we consider some basic questions regarding the extensions of modal logics with bisimulation quantifiers. In particular, we consider the relation between bisimualtion quantifiers and uniform interpolation for modal logic and the μ-calculus. We first consider these questions over the whole class of frames, and then we restrict to specific classes, where we see that the results obtained before can be easily falsified. Finally, we introduce classes of frames where we found the same good behaviour than in the whole class of frames. The results presented in this paper have been obtained in collaboration with other authors during the last years; in alphabetical order: Tim French, Marco Hollenberg, and Giacomo Lenzi.
Web Accessibility: A Foundation for Research
Authors: Simon Harper, Yeliz Yesilada
Venue:  (2008)

Covering key areas of evaluation and methodology, client-side applications, specialist and novel technologies, along with initial appraisals of disabilities, this important book provides comprehensive coverage of web accessibility. Written by leading experts in the field, it provides an overview of existing research and also looks at future developments, providing a much deeper insight than can be obtained through existing research libraries, aggregations, or search engines. In tackling the subject from a research, rather than practitioner standpoint, scientists, engineers and postgraduate students will find a definitive and foundational text that includes field overviews, references, issues, new research, problems and solutions, and opinions from industrial experts and renowned academics from leading international institutions including Adobe, Google, IBM, W3C, and York, Dartmouth and Kansai Universities.
Proceedings of the 6th international symposium on Principles and practice of programming in Java
Venue: ACM International Conference Proceeding Series; Vol. 347 (2008)

It is our pleasure to welcome you to the sixth annual conference on Principles and Practice of Programming in Java (PPPJ 2008). The Java language continues to stimulate new exciting research ideas and provides a framework for exploring new ideas in software design, as readers will see from the papers selected for presentation at this conference. The number of submissions was down this year, but the quality of those submissions remained extremely high. We received 46 abstracts, of which 40 materialized as full submissions by the deadline. Of these, we have selected 19 high quality papers for presentation in full. The topics represented in the papers are as diverse as the application areas for the Java language itself. They range over issues from teaching Java to optimizing the performance of the JVM, with many other topics in between. Our Program Committee was comprised of many world experts in object-oriented software design, compiler optimization and Java technology. They freely contributed their valuable time to help make this conference a big success. Everyone one on the committee performed a magnificent job of reading, evaluating and discussing the submissions. Major disagreements between PC members on the merits of submissions were fortunately few and were easily resolved to everyone's satisfaction. The final list of selected papers met with everyone's approval.
Study of Immune Control Computing in Immune Detection Algorithm for Information Security
Authors: Ya Jing Zhang, Yang Xue
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Based on research for anomaly detection and immune control mechanism in the biological immune principles, a method of immune control computing is introduced in immune detection. Such problems as immune detection model and immune memory are discussed. The experiments that are in the area of intrusion detection are made. Shown by experiments, the algorithm joined immune control computing provides a dynamitic detecting way and keeps stability of detection. Its detecting efficiency is increased obviously.
Interactive simulation of fire, burn and decomposition
Authors: John Keyser
Venue:  (2007)

This work presents an approach to effectively integrate into one unified modular fire simulation framework the major processes related to fire, namely: a burning process, chemical combustion, heat distribution, decomposition and deformation of burning solids, and rigid body simulation of the residue. Simulators for every stage are described, and the modular structure enables switching to different simulators if more accuracy or more interactivity is desired. A &ldquo;Stable Fluids&rdquo; based three gas system is used to model the combustion process, and the heat generated during the combustion is used to drive the flow of the hot air. Objects, if exposed to enough heat, ignite and start burning. The decomposition of the burning object is modeled as a level set method, driven by the pyrolysis process, where the burning object releases combustible gases. Secondary deformation effects, such as bending burning matches and crumpling burning paper, are modeled as a proxy based deformation. Physically based simulation, done at interactive rates, enables the user to efficiently test different setups, as well as interact and change the conditions during the simulation. The graphics card is used to generate additional frames for real-time visualization. This work further proposes a method for controlling and directing high resolution simulations. An interactive coarse resolution simulation is provided to the user as a &ldquo;preview&rdquo; to control and achieve the desired simulation behavior. A higher resolution &ldquo;final&rdquo; simulation that creates all the fine scale behavior is matched to the preview simulation such that the preview and final simulations behave in a similar manner. In this dissertation, we highlighted a gap within the CG community for the simulation of fire. There has not previously been a physically based yet interactive simulation for fire. This dissertation describes a unified simulation framework for physically based simulation of fire and burning. Our results show that our implementation can model fire, objects catching fire, burning objects, decomposition of burning objects, and additional secondary deformations. The results are plausible even at interactive frame rates, and controllable.
The Contact Surface: A Technique for Exploring Internet Scale Emergent Behaviors
Authors: Carrie Gates, John Mchugh
Venue: Proceedings of the 5th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2008)

Large scale internet data analysis often concentrates on statistical measures for volume properties or is focused on the epidemiology of specific malcodes. We have developed a high level abstraction that we call the contact surface that allows us to visualize internet scale connection behaviours across the border of a monitored network. The contact surface is a time series of contact lines, each line plotting the number of outside sources that contact a specific number of inside hosts in a given time interval (typically an hour). In general, the lines follow a power law in the mid range with distinct outliers at the one destination per source and the hundreds to thousands of destinations per source ends. During some periods, however, the lines are perturbed with what appears to be a persistent bump or waterfall. We have studied two such episodes, one that persisted from at least January 2003 until August 2003 and another that appeared on February 11, 2004 and lasted until May 31, 2004. The exact cause of the former is unknown, however the later appears to have been caused by the Welchia.B worm. Similar activities are currently being reported by other observers. We hypothesize that the cause of the perturbation is low frequency periodic scanning by a small population of hosts scanning at the same rate. We have created simulations to explore the range of activities that might be observable and find reasonable agreement with the observed phenomena.