ppxscal/embedding_network huggingface dataset:
An O(VE) algorithm for ear decompositions of matching-covered graphs
Authors: Marcelo H. De Carvalho, joseph cheriyan
Venue: ACM Transactions on Algorithms (TALG) (2005)

Our main result is an O(nm)-time (deterministic) algorithm for constructing an ear decomposition of a matching-covered graph, where n and m denote the number of nodes and edges. The improvement in the running time comes from new structural results that give a sharpened version of Lov&aacute;sz and Plummer's Two-Ear Theorem. Our algorithm is based on O(nm)-time algorithms for two other fundamental problems in matching theory, namely, finding all the allowed edges of a graph, and finding the canonical partition of an elementary graph. To the best of our knowledge, no faster deterministic algorithms are known for these two fundamental problems.
Application of Symbolic Functional Decomposition Concept in FSM Implementation Targeting FPGA Devices
Authors: Mariusz Rawski, Henry Selvaraj, Tadeusz Luba, Piotr Szotkowski
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents an FSM implementation method based on symbolic functional decomposition. This novel approach in multilevel logic synthesis of finite state machines targets FPGA architectures. Traditional methods are based on two steps: internal state encoding and then mapping the encoded state transition table into target architecture. In the case of FPGAs, functional decomposition is recognized as the most efficient method of implementing digital circuits. However none of the known state encoding algorithms can be considered as a good method to be used with functional decomposition. In this paper the concept of symbolic functional decomposition is applied to obtain a multilevel structure that is suitable for implementing in FPGA logic cells. The symbolic decomposition does not require separate encoding step. It accepts FSM description with symbolic states and performs decomposition introducing such a state encoding that guarantees the best solution known.
Extracting Sequence Diagram from Execution Trace of Java Program
Authors: Koji Taniguchi, Takashi Ishio, Toshihiro Kamiya, Shinji Kusumoto, Katsuro Inoue
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

A software system is continuously changed so many times. When we try to change a software, we must understand how the software is implemented, especially about the functions to be modified. However, such repeated changes may cause the bad situations that there is no document which reflects the changes and represents the behavior of the software correctly. So, it is important to develop a technique to extract the useful information to understand the behavior of the software from its own. We propose a method to extract compact sequence diagrams from dynamic information of object-oriented programs. Our method generates sequence diagrams by compacting a repetition included in the execution trace. This paper presents four compaction rules. The experiment illustrates how our rules effectively compact the execution trace and generate compact sequence diagrams.
Combination of RSS Newsfeeds and Forms for Driving Web-based Workflow
Authors: Daniela Bourges-Waldegg, Christian Hoertnagl
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper proposes a novel application of the popular content syndication format RSS (Really Simple Syndication) to improve the user experience of humans interacting with electronic workflows. We will discuss this in relation to a more general solution, Formidable, for developing and deploying electronic business processes that consist of a mixture of automatic and human-facing steps.
Stereoscopic Video over IP Networks
Authors: Eva Hladka, Milos Liska, Tomas Rebok
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Transfers of high-quality multimedia content pose new demands on capacity and services provided by the contemporary high-speed computer networks. Transfer of stereoscopic video is a specific example, as it needs synchronization between two separate data streams. We have set up a stereoscopic video capture system and studied synchronization of two separate Digital Video format streams sent over packet networks. We have adapted application tools to support the synchronization and used an active element working as a synchronizing UDP packet reflector to explicitly synchronize the streams if they are desynchronized in the network. We have experimentally studied the quality of achievable synchronization and the relationship between the amount of desynchronization and the additional latency overhead posed by buffering of the data on the synchronizing reflector. The results prove our assumption that even high-quality DV streams can be successfully synchronized using the simple packet reflector running on common IA32- based computer.
Extracting and Representing Cross-Language Dependencies in Diverse Software Systems
Authors: Daniel L. Moise, Kenny Wong
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

This paper presents an approach for dealing with multi-language software systems. Much of the focus of reverse engineering tools is in analyzing software systems written in one programming language. Nowadays, the abundance of new technologies and languages used to ease application development raises new challenges for reverse engineers. Therefore, this paper focuses on finding cross-language dependencies in such diverse, heterogeneous software systems. Our approach uses Source Navigator extractors to produce the facts inside each language. Then, we show an example for finding Java Native Interface (JNI) dependencies between facts from Java and C/C++ code. The integrated facts are produced in GXL form, and conform to a unified schema introduced in the paper. This approach is useful from several perspectives. It illustrates how to retrieve the dependencies from software systems written in more than one programming language. Also, the generated facts conform to the GXL format, which is accepted by many reverse engineering tools. The usefulness and scalability of the approach are tested in a case study.
The narrative aspect of scenario building - How story telling may give people a memory of the future
Authors: Baungaard Rasmussen
Venue: AI Society (2005)

Scenarios are flexible means to integrate disparate ideas, thoughts and feelings into holistic images, providing the context and meaning of possible futures. The application of narrative scenarios in engineering, development of socio-technical systems or communities provides an important link between general ideas and specification of technical system requirements. They focus on how people use systems through context-related storytelling rather than abstract descriptions of requirements. The quality of scenarios depends on relevant assumptions and authentic scenario stories. In this article, we will explore how the narrative approach may enrich the scenario &#x2018;skeleton&#x2019; with &#x2018;flesh and blood&#x2019;, that is, living, detailed and consistent storytelling. In addition, criteria are suggested for evaluation of the quality of scenario storytelling.
Ada in the avionics industry
Authors: George Romanski
Venue: ACM SIGAda Ada Letters (2005)

All systems installed on aircraft are classified based on the effects they may have on safety. As the systems have become more computerized, Ada has a role to play. Ada has been used successfully in the past, continues to be used at present and is expected to be used in the future. The key components of Ada's success in the avionics industry will be examined. The market is changing and platforms are changing. It is a critical time not to get left behind.
Optimized trellis coded vector quantization of LSF parameters, application to the 4.8 kbps FS1016 speech coder
Authors: Merouane Bouzid, Amar Djeradi, Bachir Boudraa
Venue: Signal Processing (2005)

Speech coders operating at low bit rates necessitate efficient encoding of the linear predictive coding (LPC) coefficients. Line spectral frequencies (LSF) parameters are currently one of the most efficient choices of transmission parameters for the LPC coefficients. In this paper, an optimized trellis coded vector quantization (TCVQ) scheme for encoding the LSF parameters is developed. When the selection of a proper distortion measure is the most important issue in the design and operation of the encoder, an appropriate weighted distance measure has been used during the TCVQ construction process. Using this distance, we will show that the LSF TCVQ encoder performs better than the encoder conceived with the unweighted distance and a reduction of about 1-2 bits/frame is obtained while maintaining the same performance. We further applied the TCVQ encoder system for encoding the LSF parameters of the US federal standard (FS1016) 4.8 kbps code excited linear prediction (CELP) speech coder. At lower bit rates, our objective and subjective evaluation results show that the incorporated LSF TCVQ encoder performs better than the 34 bits/frame LSF scalar quantizer used originally in the FS1016 coder. The subjective tests reveal also that the 27 bits/frame scheme produces equivalent perceptual quality to that when the LSF parameters are unquantized.
Robust Structure and Motion from Outlines of Smooth Curved Surfaces
Authors: Yasutaka Furukawa Amit Sethi, Jean Ponce, David J. Kriegman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

This paper addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive image frames. In this context, the surface points that project onto the outline of an object depend on the viewpoint and the only true correspondences between two outlines of the same object are the projections of frontier points where the viewing rays intersect in the tangent plane of the surface. In turn, the epipolar geometry is easily estimated once these correspondences have been identified. Given the apparent contours detected in an image sequence, a robust procedure based on RANSAC and a voting strategy is proposed to simultaneously estimate the camera configurations and a consistent set of frontier point projections by enforcing the redundancy of multiview epipolar geometry. The proposed approach is, in principle, applicable to orthographic, weak-perspective, and affine projection models. Experiments with nine real image sequences are presented for the orthographic projection case, including a quantitative comparison with the ground-truth data for the six data sets for which the latter information is available. Sample visual hulls have been computed from all image sequences for qualitative evaluation.
PRESTOR-1: A Processor Extending Multithreaded Architecture
Authors: Kiyofumi Tanaka
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Multithreaded processors are globally spreading. Multithreaded architecture enables fast context switching for tolerating memory access latency and bridging synchronization gap, and thus enables efficient utilization of execution pipelines. However, it cannot avoid all pipeline stalls; stalls will still occur when all processor built-in threads are in a wait state or there are not enough threads in a task/process to fill up all available context slots, since the mechanism for switching active threads is effective only for processor built-in threads' contexts. We developed a new multithreaded processor, PRESTOR-1, that increases the virtual number of built-in threads' contexts and enables seamless task/thread switching by allocating and swapping task/thread contexts hierarchically between processor and memory in a multitasking environment. The processor supports real-time applications through hierarchical task/thread allocation based on the task/thread priority and fast response mechanisms for interrupt requests exploiting the multiple-context architecture. Moreover, the processor has reconfigurable caches that provide a priority-based partitioning cache and an FIFO buffer. In this paper, we describe the details of PRESTOR-1.
A Robust and Topological Correct Marching Cube Algorithm Without Look-Up Table
Authors: Xia Renbo, Liu Weijun, Wang Yuechao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we proposed an improved version of the Marching Cube algorithm which gives topologically correct triangular approximation of the isosurface for any cube configuration. First, classification and characterization of critical points on the isosurface of trilinear functions is studied in detail. Then, unlike the past work on Marching Cube algorithm, a robust triangulation strategy without using the conventional look-up table and complementary and rotation operations is presented. Our algorithm is adaptive to the small the changes data or the small changes of the threshold, and obtains more reasonable result of triangulation of isosurface than those produced by standard MC algorithm.
An Adaptive Edge Detector Using Soft Mathematical Morphology
Authors: Xiaoxin Guo, Zhiwen Xu, Yinan Lu, Yunjie Pang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, a novel adaptive soft morphological Laplacian (ASML) filter is proposed, based on a combination of the ideas of the soft morphological filtering and the Laplacian operator. ASML filter is an adaptive nonlinear edge detector. The adaptivity is achieved by employing four directional structuring elements and the dynamic repetition parameter. ASML filter has the capability of selecting the directional structuring element with the maximum response, whose direction varies depending on the change of directional edges. In addition, by replacing the Laplacian operator with soft morphological one, the ASML filter provides an alternative algorithm for edge detection and noise suppression. The experimental results show that the ASML filter outperforms the traditional edge detector in the two aspects.
Mining massive data streams
Authors: Geoffrey Hulten
Venue:  (2005)

Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous data streams brings unique opportunities, but also new challenges. In this thesis we develop a method that can semi-automatically enhance a wide class of existing learning algorithms so that they can learn from such high-speed data streams in real time. In particular, our method can be applied to essentially any induction algorithm based on discrete search. After applying our method the algorithm: learns from data-streams in an incremental, any-time fashion; runs in time independent of the amount of data seen, while making decisions that are essentially identical to those that would be made from infinite data; uses a constant amount of RAM no matter how much data it sees; and adjusts its learned models in a very fine-grained manner as the data generating process changes over time. We evaluate our method by using it to produce a series of learning algorithms&mdash;for decision trees, Bayesian network structure, and clustering&mdash;which are all capable of learning from high-speed data streams. We evaluate these learners with extensive studies on synthetic data sets, and by applying them to a collection of massive real-world mining tasks.
Ultimately Periodic Qualitative Constraint Networks for Spatial and Temporal Reasoning
Authors: Jean-Francois Condotta, Gerard Ligozat, Stavros Tripakis
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We consider qualitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion: after an initial stretch of time, a fixed pattern of constraints (over an interval) is reproduced indefinitely. We propose a local propagation algorithm which is polynomial, and we show that it decides the consistency problem in some particular cases. We also show that the general problem of consistency for such networks is in PSPACE.
An Interview with Alan Lenton: On Games
Authors: Ubiquity staff
Venue: Ubiquity (2005)

Noted U.K. game designer Alan Lenton talks about his award-winning multi-player game Federation and discusses the sociology and psychology of gaming.
A Visual Data Mining Framework for Convenient Identification of Useful Knowledge
Authors: Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xiao
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Data mining algorithms usually generate a large number of rules, which may not always be useful to human users. In this project, we propose a novel visual data-mining framework, called Opportunity Map, to identify useful and actionable knowledge quickly and easily from the discovered rules. The framework is inspired by the House of Quality from Quality Function Deployment (QFD) in Quality Engineering. It associates discovered rules, related summarized data and data distributions with the application objective using an interactive matrix. Combined with drill down visualization, integrated visualization of data distribution bars and rules, visualization of trend behaviors, and comparative analysis, the Opportunity Map allows users to analyze rules and data at different levels of detail and quickly identify the actionable knowledge and opportunities. The proposed framework represents a systematic and flexible approach to rule analysis. Applications of the system to large-scale data sets from our industrial partner have yielded promising results.
Flocking of Subpopulations in Distributed Genetic Programming
Authors: Giedrius Paulikas, Dalius Rubliauskas
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The distribution of the genetic programming algorithm improves the efficiency of the search for the solution, but additional parameters of this distribution are undesirable. This paper presents the analysis of early experimental results of using flocking to control interactions among the distributed subpopulations so less human intervention is needed. The possibility to set up migration parameters dynamically at the run time brings the distributed genetic programming algorithm to the same level of automation as standard genetic programming while keeping the increased performance of the distributed GP. The paper discusses the nature of the required additional computations of the GP algorithm when adapting flocking for migration control. The positive empirical results support the idea of mixing both search techniques together.
Adaptive streaming and rendering of large terrains using strip masks
Authors: Joachim Pouderoux, Jean-Eudes Marvie
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Terrain rendering is an important factor in the rendering of virtual scenes. If they are large and detailed, digital terrains can represent a huge amount of data and therefore of graphical primitives to render in real-time. In this paper we present an efficient technique for out-of-core rendering of pseudo-infinite terrains. The full terrain height field is divided into regular tiles which are streamed and managed adaptively. Each visible tile is then rendered using a precomputed triangle strip patch selected in an adaptive way according to an importance metric. Thanks to these two levels of adaptivity, our approach can be seen as a cross-platform technique to render terrains on any kind of devices (from slow handheld to powerful desktop PC) by only exploiting the device capacity to draw as much triangles as possible for a target frame rate and memory space.
Micro-Architecture Verification for Microprocessors
Authors: Eyal Bin, Laurent Fournier
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

We present a tool and a methodology for micro-architecture verification of microprocessors. This document serves as an introduction to the invited talk in the special session on micro-architecture verification of microprocessors.
Automating experimentation on distributed testbeds
Authors: Yanyan Wang, Matthew J. Rutherford, Antonio Carzaniga, Alexander L. Wolf
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Engineering distributed systems is a challenging activity. This is partly due to the intrinsic complexity of distributed systems, and partly due to the practical obstacles that developers face when evaluating and tuning their design and implementation decisions.This paper addresses the latter aspect, providing techniques for software engineers to automate the experimentation activity. Our approach is founded on a suite of models that characterize the distributed system under experimentation, the testbeds upon which the experiments are to be carried out, and the client behaviors that drive the experiments. The models are used by generative techniques to automate construction of the workloads,as well as construction of the scripts for deploying and executing the experiments on distributed testbeds. The framework is not targeted at a specific system or application model, but rather is a generic, programmable tool. We have validated our approach by performing experiments on a variety of distributed systems. For two of these systems, the experiments were deployed and executed on the PlanetLab wide-area testbed.Our experience shows that this framework can be readily applied to different kinds of distributed system architectures,and that using it for meaningful experimentation,especially in large-scale network environments, is advantageous.
Improving Automatic Query Classification via Semi-Supervised Learning
Authors: Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, David D. Lewis, Abdur Chowdhury, Aleksander Kolcz
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Accurate topical classification of user queries allows for increased effectiveness and efficiency in general-purpose web search systems. Such classification becomes critical if the system is to return results not just from a general web collection but from topic-specific back-end databases as well. Maintaining sufficient classification recall is very difficult as web queries are typically short, yielding few features per query. This feature sparseness coupled with the high query volumes typical for a large-scale search service makes manual and supervised learning approaches alone insufficient. We use an application of computational linguistics to develop an approach for mining the vast amount of unlabeled data in web query logs to improve automatic topical web query classification. We show that our approach in combination with manual matching and supervised learning allows us to classify a substantially larger proportion of queries than any single technique. We examine the performance of each approach on a real web query stream and show that our combined method accurately classifies 46% of queries, outperforming the recall of best single approach by nearly 20%, with a 7% improvement in overall effectiveness.
An Interview with Scott McKinley: Project-Based Learning: The Neumont University story
Authors: Ubiquity staff
Venue: Ubiquity (2005)

Neumont University co-founder and CEO Scott McKinley says the most innovative aspect of the Neumont curriculum is its focus on student projects: "Our freshmen are on project teams from the very beginning. Their first projects are simple, heavily scaffolded, and commensurate with their novice skills. By the time they enter their last three quarters, they're working on real industry projects for serious names that work with us, including IBM and Microsoft."