ppxscal/embedding_network huggingface dataset:
Testing hybrid control systems with TTCN-3: an overview on continuous TTCN-3
Authors: Ina Schieferdecker, Juergen Grossmann
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

TTCN-3 has gained increasing significance in recent years. It was originally developed to fit the needs of testing software-based applications and systems in the telecommunication industry and has shown its applicability to a wide range of other industrial domains in the mean time. TTCN-3 provides platform-independent, universal and powerful concepts to describe tests, especially for discrete, interactive systems. However, TTCN-3 addresses systems with discrete input and output characteristics only. The lack of powerful means that reasonably allow specifying and evaluating continuous data flow makes TTCN-3 sufficient neither for the automotive industry nor for other industries that deal with highly complex software-based control systems. This paper introduces the notion of streams, stream ports and stream templates to TTCN-3. It revises the initial design of continuous TTCN-3, a TTCN-3 extension for testing continuous or hybrid systems [20,21] and demonstrates the applicability for a case study that is typical for testing embedded control systems in the automotive industry.
Socialtrust: tamper-resilient trust establishment in online communities
Authors: James Caverlee, Ling Liu, Steve Webb
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Web 2.0 promises rich opportunities for information sharing, electronic commerce, and new modes of social interaction, all centered around the "social Web" of user-contributed content, social annotations, and person-to-person social connections. But the increasing reliance on this "social Web" also places individuals and their computer systems at risk, creating opportunities for malicious participants to exploit the tight social fabric of these networks. With these problems in mind, we propose the SocialTrust framework for tamper-resilient trust establishment in online communities. SocialTrust provides community users with dynamic trust values by (i) distinguishing relationship quality from trust; (ii) incorporating a personalized feedback mechanism for adapting as the community evolves; and (iii) tracking user behavior. We experimentally evaluate the SocialTrust framework using real online social networking data consisting of millions of MySpace profiles and relationships. We find that SocialTrust supports robust trust establishment even in the presence of large-scale collusion by malicious participants.
Vehicle Recognition Using Contourlet Transform and SVM
Authors: Saeid Rahati, Reihaneh Moravejian, Ehsan Mohamad Kazemi, Farhad Mohamad Kazemi
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes the performance of a new algorithm for vehicles recognition system. This recognition system is based on extracted features on the performance of image’s Contourlet transform & achieving standard deviation of Contourlet coefficients matrix in different subbands & various directions. This paper presents the application of three different types of classifiers to the vehicle recognition. They include Support vector machine (one versus one), k nearest-neighbor and Support vector machine (one versus all). In addition, the proposed recognition system is obtained by using different subbands information as feature vector. So, we could clarify the most important subbands in aspect of having useful information. The performed numerical experiments for vehicles recognition have shown the superiority of Contourlet and standard deviation preprocessing, which are associated with the Support vector machine structure (one versus one). The results of this test show, the right recognition rate of vehicle’s model in this recognition system, at the time of using total subbands information numbers 3&4 Contourlet coefficients matrix is about 99%. We’ve gathered a data set that includes 300 images from 5 different classes of vehicles. These 5 classes of vehicles include of: PEUGEOT 206, PEUGEOT 405, Pride, RENAULT and Peykan. We’ve examined 230 pictures as our train data set and 70 pictures as our test data set.
Gradient and Principal Component Analysis Based Texture Recognition System: A Comparative Study
Authors: Ratika Pradhan, Zangpo Gyalsten Bhutia, M. Nasipuri, Mohan P. Pradhan
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Texture describes the surface characteristics object such as plants, skins, terrains etc. This paper is based on the comparative study on various approaches to identify the gray scale texture of an unknown object from a set of texture of a known object available in the database. We have focused on three approaches of comparing the input gray scale texture with the gray scale texture images of various object in a database - Image Subtraction, Gradient based and Principal Component Analysis Approaches. The work is carried out on set of the images and the various approaches were then compared and analyzed to find the best method for various textures of different object types.
Temporal partitioning data flow graphs for dynamically reconfigurable computing
Authors: Yung-Chuan Jiang, Jhing-Fa Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

FPGA-based configurable computing machines are evolving rapidly in large signal processing applications due to flexibility and high performance. In this paper, given a reconfigurable processing unit (RPU) with a logic capacity of ARPU and a computational task represented by a data flow graph G = (V, E, W), we propose a network flow-based multiway task partitioning algorithm to minimize communication costs for temporal partitioning. The proposed algorithm obtains an optimal solution with minimum interconnection under area constraints. The optimal solution is a cut set. In our approach, two techniques are applied. In the initial partition, any feasible min-cut is produced by the proposed network flow-based algorithm, so a set of feasible min-cuts is obtained. From the feasible solutions, the scheduling technique selects an optimal global solution.
SPADE: the system s declarative stream processing engine
Authors: Bugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip S. Yu, Myungcheol Doo
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at IBM T. J. Watson Research Center. As a front-end for rapid application development for System S, Spade provides (1) an intermediate language for flexible composition of parallel and distributed data-flow graphs, (2) a toolkit of type-generic, built-in stream processing operators, that support scalar as well as vectorized processing and can seamlessly inter-operate with user-defined operators, and (3) a rich set of stream adapters to ingest/publish data from/to outside sources. More importantly, Spade automatically brings performance optimization and scalability to System S applications. To that end, Spade employs a code generation framework to create highly-optimized applications that run natively on the Stream Processing Core (SPC), the execution and communication substrate of System S, and take full advantage of other System S services. Spade allows developers to construct their applications with fine granular stream operators without worrying about the performance implications that might exist, even in a distributed system. Spade's optimizing compiler automatically maps applications into appropriately sized execution units in order to minimize communication overhead, while at the same time exploiting available parallelism. By virtue of the scalability of the System S runtime and Spade's effective code generation and optimization, we can scale applications to a large number of nodes. Currently, we can run Spade jobs on ≈ 500 processors within more than 100 physical nodes in a tightly connected cluster environment. Spade has been in use at IBM Research to create real-world streaming applications, ranging from monitoring financial market feeds to radio telescopes to semiconductor fabrication lines.
Broadcasting of digital cimema streams over wireless channels: a power-based unequal error protection approach
Authors: Maurizio Murroni
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

This paper presents a wavelet transmultiplexer based communication system for the transmission of Digital Cinema streams over wireless channels. To this aim, we adopt the tools of the JPEG2000 Wireless (JPWL) standard. We implement an unequal error protection (UEP) scheme that relies on forward error correction (FEC) channel coding supported by a proper unequal distribution of the transmission power (UPD) among JPWL coding units. In particular, we show that an appropriate combination of Reed-Solomon (RS) coding and UPD on the image data, can greatly improve the average PSNR of the reconstructed frames, in case of transmission over wireless channels with both sparse and packet error statistics, such as those provided by satellite broadcasting and Wireless MAN standards as WiMAX..
Communication performance of a modular high-bandwidth multiprocessor system
Authors: Fong Pong, Nian-Feng Tzeng, Koray Oner, Chun Ning, Kwong-Tak Chui, Manoj Ekbote, Yanping Lu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

This article deals with communication performance of a multiprocessor system implemented using award-wining BCM 1480 multi-core chips. Our system uses high-performance HyperTransport links to interconnect constituent chips, realizing cache-coherent non-uniform memory access. It takes advantage of hardware support from the BCM 1480 chip to attain very impressive communication performance among constituent BCM 1480 chips. This is achieved via an extension to global memory, so that small messages can be pushed quickly across chips in less than one us by the CPU cores through DMA to achieve zero-copy message buffering. It eliminates all overhead associated with the kernel and protocol processing for the utmost interconnect bandwidth in data transfers.
Scaffolding and validation of bacterial genome assemblies using optical restriction maps
Authors: Niranjan Nagarajan, Timothy D. Read, Mihai Pop
Venue: Bioinformatics (2008)

Motivation: New, high-throughput sequencing technologies have made it feasible to cheaply generate vast amounts of sequence information from a genome of interest. The computational reconstruction of the complete sequence of a genome is complicated by specific features of these new sequencing technologies, such as the short length of the sequencing reads and absence of mate-pair information. In this article we propose methods to overcome such limitations by incorporating information from optical restriction maps. Results: We demonstrate the robustness of our methods to sequencing and assembly errors using extensive experiments on simulated datasets. We then present the results obtained by applying our algorithms to data generated from two bacterial genomes Yersinia aldovae and Yersinia kristensenii. The resulting assemblies contain a single scaffold covering a large fraction of the respective genomes, suggesting that the careful use of optical maps can provide a cost-effective framework for the assembly of genomes. Availability: The tools described here are available as an open-source package at ftp://ftp.cbcb.umd.edu/pub/software/soma Contact: mpop@umiacs.umd.edu
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
Authors: Johannes Fischer, Volker Heun, Horst Martin Stühler
Venue: Proceedings of the Data Compression Conference (2008)

The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between two specified indices can be obtained in constant time. Several solutions to this problem have been proposed, starting with Berkman and Vishkin's linear-space solution, and leading to a succinct solution using only 2n+o(n) bits in addition to the input array by Fischer and Heun. The theoretical contribution of this article is to push this latter approach one step further and show that for compressible input arrays the RMQ-information can be compressed as well. In particular, we show that information for O(1)-RMQs can be stored within the same entropy bounds that are achieved by the currently best schemes for storing A itself in compressed form, while still being able to access O(log n) contiguous bits in O(1) time. Two such entropy-bounded schemes for O(1)-RMQs are developed, each with its own practical advantage. We test these two methods extensively and compare them to three other schemes for RMQs: the currently best non-succinct solution from Alstrup at al., and two succinct approaches: Sadakane's 4n+o(n)-bit solution, and our own 2n+o(n)-bit solution. The results of this practical evaluation are (1) the practical space consumptions of the non-compressed schemes scale surprisingly well with their theoretical guarantees, and (2) for compressible input arrays our new compressed schemes can indeed reduce the space, with little or no slowdown in query time.
Preserving Caller Anonymity in Voice-over-IP Networks
Authors: Mudhakar Srivatsa, Ling Liu, Arun Iyengar
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing anonymity such as mix networks are not well suited to applications like VoIP, SSH, and gaming which require low communication latency. This paper investigates the problem of on-demand construction of QoS sensitive routes on anonymizing networks using the VoIP application. We first describe triangulation based timing analysis attacks on shortest path route set up protocols. We show that even when a small fraction (sim1) of the network is malicious, the adversary can infer the source (caller) with reasonably high probability. Second, we describe random walk based route set up protocols that significantly improve anonymity while satisfying latency-based QoS guarantees. We describe a prototype implementation of our proposal and show that our protocols can significantly reduce the probability of inferring the caller. We present a detailed experimental evaluation to demonstrate our attacks and quantify the performance and scalability of our guards.
Causal analysis for performance modeling of computer programs
Authors: Jan Lemeire, Erik Dirkx, Frederik Verbist
Venue: Scientific Programming (2007)

Causal modeling and the accompanying learning algorithms provide useful extensions for in-depth statistical investigation and automation of performance modeling. We enlarged the scope of existing causal structure learning algorithms by using the form-free information-theoretic concept of mutual information and by introducing the complexity criterion for selecting direct relations among equivalent relations. The underlying probability distribution of experimental data is estimated by kernel density estimation. We then reported on the benefits of a dependency analysis and the decompositional capacities of causal models. Useful qualitative models, providing insight into the role of every performance factor, were inferred from experimental data. This paper reports on the results for a LU decomposition algorithm and on the study of the parameter sensitivity of the Kakadu implementation of the JPEG-2000 standard. Next, the analysis was used to search for generic performance characteristics of the applications.
Open source development tools for IMS research
Authors: David Waiting, Richard Good, Richard Spiers, Neco Ventura
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The 3GPP IMS is a next generation network architecture aimed at bringing the features and rich services of the Internet to the telephony world. Traditionally telephony products are developed by large companies with access to the proprietary solutions required for PSTN products. However, the shift to a packet-switched architecture and open Internet protocols has increased the developer base to include the huge community of web-developers. Consequently there are currently several open source software projects that aim to provide proof-of-concept implementations and research tools for promoting the development and adoption of IMS technologies. This work investigates the tools created by four open source IMS projects and incorporates these tools into a practical IMS test-bed framework. Evaluations are performed that demonstrate the capabilities and limitations of these tools in providing rich services to IMS users.
Design of an SLA-Driven QoS Management Platform for Provisioning Multimedia Personalized Services
Authors: Xiaorong Li, Stephen John Turner, Kok Heng Tong, Hoong Maeng Chan, Terence Hung
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we present an SLA-driven QoS Management Platform which establishes service level agreement between the service provider and the customers before the service delivery and manages the distributed resources efficiently to support QoS-aware multimedia personalized services (MPS) over large scale networks. Based on service oriented architecture, such a QoS management platform consists of SLA negotiation, QoS management and resource management. The QoS management connects the SLA negotiation and resource management to real-time monitor QoS and adapt the quality levels to cope with the varying network conditions. Such a QoS management platform allows clients to specify the QoS requirements, and enables service providers to offer different QoS levels, negotiate with their customers on the possible quality levels and adapt the resources allocation to optimize the system overall performance. We constructed a prototype system and study the QoS management in both static and dynamic service modes. Experiments are conducted to examine the system communication overhead caused by the SLA communication, and system performance by integrating various strategies for QoS management. The results show that our proposed SLA-driven QoS management platform is highly flexible, extensible and efficient to support QoS-aware MPS over large scale networks.
Satellite image pansharpening by chrominance propagation combined with Kernal interpolation
Authors: Marcin Iwanowshi, Artur Huk
Venue: Machine Graphics Vision International Journal (2006)

This paper describes a method for propagation-based spatial interpolation of missing color information in satellite images. Most of the land-observation satellites produce two types of imagery for every scene - multispectral and panchromatic. The first kind is characterized by lower spatial resolution but higher spectral one, while the second is a graylevel image at higher resolution. In order to get full color visualization of a scene, the high-resolution panchromatic image must be combined with the low-resolution color information taken from multispectral bands. This process is called pansharpening. In this paper, a new method for pansharpening is proposed which combines chrominance propagation with kernel interpolation. Thanks to the propagation step, the method properly reconstructs color information and does not blur the edges on color channels.
Adaptive multi-hop clustering in mobile networks
Authors: Matthias R. Brust, Hannes Frey, Steffen Rothkugel
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Clustering algorithms form hierarchical structures of an otherwise homogeneous ad hoc or sensor network. Efficient clustering is a challenging task since the process should be completely self-organized and makes use of incomplete environmental information. As result of these requirements many clustering algorithms use local information and support 1-hop sized clusters. The contribution of this paper is to show how k-hop sized clusters can be formed and maintained by solely using local neighborhood information. k-hop sized clusters are clusters where nodes are at most k-hops away from the clusterhead, i.e. with a cluster diameter of at most 2k. The presented k-hop clustering algorithm takes advantage of nodes' mobility in order to form and maintain k-hop sized clusters. The paper concludes that mobility is a key force for supporting self-organization of clusters. The algorithm described works locally, asynchronously, and fully distributed.
Multiple Arithmetic in Dynamic System Simulation
Authors: Václav átek, Jirí Kunovský, Jirí Petrek
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

A very interesting and promising numerical method of solving systems of ordinary differential equations based on Taylor series has appeared. The potential of the Taylor series has been exposed by many practical experiments and a way of detection and solution of large systems of ordinary differential equations has been found. Generally speaking, a stiff system contains several components, some of them are heavily suppressed while the rest remain almost unchanged. This feature forces the used method to choose an extremely small integration step and the progress of the computation may become very slow. There are many (implicit) methods for solving stiff systems of ODE’s, from the most simple such as implicit Euler method to more sophisticated (implicit Runge-Kutta methods) and finally the general linear methods. Usually a quite complicated auxiliary system of equations has to be solved in each step. These facts lead to immense amount of work to be done in each step of the computation. These are the reasons why one has to think twice before using the stiff solver and to decide between the stiff and non-stiff solver.
Homotopy types of box complexes
Authors: P&#x00e9;ter Csorba
Venue: Combinatorica (2007)

In [14] Matou&#x0161;ek and Ziegler compared various topological lower bounds for the chromatic number. They proved that Lov&#x00e1;sz&#x2019;s original bound [9] can be restated as X(G) &#x2265; ind(B(G)) + 2. Sarkaria&#x2019;s bound [15] can be formulated as X(G) &#x2265; ind(B0(G)) + 1. It is known that these lower bounds are close to each other, namely the difference between them is at most 1. In this paper we study these lower bounds, and the homotopy types of box complexes. The most interesting result is that up to &#x2124;2-homotopy the box complex B(G) can be any &#x2124;2-space. This together with topological constructions allows us to construct graphs showing that the mentioned two bounds are different. Some of the results were announced in [14].