ppxscal/embedding_network huggingface dataset:
Case Studies in Planar Part Feeding and Assembly Based on Design of Limit Sets
Authors: T.D. Murphey, K.M. Lynch
Venue: International Journal of Robotics Research (2008)

Vibration is commonly used in industrial parts feeding and alignment processes, and to provide energy to encourage mobility among self-assembling parts. We are studying a simple model of agitation where planar parts are repetitively thrown by a simple one-degree-of-freedom throwing surface, caught and allowed to settle. Throwing actions result in nonlinear discrete-time maps in the parts' configuration space, exhibiting behaviors such as unique fixed points and uncertainty-reducing forward limit sets with large basins of attraction. We show how to shape these maps by choosing the arm geometry, throwing velocity and mass parameters of the parts. In some cases, we can design a single map that is guaranteed to uniquely position and orient a part. In other cases, we can design multiple maps corresponding to different throw velocities such that the composition of the maps can be used to drive multiple parts to a desired assembly. Switching between the throw actions is triggered by simple sensors that recognize when the system has achieved a configuration in the basin of attraction of a subsequent map.
Efficient And Secure Pseudo-Random Number Generation
Authors: U. V. Vazirani
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Cryptographically secure pseudo-random number generators known so far suffer from the handicap of being inefficient; the most efficient ones can generate only one bit on each modular multiplication (n/sup 2/ steps). Blum, Blum and Shub ask the open problem of outputting even two bits securely. We state a simple condition, the XOR-Condition, and show that any generator satisfying this condition can output logn bits on each multiplication. We also show that the logn least significant bits of RSA, Rabin's Scheme, and the x/sup 2/ mod N generator satisfy boolean predicates of these bits are secure. Furthermore, we strengthen the security of the x/sup 2/ mod N generator, which being a Trapdoor Generator, has several applications, by proving it as hard as Factoring.
Strategies for shape matching using skeletons
Authors: Wooi-Boon Goh
Venue: Computer Vision and Image Understanding (2008)

Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance of such shape matching algorithms. Firstly, it is important that ligature-sensitive information be incorporated into the part decomposition and shape matching processes. Secondly, part decomposition should be treated as a dynamic process in which the selection of the final decomposition of a shape is deferred until the shape matching stage. Thirdly, both local and global measures must be employed when computing shape dissimilarity. Finally, skeletal segments must be weighted by appropriate visual saliency measures during the part matching process. These saliency measures include curvature and ligature-based measures. Experimental results show that the incorporation of these strategies significantly improves shape database retrieval accuracy.
Data replication in p2p environments
Authors: André Brinkmann, Sascha Effert
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Current p2p environments are often based on Consistent Hashing as underlying distributed hash table (DHT). The drawback of Consistent Hashing for small or mid-sized environments is that it is not able to efficiently use the available storage capacity, if the environment consists of heterogeneous peers. Inside this paper, we investigate the Redundant Share strategy and introduce the peer-Replication strategy, which are able to ensure an optimal capacity efficiency, even in case of data replication. While Redundant Share is not always able to retrieve all copies inside the view of a client, peer-Replication achieves this property by introducing a small number of additional communication rounds. The trade-off between the proposed peer-Replication strategy and Consistent Hashing is the number of required communication rounds vs. the quality of the data distribution. Inside this paper we show that a very small number of additional communication rounds enables us to significantly increase the capacity efficiency.
Strongly algebraic = SFP (topically)
Authors: Steven Vickers
Venue: Mathematical Structures in Computer Science (2001)

Certain &lsquo;Finite Structure Conditions&rsquo; on a geometric theory are shown to be sufficient for its classifying topos to be a presheaf topos. The conditions assert that every homomorphism from a finite structure of the theory to a model factors via a finite model, and they hold in cases where the finitely presentable models are all finite. The conditions are shown to hold for the theory of strongly algebraic (or SFP) information systems and some variants, as well as for some other theories already known to be classified by presheaf toposes. The work adheres to geometric constructivism throughout, and in consequence provides &lsquo;topical&rsquo; categories of domains (internal in the category of toposes and geometric morphisms) with an analogue of Plotkin's double characterization of strongly algebraic domains, by sets of minimal upper bounds and by sequences of finite posets.
Random classification noise defeats all convex potential boosters
Authors: Philip M. Long, Rocco A. Servedio
Venue: Proceedings of the 25th international conference on Machine learning (2008)

A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class includes AdaBoost, LogitBoost, and other widely used and well-studied boosters. In this paper we show that for a broad class of convex potential functions, any such boosting algorithm is highly susceptible to random classification noise. We do this by showing that for any such booster and any nonzero random classification noise rate &eta;, there is a simple data set of examples which is efficiently learnable by such a booster if there is no noise, but which cannot be learned to accuracy better than 1/2 if there is random classification noise at rate &eta;. This negative result is in contrast with known branching program based boosters which do not fall into the convex potential function framework and which can provably learn to high accuracy in the presence of random classification noise.
Partial and complete local diagnosis in computer systems with circulant structure
Authors: Yu. K. Dimitriev
Venue: Automation and Remote Control (2008)

System diagnosis at multiple faults of multiplicity not greater than t is considered. The conditions when the state of each system module is only determined by the testing rusults of the physically connected modules (self-determination conditions) are analysed. The diagnosability conditions are established for the case when the self-determination conditions are not satisfied for any module. A new class of locally (t r /t)-diagnosable systems is introduced, where t is the fault multiplicity and t r is the multiplicity of faults at which the states of all system modules can be determined correctly and completely. The values of t r are estimated. It is shown that the local t-diagnosability can be achieved by the system test redundancy.
Development of Pedestrian-to-Vehicle Communication System Prototype for Pedestrian Safety Using both Wide-Area and Direct Communication
Authors: Chika Sugimoto, Yasuhisa Nakamura, Takuya Hashimoto
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The realization of a safe road traffic environment is required in order to reduce the number of pedestrian accidents. We propose a prototype pedestrian-to-vehicle communication system which uses a cellular phone and wireless communication to improve the safety of pedestrians. One of the effectual measures against pedestrian-to-vehicle accidents is to make each of pedestrians and drivers find the others and recognize the risk from out of sight and with time to spare for avoidance of accidents. A pedestrian-to-vehicle communication system was developed by using a cellular phone and a car navigation system equipped with GPS and wireless communication function. We focused on intersections as a traffic scene to be covered by the system because pedestrian accidents often occur around intersections at which pedestrians are out of sight of drivers. Over-the-horizon propagation property and communication characteristics of wireless LAN were examined at street intersections and the application potential as the P2P communication method to exchange information between pedestrians and vehicles without infrastructure was shown. After data was exchanged via FOMA in a wide area, information could be exchanged between a pedestrian and a vehicle via WLAN 20m, 100m away from an intersection to different directions in about 20ms. And, the system could give an alarm to pedestrians and cars with collision risk.
Adaptive watermark mechanism for rightful ownership protection
Authors: Chin-Chen Chang, Pei-Yu Lin
Venue: Journal of Systems and Software (2008)

Watermarking is used to protect the integrity and copyright of images. Conventional copyright protection mechanisms; however, are not robust enough or require complex computations to embed the watermark into the host image. In this article, we propose an adaptive copyright protection scheme without the use of discrete cosine transformation (DCT) and discrete wavelet transformation (DWT). This novel approach allows image owners to adjust the strength of watermarks through a threshold, so that the robustness of the watermark can be enhanced. Moreover, our scheme can resist various signal processing operations (such as blurring, JPEG compression, and noising) and geometric transformations (such as cropping, rotation, and scaling). The experimental results show that our scheme outperforms related works in most cases. Specifically, our scheme preserves the data lossless requirement, so it is suitable for medical and artistic images.
Undergraduate data communications and networking projects using opnet and wireshark software
Authors: Vasil Y. Hnatyshin, Andrea F. Lobo
Venue: ACM SIGCSE Bulletin (2008)

The national importance of creating "content reflecting cutting edge developments in STEM fields" has been recognized the National Science Foundation. The National Research Council has also noted that creating engaging laboratory and classroom experiences is a challenge to effective undergraduate education in STEM disciplines. In this paper we present our endeavors to address these issues in the field of computer networks. We discuss our experiences with novel laboratory and classroom projects using OPNET and Wireshark software products in undergraduate networking courses. These laboratories help undergraduate students understand fundamental networking concepts through modeling and simulation of computing systems. We have found that their use enhances student learning and interest in the subject of computer networks.
A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
Authors: Ali Haydar Özer, Can Özturan
Venue: Computers and Operations Research (2009)

Single unit combinatorial auction problem (CAP) and its multi-unit extension have received a lot of attention recently. This paper introduces yet another variant of CAP which generalizes the multi-unit CAP further to allow bids on collections of items that can come from bidder defined classes of items. A bidder may be indifferent to some items with different brands, specifications or qualities and consider them as substitutable. In this case, these items can be put in a class and hence the bids can be made by referring to the items in such classes. This model enables the bidder to express his requests by using less number of bids in case he does not discriminate between different items. Because of this, we call this problem multi-unit nondiscriminatory combinatorial auction (MUNCA) problem. An integer programming formulation is given for this problem. Since this problem is NP-hard, two fast heuristic algorithms have also been designed. The heuristics give quite good solutions when compared to the optimal solution.
Fostering user-developer collaboration with infrastructure probes
Authors: Christian Dörner, Jan Heß, Volkmar Pipek
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

In this paper we present a new variation of cultural probes, called Infrastructure Probes (IP). IPs can be seen as an additional ethnographic method to get a deeper understanding of the user's working context and thus help to improve the collaboration between users and developers regarding requirements elicitation. They consist of a screenshot tool, a digital camera, Post-it's, forms, an IT diary and a writing pad, allowing end users to observe and document their use of the IT infrastructure in question with special emphasis on problematic situations. The results of a first evaluation of the concept show that IPs could supplement traditional ethnographic methods to give researchers as well as software engineers a deeper insight into the working habits of users, but could also be a means for users to document and exchange technology usages. For a reflection of the IP concept we conducted feedback workshops together with the participants of the evaluation. The feedback resulted in an improved version which is currently already under evaluation.
Suitable remote sensing method and data for mapping and measuring active crop fields
Authors: H. Xie, Y. Q. Tian, J. A. Granillo, G. R. Keller
Venue: International Journal of Remote Sensing (2007)

The objective of the study was to examine suitable remote sensing methods and data for mapping and measuring the acreages of active crop lands in order to improve irrigation management. We compared classification results from a supervised classification method and a method using normalized difference vegetation index (NDVI) with additional pre-classification processing. IKONOS and Landsat Enhanced Thematic Mapper Plus (ETM+) images were tested to see if high spatial resolution remote sensing data would have significant advantages in distinguishing between active and fallow lands. The classification achieved an overall accuracy of 93.63%. The results showed that the supervised classification did not have a clear advantage over the simple method using NDVI at the level of distinguishing between active crops and fallow lands. The result suggests that using ETM+ instead of IKONOS high spatial resolution imageries is appropriate because of the high cost of IKONOS imageries and image heterogeneity of agricultural fields. It was shown that pre-processing with a mask to exclude the non-agricultural objects blended with agricultural fields is critical.
Attitudes and practices of students towards password security
Authors: Delbert Hart
Venue: Journal of Computing Sciences in Colleges (2008)

Passwords are the core authentication method behind most computer security systems. This paper presents a summary of the responses of students to a survey on password practices and attitudes. The paper also presents the results of an experiment to determine the effect of a brief presentation of password security best practices on students.
Numerical solution of a singularly perturbed three-point boundary value problem
Authors: M. Cakir, G. M. Amiraliyev
Venue: International Journal of Computer Mathematics (2007)

We consider a uniform finite difference method on an S-mesh (Shishkin type mesh) for a singularly perturbed semilinear one-dimensional convection-diffusion three-point boundary value problem with zeroth-order reduced equation. We show that the method is first-order convergent in the discrete maximum norm, independently of the perturbation parameter except for a logarithmic factor. An effective iterative algorithm for solving the non-linear difference problem and some numerical results are presented.
An Area-Efficient Design of Variable-Length Fast Fourier Transform Processor
Authors: Shuenn-Shyang Wang, Chien-Sung Li
Venue: Journal of Signal Processing Systems (2008)

Fast Fourier transform (FFT) plays an important role in the orthogonal frequency division multiplexing (OFDM) communication systems. In this paper, we propose an area-efficient design of variable-length FFT processor which can perform various FFT lengths of 512/1,024/2,048/4,096/8,192 points used in OFDM-based communication systems, such as digital audio broadcasting (DAB), digital video broadcasting-terrestrial (DVB-T) and digital video broadcasting-handheld (DVB-H). To reduce computational complexity and chip area, we develop a new variable-length FFT architecture by devising a mixed-radix algorithm that consist of radix-2, radix-22 and radix-2/4/8 algorithms and optimizing the realization by substructure sharing. Based on this architecture, an area-efficient design of variable-length FFT processor is presented. By synthesized using the UMC 0.18 μm process, the area of the processor is 2.9 mm2 and the 8,192-point FFT can be performed correctly up to 50 MHz with power consumption 823 mW under a 1.8 V supply voltage.
De-constructing and re-constructing aspect-orientation
Authors: William Harrison
Venue: Proceedings of the 7th workshop on Foundations of aspect-oriented languages (2008)

Through its decade-and-a-half long evolution, the aspect-oriented software community has occasionally struggled with its identity -- revisiting the question "What kinds of technologies make up aspect-oriented software and who should be interested in it?" We attempt to de-construct "aspect-oriented" into several issues making up its foundation, believing that the community is inclusive and that work exploring or exploiting any of these concepts fits within the community. Although their historical setting contributes somewhat to the understanding of why different authors have emphasized one or more of these issues, we analyze them from an intrinsic point-of-view, to highlight broader or deeper issues that may lie behind the constructs currently made available, in the hope that "aspect-oriented" software technologies can be extended to provide an even stronger basis for software than they do today.
Against lock-based semantics for transactional memory
Authors: Victor Luchangco
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

In this position paper, I argue that transactional memory should not be specified in terms of locks. In particular, the semantics of transactional memory in the face of nontransactional access, weak memory consistency guarantees and compiler transformations should not be determined by the behaviors exhibited by lock-based implementations. Specifying transactional behavior in terms of locks would repeat mistakes made in the database community and likely result in specifications as inscrutable to programmers as the memory consistency models that proliferated in the 1990s. It would undercut the promise of transactional memory to free us from the tyranny of lock-based programming and the fragile programs that result, a promise based on the potential for transactions to provide a measure of modularity for concurrent programs. We should strive to preserve that potential as we relax transactional guarantees to admit more efficient implementations.
A Fast Boundary Tracing Scheme Using Image Patch Classification
Authors: Weijia Shen, Ashraf A. Kassim, Wang Shih-Chang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This paper proposes a novel fast boundary tracing scheme which naturally encodes the prior knowledge. Another advantage is that this scheme is independent of the subsequent segmentation process. Therefore, it can serveas a pre-processing step in any segmentation scheme. Forexample, it could be used to automatically generate a close-to-boundary initialization for all types of deformable models. Topographic Independent Component Analysis (TICA)based feature exaction technique is adopted for learning arepresentation from a set of image patches in an unsupervised way. During learning, a topographic map of basis components emerge. A unique intelligent contour generation procedure is also proposed. Experimental results on abdominal CT images demonstrate the potential of our approach.
Classifiers without borders: incorporating fielded text from neighboring web pages
Authors: Xiaoguang Qi, Brian D. Davison
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Accurate web page classification often depends crucially on information gained from neighboring pages in the local web graph. Prior work has exploited the class labels of nearby pages to improve performance. In contrast, in this work we utilize a weighted combination of the contents of neighbors to generate a better virtual document for classification. In addition, we break pages into fields, finding that a weighted combination of text from the target and fields of neighboring pages is able to reduce classification error by more than a third. We demonstrate performance on a large dataset of pages from the Open Directory Project and validate the approach using pages from a crawl from the Stanford WebBase. Interestingly, we find no value in anchor text and unexpected value in page titles (and especially titles of parent pages) in the virtual document.
Comments on the Complete Characterization of a Family of Solutions to a Generalized Fisher Criterion
Authors: Jieping Ye
Venue: The Journal of Machine Learning Research (2008)

Loog (2007) provided a complete characterization of the family of solutions to a generalized Fisher criterion. We show that this characterization is essentially equivalent to the original characterization proposed in Ye (2005). The computational advantage of the original characterization over the new one is discussed, which justifies its practical use.
Combining Immune with Ant Colony Algorithm for Geometric Constraint Solving
Authors: Hua Yuan, Yi Li, Wenhui Li, Kong Zhao, Duo Wang, Rongqin Yi
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Geometric Constraint Problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on Ant Colony Optimization algorithm and the immune system model is proposed to provide solution to the Geometric Constraints Problem. In the new algorithm, affinity calculation process and pheromone trail lying is embedded to maintain diversity and carry out the global search and the local search in many directions rather than one direction around the same individual simultaneously. This new algorithm different with current optimization methods in that it gets the good solution by excluding bad solutions. The experimental results reported here will shed more light into how affects the hybrid algorithm's search power in solving Geometric constraint problem.
NetFailPAC: A Single Failure Protection Algorithm with QoS Provision for Optical WDM Networks
Authors: W. Grote, A. Arenas, A. Zapata
Venue: Proceedings of the Third International Conference on Systems (2008)

By sharing the protection bandwidth of high-priority connections (HPC) with the bandwidth of low-priority (LPC) ones, NetFailPAC (Network Failure Protection Algorithm with Class of Service) establishes working (HPC and LPC) and protection routes (for HPC only) in a WDM network. By using bandwidth as the main metric to select the working and backup paths, it out performs previous proposals increasing high-priority connection setup capabilities from 0% to 50% without additional infrastructure, while maintaining similar network performance.