ppxscal/embedding_network huggingface dataset:
Extending Graph-Cut to Continuous Value Domain Minimization
Authors: Michael Felsberg
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper we propose two methods for minimizing objective functions of discrete functions with continuous value domain. Many practical problems in the area of computer vision are continuous-valued, and discrete optimization methods of graph-cut type cannot be applied directly. This is different with the proposed methods. The first method is an add-on for multiple-label graph-cut. In the second one, binary graph-cut is firstly used to generate regions of support within different ranges of the signal. Secondly, a robust error minimization is approximated based on the previously determined regions. The advantages and properties of the new approaches are explained and visualized using synthetic test data. The methods are compared to ordinary multi-label graph-cut and robust smoothing for the application of disparity estimation. They show better quality of results compared to the other approaches and the second algorithm is significantly faster than multi-label graph-cut.
Visual data Processing and Action Control Using Binary Neural Network
Authors: A. V. Kazantsev
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

A new model of the brain-like neural network for visual data processing and action control is proposed. The neural network is built on discrete elements with binary input and output with memory cells. Optimization of the network is conducted using a natural selection process within the framework of an artificial life paradigm. The theoretical principles of the neuron and network structure construction have been tested and assured by real experiment using a computer program which models a population of virtual bacteria living and evolving in a restricted 2D area. Virtual bacteria act using binary visual information as input. Given the rules of survival and neural network mutation, new generations of bacteria form their brain using the neural networks of their successful predecessors. The proposed approach demonstrates the possibility of constructing a brain-like neural network based only on binary data processing.
Synthesis of Petri Nets from Finite Partial Languages
Authors: Robert Lorenz, Robin Bergenthum, Jorg Desel, Sebastian Mauser
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

In this paper we present an algorithm to synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial language). This p/t-net has minimal non-sequential behavior including the specified partial language. Consequently, either this net has exactly the non-sequential behavior specified by the partial language, or there is no such p/t-net. We finally develop an algorithm to test whether the synthesized net has exactly the non-sequential behavior specified by the partial language. The algorithms are based on the theory of regions for partial languages developed by Lorenz and Juhás. Thus, this paper shows the applicability of this concept and, for the first time, provides an effective algorithm for the synthesis of system models from partial languages.
Shredding your garbage: reducing data lifetime through secure deallocation
Authors: Jim Chow, Ben Pfaff, Tal Garfinkel, Mendel Rosenblum
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

Today's operating systems, word processors, web browsers, and other common software take no measures to promptly remove data from memory. Consequently, sensitive data, such as passwords, social security numbers, and confidential documents, often remains in memory indefinitely, significantly increasing the risk of exposure. We present a strategy for reducing the lifetime of data in memory called secure deallocation. With secure deal-location we zero data either at deallocation or within a short, predictable period afterward in general system allocators (e.g. user heap, user stack, kernel heap). This substantially reduces data lifetime with minimal implementation effort, negligible overhead, and without modifying existing applications. We demonstrate that secure deallocation generally clears data immediately after its last use, and that without such measures, data can remain in memory for days or weeks, even persisting across reboots. We further show that secure deallocation promptly eliminates sensitive data in a variety of important real world applications.
Unifying unified voice messaging
Authors: Jon Finke
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

Roughly 18 months after installing a unified voice messaging system, we picked it up and merged it into our pre-existing production email domain. This paper deals with both technical aspects deploying a unified messaging system, as well as the cultural shock of merging the very different operational domains of Email support with Telecommunications support into a shared support model. As an added bonus we will discuss the merging two Exchange/Active Directory worlds into one with minimal impact on the existing users of both systems. Lastly, we will discuss some issues of operating a partially unified voice messaging system.
Module Partitioning and Interlaced Data Placement Schemes to Reduce Conflicts in Interleaved Memories
Authors: Lizyamma Kurian, Bermjae Choi, Paul T. Hulina, Lee D. Coraor
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

In interleaved memories, interference between concurrently active vector streams results in memory bank conflicts and reduced bandwidth. In this paper, we present two schemes for reducing inter-vector interference. First, we propose a memory module partitioning technique in which disjoint access sets are created for each of the concurrent vectors. Various properties of the involved address mapping are presented. Then we present an interlaced data placement scheme, where the simultaneously accessed vectors are interlaced and stored to the memory. Performance of the two schemes are evaluated by trace driven simulation. It is observed that the schemes have significant merit in reducing the interference in interleaved memories and increasing the effective memory bandwidth. The schemes are applicable to memory systems for superscalar processors, vector supercomputers and parallel processors.
Jointly optimal downlink beamforming and base station assignment
Authors: M. Bengtsson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We present an algorithm that jointly determines the optimal downlink beamformers and the optimal assignment of each mobile to a base station. The optimality criterion is based on a systems perspective; provide sufficient quality of service for all users, transmitting as little excess power as possible. Since the algorithm is centralized and requires knowledge about all the channels in the system, it may be infeasible in a practical implementation. However, it provides the ultimate benchmark in system evaluations. Numerical examples show substantial gain compared to ordinary base station assignment.
Filters as a language support for design patterns in object-oriented scripting languages
Authors: Gustaf Neumann, Uwe Zdun
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Scripting languages are designed for glueing software components together. Such languages provide features like dynamic extensibility and dynamic typing with automatic conversion that make them well suited for rapid application development. Although these features entail runtime penalties, modern CPUs are fast enough to execute even large applications in scripting languages efficiently. Large applications typically entail complex program structures. Object-orientation offers the means to solve some of the problems caused by this complexity, but focuses only on entities up to the size of a single class. The object-oriented design community proposes design patterns as a solution for complex interactions that are poorly supported by current object-oriented programming languages. In order to use patterns in an application, their implementation has to be scattered over several classes. This fact makes patterns hard to locate in the actual code and complicates their maintenance in an application. This paper presents a general approach to combine the ideas of scripting and object-orientation in a way that preserves the benefits of both of them. It describes the object-oriented scripting language XOTcl (Extended OTcl), which is equipped with several language functionalities that help in the implementation of design patterns. We introduce the filter approach which provides a novel, intuitive, and powerful language support for the instantiation of large program structures like design patterns.
An Accurate and Efficient 3-Phase Measurement Method for IP Traffic Flow on High Speed Link
Authors: Gaogang Xie, Jianhua Yang, Valerie Issarny, Alberto Conte
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Flow metrics are critical for protocol research, anomaly detection, network operation and application deployment. There are great challenges to match every packet into millions of flows in high speed network link. A 3-phase measurement method for IP traffic flow is proposed in this paper. The packets are captured and classified into the flows through hash table, search tree and linear table with this approach. The traffic measurement systems in general purpose CPU platform and network processor platform with this method have been implemented and deployed in backbone links. The experiment on OC-48 backbone shows the average length search path for each packet is 7.7. Average process times of mapping successfully and unsuccessfully are about 1.3 \mu s and 1.8 \mus respectively at the length of search path 350. Traffic matrix, host behavior and other metrics can been easily deduced with our approach.
Synchronization by pilot signal
Authors: J. Joutsensalo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We propose a novel approach for code acquisition in a code-division multiple access (CDMA) communication system. The essential assumption is that the pilot signal of the desired user is available. If the codes are exactly orthogonal, the method can be derived from an optimization criterion. Using the pilot signal, the performance can be greatly improved without increasing the computational complexity. Simulations show that our method clearly outperforms the minimum variance method, eigenvector-based MUSIC, and matched filter.
HW-SW emulation framework for temperature-aware design in MPSoCs
Authors: David Atienza, Pablo G. Del Valle, Giacomo Paci, Francesco Poletti, Luca Benini, Giovanni De Micheli, Jose M. Mendias, Roman Hermida
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

New tendencies envisage multiprocessor systems-on-chips (MPSoCs) as a promising solution for the consumer electronics market. MPSoCs are complex to design, as they must execute multiple applications (games, video) while meeting additional design constraints (energy consumption, time-to-market). Moreover, the rise of temperature in the die for MPSoCs can seriously affect their final performance and reliability. In this article, we present a new hardware-software emulation framework that allows designers a complete exploration of the thermal behavior of final MPSoC designs early in the design flow. The proposed framework uses FPGA emulation as the key element to model hardware components of the considered MPSoC platform at multimegahertz speeds. It automatically extracts detailed system statistics that are used as input to our software thermal library running in a host computer. This library calculates at runtime the temperature of on-chip components, based on the collected statistics from the emulated system and final floorplan of the MPSoC. This enables fast testing of various thermal management techniques. Our results show speedups of three orders of magnitude compared to cycle-accurate MPSoC simulators.
Phygital Map: Accessing Digital Multimedia from Physical Map
Authors: Jin Nakazawa, Hideyuki Tokuda
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

We present an augmented map interface called Phygital (physical,digital) Map that enables users to access digital multimedia stored invarious off-the-shelf devices from physically printed maps, such as wall-mounted maps and atlas books. While the rapidly expanding variety of multimedia devices has been facilitated capturing the real world events through various digital media, the interface for playback of these digital media is not well integrated into the physical world. Phygital map addresses this difficulty by providing an interface that is capable of triggering and controlling multimedia devices and the network data sources, based on interactions on a printed map surface. Key features of Phygital Map are use of off-the-shelf devices for both media manipulations and the interface to make applications pervasive, an adoption of inexpensive positioning devices as tangible artifacts on maps, and an extensible infrastructure that can cope with varying devices built on growing number of middleware platforms. In this paper, we discuss the design and implementation of Phygital Map, and the ease of using it for multimedia exploration applications.
Biological Transactions for Quantitative Models
Authors: Federica Ciocchetta, Corrado Priami
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this work an extension of stochastic @p-calculus with biological transactions is presented. This permits to model multi-reactant multi-product reactions as atomic actions when quantitative information are given. First, the syntax and the semantics are defined, then some transaction properties are discussed. Finally, some examples are described.
A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network
Authors: Nan Du, Bin Wu, Liutong Xu, Bai Wang, Xin Pei
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Efficient enumeration of all maximal cliques in a given graph has many applications in Graph Theory, Data Mining and Bioinformatics. However, the exponentially increasing computation time of this problem confines the scale of the graph. Meanwhile, recent researches show that many networks in our world are complex networks involving massive data. To solve the maximal clique problem in the real-world scenarios, this paper presents a parallel algorithm Peamc (Parallel Enumeration of All Maximal Cliques) which exploits several new and effective techniques to enumerate all maximal cliques in a complex network. Furthermore, we provide a performance study on a true-life call graph with up to 2,423,807 vertices and 5,317,183 edges. The experimental results show that Peamc can find all the maximal cliques in a complex network with high efficiency and scalability.
Exploiting the TTL Rule in Unstructured Peer-to-Peer Networks
Authors: Georgios Pitsilis, Panayiotis Periorellis
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Peer-to-Peer networks exist with the volunteering cooperation of various entities on the Internet. Their self-structure nature has the important characteristic that they make no use of central entities to run as coordinators and the benefits of this cooperation can be enjoyed equally by all the members of the community with the assumption that they all make right use of the protocol. In this study we examine what the consequences on the community are in the case of existence of misbehaving nodes which can abuse the network resources for their personal benefit and we also analyze the cost and the benefit of some proposed solution that could be used in order to bring into account the above problem.
A domain specific language for video device drivers: from design to implementation
Authors: Scott Thibault, Renaud Marlet, Charles Consel
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Domain-specific languages (DSL) have many potential advantages in terms of software engineering ranging from increased productivity to the application of formal methods. Although they have been used in practice for decades, there has been little study of methodology or implementation tools for the DSL approach. In this paper we present our DSL approach and its application to a realistic application: video display device drivers. The presentation focuses on the validation of our proposed framework for domain-specific languages, which provides automatic generation of efficient implementations of DSL programs. Additionally, we describe an example of a complete DSL for video display adaptors and the benefits of the DSL approach in this application. This demonstrates some of the generally claimed benefits of using DSLs: increased productivity, higher-level abstraction, and easier verification. The DSL has been fully implemented with our approach and is available1.
Design, implementation and policy framework for a Linux based temperature sensitive storage
Authors: Venkatesh Pallipadi, K. Gopinath
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

Temperature Sensitive Storage (TSS) is a data storage architecture that keeps track of the access frequencies of data and uses this information to manage storage effciently and effectively. The term temperature refers to the access frequency of the data. TSS is a hierarchical storage architecture with frequently accessed data residing in a storage device with faster access time, while less frequently accessed data placed in a device which is more storage efficient. The hierarchy is currently a 3-tier architecture consisting of declustered RAID 1 (RAID1), RAID 5 (RAID5) and compressed RAID 5 (cRAID5) storage devices. The data is dynamically moved between these tiers, depending on their access frequencies. TSS, along with fast access and efficiency of storage, also provides reliability of data by incorporating redundancy in the system through the use of RAID architecture. Simple policies for dynamically managing the data have been implemented as user level daemon processes. They are independent of the low level implementation of the TSS driver. They make use of certain ioctl() calls provided by the TSS device driver. In this paper we discuss the design, implementation and policy framework of a Linux based TSS, and compare its performance with static RAID systems.
Fault-Tolerant Routing Algorithms for a Massively Parallel Machine
Authors: C. Aktouf, C. Robach, G. Mazare
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper studies the reconfiguration problem within a 2D MIMD machine, once the testing process is accomplished. For that, three fault-tolerant routing algorithms are proposed and their efficiency illustrated. The implementation results are also given.
Optimizing Free Space Optics for City-Wide Wireless Networks
Authors: Ahmed M. Mahdy, Jitender S. Deogun
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Recent advances in wireless communications have paved the road to the development of revolutionary city-wide wireless networks that provide a virtual wireless cloud covering large metro areas. City-Wide wireless networks offer unmatched options to different community sectors including local government, industry, business, people, and education. However, realizing the benefits and advantages of such a remarkable infrastructure is not straightforward. Extendibility and security limitations present a bottleneck for unrestricted growth of such networks. The future of city-wide wireless networks is in doubt unless these limitations are addressed and solutions are sought. In this paper, we propose free space optical systems as a cost effective backbone that can meet the requirements of future city-wide wireless networks. We study the deployment of free space optics and address major challenges.
Using Privacy Process Patterns for Incorporating Privacy Requirements into the System Design Process
Authors: Christos Kalloniatis, Evangelia Kavakli, Stefanos Gritzalis
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In the online world every person has to hold a number of different data sets so as to be able to have access to various e-services and take part in specific economical and social transactions. Such data sets require special consideration since they may convey personal data, sensitive personal data, employee data, credit card data etc. Recent surveys have shown that people feel that their privacy is at risk from identity theft and erosion of individual rights. The result is that privacy violation is becoming an increasingly critical issue in modern societies. To this end, PriS, a new security requirements engineering methodology, has been introduced aiming to incorporate privacy requirements early in the system development process. In this paper, we extend the PriS conceptual framework by introducing privacy process patterns as a way for describing the effect of privacy requirements on business processes. In addition, privacy process patterns facilitate the identification of the system architecture that best supports the privacy-related business processes, thus providing a holistic approach from business goals to "privacy-compliant' IT systems.
E-Risk Management through Self Insurance: An Option Model
Authors: Arunabha Mukhopadhyay, Binay Bhushan, Debashis Saha, Ambuj Mahanti
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

e-business organizations are under constant threat of their business being disrupted by hackers, viruses and a host of malicious attackers. This would lead to loses to the tune of millions. To ensure self- protection, they spend millions of dollars on firewalls, anti-virus, intrusion detection systems, digital signature and encryption. Nonetheless, a new virus or a clever hacker can easily compromise these deterrents. Organizations should resort to self e-risk insurance as a supplementary mechanism to reduce these individual financial losses. We propose in this paper two option modes for self- e-risk insurance, for hedging e-risk. The first is an exchange traded model, comprising of a long asset, long put and short call. The second is an over the counter model using a long call.