ppxscal/embedding_network huggingface dataset:
An interface for targeted collection of common sense knowledge using a mixture model
Authors: Robert Speer, Jayant Krishnamurthy, Catherine Havasi, Dustin Smith, Henry Lieberman, Kenneth Arnold
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We present a game-based interface for acquiring common sense knowledge. In addition to being interactive and entertaining, our interface guides the knowledge acquisition process to learn about the most salient characteristics of a particular concept. We use statistical classification methods to discover the most informative characteristics in the Open Mind Common Sense knowledge base, and use these characteristics to play a game of 20 Questions with the user. Our interface also allows users to enter knowledge more quickly than a more traditional knowledge-acquisition interface. An evaluation showed that users enjoyed the game and that it increased the speed of knowledge acquisition.
Solving terminal allocation problem using simulated annealing arithmetic
Authors: Zengnian Zhang, Xudong Ke
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

Due to the tremendous growth in telecommunications network, a large variety of combinatorial optimization problems have aroused people's enormous interest. In those problems, the terminal allocation attracts people's attention most. In this paper, we focus on studying the capability of Simulated Annealing Arithmetic for optimizing the terminal allocation problems in communications network. They take advantage of the best characteristic of the two effective scheduling strategies Round Robin and Shortest Distance based on local information at the terminal in the communications network. The effectiveness of the Simulated Annealing Arithmetic, where some cooling strategies are used, is passed judgment by comparing system performance under different terminal allocation algorithms including Round Robin and Short Distance. Experimental results show that the proposed Simulated Annealing Arithmetic provides an optimized combinatorial solution, therefore increase the whole throughput of the communications network system.
Overlay networks: implementation by specification
Authors: Stefan Behnel, Alejandro Buchmann
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Implementing overlay software is non-trivial. Current projects build overlays or intermediate frameworks on top of low-level networking abstractions. This leaves implementing the topologies, their maintenance and optimisation strategies, and the routing to the developer. We take a novel approach to overlay implementation by modelling topologies as a distributed database. This approach, named "Node Views", abstracts from low-level issues like I/O and message handling. Instead, it moves ranking nodes and selecting neighbours into the heart of the overlay software development process. It decouples maintenance components in overlay software and allows implementing them in a generic, configurable way for pluggable integration in frameworks.
Shadow removal for robust vehicle detection
Authors: Tomás Rodríguez
Venue: Machine Graphics Vision International Journal (2008)

Shadow removal is a critical process for any computer vision based vehicle detection system. Traditional shadow removal methods are not sufficiently robust since they frequently remove parts of the vehicles together with the shadows. For robust shadow identification and removal, shadow information must be compiled at every step of the computer vision chain from the time the shadow enters the scene until it finally disappears. In this paper we present a shadow removal algorithm that preserves the compactness of the vehicles' object masks while allowing for dealing with changing illumination conditions, long and broken shadows and multiple shadows at night. The method is based on a complex shadow model which includes, among others, information regarding: luminance and chromaticity, morphology, dynamics and spatial relations analysis.
Weight-balanced trees
Authors: J. L. Baer
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

It is now recognized that binary search trees are structures which can be used efficiently for the organization of files and directories. The ease of insertion and deletion of nodes makes trees very appealing for directories which are often modified. By comparison with a sequential table organization, some additional memory is required for the links between nodes. From a cost-effective viewpoint, this is generally more than compensated for by the savings in searching (for a linear table) and inserting (for an ordered table).
Function classes for double exponential integration formulas
Authors: Ken&#x2019;ichiro Tanaka, Masaaki Sugihara, Kazuo Murota, Masatake Mori
Venue: Numerische Mathematik (2009)

The double exponential (DE) formulas for numerical integration are known to be highly efficient, more efficient than the single exponential (SE) formulas in many cases. Function classes suited to the SE formulas have already been investigated in the literature through rigorous mathematical analysis, whereas this is not the case with the DE formulas. This paper identifies function classes suited to the DE formulas in a way compatible with the existing theoretical results for the SE formulas. The DE formulas are good for more restricted classes of functions, but more efficient for such functions. Two concrete examples demonstrate the subtlety in the behavior of the DE formulas that is revealed by our theoretical analysis.
Simplified software inspection process in compliance with international standards
Authors: Deepti Mishra, Alok Mishra
Venue: Computer Standards Interfaces (2009)

A significant amount of software is developed all over the world by small and medium size software organizations. These organizations do not have enough infrastructures and resources to implement an austere quality plan. Software inspection is a fundamental component of the software quality assurance process. Formal review methods are rigorous and their implementation is cumbersome for small and medium enterprises. In this paper, we have presented a new simplified inspection process which is easy to implement, requires fewer resource and almost no documentation. Also, people who are conducting this inspection need not be present at the same place during most stages of the inspection process. We have also compared this process with IEEE and NASA standards for software inspection and found that it meets almost 99% of both standards. While there has been much research on inspection, little attention is paid towards compliance with international standards. These results could be used as a basis for further research in software inspection and process towards aligning with international standards. This process has been successfully implemented in a CMM level 3 software development organization which is striving to accomplish higher maturity levels to establish at the international level.
Elementary differences among jump classes
Authors: Angsheng Li
Venue: Theoretical Computer Science (2009)

It is shown that Th(H"1)1, where H"m is the upper semi-lattice of all high"m computably enumerable (c.e.) degrees for m>0, giving a first elementary difference among the highness hierarchies of the c.e. degrees.
An efficient block-based lossless information hiding technique
Authors: Tzu-Chuen Lu, Ying-Hsuan Huang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Lossless information hiding is to embed secret information into multi-media. Through extraction algorithm, the concealed information can be extracted and the original multi-media can be totally recovered. Jin et al. developed a simple and efficient lossless hiding scheme. The stego image quality resulted from Jin et al.'s scheme is good. However, their scheme can not hide a large number of secret data. Therefore, this paper proposes an enhanced hiding scheme to improve Jin et al.'s scheme. Furthermore, we apply an wavelet control technique based on Kamstra et al.'s scheme to control the image distortion. The experimental result shows that the amount of secret data based on the proposed scheme is higher than that of Jin et al.'s scheme. Moreover, the proposed method combined with Kamstra et al.'s scheme enhances the stego image quality efficiently.
Computation Simulation on Aerodynamic Characteristic of PSD in Subway Platform
Authors: Wei-chao Yang, Li-min Peng, Li-chuan Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Based on the unsteady compressible three-dimensional N-S equations and standard k-turbulent model, the travel process was simulated used the finite volume method. The pressure variation mechanism and its spatial-time change characteristic of PSD were analyzed. Meanwhile, the relationship between the pressure of PSD and such influence factors was discussed, as train speed, blockage ratio, the area as well as the ventilation scheme of the subway tunnel. Result showed it is necessary to consider the pressure variation in influence of the exhaust ventilation of the subway tunnel., and the pressure gradient along with the train and the pressure wave between the piston vents, coming into being during the train traveling in subway tunnel, are the basic factors causing the pressure fluctuation of PSD, especially the former, which is called the plane turbulent Coquette flow. The scope of PSD pressure fluctuation is proportional to the tunnel blockage ratio and the square of train speed. Smaller area of piston vent is favorable to reduce the pressure.
Market equilibria with hybrid linear-Leontief utilities
Authors: Xi Chen, Li-Sha Huang, Shang-Hua Teng
Venue: Theoretical Computer Science (2009)

We introduce a new family of utility functions for exchange markets. This family provides a natural and ''continuous'' hybridization of the traditional linear and Leontief utilities and might be useful in understanding the complexity of computing approximating market equilibria, although computing an equilibrium in a market with this family of utility functions, this is PPAD-hard in general. In this paper, we present an algorithm for finding an approximate Arrow-Debreu equilibrium when the Leontief components of the market are grouped, finite and well-conditioned.
Cutting circles and polygons from area-minimizing rectangles
Authors: Josef Kallrath
Venue: Journal of Global Optimization (2009)

A set of circles, rectangles, and convex polygons are to be cut from rectangular design plates to be produced, or from a set of stocked rectangles of known geometric dimensions. The objective is to minimize the area of the design rectangles. The design plates are subject to lower and upper bounds of their widths and lengths. The objects are free of any orientation restrictions. If all nested objects fit into one design or stocked plate the problem is formulated and solved as a nonconvex nonlinear programming problem. If the number of objects cannot be cut from a single plate, additional integer variables are needed to represent the allocation problem leading to a nonconvex mixed integer nonlinear optimization problem. This is the first time that circles and arbitrary convex polygons are treated simultaneously in this context. We present exact mathematical programming solutions to both the design and allocation problem. For small number of objects to be cut we compute globally optimal solutions. One key idea in the developed NLP and MINLP models is to use separating hyperplanes to ensure that rectangles and polygons do not overlap with each other or with the circles. Another important idea used when dealing with several resource rectangles is to develop a model formulation which connects the binary variables only to the variables representing the center of the circles or the vertices of the polytopes but not to the non-overlap or shape constraints. We support the solution process by symmetry breaking constraints. In addition we compute lower bounds, which are constructed by a relaxed model in which each polygon is replaced by the largest circle fitting into that polygon. We have successfully applied several solution techniques to solve this problem among them the Branch Reduce Optimization Navigator (BARON) and the LindoGlobal solver called from GAMS, and, as described in Rebennack et al. [21], a column enumeration approach in which the columns represent the assignments. Good feasible solutions are computed within seconds or minutes usually during preprocessing. In most cases they turn out to be globally optimal. For up to 10 circles, we prove global optimality up to a gap of the order of 10-8 in short time. Cases with a modest number of objects, for instance, 6 circles and 3 rectangles, are also solved in short time to global optimality. For test instances involving non-rectangular polygons it is difficult to obtain small gaps. In such cases we are content to obtain gaps of the order of 10%.
Computational Systems Biology with Constraints: Stochastic Modeling of Biological Systems withConcurrent Constraint Programming
Authors: Luca Bortolussi
Venue:  (2008)

Recently, stochastic process algebras have been usedfor modeling biological systems, as they provide asimple, compositional language to define biologicalmodels. Classical process algebras, however, requireto express everything in terms of communications, alimiting restriction when structured informationneeds to be processed.In this book, we tackle this problem using a moregeneral language and programming it to deal with thedomain of interest. Specifically, we introduce astochastic extension (sCCP) of Concurrent ConstraintProgramming. It is precisely the use of constraintsthat gives flexibility and extendibility to thelanguage, together with the presence ofcontext-dependent stochastic rates. To prove this, weshow how sCCP can be used to model a wide range ofbiological systems, from biochemical networks to theprocess of folding of a protein, providing evidencethat the use of constraints simplifiesthe process of modeling and allows to incorporateexternal knowledge. Many analysis tools are developed: stochastic simulation, model checking,ODE-based approximations. The book can be ofinterest to researchers working in the field ofcomputational systems biology.
Tuning Local Search by Average-Reward Reinforcement Learning
Authors: Steven Prestwich
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

Reinforcement Learning and local search have been combined in a variety of ways, in order to learn how to solve combinatorial problems more efficiently. Most approaches optimise the total reward, where the reward at each action is the change in objective function. We argue that it is more appropriate to optimise the average reward. We use R-learning to dynamically tune noise in standard SAT local search algorithms on single instances. Experiments show that noise can be successfully automated in this way.
Routing in multi-hop wireless mesh networks with bandwidth guarantees
Authors: Ronghui Hou, King-Shan Lui, Hon-Sun Chiu, Kwan L. Yeung, Fred Baker
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

This paper presents a distributed polynomial algorithm for finding the maximum bandwidth path in Wireless Mesh Networks (WMNs). Our proposed algorithm can be applied for designing the proactive hop-by-hop routing protocol with bandwidth guarantee. To the best of our knowledge, our work is the first distributed path calculation algorithm in WMNs.
IP Covert Channel Detection
Authors: Serdar Cabuk, Carla E. Brodley, Clay Shields
Venue: ACM Transactions on Information and System Security (TISSEC) (2009)

A covert channel can occur when an attacker finds and exploits a shared resource that is not designed to be a communication mechanism. A network covert channel operates by altering the timing of otherwise legitimate network traffic so that the arrival times of packets encode confidential data that an attacker wants to exfiltrate from a secure area from which she has no other means of communication. In this article, we present the first public implementation of an IP covert channel, discuss the subtle issues that arose in its design, and present a discussion on its efficacy. We then show that an IP covert channel can be differentiated from legitimate channels and present new detection measures that provide detection rates over 95&percnt;. We next take the simple step an attacker would of adding noise to the channel to attempt to conceal the covert communication. For these noisy IP covert timing channels, we show that our online detection measures can fail to identify the covert channel for noise levels higher than 10&percnt;. We then provide effective offline search mechanisms that identify the noisy channels.
A genetic algorithm with gene rearrangement for K-means clustering
Authors: Dong-Xia Chang, Xian-Da Zhang, Chang-Wen Zheng
Venue: Pattern Recognition (2009)

In this paper, a new clustering algorithm based on genetic algorithm (GA) with gene rearrangement (GAGR) is proposed, which in application may effectively remove the degeneracy for the purpose of a more efficient search. A new crossover operator that exploits a measure of similarity between chromosomes in a population is also presented. Adaptive probabilities of crossover and mutation are employed to prevent the convergence of the GAGR to a local optimum. Using the real-world data sets, we compare the performance of our GAGR clustering algorithm with K-means algorithm and other GA methods. An application of the GAGR clustering algorithm in unsupervised classification of multispectral remote sensing images is also provided. Experiment results demonstrate that the GAGR clustering algorithm has high performance, effectiveness and flexibility.
Real-Time Body Pose Recognition Using 2D or 3D Haarlets
Authors: Michael Bergh, Esther Koller-Meier, Luc Gool
Venue: International Journal of Computer Vision (2009)

This article presents a novel approach to markerless real-time pose recognition in a multicamera setup. Body pose is retrieved using example-based classification based on Haar wavelet-like features to allow for real-time pose recognition. Average Neighborhood Margin Maximization (ANMM) is introduced as a powerful new technique to train Haar-like features. The rotation invariant approach is implemented for both 2D classification based on silhouettes, and 3D classification based on visual hulls.
Enforcement of Copyright Laws for Multimedia through Blind, Detectable, Reversible Watermarking
Authors: F. Bartolini, G. Bini, V. Cappellini, A. Fringuelli, G. Meucci, A. Piva, M. Barni
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A new classification of digital watermarking techniques, which is based on the way the decoding process works, is introduced. This classification is used to analyze the impact concepts such as watermark blindness, privateness, readability and reversibility have on practical application scenarios. In the second part of the work, a new, object-oriented, Electronic Copyright Management System (ECMS) is presented which, by relying on state-of-the-art technology, makes it possible the enforcement of copyright laws in an open-network environment.
WikiFolders: augmenting the display of folders to better convey the meaning of files
Authors: Stephen Voida, Saul Greenberg
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Hierarchical file systems and file browsers offer powerful capabilities for managing and organizing folders and files. Yet they lack robust tools for annotating and documenting these files-individually or collectively-with descriptive text. In contrast, Web pages and wikis make it easy to create rich and meaningful narratives around digital artifacts, allowing files to be embedded within explanatory text and images. Unfortunately, considerable effort is required to manage files stored on Web servers and to ensure that the published content remains up-to-date. In this note, we describe WikiFolders, a hybrid system for annotating file folders that draws upon the strengths of both the hierarchical file system and wikis.
An Optimal Algorithm for Designing NCO Circuit in Mobile Communication Systems
Authors: Shuhua Hu, Hui Li, Jiaqing Huang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we present an algorithm named Coordinate Rotation Digital Computer (CORDIC) for designing the Numerically Controlled Oscillator (NCO) used in Digital Down Converters (DDC) of GSM applications. Synthesizing with Synopsys EDA tools shows that CORDIC can significantly reduce the die size by about 30%, thus greatly expands the application fields of NCO. Meanwhile, this paper analyzes the problems in engineering implementation and points out the future research directions.
Multi-projector Calibration and Alignment Using Flatness Analysis for Irregular-Shape Surfaces
Authors: Qingshu Yuan, Dongming Lu
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

A multi-projector calibration and alignment method, which has no assumptions on projection surfaces' shape, is presented. Based on surface flatness analysis, the method will automatically partition the projection surface into pieces, more at none flat regions and less at flat ones, as flat region will cause less distortions. Corresponding to these pieces, an image will first be cut into some sub-images, and then projected onto the surfaces using texture warping method. The principle which ensures the inner projector distortion correction is proved, that is if a camera captures an undistorted projected image, human eye will also observe an undistorted one at that spot. Multi-projector alignment is achieved by projecting images which are rendered according to the camera's extrinsic parameters during the course of coded structured light capturing. Because the camera can capture a wide field of view area by moving and rotating itself, the alignment method has a build-in support for scalability in view filed. The whole work of calibration and alignment can be done in a single camera capture process. Results show that the proposed method is efficient and robust.
Extracting and Reasoning about Web Data
Authors: Giovanni Pirrotta
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The Web contains an enormous quantity of information, virtually supporting all types of reasoning and decision-making. Unfortunately, most of the times automated access to Web data and tracking updates turns out to be hard. Several technological, standardization and research efforts are now under way to make, among other things, Web data easily accessed and properly manipulated by machines. Indeed, for several years now, the W3C consortium has released useful recommendations on RDF(s)[1] and OWL[2], which are used to assign semantic to Web data. In particular, making existing Web data available to machine consumption can be a challenging task. Obviously, it is impossible to re-write the whole Web using advanced semantic Web languages; hence, various new technologies are currently being proposed for translating existing Web data, into RDF document, as GRDDL[3]. In this manner, it is now possible to transform plain-HTML Web pages into RDF documents, and then apply inferential engines to deduce new knowledge. 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