ppxscal/embedding_network huggingface dataset:
Load-oriented and interference-aware channel assignment for multicasting in wireless mesh networks
Authors: Wen-Lin Yang, Cheng-Huang Tung
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In this paper, we investigate a problem concerning that a multimedia delivering system is deployed on a WMN in which a large amount of end-users may subscribe for receiving a video/audio stream from the video server simultaneously. For delivering the continuous stream without interference, a non-overlapping channel constrained multicast tree is then required to be determined. Due to the limited number of non-overlapping channels, we may have a situation that some links may not have channels allocated. As a result, some end-users may not receive the streams they have subscribed. That is, the resulting multicast tree may cover a subset of mesh routers where end-users can receive video streams successfully. Thus, our goal is to determine a partial multicast tree that can maximize the number of serviced end-users. The problem is referred as the multi-channel constrained multicasting (MCCM) problem. We propose an algorithm named LCMR for this problem. The experimental results show that the partial multicast tree determined by our LCMR method outperforms the trees found by the previous published approaches in terms of the number of serviced end-users.
Computing expectations with continuous p-boxes: Univariate case
Authors: Lev Utkin, Sebastien Destercke
Venue: International Journal of Approximate Reasoning (2009)

Given an imprecise probabilistic model over a continuous space, computing lower/upper expectations is often computationally hard to achieve, even in simple cases. Because expectations are essential in decision making and risk analysis, tractable methods to compute them are crucial in many applications involving imprecise probabilistic models. We concentrate on p-boxes (a simple and popular model), and on the computation of lower expectations of non-monotone functions. This paper is devoted to the univariate case, that is where only one variable has uncertainty. We propose and compare two approaches: the first using general linear programming, and the second using the fact that p-boxes are special cases of random sets. We underline the complementarity of both approaches, as well as the differences.
Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm
Authors: Shiyuan Gu, Sukhamay Kundu
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

We propose a new method for the recognition and retrieval of shapes whose contours are simple closed curves. First, we give a new shape representation by a sequence of 2D-vectors of angles, which is independent of rotation and scaling. Each 2D-vector captures the local shape information around a point in the contour. Next, we apply a dynamic programming method to match the points of two contours and identify the outlier (unmatched) points in each contour with respect to the other. Then, we define the similarity of a pair of contours by the number of unmatched points and the matching cost for the matched points. Finally, the recognition and retrieval are done using the nearest-neighbor method. Our experiments on MPEG-7 database show that the performance of the new algorithm is very similar to that of the best-known algorithms in the literature in spite of its significantly less computational complexity and simplicity.
Mean shift-based clustering analysis of multispectral remote sensing imagery
Authors: S. Bo, L. Ding, H. Li, F. Di, C. Zhu
Venue: International Journal of Remote Sensing (2009)

In clustering analysis of remote sensing imagery, a commonly held assumption is that the feature space can be modelled as a mixture of Gaussians. However, the assumption is not true for many real data and therefore incorrect classification results are often obtained by parametric methods. Nonparametric methods in feature space analysis can avoid the use of the normality assumption. Arbitrarily structured feature spaces can be analysed only by means of nonparametric methods as these methods do not have embedded assumptions. The mean shift is a basic computational module of the nonparametric technique in pattern recognition. The mean shift procedure can be used to cluster multispectral remote sensing imagery. Earlier clustering techniques based on the mean shift used a single scale over the entire feature space and were not feasible for the analysis of complex multimodal feature spaces. In this paper, we present an adaptive mean shift method in which local scale information is involved. The proposed algorithm can find arbitrary density, size and shape clusters in remote sensing imagery. The method is a simple technique of unsupervised image classification. We demonstrate its advantages in classification accuracy over earlier methods described in this paper.
Low-k compatible all-copper flip-chip connections
Authors: Tyler Osborn, C. Hunter Lightsey, Paul A. Kohl
Venue: Microelectronic Engineering (2009)

A novel fabrication technique using electroless copper deposition has been used to produce all-copper, chip-to-substrate connections. This process replaces solder by electrolessly joining copper pillars on the chip and substrate. The electroless copper joints were annealed at 180^oC after plating. A model was developed to explore methods for lowering the stress within the copper pillar, especially at the point where the pillar intersects the chip surface. The acceptable stress level within the copper pillars is a function of the on-chip dielectric material and the on-chip interconnect structures. In order to avoid fracture of the on-chip dielectric, the stress in the copper pillars should be less than the current lead-free solders that the all-copper pillars would be replacing. A polymer collar surrounding the copper pillars was used to support the pillars and improves thermo-mechanical reliability. The improvement in stress-reduction, ultimately leading to higher reliability was studied as a function of elastic modulus of the polymer collar support. It has been shown that the pillar stress generated during temperature cycling can be reduced by increasing the modulus of the pillar support and changing the shape of the copper pillars. Finally, three high-contrast photodefinable collar materials were characterized and tested. Nano-indentation experiments were performed to measure the mechanical properties of each material and shear tests were performed to verify the benefits of the higher elastic modulus collars.
Activity recognition with the aid of unlabeled samples
Authors: Donghai Guan, Young-Koo Lee, Sungyoung Lee
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Activity recognition is an important topic in ubiquitous computing. In activity recognition, supervised learning techniques have been widely applied to learn the activity models. However, most of them can only utilize labeled samples for learning even though a large amount of unlabeled samples exist. In our previous work, we have proposed a semi-supervised learning method which can utilize both labeled and unlabeled samples for learning. As an alternative, a new learning method is proposed in this work. It makes use of the unlabeled samples to remove the noises from labeled samples, so that the learning performance is improved. Experimental results show the effectiveness of our method.
A hybrid DWT-SVD copyright protection scheme based on k-means clustering and visual cryptography
Authors: Ming-Shi Wang, Wei-Che Chen
Venue: Computer Standards Interfaces (2009)

In this paper, a novel copyright protection scheme that combines the discrete wavelet transform (DWT) and the singular value decomposition (SVD) is proposed. Instead of modifying the original host image to conceal a secret image, the proposed scheme first extracts the image features from the host image by applying the DWT and the SVD. The extracted features are then classified into two clusters by employing the k-means clustering technique, and a master share is generated using the clustering result. Finally, the master share is used together with a secret image to construct an ownership share according to a two-out-of-two visual cryptography (VC) technique. When rightful ownership needs to be determined, the secret image for ownership identification can be revealed by stacking the master share and the ownership share. Experimental results demonstrate that the proposed scheme can effectively resist several common attacks. In addition, the revealed watermark can be easily recognized by human eyes, even if the host image has undergone severe attacks.
mimir: a market-based real-time question and answer service
Authors: Gary Hsieh, Scott Counts
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Community-based question and answer (Q&A) systems facilitate information exchange and enable the creation of reusable knowledge repositories. While these systems are growing in usage and are changing how people find and share information, current designs are inefficient, wasting the time and attention of their users. Furthermore, existing systems do not support signaling and screening of joking and non-serious questions. Coupling Q&A services with instant and text messaging for faster questions and answers may exacerbate these issues, causing Q&A services to incur high interruption costs on their users. In this paper we present the design and evaluation of a market-based real-time Q&A system. We compared its use to a similar Q&A system without a market. We found that while markets can reduce wasted resources by reducing the number of less important questions and low quality answers, it may also reduce the socially conducive questions and usages that are vital to sustaining a Q&A community.
A Collision Predict Based Local Path Planning of Mobile Robots
Authors: Yang Gao, Shu-dong Sun
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Based on the velocity of obstacles and its distribution, the position of the dangerous region (potential collision region) has been predicted. So that the dangerous region would be expanded based on the distribution of its position to ensure the security. By finding the best “Free Road” and estimate the “danger”, a data reduction technique is employed to compress all the information needed in path planning. With the help of that the efficiency of the fuzzy logic controller is improved significantly which is also employed to calculate the speed of the robot. Benefit from the fuzzy logic controller and the dangerous region predicted technique, our method is more robust in dynamic environment with uncertainty. And the results of both experiments and simulations have proved that our method get a better effect than the conventional ones.
A Decision Support Methodology for the Control of Alternative Penalties - A Case-Based Reasoning Approach
Authors: Expedito Carlos Lopes, Ulrich Schiel, Gilson Pereira dos Santos Jr.
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

The Brazilian system of alternative penalties presents an increasing demand of processes. Exceptions, as criminal backsliding, increases even more the demand. The organizational structure to assist judgments, designation of services program/institution and penal executions attendance involve different units and their respective judges. The process of efficient decision making requests a perfect synchronism among the judges of the units. This work presents a methodology for supporting the computerised decision, described through a general decision-making process and of specific treatments for exceptions, aided in Case-Based Reasoning (CBR) techniques. Therefore, the objective is to facilitate decision making and to increase productivity guaranteeing interoperability of the alternative penalties units. The basic CBR cycle has been adapted in order to be compatible with the general decision-making process. We present a prototype built with the framework JColibri.
Monocular 3D Reconstruction of Objects Based on Cylindrical Panoramas
Authors: Ralf Haeusler, Reinhard Klette, Fay Huang
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper discusses ways of using a single panoramic image (captured by a rotating sensor-line camera having very-high spatial resolution) for the geometric shape recovery of a shown object. The objective is to create a sparse polyhedral model, only allowing a few interactive user inputs for a given single panoramic image. The study was motivated by the general question whether a single panoramic image projection allows some kind of 3D shape recovery, possibly benefitting from available monocular approaches for standard (say, pinhole-type) camera models.
Maximum independent sets in subclasses of P5-free graphs
Authors: Vadim Lozin, Raffaele Mosca
Venue: Information Processing Letters (2009)

The class of P"5-free graphs is the unique minimal class defined by a single connected forbidden induced subgraph for which the complexity status of the maximum independent set problem is unknown. In this paper, we prove polynomial-time solvability of the problem in two subclasses of P"5-free graphs generalizing several previously known results.
Indeterministic Behavior in Computing Systems and Its Possible Impact on the Digital Society
Authors: Bertil Ekdahl
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Many people have experienced computers not doing what they were expected to do or, perhaps more often, met with computers that deliver faulty results. Frequently, if not always, such behavior is blamed the lack of a complete requirements specification. In this assertion, it is tacitly understood that if a specification is correct and comprehensive enough then it is possible to avoid computing errors since the designer in those cases is able to construct a correct program whose behavior in any situation is well known: every detail in the program is known and so is its behavior. In this paper I will show that if there is a truth in such a conjecture then it is valid only for not very complicated programs. In explaining this, I will follow an interesting observation of von Neumann that there is a god deal in (formal) logic which indicates that the description of the functions of a computer (automata) is simpler than a description of the computer itself, as long as the computer is not very complicated, but when we get to high complications, the actual object is simpler than the literary description. This is not a consequence of an emergent property, like an evolving organ, but is a restriction bound up with languages and not an intrinsic property originating from physical complications. Its consequences are that with very high complexity, we can never truly know how the computer in every situation will behave. As long as computing was mostly on site, perhaps this state of things was of minor importance but with the advent of an improved Web, the, so-called, Semantic Web, this indeterminism will make a difference. There will be an element of uncertainty and it may very well be a question of confidence.
Editorial: Guest editors' introduction
Authors: René Krikhaar, Ralf Lämmel
Venue: Science of Computer Programming (2009)

This special issue collects 5 contributions that are substantially revised and extended versions of papers that appeared in the conference proceedings of ICPC 2008 - The 16th IEEE International Conference on Program Comprehension. In this introduction of the special issue, we briefly summarize the mission of the ICPC conference series, report on the actual conference event, and characterize the collected contributions.
Computer speech for people with cerebral palsy
Authors: Jay Hewitt
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Using a grant from the Apple Educational Foundation, a speech system was constructed using an Apple micro-computer, a Corvus hard disk drive, and the Mountain Hardware Supertalker. Since digitized rather than synthesized speech is employed, speech quality is extremely high. Use of an 8M byte hard disk drive permitted the system to contain approximately 5000 words. In normal operation, user types in the first two letters of a desired word. A list of words beginning with those two letters than appears on a TV monitor. To select a word, user enters the number which is beside each word. At the end of a sentence, user types a period and the computer speaks the n words in the sentence in approximately 2n seconds. For individuals unable to operate a keyboard, two alternative means of input exist. The paper describes the nature of the words in the system, the computer program, and certain characteristics of the hardware.
Simulation-based planning for precast production with two critical resources
Authors: Xiaofeng Zhai, Robert L. K. Tiong, Hans C. Bjornsson, David K. H. Chua
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Planning plays an important role in precast production management. In practice, however, this work is primarily carried out on a rule-of-thumb basis. A specialized planning model based on simulation technique and genetic algorithm (GA) is presented in this paper for precast production with two critical resources. A novel priority rule, the critical precast component (CP) rule, is established for mold considerations during simulation, and a bi-directional simulation is adopted to reduce excessive overtime and precast stock. On this basis, three simulation approaches are designed using different simulation heuristics and directions. To test the validity of the proposed model with different approaches, a planning experiment is carried out. By comparison, it is clear that the Simulation-GA based model using CP rule and bi-directional simulation can generate a satisfying resource plan and production schedule.
Achieving 10 Gb/s using safe and transparent network interface virtualization
Authors: Kaushik Kumar Ram, Jose Renato Santos, Yoshio Turner, Alan L. Cox, Scott Rixner
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

This paper presents mechanisms and optimizations to reduce the overhead of network interface virtualization when using the driver domain I/O virtualization model. The driver domain model provides benefits such as support for legacy device drivers and fault isolation. However, the processing overheads incurred in the driver domain to achieve these benefits limit overall I/O performance. This paper demonstrates the effectiveness of two approaches to reduce driver domain overheads. First, Xen is modified to support multi-queue network interfaces to eliminate the software overheads of packet demultiplexing and copying. Second, a grant reuse mechanism is developed to reduce memory protection overheads. These mechanisms shift the bottleneck from the driver domain to the guest domains, improving scalability and enabling significantly higher data rates. This paper also presents and evaluates a series of optimizations that substantially reduce the I/O virtualization overheads in the guest domain. In combination, these mechanisms and optimizations increase the maximum throughput achieved by guest domains from 2.9Gb/s to full 10 Gigabit Ethernet link rates.
Experiences with recombinant computing: Exploring ad hoc interoperability in evolving digital networks
Authors: W. Keith Edwards, Mark W. Newman, Jana Z. Sedivy, Trevor F. Smith
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2009)

This article describes an infrastructure that supports the creation of interoperable systems while requiring only limited prior agreements about the specific forms of communication between these systems. Conceptually, our approach uses a set of &ldquo;meta-interfaces&rdquo;&mdash;agreements on how to exchange new behaviors necessary to achieve compatibility at runtime, rather than requiring that communication specifics be built in at development time&mdash;to allow devices on the network to interact with one another. While this approach to interoperability can remove many of the system-imposed constraints that prevent fluid, ad hoc use of devices now, it imposes its own limitations on the user experience of systems that use it. Most importantly, since devices may be expected to work with peers about which they have no detailed semantic knowledge, it is impossible to achieve the sort of tight semantic integration that can be obtained using other approaches today, despite the fact that these other approaches limit interoperability. Instead, under our model, users must be tasked with performing the sense-making and semantic arbitration necessary to determine how any set of devices will be used together. This article describes the motivation and details of our infrastructure, its implications on the user experience, and our experience in creating, deploying, and using applications built with it over a period of several years.
Parallel and distributed model checking in Eddy
Authors: I. Melatti, R. Palmer, G. Sawaya, Y. Yang, R. M. Kirby, G. Gopalakrishnan
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2009)

Model checking of safety properties can be scaled up by pooling the CPU and memory resources of multiple computers. As compute clusters containing 100s of nodes, with each node realized using multi-core (e.g., 2) CPUs will be widespread, a model checker based on the parallel (shared memory) and distributed (message passing) paradigms will more efficiently use the hardware resources. Such a model checker can be designed by having each node employ two shared memory threads that run on the (typically) two CPUs of a node, with one thread responsible for state generation, and the other for efficient communication, including (1) performing overlapped asynchronous message passing, and (2) aggregating the states to be sent into larger chunks in order to improve communication network utilization. We present the design details of such a novel model checking architecture called Eddy. We describe the design rationale, details of how the threads interact and yield control, exchange messages, as well as detect termination. We have realized an instance of this architecture for the Murphi modeling language. Called Eddy_Murphi, we report its performance over the number of nodes as well as communication parameters such as those controlling state aggregation. Nearly linear reduction of compute time with increasing number of nodes is observed. Our thread task partition is done in such a way that it is modular, easy to port across different modeling languages, and easy to tune across a variety of platforms.
Feature-preserving denoising of point-sampled surfaces
Authors: Jifang Li
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Based on sampling likelihood and feature intensity, in this paper, a feature-preserving denoising algorithm for point-sampled surfaces is proposed. In terms of moving least squares surface, the sampling likelihood for each point on point-sampled surfaces is computed, which measures the probability that a 3D point is located on the sampled surface. Based on the normal tensor voting, the feature intensity of sample point is evaluated. By applying the modified bilateral filtering to each normal, and in combination with sampling likelihood and feature intensity, the filtered point-sampled surfaces are obtained. Experimental results demonstrate that the algorithm is robust, and can denoise the noise efficiently while preserving the surface features.