ppxscal/embedding_network huggingface dataset:
On the numbers of variables to represent sparse logic functions
Authors: Tsutomu Sasao
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

In an incompletely specified function f, don't care values can be chosen to minimize the number of variables to represent f. It is shown that, in incompletely specified functions with k 0's and k 1's, the probability that f can be represented with only p = 2[log2(k + 1)] variables is greater than e-1 = 0.36788. In the case of multiple-output functions, where only the outputs for k input combinations are specified, most functions can be represented with at most p = 2[log2(k+1)] -1 variables. Experimental data is shown to support this. Because of this property, an IP address table can be realized with a small amount of memory.
Face Tracking and Realistic Animations for Telecommunicant Clones
Authors: Stephane Valente, Jean-Luc Dugelay
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We present recent developments in the context of face cloning using view--based techniques, permitted by the cooperation between analysis and synthesis algorithms.We detail efficient 3D face modelling techniques, that are capable to reproduce convincing facial expressions, and we show how such realistic face models are suitable for a view-based analysis framework, to recover both the global pose and the facial expressions of a human performer, without any markers or makeup.
Texture Retrieval Effectiveness Improvement Using Multiple Representations Fusion
Authors: Noureddine Abbadeni
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

We propose a multiple representations approach to tackle the problem of content-based image retrieval effectiveness. Multiple representations is based on the use of multiple models or representations and make them cooperate to improve search effectiveness. We consider the case of homogeneous textures. Texture is represented using two different models: the well-known autoregressive model and a perceptual model based on perceptual features such as coarseness and directionality. In the case of the perceptual model, two viewpoints are considered: perceptual features are computed on original images and on the autocovariance function corresponding to original images. Thus, we use a total of three representations (models and viewpoints) to represent texture content. Simple results fusion models are used to merge search results returned by each of the three representations. Benchmarking carried out on the well-known Brodatz database using the recall graph is presented. Retrieval relevance (effectiveness) is improved in a very appreciable way with the fused model. 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
Brief paper: Controlling the motion of charged particles in a vacuum electromagnetic field from the boundary
Authors: Luis R. Suazo, Weijiu Liu
Venue: Automatica (Journal of IFAC) (2009)

We consider the problem of driving two non-relativistic charged particles in a bounded vacuum electromagnetic field to the same location by applying electromagnetic forces through the boundary of the domain. The dynamics of the particles is modeled by the Maxwell-Lorentz system and the problem is reduced to a boundary feedback control problem. Using the perturbed energy method, we design feedback controllers and prove that the particles under the designed control move to the origin exponentially. The techniques of control design and stability analysis may be potentially applied to control of fusion.
Multi-objective UAV mission planning using evolutionary computation
Authors: Adam J. Pohl, Gary B. Lamont
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This investigation develops an innovative algorithm for multiple autonomous unmanned aerial vehicle (UAV) mission routing. The concept of a UAV Swarm Routing Problem (SRP) as a new combinatorics problem, is developed as a variant of the Vehicle Routing Problem with Time Windows (VRPTW). Solutions of SRP problem model result in route assignments per vehicle that successfully track to all targets, on time, within distance constraints. A complexity analysis and multi-objective formulation of the VRPTW indicates the necessity of a stochastic solution approach leading to a multi-objective evolutionary algorithm. A full problem definition of the SRP as well as a multi-objective formulation parallels that of the VRPTW method. Benchmark problems for the VRPTW are modified in order to create SRP benchmarks. The solutions show the SRP solutions are comparable or better than the same VRPTW solutions, while also representing a more realistic UAV swarm routing solution.
Structured systems development
Authors: Jack Shaw, Kenneth W. Hunter, Gregory L. Brennan
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The management of data processing projects has yet to proceed from a loosely practiced "art" to a professionally disciplined science. EDP practitioners have not established a "body of knowledge" or a methodology or a standard approach to the development of systems. Such a body of knowledge is a prerequisite to the effective management of systems projects.
A Robust Image Watermarking Algorithm against JPEG2000
Authors: Zhang Dazhi, Wu Boying, Sun Jiebao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In this paper, a robust meaningful image watermarking algorithm against JPEG2000 standard which will be the most popular compression technique is proposed. The meaningful watermarking algorithm is based on discrete wavelet transform and linear interpolation. In order to improve the robustness of the algorithm, we select the important horizontally and vertically lowpass coefficients as the embedding points. Experiments showed that the algorithm had not only good information capacity but also good security, invisibility and undetectability. Furthermore, the robust algorithm can stand against JPEG2000 and JPEG lossy compression effectively, and realize watermark blind detecting.
SVNNAT: Measuring Collaboration in Software Development Networks
Authors: Michael Schwind, Christian Wegmann
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

We investigate the structures of collaboration in software development groups by analyzing the data derived from the versioning system SVN (subversion) for several open source projects of different types and sizes. The goal of the work presented here is to investigate specific properties of the network topology in the collaboration groups of open source developer communities. For this purpose we developed a software called 'SVN Network Analysis Tool' (SVNNAT) which helps us to analyze the update data in subversion systems (SVN) with respect to the changes committed to the software code. In order to construct the network topology from the SVN data, we defined a collaboration coefficient that is able to express the strength of the developers' relationship in terms of their collaboration during the software production process. We present initial results deriving from the application of SVNNAT to several open source projects including up to 871 software developers. After constructing weighted networks from the matrix representation of the collaboration coefficients, we characterize the resulting networks using typical indicators of topology properties like betweenness, closeness, and degree centralization.
Nearly homogeneous multi-partitioning with a deterministic generator
Authors: Michaël Aupetit
Venue: Neurocomputing (2009)

The need for homogeneous partitions, where all parts have the same distribution, is ubiquitous in machine learning and in other fields of scientific studies. Especially when only few partitions can be generated. In that case, validation sets need to be distributed the same way as training sets to get good estimates of models' complexities. And when standard data analysis tools cannot deal with too large data sets, the analysis could be performed onto a smaller subset, as far as its homogeneity to the larger one is good enough to get relevant results. However, pseudo-random generators may generate partitions whose parts have very different distributions because the geometry of the data is ignored. In this work, we propose an algorithm which deterministically generates partitions whose parts have empirically greater homogeneity on average than parts arising from pseudo-random partitions. The data to partition are seriated based on a nearest neighbor rule, and assigned to a part of the partition according to their rank in this seriation. We demonstrate the efficiency of this algorithm on toys and real data sets. Since this algorithm is deterministic, it also provides a way to make reproducible machine learning experiments usually based on pseudo-random partitions.
Application of Graph Transformation in Verification of Dynamic Systems
Authors: Zarrin Langari, Richard Trefler
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model the dynamic behaviour of a telecommunication system. In this paper, we show how GTS modeling can facilitate verification of invariant properties of potentially infinite-state communication systems. We take as a case study for this approach an invariant property of telecommunication service components that can act both as the source and the target of a connection. Verifying an ordering among service components to be invariant is essential to guarantee the desirable behaviour of these services. We show how the verification can be performed by the analysis of a finite set of transformation rules describing the GTS system model. We prove that invariant properties are preserved in a GTS model if the set of transformation rules describing the model satisfies the property. Thus, we show how to perform system verification through analysis of the model description without building the full system state space.
An evolutionary simulation-optimization approach in solving parallel-machine scheduling problems - A case study
Authors: Taho Yang
Venue: Computers and Industrial Engineering (2009)

Parallel-machine scheduling research is one of the active fields in the past decade due to its increasing application. Due to the problem complexity, it is a general practice to find an appropriate heuristic rather than an optimal solution for the parallel-machine scheduling problem. The wirebonding workstation is the bottleneck in integrated-circuit packaging manufacturing. Effective scheduling is one of the key factors towards improving the efficiency of the wirebonding operations. The wirebonding scheduling problem is an equal (or identical) parallel-machine scheduling problem. The research solved the wirebonding scheduling problem by using an evolutionary simulation-optimization approach. Empirical results, benchmarked against lower bound solutions, showed the quality solutions of less than 2% deviation for a wide range of production scenarios. However, if the problem size were to increase, the proposed methodology might become computationally prohibitive, and this might well require further development if used to solve the identified problem in such circumstances.
MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty
Authors: Ching-Nung Yang, An-Guo Peng, Tse-Shih Chen
Venue: Signal Processing (2009)

A (k, n)-threshold visual secret sharing (VSS) scheme has the distinctive property of easy decryption by manually printing out shadow images on transparencies and stack them to visually reveal the secret image. However, the decoding is highly dependent on the precise alignment of transparencies by hand. The misalignment makes the secret in reconstructed image invisible, and this is referred to as the misalignment problem. In this paper, we consider the misalignment problem in VSS scheme. We design a misalignment tolerant VSS (MTVSS) scheme based on the trade-off between the usage of big and small blocks to address this misalignment problem. Our MTVSS scheme allows people visually reveal the original secret image, and it is not necessary to align the transparencies precisely.
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Authors: Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende
Venue: Discrete Applied Mathematics (2009)

Given an undirected graph G with penalties associated with its vertices and costs associated with its edges, a Prize Collecting Steiner (PCS) tree is either an isolated vertex of G or else any tree of G, be it spanning or not. The weight of a PCS tree equals the sum of the costs for its edges plus the sum of the penalties for the vertices of G not spanned by the PCS tree. Accordingly, the Prize Collecting Steiner Problem in Graphs (PCSPG) is to find a PCS tree with the lowest weight. In this paper, after reformulating and re-interpreting a given PCSPG formulation, we use a Lagrangian Non Delayed Relax and Cut (NDRC) algorithm to generate primal and dual bounds to the problem. The algorithm is capable of adequately dealing with the exponentially many candidate inequalities to dualize. It incorporates ingredients such as a new PCSPG reduction test, an effective Lagrangian heuristic and a modification in the NDRC framework that allows duality gaps to be further reduced. The Lagrangian heuristic suggested here dominates their PCSPG counterparts in the literature. The NDRC PCSPG lower bounds, most of the time, nearly matched the corresponding Linear Programming relaxation bounds.
Goal-oriented service selection
Authors: Peter Salhofer, Gerald Tretter, Bernd Stadlhofer, FH Joanneum
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Semantic technologies are going to be applied to almost all aspects of e-Government. Most of the approaches described so far deal with automatic web service discovery used by software agents. This paper focuses on the use of semantic technologies to support citizens when interacting with e-Government sites. Our experience has shown, that sometimes identifying the appropriate service that is needed to accomplish a tasks can require some in-depth knowledge of existing regulations. To overcome this potential barrier we suggest a relatively simple approach based on the use of ontologies to support citizens to select the correct administrative service. Our approach assists a citizen in formally expressing a goal that can in turn be used for service discovery. This is done by introducing some guidelines and constraints on the model; while this process can be simplified the complexity can be hidden from the user.
Placement based multiplier rewiring for cell-based designs
Authors: Fan Mo, Robert K. Brayton
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We present an algorithm for improving the performance of Carry-Save-Adder (CSA) style multipliers. Based on placement information, the algorithm exploits the arithmetic equivalence in the CSA multipliers and rewires to improve the slack of the multiplier.
Simple Polygons of Maximum Perimeter Contained in&#x00a0;a&#x00a0;Unit&#x00a0;Disk
Authors: Charles Audet, Pierre Hansen, Fr&#x00e9;d&#x00e9;ric Messine
Venue: Discrete Computational Geometry (2009)

A polygon is said to be simple if the only points of the plane belonging to two of its edges are its vertices. We answer the question of finding, for a given integer n, a simple n-sided polygon contained in a disk of radius 1 that has the longest perimeter. When n is even, the optimal solution is arbitrarily close to a line segment of length 2n. When n is odd, the optimal solution is arbitrarily close to an isosceles triangle.
Structured control in programming languages
Authors: Charles T. Zahn,  Jr.
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Solving a problem with the aid of a computer involves the construction and execution of a program described by a linear piece of text. First, the problem-solver (programmer) translates his problem into a procedural solution embodied in a static program text, written in a programming language. Then a computer is caused to perform a dynamic sequence of actions in accordance with the commands in the program text. The reliability of this two-stage problem solution (i.e., the likelihood that the actions performed really provide a solution of the problem) depends on the degree to which the program text mirrors the possible action sequences that it causes, as well as the problem solution that it purports to implement. It is useful to speak of the "conceptual distance" between program text and action sequences or between problem definition and program text. The programmer who wants some measure of confidence in the reliability of his program must bridge both these conceptual distances. It follows that a major goal of programming language design should be to help reduce both these distances.
Investigating touch interactions for an augmented world
Authors: Brett Wilkinson, Paul Calder
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Touch screen interaction usually requires the user to view the input surface in order to make their selections. When the interaction platform is purposefully occluded to allow for natural interaction with an augmented reality (AR) system new issues are raised in regard to the usability of the touch sensitive interface. This paper details a user evaluation scenario that we have conducted looking at pen-based selection techniques for a personal, light-weight AR system and introduces a trial for manipulation testing that we are currently conducting. By testing various techniques we are identifying a combination of operations that will enable effective and usable communication with an unobtrusive, mobile AR system.
Educational Strategies and Technical Implementation: The Experience of Politecnico di Torino in Remote Tutoring
Authors: Laura Farinetti, Giovanni Malnati
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper describes an experience of synchronous distance education through videoconferencing for providing remote tutoring sessions, made at Politecnico di Torino. The major requirement, a high degree of interactivity between the teacher and the students, influenced both the adopted technical solution and the educational strategies. The first part of the paper is about the context of the experience and the technical solution, and describes the overall system design, the remote classroom and the tutor site. The second part is about the educational aspects, and analyses the educational dialogue and the communication and educational strategies that we learned by this experience, and that may have a more general value.
A discrete particle swarm optimization algorithm for scheduling parallel machines
Authors: Ali Husseinzadeh Kashan, Behrooz Karimi
Venue: Computers and Industrial Engineering (2009)

As a novel evolutionary technique, particle swarm optimization (PSO) has received increasing attention and wide applications in a variety of fields. To our knowledge this paper investigates the first application of PSO algorithm to tackle the parallel machines scheduling problem. Proposing equations analogous to those of the classical PSO equations, we present a discrete PSO algorithm (DPSO) to minimize makespan (C"m"a"x) criterion. We also investigate the effectiveness of DPSO algorithm through hybridizing it with an efficient local search heuristic. To verify the performance of DPSO algorithm and its hybridized version (HDPSO), comparisons are made through using a recently proposed simulated annealing algorithm for the problem, addressed in the literature, as a comparator algorithm. Computational results signify that the proposed DPSO algorithm is very competitive and can be rapidly guided when hybridizing with a local search heuristic.
Teaching programming using bricolage
Authors: Evelyn Stiller
Venue: Journal of Computing Sciences in Colleges (2009)

Traditional approaches to programming education work well for conventional computer science students, but in the face of reduced enrollments and a severe underrepresentation of women and minorities, we must offer a variety of pedagogies to reach students who do not respond to this pedagogical approach. Research spanning several decades suggests that analytically less-experienced students may do well using a bricolage approach. This paper illustrates how to apply this approach to teaching students to program, and discusses its success in a course called, The Art and Science of Animation.
Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Authors: Boris Rachev, Anger Smrikarov
Venue: ACM International Conference Proceeding Series; Vol. 374 (2008)

CompSysTech'08 is the Ninth Bulgarian International Computer Science Conference, organized by acmbul - Bulgarian Chapter of the ACM in association with the Bulgarian Academic Society of Computer Systems and Information Technologies, the Bulgarian Union of Automation & Informatics, and the European Commission: Seventh Framework Programme --- Specific Programme "Capacity" --- Research potential strengthening the IST Research Capacity of Sofia University. This Conference is the 21st acmbul event during the last 18 years and it is the first Bulgarian Conference in Computing, which has been listed on the ACM Calendar of Conferences & Events several years ago. Over 100 papers were presented to the CompSysTech'08 Programme Committee. PC strongly reviewed the submitted papers in the CompSysTech Submission & Review System environment. The Conference topics traditionally include the following fields of the latest achievements in Computing: &bull; Computer Systems (Hardware) &bull; Computer Technologies (Software) &bull; Application Aspects of Computer Systems & Technologies &bull; Educational Aspects of Computer Systems & Technologies The CompSysTech'08 PhD Workshop was organized to bring together PhD Students working on topics related to the CompSysTech Conference Series. The new CompSysTech'08 Students & High School Students Workshop was organized to involve the youngest research people into the CompSysTech'08 scientific discussions. Thanks to acad. Petar Kenderov for this great idea. A special CompSysTech'08 PC Jury selected the best Papers for each session and for the Workshops Sessions. The results are given below after each session's heading. Over 150 participants from Bulgaria and abroad had the chance to get acquainted and exchange ideas on the topics concerned, as well as on some of the latest advancements in Computing.