ppxscal/embedding_network huggingface dataset:
From adaptive renaming to set agreement
Authors: Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers
Venue: Theoretical Computer Science (2009)

The adaptive M-renaming problem consists of providing processes with a new name taken from a name space whose size M depends only on the number p of processes that participate in the renaming (and not on the total number n of processes that could ask for a new name). The k-set agreement problem allows each process that proposes a value to decide a proposed value in such a way that at most k different values are decided. In an asynchronous system prone to up to t process crash failures, and where processes can cooperate by accessing atomic read/write registers only, the best that can be done is a renaming space of size M=p+t. In the same setting, the k-set agreement problem cannot be solved when t>=k. This paper focuses on the way a solution to the adaptive renaming problem can help in solving the k-set agreement problem when t>=k. It has two contributions. Considering the case k=t (1@?t2k (i.e. adaptive (p+k-1)-renaming allows progressing from k>t to k=t, but does not allow bypassing the ''k=t'' frontier when n>2k).
A 2-Layered Infrastructure of Content-Based Image Retrieval on Peer-to-Peer Network
Authors: Wei Mao, Jie Yang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

There are currently two interface types for searching and browsing large image collections: keyword-based image retrieval (KBIR), and content-based image retrieval (CBIR). The KBIR system searches images according to the text of keyword annotated on images. This method is simple and relative effective to the query user, however, manpower-costly and likely to result in semantic gap. Because of the inherently complicated characteristics of image information, the CBIR system is of extremely high computing performance demand and hardly scalable due to the centralized architecture of traditional Client/Server network. We argue process of CBIR and similarity measurement of images, propose an index model in image database for CBIR system, and then present a hybrid peer-to-peer (P2P) network model of CBIR system based on 2-layered infrastructure in which the advantages of both distributed computing and centralized managing are integrated. We finally implement a prototype of this CBIR system on the JXTA framework.
Superior-Order Curvature-Corrected Logarithmic CMOS Nanostructure
Authors: Cosmin Popa
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

A new high precision superior-order curvature-corrected integrated nanostructure will be presented. In order to improve the temperature behavior of the circuit, a double differential structure will be used, implementing the linear and the superior-order curvature corrections. An original CTAT (Complementary To Absolute Temperature) voltage generator will be proposed, using exclusively MOS transistors biased in weak inversion for a low power operation of the integrated nanostructure, having two great advantages: an important reducing of the circuit silicon area and an improved accuracy (matched resistors being replaced by matched MOS active devices). The superior-order curvature-correction will be implemented by taking the difference between two gate-source voltages of subthreshold-operated MOS transistors, biased at drain currents having different temperature dependencies: PTAT (Proportional To Absolute Temperature) and PTAT2. The SPICE simulations confirm the theoretical estimated results, showing a temperature coefficient under 9.4ppm/K for an extended input range 173K
A system theoretic study on a treatment of AIDS patient by achieving long-term non-progressor
Authors: H. Shim, N. H. Jo, H. Chang, J. H. Seo
Venue: Automatica (Journal of IFAC) (2009)

There has been much recent interest in the long-term non-progressor (LTNP), who has been infected with human immunodeficiency virus (HIV) but does not proceed to AIDS. Under the assumption that a mathematical model describing the HIV infection and drug effects is true for real systems, we claim that it is possible to steer the state of any patients to that of LTNP if the model parameters belong to the proposed parameter intervals. Once the state is transferred close to LTNP, CTL memory is established and the viral load remains very low level even after the medication is stopped. In order to justify the claim, we first analyze the stability and the bifurcation of the model and show that there exists an equilibria curve towards LTNP, which is stable for all fixed constant inputs except some singular points. Then, we propose a new treatment strategy based on a useful property of Non-vanishing Basin of Attraction (NvBA)-stability. An extensive simulation study is also included to validate the proposed treatment for various initial conditions and to show the robustness against the parameter uncertainty. From a practical perspective, it deserves further investigation whether the proposed treatment strategy could switch a patient into LTNP in the real world.
SDL distributed simulator
Authors: Pau Fonseca i Casas
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Formalisms allows the complete understanding of a simulation model and helps in its implementation. However only few simulation tools allows an automatic construction of a simulation model based in a formalization of the system. SDL is a modern object oriented formalism that allows the definition of distributed systems. It has focused on the modeling of reactive, state/event driven systems, and has been standardized by the International Telecommunications Union (ITU) in the Z.100 recommendation Since it is a graphical formalism simplifies the understanding of the model. In this poster we show an implementation of a simulation infrastructure that follows SDL formalization language. This infrastructure allows a distributed simulation of the models without any modification to the model definition. Since this infrastructure follows the SDL language formalism it is useful not only for a production use, but to teach formalisms and distributed simulation concepts. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
WiFIsViz: Effective Visualization of Frequent Itemsets
Authors: Carson Kai-Sang Leung, Pourang P. Irani, Christopher L. Carmichael
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Frequent itemset mining plays an essential role in the mining of many different patterns. Most existing frequent itemset mining algorithms return the mined results--namely, frequent itemsets--in the form of textual lists. However, the use of visual representation can enhance the user understanding of the inherent relations in a collection of frequent itemsets. In this paper, we propose an effective visualizer, called WiFIsViz, to display the mined frequent itemsets. WiFIsViz provides users with an overview and details about the itemsets. Moreover, this visualizer is also equipped with several interactive features for effective visualization of the frequent itemsets mined from various real-life applications.
The implementation of a cryptography-based secure office system
Authors: Christian Mueller-Schloer, Neal R. Wagner
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A cryptography-based secure office system is discussed, including design criteria and a specific implementation. The system is intended to be practical, simple, and inexpensive, but also highly secure. The implementation uses a hybrid scheme of conventional (DES) and public-key (RSA) cryptography. Randomly generated DES keys encrypt messages and files, and the DES keys themselves and a one-way hash of the messages are encrypted and signed by RSA keys. The system provides secure electronic mail (including electronic registered mail and an electronic notary public), secure two-way channels, and secure user files. Timestamps and a special signed file of public keys help decrease the need for an online central authority involved in all transactions.
Image Content Extraction Using a Bottom-Up Visual Attention Model
Authors: Ionut Pirnog, Cristina Oprea, Constantin Paleologu
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper we propose a perceptual approach to content analysis based on region segmentation. Content adaptation has become one of the most important problems in recent years due to fast growing of multimedia based services. The process of content analysis and extraction represents one step in solving the problem of content adaptation. Adaptation means the preparation and delivery of content that matches the resources of the connected terminal or network in an optimal way. The proposed content extraction method it can be classified as perceptual because it uses HVS to detect salient regions in images. The main idea of this approach is to adapt the content to the user resources without loss of salient information. Region segmentation is used for object detection and combined with the bottom-up visual attention model can lead to salient object detection.
An efficient method of image identification by combining image features
Authors: Jaekyong Jeong, Chijung Hwang, Byeungwoo Jeon
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper proposes an efficient image identification method by combining image features and using image clustering. For more efficient image identification, we use global and local features in a hierarchical manner. The combined global feature reflecting general information of image helps faster retrieval of candidate images and the feature point based local feature facilitates more accurate fine matching with the candidate images. We consider the Fuzzy C-Means clustering method since it is effective for the image data which are characteristically alike and have fuzzy boundary in coordinate by their global features. The global feature vector which we use is very effective in clustering and retrieval since it represents general properties of image and its dimension is very low. As a result, the number of fine matching which requires very large computing time and high complexity is considerably decreased since searching original image of query is done by fine matching within partial database of candidate images.
STARAN parallel processor system hardware
Authors: Kenneth E. Batcher
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The parallel processing capability of STARAN resides in n array modules (n&le;32). Each array module contains 256 small processing elements (PE's). They communicate with a multi-dimensional access (MDA) memory through a "flip" network, which can permute a set of operands to allow inter-PE communication. This gives the programmer a great deal of freedom in using the processing capability of the PE's. At one stage of a program, he may apply this capability to many bits of one or a few items of data; at another stage, he may apply it to one or a few bits of many items of data.
Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Venue: Workshop on Program Analysis for Software Tools and Engineering (2008)

This volume constitutes the proceedings of Program Analysis for Software Tools and Engineering (PASTE) 2008, held November 9--10, 2008 in Atlanta, Georgia, USA, co-located with SIGSOFT 2008 Symposium on Foundations of Software Engineering. This year PASTE solicited both short (three-page) and long (six-page) papers. In both cases the length excluded the formal bibliography, which could be as long as necessary. Every paper received a minimum of four reviews, and many had five. Out of twenty-six submissions, we accepted thirteen. The program committee met by software and telephone. The workshop was kicked off on the first day with an invited presentation by Tevfik Bultan on modularity, interfaces, and verification, and on the second day with an invited presentation by Somesh Jha on retrofitting legacy code for security.
A Framework for Reputation Management in Large-Scale Distributed Systems
Authors: Yiduo Mei, Shangyuan Guan, Xiaoshe Dong, Siyuan Ma, Zhao Wang
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

The increasing security requirements for distributed collaborations, as well as the trend toward large-scale and remote geographically-dispersed computer systems, have created a growing demand for better trustfulness evaluation of participants involved in the collaboration. We propose a novel local-weighted and global feedback-based reputation framework for reputation management to facilitate secure collaborations in large-scale distributed systems. Different from existing works, we evaluate feedback trustfulness of participants involved in the collaboration in our proposed framework. Experimental results show that our proposed framework is applicable, effective and robust in combating malicious participants and malicious behaviors in large-scale distributed systems such as peer-to-peer networks.
A systems approach to career development: report of two surveys
Authors: Paul D. Oyer, Dorothy L. Ray
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The so-called profession of computer data processing has barely reached adolescence. Like the electrical engineering profession of 25 years ago we have no standards for describing our job tasks (what we do), nor for defining job skills needed (how we do it), nor for defining educational needs (what we need to know), nor for estimating time and cost for a complete job (how long it takes and level of skills/knowledge needed).
Research and Design of PINS Simulator Based on UnderWater Vehicle Space Model
Authors: Jian-hua Cheng, Xu-hong Cheng, Xin-zhe Wang, Yan-ling Hao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Vehicle mobile movement can cause dynamic error of the Platform inertial navigation system (PINS) which is widely used in underwater vehicle. Taking PINS as the research object, the space motion mathematical models of underwater vehicle are analyzed and established by reasonable simply. Through coordinate transformation relationship research of the fixed coordinate system, the moving coordinate system and the local present coordinate system, the underwater vehicle actual space motion can be embedded in the PINS. It can provide PINS the input information which contain the east and north acceleration real-timely by controlling vehicle motion and get the navigation which is more close to underwater actual motion. Thus the whole PHINS simulator based on underwater vehicle motion model are realized. Computer simulation result show the embeddedmethod is right and the PINS simulator can realized the actual simulation well. This is a new good method for the movement adaptability examination of INS.
Augmented Reality for First Response Scenarios: Navigational and Reference Device Based on ComputerVision Techniques
Authors: Robert Andrzej Bogucki
Venue:  (2008)

Making life-critical decisions based on limitedinformation about an environment is a fact of lifefor first response professionals (firefighters,HAZMAT teams, antiterrorist or rescue teams, lawenforcement officers) and military personnel. Theconfluence of computing technologies and newuser interface paradigms holds the key toincreasing situational awareness and cognitivelyassisting responders. This monographdetails the design and implementation of a prototypeindoor Augmented Reality device based on commercialoff-the-shelf components, developed by theauthor in the course of his postgraduate work. Thedevice provides the user with location-specificinformation and offers capabilities for team membertracking. Presented here are the design rationales,user interface and interaction design details as wellas software/hardware component selection andintegration steps. The book is a design case study aswell as an application-specific introduction to thefield of Augmented Reality, and is addressed toreaders of various backgrounds - Mixed Realityresearchers and enthusiasts, municipal and publicservices decision-makers, computer interface designprofessionals or students.
Interaction with Information Graphics: A Content-Based Approach
Authors: Anna Kämäräinen, Pertti Saariluoma
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Understanding information graphics rely on thought process of graphics' reader, and thinking has the most important role in interpretation and exploitation. We are interested in the cognitive mechanisms underlying interaction with information graphics. In this study, we studied those cognitive processes which are employed when interacting with information graphics. Based on these experiments, we have separated four different types of thought processes which occur during the interactions with information graphics. We propose that these thought processes are apperception, restructuring, reflection and construction.
Detecting and tolerating asymmetric races
Authors: Paruj Ratanaworabhan, Martin Burtscher, Darko Kirovski, Benjamin Zorn, Rahul Nagpal, Karthik Pattabiraman
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

This paper introduces ToleRace, a runtime system that allows programs to detect and even tolerate asymmetric data races. Asymmetric races are race conditions where one thread correctly acquires and releases a lock for a shared variable while another thread improperly accesses the same variable. ToleRace provides approximate isolation in the critical sections of lock-based parallel programs by creating a local copy of each shared variable when entering a critical section, operating on the local copies, and propagating the appropriate copies upon leaving the critical section. We start by characterizing all possible interleavings that can cause races and precisely describe the effect of ToleRace in each case. Then, we study the theoretical aspects of an oracle that knows exactly what type of interleaving has occurred. Finally, we present two software implementations of ToleRace and evaluate them on multithreaded applications from the SPLASH2 and PARSEC suites. Our implementation on top of a dynamic instrumentation tool, which works directly on executables and requires no source code modifications, incurs an overhead of a factor of two on average. Manually adding ToleRace to the source code of these applications results in an average overhead of 6.4 percent.
A Novel P2P Traffic Identification Scheme Based on Support Vector Machine Fuzzy Network
Authors: Zhong Gao, Guanming Lu, Daquan Gu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the rapid development of the Internet, the P2P (Peer-to-Peer) technology which is characterized by no utilization of any servers with centralized functions has kept advancing apace. However, how to improve the accuracy of the P2P traffic identification efficiently is still a challenging problem. In this paper, we propose a new approach for P2P traffic identification, which uses a novel Support Vector Machine Fuzzy Network (SVMFN) to make the identification more suitable and accurate in various network environments with different rates. The experimental results show that the generalization performance and the accuracy of identification are improved significantly compared to that of the traditional methods, and adapt to engineering applications.
Knowledge representation and the dimensions of a multi-model relationship
Authors: Charles Turnitsa, Andreas Tolk
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The exchange of data between different models in a multisimulation environment is about the exchange of information from within the context of two separate worldviews. This amounts to knowledge (information in context). To represent this knowledge, in any of a number of different ways (meta-data, ontological reference, frames, etc.) there must be a method to bridge the gap between what the worldview of origination can represent and what the worldview of destination can receive. This requires some understanding of the dimensions of difference between the two worldviews. As each separate model is the product of a different perspective by the model's developer, each individual model will have a different worldview. Understanding what these differences are, and viewing them in light of the requirements for conceptual interoperability will contribute a great teal to the knowledge that must be captured for meaningful exchange.
Putting a Slug to Work
Authors: Konstantin Läufer, George K. Thiruvathukal, Ryohei Nishimura, Carlos Ramírez Martínez-Eiroa
Venue: Computing in Science and Engineering (2009)

In this article, the authors explore various uses of inexpensive embedded Linux devices such as the Linksys NSLU2 ("slug"). Embedded computing is a topic of growing interest. Although novel architectures such as cell processors, graphics processors (GPUs), and FPGAs are growing in popularity, conventional microproessor designs such as Intel's Xscale (ARM) and Atom pack a punch in a small footprint, not to mention being widely supported by commodity operating system and development tools. We're convinced that this entire space is a tool worth keeping in the scientific programmer's and software developer's toolchests.
A hemisystem of a nonclassical generalised quadrangle
Authors: John Bamberg, Frank De Clerck, Nicola Durante
Venue: Designs, Codes and Cryptography (2009)

The concept of a hemisystem of a generalised quadrangle has its roots in the work of B. Segre, and this term is used here to denote a set of points $${\mathcal{H}}$$ such that every line meets $${\mathcal{H}}$$ in half of the points of . If one takes the point-line geometry on the points of the hemisystem, then one obtains a partial quadrangle and hence a strongly regular point graph. The only previously known hemisystems of generalised quadrangles of order (q, q 2) were those of the elliptic quadric $${\mathsf{Q}^-(5,q)}$$ , q odd. We show in this paper that there exists a hemisystem of the FisherThasWalkerKantor generalised quadrangle of order (5, 52), which leads to a new partial quadrangle. Moreover, we can construct from our hemisystem the 3&middot; A 7-hemisystem of $${\mathsf{Q}^-(5,5)}$$ , first constructed by Cossidente and Penttila.