ppxscal/embedding_network huggingface dataset:
Optimization of multi-resolution source codes
Authors: Michelle Effros
Venue:  (2004)

What is an optimal multi-resolution source code? This thesis studies the optimization of multi-resolution source codes. A multi-resolution source code is a data compression algorithm that generates a bit-stream that can be truncated at any point to reconstruct low-resolution representations of the original data. By progressively refining the description, these codes allow the receiver to get representations of progressively increasing quality from a single file. The optimization methods presented here are based on the minimization of a Lagrangian performance measure, which is a weighted sum of rates and distortions at the different resolutions of the multi-resolution code. The Lagrangian coefficients are the weights that parameterize the priorities assigned to the resolutions. The relative value of these parameters can be set according to the user's preferences regarding which rates are more important, the probability of decoding the file at each possible rate, or any other prioritization rationale. We present a method for converting design constraints into the corresponding Lagrangian parameters. We also use a Lagrangian analysis to investigate optimality properties of multiresolution codes. Specifically, we explore the characterization of the theoretically optimal output density functions of a two-resolution source code for any arbitrary set of priorities over the resolutions. Once the priority function has been identified, the goal is to design the multiresolution code that yields the best rate-distortion trade-off for those priorities. The minimization of the multi-resolution Lagrangian is somewhat specific to the frame work and type of multi-resolution code. We pursue this goal in several coding frameworks. The first framework is the multi-resolution vector quantizer (MRVQ) framework. Prior work on the topic described optimal MRVQ design for both fixed- and variable-rate systems but implemented only fixed-rate codes. The earliest portion of this thesis began with the implementation of the earlier described algorithm for variable-rate MRVQ for use as a testbed for understanding the important question of how to choose the Lagrangian parameters for multi-resolution codes to meet a collection of desired constraints. Armed with a new understanding of parameter choice in the MRVQ framework, we moved next to the more sophisticated coding framework of wavelet-based embedded bit-plane coders. New results in this framework include improvements on the Set Partitioning in Hierarchical Trees (SPIHT) and the Group Testing for Wavelets (GTW) algorithms that apply the lessons learned from MRVQ theory in these more sophisticated wavelet coding frameworks. Experimental results demonstrate the performance benefits associated with this approach.
Descriptional complexity of error/edit systems
Authors: Lila Kari, Stavros Konstantinidis
Venue: Journal of Automata, Languages and Combinatorics (2004)

Errors appear in a wide range of information processing and transmission applications, such as data communications, biological computing, computer typesetting, speech recognition, etc. It can be said indeed that errors are truly natural phenomena. In this work we introduce error or edit systems (e-systems, for short), which are formal languages over the alphabet of the basic edit operations. Our formalism allows one to model essentially any kind of error situations. For certain natural regular e-systems, we investigate their descriptional complexity in terms of the number of states of the automata accepting such systems. This problem is of interest in its own right as well as in the computation of maximal error-correcting capabilities of known languages.
Probabilistic Coverage in Wireless Sensor Networks
Authors: Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage in order to anticipate this sensing behavior. We investigate the coverage issues in wireless sensor networks based on probabilistic coverage and propose a distributed Probabilistic Coverage Algorithm (PCA) to evaluate the degree of confidence in detection probability provided by a randomly deployed sensor network. The probabilistic approach is a deviation from the idealistic assumption of uniform circular disc for sensing coverage used in the binary detection model. Simulation results show that area coverage calculated by using PCA is more accurate than the idealistic binary detection model.
A Simplified MPC for Image Compression
Authors: Chuanfeng Lv, Qiangfu Zhao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In recent years, principal component analysis (PCA) has attracted great attention in image compression field. However due to the linear nature, PCA cannot simultaneously explain the global and local characteristics of the input image. To achieve high compression rate, only a few basis vectors should be used. The fewer the basis vectors used, the more local information will be lost. To solve this problem, a number of improved PCA approaches have been proposed. The basic idea is to reduce the error by using different basis vectors for different sub-spaces of the problem space. These algorithms are non-linear, but very time-consuming and cannot be used easily. In this paper, a VQ based mixture of principle components (MPCs) is proposed. Experimental results show that the proposed approach, although simpler, is actually better than existing PCA based approaches.
Situational method engineering: combining assembly-based and roadmap-driven approaches
Authors: Isabelle Mirbel, Jolita Ralyt&#x00e9;
Venue: Requirements Engineering (2005)

Because the engineering situation of each information system development (ISD) project is different, engineering methods need to be adapted, transformed or enhanced to satisfy the specific project situation. Contributions, in the field of situational method engineering (SME), aim at providing techniques and tools allowing to construct project-specific methods instead of looking for universally applicable ones. In addition to the engineering method tailoring, necessary to fit the project situation, a customization of the engineering method for each engineer participating in the project is also required. Such a configuration allows a better understanding of the method by focusing on guidelines related to the project engineer&#x2019;s daily tasks. It also increases his/her involvement in the ISD method realization. To achieve this twofold objective (ISD method tailoring and customization), we propose a framework for SME combining an assembly-based approach for project-specific method construction and a roadmap-driven approach for engineer-specific method configuration. The first step of our process provides support to build a new method that is most suitable for the current ISD project situation, whereas the second step aims at choosing the most adapted path (roadmap) to satisfy the requirements of a particular project engineer within the project-specific method. The two core elements of our SME framework are the method chunks repository and the reuse frame. The former concerns reusable method components definition and storage whereas the latter deals with the characterization of the project situation and the project engineer&#x2019;s profile. In this paper we start first by presenting our SME framework and its core elements: the method chunk repository and the reuse frame. Then we show how to take advantage of them through our two-step process combining assembly-based method construction and roadmap-driven method configuration.
Analysis of Topics and Relevant Documents for Navigational Retrieval on the Web
Authors: Keizo Oyama, Haruko Ishikawa, Akiko Aizawa
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

An investigation into relationships among search methods, topic types, and styles of relevant Web pages was conducted using the "NTCIR-4 WEB Test Collection for Navigational Retrieval", which was built for evaluating the retrieval effectiveness of Web search systems aiming to find representative web pages of a given object. First, "Known Item Search," the task of the test collection, is defined and its outline is given. It consists of 100 gigabytes of Web document data NW100G-01, 300 topics of various types, and corresponding relevance judgments. Next, summaries of the systems and their evaluations used in this investigation are shown. Some systems used anchor text information or link information, and others used only the content information in various ways. Finally, characteristics of topics and their relevant documents and some interesting observations are discussed in relation to search methods and their effectiveness.
Project Asset Portability
Authors: Diomidis Spinellis
Venue: IEEE Software (2006)

Nowadays, a software system's program source code makes up only a small part of its assets stored as bits--taking up a larger percentage are specifications, design diagrams, application server deployment scripts, build rules, version history, documentation, and regression tests. How is the situation in your organization? Can you easily move your design diagrams from one UML-based tool to another, change the repository where your specifications are stored, run your regression tests on a different platform, or switch to a different configuration management system? Unless your organization still uses paper records for these tasks (in which case your problems are in a totally different league), chances are you dread even the thought of changing the tools you use.
Hierarchical token based mutual exclusion algorithms
Authors: M. Bertier, L. Arantes, P. Sens
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Mutual exclusion is a basic block of distributed synchronization algorithms. One of the challenges in highly distributed environments (like peer-to-peer or Grid configurations) is to provide scalable synchronizations taking into account the hierarchical network topology. This paper proposes hierarchical mutual exclusion algorithms. These algorithms are extensions of the Naimi-Trehel token algorithm, reducing the cost of latency and the number of message exchanges between far hosts. We propose three main extensions : (1) hierarchical proxy-based approach; (2) aggregation of requests; and (3) token preemption by closer hosts. We compared the performance of these algorithms on an emulated Grid testbed. We study the impact of each of the extensions, showing that the combination of them can greatly improve performance of the original algorithm.
An L3-Driven Fast Handover Mechanism in IPv6 Mobility
Authors: Kazutaka GOGO, Rie SHIBUI, Fumio TERAOKA
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

Several fast handover mechanisms have been proposed to achieve seamless mobility in IPv6. These proposals assume that the network layer of a mobile node can use the link layer information. However, none of them defines how to abstract and utilize the link layer information. This paper defines the abstractions of the link layer information to achieve fast handover in IPv6. This paper also proposes a network layer (L3) driven fast handover mechanism by using the abstract link layer information. The L3-driven fast handover mechanism was implemented on FreeBSD. The measurement results show that the gap time of an L3 handover is only 3-4 msec in our outdoor test network consisting of eight IEEE802.11a subnets.
New Procedures to Identify Redundant Stuck-At Faults and Removal of Redundant Logic
Authors: Gang Chen, Sudhakar Reddy, Irith Pomeranz, Janusz Rajski
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

We present new procedures for identifying redundant stuck-at faults including multiple line stuck-at faults on the branches of fan-out stems. The methods proposed include new procedures to identify stuck-at faults that are simultaneously redundant thus allowing simultaneous removal of logic associated with several redundant faults. Experimental results on benchmark as well as industrial circuits are also presented to demonstrate the effectiveness of the proposed methods.
A Mobile Terminal Location Tracking Model for Personal Communication Systems
Authors: J. Almhana, V .. Choulakian, R. McGorman
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we propose a Markov movement model for mobile terminals in wireless personal communication service networks and study the location registration problem. We formulate the location registration as a Markov decision process and prove that the optimal strategies have threshold structures.To avoid solving the Bellman dynamical programming equations, we propose a single sample path-based algorithm to tune thresholds of the strategies. Since the proposed algorithm uses only one sample path of the system, it can be implemented online.
RTPS Middleware for Real-Time Distributed Industrial Vision Systems
Authors: Basem Almadani
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Designing and constructing Real-Time Distributed Industrial Vision Systems (RT-DIVS) from scratch is very complicated task. RT-DIVS has Conflicting requirements such as reasonable development cost, ease of use, reusable code and high performance. The success key in building such systems is to recognize the need for middleware software. Middleware plays a major role in developing distributed systems efficiently. Real-Time Publish-Subscribe (RTPS) model is one of the latest developments in Real-Time middleware technologies. Network Data Distribution Service (NDDS) is RTPS middleware developed by Real-Time Innovation (RTI). NDDS is widely used in Real-Time distributed and embedded systems for mission critical applications. The research work presented in this paper discusses the employment of NDDS for RT-DIVS and the advantages of NDDS¿s Quality of Service (QoS) policies in covering the requirements of RTDIVS. An experimental test set-up is used to verify the NDDS¿s performance for RT-DIVS. Tests results show that RTPS middleware (and NDDS specifically) is suitable for soft and firm timelines requirements for distributed industrial vision systems.
Implicit Schemes for the Fokker-Planck-Landau Equation
Authors: Mohammed Lemou, Luc Mieussens
Venue: SIAM Journal on Scientific Computing (2005)

We propose time implicit schemes to solve the homogeneous Fokker--Planck--Landau equation in both the isotropic and 3-dimensional geometries. These schemes have properties of conservation and entropy. Moreover, they allow for large time steps, making them faster than the usual explicit schemes. To solve the involved linear systems, we prove that the use of Krylov-like solvers preserves the conservation properties. We show in particular that the conjugate gradient method can be used. Numerical tests are performed for the isotropic case and demonstrate an important gain in terms of CPU time, with the same accuracy as explicit schemes. This work is a first step to the development of fast implicit schemes to solve a class of inhomogeneous kinetic equations.
Protecting privacy in tabular healthcare data: explicit uncertainty for disclosure control
Authors: Brian Shand, Jem Rashbass
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

Summary medical data provides important statistical information for public health, but risks revealing confidential patient information. This risk is particularly difficult to assess when many different tables are released, independently protected against disclosure by various techniques. In this paper, we present a new technique for disclosure control in tabular data which uses explicit uncertainty to prevent small numbers of records from being identified disclosively. In contrast to other techniques, bounds on the cell perturbations are also made public. This technique can be applied effectively to large datasets in their entirety, automatically, and the transformed data can then be used to create the derivative tables, or hosted on a public web site. It is even safe for population-based data. Furthermore, we show that this transformation is computationally efficient while ensuring k-anonymity, and demonstrate the suitability of the transformed data for further statistical analysis.
Measuring the Shared Fate of IGP Engineering and Interdomain Traffic
Authors: Sharad Agarwal, Antonio Nucci, Supratik Bhattacharyya
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Typically, each Autonomous System (AS) tunes its local IS-IS or OSPF metrics without any coordination with other ASes. Such local optimizations can lead to sub-optimal end-to-end network performance, as suggested by the performance enhancements achieved by some overlay routing projects. We study the interaction of local IGP engineering in an ISP network with interdomain routing policies. Specifically, (a) how does hot-potato routing (the BGP policy of choosing the closest egress) influence the selection of IGP link metrics? and (b) how does traffic to neighboring ASes shift due to changes in the local AS¿s IGP link metrics?In our measurement study, we find that the hot-potato routing policy interacts significantly with IGP engineering - ignoring this interaction resulted in metrics sub-optimal by as much as 20% of link utilization. Further, the impact on neighboring ASes depends on peering locations and policies, and as much as 25% of traffic to a neighboring AS can shift the exit point. Such interdomain shifts can be detrimental to the performance of neighboring ASes. We rely on the actual measured network topology, IGP metrics, traffic matrix and delay bounds. Even though our results are specific to a single ISP, they show significant interaction between local IGP engineering and interdomain routing policies, and thus motivate further work on global network optimization and coordination among ISPs.
Facit and the BESK Boys: Sweden's Computer Industry (1956-1962)
Authors: Tom Petersson
Venue: IEEE Annals of the History of Computing (2005)

In 1956 the Swedish company Facit, previously engaged in producing electro-mechanical office equipment, recruited a group of Swedish top engineers within computer technology, known as the BESK boys. They had developed a computer, which for a short while was the fastest in the world. Facit's plan was to produce large-scale business computers for the Swedish and Western European markets. But already after a couple of years these plans had to be revised as the former partner IBM suddenly walked away from its cooperation agreement with Facit and simultaneously introduced the new 1401-series to the European markets. Facit tried to establish cooperation with other domestic and foreign, mostly American, companies but failed to meet the IBM challenge. In the early 1960s Facit finally shut down its grandiose computer project.
Robust subspace analysis for detecting visual attention regions in images
Authors: Yiqun Hu, Deepu Rajan, Liang-Tien Chia
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Detecting visually attentive regions of an image is a challenging but useful issue in many multimedia applications. In this paper, we describe a method to extract visual attentive regions in images using subspace estimation and analysis techniques. The image is represented in a 2D space using polar transformation of its features so that each region in the image lies in a 1D linear subspace. A new subspace estimation algorithm based on Generalized Principal Component Analysis (GPCA) is proposed. The robustness of subspace estimation is improved by using weighted least square approximation where weights are calculated from the distribution of K nearest neighbors to reduce the sensitivity of outliers. Then a new region attention measure is defined to calculate the visual attention of each region by considering both feature contrast and geometric properties of the regions. The method has been shown to be effective through experiments to be able to overcome the scale dependency of other methods. Compared with existing visual attention detection methods, it directly measures the global visual contrast at the region level as opposed to pixel level contrast and can correctly extract the attentive region.
Detecting unusual email communication
Authors: P. S. Keila, D. B. Skillicorn
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

Deception theory suggests that deceptive writing is characterized by reduced frequency of first-person pronouns and exclusive words, and elevated frequency of negative emotion words and action verbs. We apply this model of deception to the Enron email dataset, and then apply singular value decomposition to elicit the correlation structure between emails. Those emails that have high scores using this approach include deceptive emails; other emails that score highly using these frequency counts also indicate organizational dysfunctions such as improper communication of information. Hence this approach can be used as a tool for both external investigation of an organization, and internal management and regulatory compliance.
Timna: a framework for automatically combining aspect mining analyses
Authors: David Shepherd, Jeffrey Palm, Lori Pollock, Mark Chu-Carroll
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

To realize the benefits of Aspect Oriented Programming (AOP), developers must refactor active and legacy code bases into an AOP language. When refactoring, developers first need to identify refactoring candidates, a process called aspect mining. Humans perform mining by using a variety of clues to determine which code to refactor. However, existing approaches to automating the aspect mining process focus on developing analyses of a single program characteristic. Each analysis often finds only a subset of possible refactoring candidates and is unlikely to find candidates which humans find by combining analyses. In this paper, we present Timna, a framework for enabling the automatic combination of aspect mining analyses. The key insight is the use of machine learning to learn when to refactor, from vetted examples. Experimental evaluation of the cost-effectiveness of Timna in comparison to Fan-in, a leading aspect mining analysis, indicates that such a framework for automatically combining analyses is very promising.
Investigation of simultaneous fluorine and carbon incorporation in a silicon oxide dielectric layer grown by PECVD
Authors: S. Altshuler, Y. Chakk, A. Rozenblat, A. Cohen
Venue: Microelectronic Engineering (2005)

article-11-abstract
Mappings for Accurately Reverse Engineering UML Class Models from C++
Authors: Andrew Sutton, Jonathan I. Maletic
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

The paper introduces a number of mapping rules for reverse engineering UML class models from C++ source code. The mappings focus on accurately identifying such elements as relationship types, multiplicities, and aggregation semantics. These mappings are based on domain knowledge of the C++ language and common programming conventions and idioms. An application implementing these heuristics is used to reverse engineer a moderately sized open source, C++ application, and the resultant class model is compared against those produced by other UML reverse engineering applications. A comparison shows that these presented mapping rules effectively produce meaningful, semantically accurate UML models.