ppxscal/embedding_network huggingface dataset:
Modeling end-to-end QoS management and real time agreement protocols for resource reservation for multimedia mobile radio network
Authors: Sonia Ben Rejeb, Nidal Nasser, Zièd Choukair, Sami Tabbane
Venue: Computer Communications (2007)

Wireless networks' Operators still face the dual face problem of end to end resource allocation management wile making efficient use of bandwidth. Relative considerations include user mobility, traffic characteristics, Quality of Service (QoS) parameters (throughput, delay, jitter, etc.). The satisfaction of the user depends on subjective parameters related to the rendering of the requested services (end-to-end quality of service). In order to accommodate these parameters, prescriptions have been formulated by the IETF within the framework of the IntServ/DiffServ group which targets network QoS control. The call admission control (CAC) is essential within this mobile communication architecture because the network resources are limited. The purpose of this work is to specify traffic threshold parameters and the constraints in terms of QoS for a resource allocation based on a call admission control mechanism in a mobile network. In our approach, this mechanism takes place in two stages : the first stage at the level of the New Call acceptation capability by Cell registered at mobile radio Level Agreement Service (SLA), where user mobility is considered as being a major constraint for call acceptance. The second stage takes place at the DiffServ operator network level. QoS acceptance is defined by the SLA contract specifying the parameters of the different levels of acceptance. At a global level, new call or handover call acceptance is based on a collective and consensual decision between the different participating networks. Such a consensus aims at taking a consistent decision to reserve resources according to one of the levels of service predefined by the caller SLA. Then allowing the caller to renegotiate the level of service QoS according to traffic load fluctuation, or to negotiate new resources for new applications requested during the session. The other participating networks can also initiate a renegotiation for the same reasons.
VERKKOKE: learning routing and network programming online
Authors: Anton Alstes, Janne Lindqvist
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

We present an Online Teaching Environment (OTE) that supports "learning by doing" philosophy in teaching telecommunications software and routing. "Learning by doing" is achieved by giving students a programming assignment that introduces them to socket programming and gives them the opportunity to practice implementing simplified routing protocols. The OTE creates individual assignments for students, accepts solution submissions via the Internet, and, finally, checks the assignments automatically. The system also notifies the students of possible mistakes in their solutions, so they can learn from their mistakes, fix them and resubmit the corrected solutions. The teacher needs only to start the system when the course begins and verify the assignment results when students have finished their work. The OTE is compatible with modern learning management systems through its adherence to the SharableContent Object Reference Model (SCORM) specification. The OTE supports intricate and realistic programming assignments through representative topology generation and sophisticated network simulation.
Backup path provisioning scheme and delay time analysis in GMPLS networks
Authors: Wan-Seop Lee, Ki-Il Kim, Pyung-Dong Cho, Hyeon Park
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Since GMPLS is likely to be the technology of choice in the future IP-based transport network, it is necessary that MPLS be able to provide protection and restoration of traffic. There are 1+1, 1:1, 1:N M:N path protection mechanisms for restoring paths on MPLS networks. But since these methods have low resource utilization for setting up the backup paths, several methods have been proposed for protection with mesh-based optical networks using shared backup path and capacity. But when the fault occurs in the networks, backup path activation time is one of key issues in the optical area, too. Although there are several works in the research for survivability in optical networks, most of them seem to neglect delay time to be consumed for backup path activation. We propose a new backup path provisioning scheme taking resource utilization as well as delay time into account. We then it compare with existing proposed schemes in terms of improvement of resource utilization.
Using Design Structure Matrices to Assess Modularity in Aspect-Oriented Software Product Lines
Authors: Pedro Jr. Matos, Rafael Duarte, Ivan Cardim, Paulo Borba
Venue: Proceedings of the First International Workshop on Assessment of Contemporary Modularization Techniques (2007)

This paper presents our experience on assessing the modularity of software product lines through the dependencies found using design structure matrices. We conducted a case study on a mobile game software product line and we were able to identify some important dependencies between the modules.
A Hybrid Actuation Approach for Haptic Devices
Authors: Francois Conti, Oussama Khatib, Charles Baur
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This paper presents a new actuation approach which combines the use of brakes, springs and mini motors to produce a safer and more energy efficient way to drive haptic devices. The applications which can greatly benefit from this new technology include force-feedback interfaces which operate medical robots, an area where safety and reliability are of prime concerns, and small portable devices which can only be powered by limited energy sources such as small batteries. This work also addresses the problems of limited rendering capabilities which today are present on most passive haptic displays.
Case-based task decomposition with incomplete domain descriptions
Authors: Hector Munoz-Avila
Venue:  (2006)

Hierarchical task network (HTN) task decomposition is a planning paradigm that accomplishes high-level tasks by decomposing them into simpler tasks during problem solving. Over the years, there has been a recurrent interest on HTN planning for a variety of reasons, including its relation with models for cognitive reasoning, runtime efficiency, and a number of real-world domains that are amenable to be modeled in a hierarchical fashion. An obstacle that hinders the use of HTN planning techniques in a wide range of applications is the need for a complete domain description. In case-based reasoning (CBR), previous problem-solving episodes are reused to solve new problems. A number of research efforts have been conducted for combining CBR and planning in the past. Some of the research resulted in domain-independent CBR systems for planning but required a complete domain description; others did not require a domain description but resulted in domain-specific problem solving. In this dissertation, a novel approach for hierarchical task decomposition with incomplete domain descriptions is presented. This approach utilizes domain-independent case adaptation to enable using generalized cases as the main source of task decomposition knowledge. To achieve desired planning performance, a preference-guided case refinement is integrated with a case retrieval criterion and a case reuse algorithm that take advantage of the refinement. The implemented DInCaD (D&barbelow;omain Independent Case-based task D&barbelow;ecomposition) system is the first case-based reasoning system that performs domain independent hierarchical task decomposition with incomplete domain descriptions. In addition, semantics are defined and proven for analyzing the properties of the presented approach, providing a complementary to the theoretical foundation of case-based reasoning research. Several metrics for evaluating case-based planning systems are studied and adapted to measure the planning performance of the implemented system.
On Computation and Communication with Small Bias
Authors: Harry Buhrman, Nikolay Vereshchagin, Ronald de Wolf
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication complexity. The class PP in fact has two, a version with weakly restricted bias called PP^cc, and a version with unrestricted bias called UPP^cc. Ever since their introduction by Babai, Frankl, and Simon in 1986, it has been open whether these classes are the same. We show that PP^cc \varsubsetneq UPP^cc. Our proof combines a query complexity separation due to Beigel with a technique of Razborov that translates the acceptance probability of quantum protocols to polynomials. Second, we study how small the bias of minimal-degree polynomials that sign-represent Boolean functions needs to be. We show that the worst-case bias is at worst double-exponentially small in the sign-degree (which was very recently shown to be optimal by Podolski), while the averagecase bias can be made single-exponentially small in the sign-degree (which we show to be close to optimal).
Weighted IS Method of Estimating FER of LDPC Codes in High SNR Region
Authors: Guangwen Li, Guangzeng Feng
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, one improved frame error rate (FER) estimation approach in high Signal Noise Ratio (SNR) region for low-density parity-check (LDPC) codes is reported. Firstly dominant trapping sets (TSs), accounting for most of FER in high SNR region, are picked out as decoding result, with input of decoder consisting of a group of biased bits. And how those biased bits are chosen is reduced to finding solution to an binary integer program. Then decoder termination conditions are slightly modified so that history of the tentative decoding could facilitate action of searching for dominant TSs effectively. Without no prior knowledge of shape of error regions for specific LDPC code, we implement weighted mean translation (MT) of importance sampling (IS) method to compute FER in high SNR region. Simulation results demonstrate estimated FER curve conforms well with that of standard monte carlo (MC) simulation in overlapped SNR region.
Using grid computing based components in on demand environmental data delivery
Authors: Raffaele Montella, Giulio Giunta, Angelo Riccio
Venue: Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks (2007)

The grid computing technology is evolving from the emergence to the stable and production status. In the computational science field the grid computing approach for storage and computing element resource sharing is a common way thanks to middleware as the Globus Toolkit and grid environments as the Condor project. In many domain applications, as environmental science, bioinformatics and interactive multimedia delivery, the shared resource is composed by tagged data and contents instead of hardware components. We provide a grid aware component leveraging on our Resource Broker Service implementing a wrap over the world-wide spread OpenDAP scientific data access protocol, ensuring effective and efficient grid based content distribution, and contributing to the "grand challenge" concerning the development of grid-aware software infrastructure for data intensive environmental applications.
Virtual appliances in the collective: a road to hassle-free computing
Authors: Constantine Sapuntzakis, Monica S. Lam
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

This paper describes the vision of the Collective, a compute utility which runs internet services as well as the highly interactive applications we run on desktop computers today. As part of this vision, we wish to shift the burden of administering the desktops from users to professionals. To decrease the cost of administering systems, we find inspiration in the reliability and maintainability of network-connected computer appliances. We argue for structuring our software as a group of networked appliances, each appliance virtualized on a virtual machine monitor. We show how to run virtual appliances in the Collective system and examine some ways in which individuals and groups may adopt virtual appliances.
A Concurrent Dynamic Task Graph
Authors: Theodore Johnson
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be statically and optimally allocated to the processors. If the tasks and task dependencies aren't known ahead of time (the case in some analysts-factor sparse matrix algorithms), then task scheduling must be performed on the fly. We present simple algorithms for a concurrent dynamic-task graph. A processor that needs to execute a new task can query the task graph for a new task, and new tasks can be added to the task graph on the fly. We present several alternatives for allocating tasks for processors and compare their performance.
Enhancement of intuitive reasoning through precision teaching and simulations
Authors: E. W. Thomas, J. Marr, N. Walker
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

We have studied how performance on the E&M (Electricity and Magnetism) portion of an Introductory Physics course may be enhanced by the careful choice of the exercises that the students perform. Exercises and homework problems are of two types; direct problems involve little more than the entry of numbers into a basic equation; and indirect problems requiring a solution strategy involving various subgoals which must be identified and achieved. By concentrating first on the development of basic skills through the technique of precision teaching and the use of simple direct problems, we show significant long term performance improvement, particularly among students at risk. We further examine how computer simulations can enhance intuitive reasoning and how the choice of a structured set of homework problems enhanced performance.
Automatic multiview quadruple alignment of unordered range scans
Authors: Frank B. ter Haar, Remco C. Veltkamp
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

This paper presents a new multiview alignment algorithm that performs both the coarse and fine alignment of unordered sets of range scans. Our algorithm selects quadruples of range scans, which have feature points of their 2D projections in common. These quadruples are then verified using an Iterative Closest Point (ICP) algorithm. The accepted quadruples form incomplete models of an object that can be aligned using isometries of the Principal Component Analysis (PCA) in combination with an ICP algorithm. The output of our method is a set of finely aligned meshes. Our method was applied to range scans of different clusters of objects varying in the type of acquisition system, the number of range scans, the scan resolution, and scan accuracy. Results show that our method is both effective and efficient for the alignment of meshes: it is capable of aligning object meshes with various properties, aligns the majority of meshes without a priori knowledge, and doesn't require a multiview ICP algorithm to improve the final alignment.
Online Medical CBT Usage
Authors: A. J. M. de Man, P. M. Bloemendaal, S. Eggermont
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The website MedicalEducation.nl enables to students to access online medical Computer Based Training material any time and any place. For three types of embedding of CBT material in a medical curriculum, the relation between embedding type and usage statistics are described. The introduction of competition is shown to enhance CBT re-usage.
A Novel Application-specific Instruction-set Processor Design Approach for Video Processing Acceleration
Authors: Mame Maria Mbaye, Normand Bélanger, Yvon Savaria, Samuel Pierre
Venue: Journal of VLSI Signal Processing Systems (2007)

Application-specific instruction-set processors (ASIPs) provide a good alternative for video processing acceleration, but the productivity gap implied by such a new technology may prevent leveraging it fully. Video processing SoCs need flexibility that is not available in pure hardware architectures, while pure software solutions do not meet video processing performance constraints. Thus, ASIP design could offer a good tradeoff between performance and flexibility. Video processing algorithms are often characterized by intrinsic parallelism that can be accelerated by ASIP specialized instructions. In this paper, we propose a new approach for exploiting sequences of tightly coupled specialized instructions in ASIP design applicable to video processing. Our approach, which avoids costly data communications by applying data grouping and data reuse, consists of accelerating an algorithm's critical loops by transforming them according to a new intermediate representation. This representation is optimized and loop parallelism possibilities are also explored. This approach has been applied to video processing algorithms such as the ELA deinterlacer and the 2D-DCT. Experimental results show speedups up to 18 (on the considered applications, while the hardware overhead in terms of additional logic gates was found to be between 18 and 59%.
Data distribution schemes of sparse arrays on distributed memory multicomputers
Authors: Chun-Yuan Lin, Yeh-Ching Chung
Venue: The Journal of Supercomputing (2007)

A data distribution scheme of sparse arrays on a distributed memory multicomputer, in general, is composed of three phases, data partition, data distribution, and data compression. To implement the data distribution scheme, many methods proposed in the literature first perform the data partition phase, then the data distribution phase, followed by the data compression phase. We called a data distribution scheme with this order as Send Followed Compress (SFC) scheme. In this paper, we propose two other data distribution schemes, Compress Followed Send (CFS) and Encoding-Decoding (ED), for sparse array distribution. In the CFS scheme, the data compression phase is performed before the data distribution phase. In the ED scheme, the data compression phase can be divided into two steps, encoding and decoding. The encoding step and the decoding step are performed before and after the data distribution phase, respectively. To evaluate the CFS and the ED schemes, we compare them with the SFC scheme. In the data partition phase, the row partition, the column partition, and the 2D mesh partition with/without load-balancing methods are used for these three schemes. In the compression phase, the CRS/CCS methods are used to compress sparse local arrays for the SFC and the CFS schemes while the encoding/decoding step is used for the ED scheme. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the SFC, the CFS, and the ED schemes in terms of the data distribution time and the data compression time. In experimental tests, we implemented these three schemes on an IBM SP2 parallel machine. From the experimental results, for most of test cases, the CFS and the ED schemes outperform the SFC scheme. For the CFS and the ED schemes, the ED scheme outperforms the CFS scheme for all test cases.
Graph regularization for color image processing
Authors: Olivier Lezoray, Abderrahim Elmoataz, Sébastien Bougleux
Venue: Computer Vision and Image Understanding (2007)

Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation problems. The solutions of variational models can be obtained by minimizing appropriate energy functions and this minimization is usually performed by continuous partial differential equations (PDEs). The problem is usually considered as a regularization matter which minimizes a smoothness plus a regularization term. In this paper, we propose a general discrete regularization framework defined on weighted graphs of arbitrary topologies which can be seen as a discrete analogue of classical regularization theory. The smoothness term of the regularization uses a discrete definition of the p-Laplace operator. With this formulation, we propose a family of fast and simple anisotropic linear and nonlinear filters which do not involve PDEs. The proposed approach can be useful to process color images for restoration, denoising and segmentation purposes.
Implementation of a triple modular redundant FPGA based safety critical system for reliable software execution
Authors: Venkatesh Vasudevan, Peter Waldeck, Hardik Mehta, Neil Bergmann
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

This paper describes the implementation of a TMR (Triple Modular Redundant) microprocessor system on a FPGA. The system exhibits true redundancy in that three instances of the same processor system (both software and hardware) are executed in parallel. The described system uses software to control external peripherals and a voter is used to output correct results. An error indication is asserted whenever two of the three outputs match or all three outputs disagree. The software has been implemented to conform to a particular safety critical coding guideline/standard which is popular in industry. The system was verified by injecting various faults into it.
An Approach of Standardization and Searching based on Hierarchical Bayesian Clustering (HBC) for Record Linkage System
Authors: Zin War Tun, Nilar Thein
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

Information sources on the Web are controlled by different text formats, and have varying inconsistencies. Data form many online sources do not contain enough information to accurately link the records. To link record from different data sources, any system must identify common entities from these sources. Therefore, the major challenges in record linkage are computational complexity and linkage accuracy. To reduce the number of record pairs for comparison, record linkage utilizes similarity search techniques in order to search for candidate similar records. Various searching methods have been used in record linkage systems. In this paper, we propose a record linkage framework and also focus on standardization and enhance the searching method by adopting an advanced feature of cluster-based searching method called Hierarchical Bayesian Clustering (HBC), which is not only for more efficient record pair comparison, but also for speeding up the record linkage accuracy. The purpose of this method is to place similar records into cluster that restricts the search scope for record comparison and also enhances matching accuracy.