ppxscal/embedding_network huggingface dataset:
Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn
Authors: Peng Cheng, Shigeru Masuyama
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Let Ni be the number of connected spanning subgraphs with i(n-1 <im) edges in an n-vertex m-edge undirected graph G = (V,E). Although Nn-1 is computed in polynomial time by the Matrix-tree theorem, whether Nn is efficiently computed for a graph G is an open problem (see e.g., [2]). On the other hand, whether Nn2 ≥ Nn-1Nn+1 for a graph G is also open as a part of log concave conjecture (see e.g., [6],[12]). In this paper, for a complete graph Kn, we give the formulas for Nn, Nn+1, by which Nn, Nn+1 are respectively computed in polynomial time on n, and, in particular, prove Nn2 > (n-1)(n-2)/n(n-3) Nn-1Nn+1 as well.
University computer curricula
Authors: Dick B. Simmons, Edward J. McCluskey, Aaron Finerman, M. L. Dertouzos, Jurg Nievergelt
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The status of university computer curricula will be discussed and recommendations of how university computer curricula can be improved in the future will be presented. The panel will discuss how universities can better meet critical needs of industry, business, and government in the various areas of information processing. With the advent of minicomputers, on-line computing, computer aided instruction and the rapid growth of data processing, the emphasis in computer curriculum has changed and some of the earlier ideas should be updated.
Participatory Simulation Platform Using Network Games
Authors: Shoichi Sawada, Hiromitsu Hattori, Marika Odagaki, Kengo Nakajima, Toru Ishida
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

In this paper, we develop a novel participatory simulation platform, called gumonji/Q, by integrating scenario description language Q and network game gumonji. In a participatory simulation, humans and software-agents coexist in a shared virtual space and jointly perform simulations. To observe practical behaviors of humans, a participatory simulation platform must be able to provide reasonable simulated experience for humans to let them behave as they do in the real-world. gumonji/Q makes it possible to design diverse interaction protocols based on Q's scenario description ability. Under the "game-quality" graphics provided by gumonji, humans and agents can interact with their surrounding environment, which means they can affect the environment and receive feedback from the environment. Since gumonji/Q inherits gumonji's features as a network game, users are more enticed to participate in simulations since simulations on gumonji/Q seems more enjoyable than normal simulations. We show an example of how to obtain human behavior models through a simulation on gumonji/Q.
Minimising Native Interference in Still Image Data Hiding
Authors: Jian Jun Guo, Xin Xu, Zhao Feng Ma, Jian Yin Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The technique of using orthogonal sequences to embed digital watermarks is described. It is shown that embedding with sequences which are orthogonal to the cover image can enhance the detection reliability and improve the system performance and robustness compared to using random sequences. Algorithms to generate such orthogonal sequences are introduced and the performance results are compared. Results indicate that the more than 1000 bit payload is realised for printed photographs (512 &times; 512 pixels).
Semi-automatic Annotations in Unknown Environments
Authors: Gerhard Reitmayr, Ethan Eade, Tom W. Drummond
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Unknown environments pose a particular challenge for augmented reality applications because the 3D models required for tracking, rendering and interaction are not available ahead of time. Consequently, authoring of AR content must take place on-line. This work describes a set of techniques to simplify the online authoring of annotations in unknown environments using a simultaneous localisation and mapping (SLAM) system. The point-based SLAM system is extended to specifically track and estimate high-level features indicated by the user. The automatic estimation of these complex landmarks by the system relieves the user from the burden of manually specifying the full 3D pose of annotations while improving accuracy. These properties are especially interesting for remote collaboration applications where either user interfaces on handhelds or camera control by the remote expert are limited.
Fast point matching algorithm for mapping applications
Authors: Olivier Demuynck, Nazareth Castellanos
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

This paper presents a method for image positioning, and map creation. The images are captured by a flying modulo equipped by a camera to observe a selected area. In this study we suppose this system is located at a fixed height, and compare its mechanism to a free pendulum moving with the wind force. The camera is always pointing vertically thanks to a motored system. This system isn't noise free and has a positioning error range, and so it requires a software correction to carry out this mapping from a continuous transmission of pictures. The goal of this study is to allow the user to easily watch a coherent sequence of images to observe and follow a moving target. The implemented algorithm, detailed in the further sections, compute first the interest points, finds then their match without using correlation (which speed up the treatment), solve the mathematical system of equations to obtain the translation and rotation that suffered the two successive pictures, and interprets the result for its representation for the user. In this study, we checked the well functioning of this method for a few sorts of grounds (city, forest, or desert) which allow us to conclude on the high efficiency with a high speed processing.
On-line scheduling of parallel machines to minimize total completion times
Authors: Peihai Liu, Xiwen Lu
Venue: Computers and Operations Research (2009)

In this paper, we consider the scheduling problem on identical parallel machines, in which jobs are arriving over time and preemption is not allowed. The goal is to minimize the total completion times. According to the idea of the Delayed-SPT Algorithm proposed by Hoogeven and Vestjens [Optimal on-line algorithms for single-machine scheduling. In: Proceedings 5th international conference on integer programming and combinatorial optimization (IPCO). Lecture notes in computer science, vol. 1084. Berlin: Springer; 1996. p. 404-14], we give an on-line algorithm for the scheduling problem on m identical parallel machines. We show that this algorithm is 2-competitive and the bound is tight.
Research on vibration of rotor by application of the improved harmonic wavelet
Authors: Xiaojin Fu
Venue: Analog Integrated Circuits and Signal Processing (2009)

Because of low attenuation speed of harmonic wavelet in time domain, we carry on the smooth processing in the frequency domain to get better quality of harmonic wavelet. With improved transaction of harmonic wavelet, this paper analyzes in subdivided frequency domain the vibration signal, which is distilled by the track of axes, eliminates most useless signals by calculating time domain and gets high definition graph of vibration signal in time domain at last. The fine track of axes, especially this of inferior frequency signal, well serves the analysis of rotor malfunction. The result shows greater value in practice.
Association Rules Mining Based on Simulated Annealing Immune Programming Algorithm
Authors: Yongqiang Zhang, Shuyang Bu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Association rules mining is an important problem of data mining, in this paper we propose a association rules mining algorithm based on the simulated annealing immune programming algorithm which combines each character of the simulated annealing algorithm and immune programming algorithm. Through the theoretical analysis and the experiment we can find that this algorithm has better robustness and the global and local ability of search, thus it can quickly, effectively excavate more association rules which meet the conditions.
AURAL: evolutionary sonification with robots
Authors: Artemis M.F.S. Moroni, Jônatas Manzolli
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This study aims to provide a platform for exploring robotic navigation in line with evolutionary computation of sound control data. Real world devices, two mobile robots and an omnidirectional vision system are integrated to sonify trajectories of robots in real time.
Contextual Extension with Concept Maps in the Argument Interchange Format
Authors: Ioan Alfred Letia, Adrian Groza
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

In our approach of argumentation we focus on formalizing the context of arguments and its propagation within the argumentation chain, aiming to facilitate the re-usability of arguments in the World Wide Argument Web. The contextual extension is based on intensional operators used to update the context for different arguments. We extend the ontology of the Argument Interchange Format with context nodes and visualize the arguments as concept maps.
Simulation based optimization of multi-location transshipment problem with capacitated transportation
Authors: Banu Yetkin Ekren, Sunderesh S. Heragu
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this study, a single-item two-echelon inventory system where the items can be stored in each of N stocking locations is optimized using simulation. The aim of this study is to minimize the total inventory, backorder, and transshipments costs, based on the replenishment and transshipment quantities. In this study, transshipments which are the transfer of products among locations at the same echelon level and transportation capacities which are the transshipment quantities between stocking locations, are also considered. Here, the transportation capacities among the stocking locations are bounded due to transportation media or the locations' transshipment policy. Assuming stochastic demand, the system is modeled based on different cases of transshipment capacities and costs. To find out the optimum levels of the transshipment quantities among stocking locations and the replenishment quantities, the simulation model of the problem is developed using ARENA 10.0 and then optimized using the OptQuest tool in this software.
A simulation of chopper neurons in the cochlear nucleus with wideband input from onset neurons
Authors: Andreas Bahmer, Gerald Langner
Venue: Biological Cybernetics (2009)

The unique temporal and spectral properties of chopper neurons in the cochlear nucleus cannot be fully explained by current popular models. A new model of sustained chopper neurons was therefore suggested based on the assumption that chopper neurons receive input both from onset neurons and the auditory nerve (Bahmer and Langner in Biol Cybern 95:4, 2006). As a result of the interaction of broadband input from onset neurons and narrowband input from the auditory nerve, the chopper neurons in our model are characterized by a remarkable combination of sharp frequency tuning to pure tones and faithful periodicity coding. Our simulations show that the width of the spectral integration of the onset neuron is crucial for both the precision of periodicity coding and their resolution of single components of sinusoidally amplitude-modulated sine waves. One may hypothesize, therefore, that it would be an advantage if the hearing system were able to adapt the spectral integration of onset neurons to varying stimulus conditions.
Exploring bilingual, task-oriented, document-centric chat
Authors: Hao Jiang, Kevin Singley
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

We study a new type of workplace communication made possible by the recent advent of real-time bilingual chat tools. Because of the imperfect accuracy of real-time text translation services, this type of communication imposes extreme difficulties on user collaboration and task performance. The problems are compounded by the narrow task awareness and communication bandwidth afforded by standard chat. We report an exploratory study of users attempting to arrive at a joint understanding of a document using a bilingual chat tool. We observed many problems concerning the establishment of common ground and task coordination. We derive design implications for an improved chat tool that better supports the sharing of mental state and task coordination in this communication environment.
Improving Zernike Moments Comparison for Optimal Similarity and Rotation Angle Retrieval
Authors: Jérôme Revaud, Guillaume Lavoué, Atilla Baskurt
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Zernike moments constitute a powerful shape descriptor in terms of robustness and description capability. However the classical way of comparing two Zernike descriptors only takes into account the magnitude of the moments and loses the phase information. The novelty of our approach is to take advantage of the phase information in the comparison process while still preserving the invariance to rotation. This new Zernike comparator provides a more accurate similarity measure together with the optimal rotation angle between the patterns, while keeping the same complexity as the classical approach. This angle information is particularly of interest for many applications, including 3D scene understanding through images. Experiments demonstrate that our comparator outperforms the classical one in terms of similarity measure. In particular the robustness of the retrieval against noise and geometric deformation is greatly improved. Moreover, the rotation angle estimation is also more accurate than state of the art algorithms.
On the complexity of measuring software complexity
Authors: G. Michael Schneider, Robert L. Sedlmeyer, Joe Kearney
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The term software complexity (program quality, program complexity,...) has been used by software engineering researchers to denote the testability, maintainability, readability, and/or comprehensibility of a program. Curtis points out a common bond that unites all these concepts: a program's complexity determines how difficult it is for programmers to work with.
In the News
Authors: Mark Ingebretsen
Venue: IEEE Intelligent Systems (2009)

The first story, "AI Heralds a New Musical Age," discusses current uses of AI technology to analyze and categorize music, as well as synthesize musical accompaniment. The second story, "Multiagent Designs Could Safeguard Networks across the Web," looks at how multiagent systems and neural networks can provide security against malicious software attacks.
3D Target Scale Estimation and Target Feature Separation for Size Preserving Tracking in PTZ Video
Authors: Yi Yao, Besma Abidi, Mongi Abidi
Venue: International Journal of Computer Vision (2009)

To achieve size preserving tracking, in addition to controlling the camera's pan and tilt motions to keep the object of interest in the camera's field of view (FOV), the camera's focal length is adjusted automatically to compensate for the changes in the target's image size caused by the relative motion between the camera and the target. The estimation accuracy of these changes determines the effectiveness of the resulting zoom control. The existing method of choice for real-time target scale estimation applies structure from motion (SFM) based on the weak perspective projection model. In this paper we propose a target scale estimation algorithm with a linear solution based on the more advanced paraperspective projection model, which improves the accuracy of scale estimation by considering center offset. Another key issue in SFM based algorithms is the separation of target and background features, especially when composite camera (pan/tilt/zoom) and target motions are involved. This paper designs a fast target feature separation/grouping algorithm, the 3D affine shape method. The resulting separation automatically adapts to the target's 3D geometry and motion and is able to accommodate a large amount of off-plane rotation, which most existing separation/grouping algorithms find difficult to achieve. Experimental results illustrate the effectiveness of the proposed scale estimation and feature separation algorithms in tracking translating and rotating objects with a PTZ camera while preserving their sizes. In comparison with the leading size preserving tracking algorithm described by Tordoff and Murray, our algorithm is able to reduce the cumulative tracking error significantly from 17.4% to 3.3%.
Locally Adaptive Perceptual Compression for Color Images
Authors: Kuo-Cheng Liu, Chun-Hsien Chou
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The main idea in perceptual image compression is to remove the perceptual redundancy for representing images at the lowest possible bit rate without introducing perceivable distortion. A certain amount of perceptual redundancy is inherent in the color image since human eyes are not perfect sensors for discriminating small differences in color signals. Effectively exploiting the perceptual redundancy will help to improve the coding efficiency of compressing color images. In this paper, a locally adaptive perceptual compression scheme for color images is proposed. The scheme is based on the design of an adaptive quantizer for compressing color images with the nearly lossless visual quality at a low bit rate. An effective way to achieve the nearly lossless visual quality is to shape the quantization error as a part of perceptual redundancy while compressing color images. This method is to control the adaptive quantization stage by the perceptual redundancy of the color image. In this paper, the perceptual redundancy in the form of the noise detection threshold associated with each coefficient in each subband of three color components of the color image is derived based on the finding of perceptually indistinguishable regions of color stimuli in the uniform color space and various masking effects of human visual perception. The quantizer step size for the target coefficient in each color component is adaptively adjusted by the associated noise detection threshold to make sure that the resulting quantization error is not perceivable. Simulation results show that the compression performance of the proposed scheme using the adaptively coefficient-wise quantization is better than that using the band-wise quantization. The nearly lossless visual quality of the reconstructed image can be achieved by the proposed scheme at lower entropy.
A New Method of SAR Image Reconstruction and Segmentation
Authors: Yingying Kong, Jianjiang Zhou
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper proposes the use of the inherent characteristics of SAR images to improve Gibbs-MRF model for recovering SAR image. Further, it puts forward to segment SAR image into target and shadow with the theory of connectivity in digital morphology. The new method is not only using GAMMA distribution to replace the traditional Rayleigh distribution in the estimate of MAP (Maximum A Posteriori Probability, MAP), but also using the connectivity model of pixels intensity value relevance to extract goal better in the neighborhood of SAR image pixel space. This method takes full advantage of the relevance between the information of digital morphology of the SAR image and the pixel intense, and eliminates isolated points and obtains good segment results.
Study on the Synchronizing Mechanism of Node's Metadata Catalog Service
Authors: Xian-Gang Luo, Xiao-Hui Liu, Zhong Xie, Gui-Zhou Zheng
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In spatial information sharing platform, an important use of the metadata is data searching. Traditional information sharing platform mostly search data just in the central node, which is inefficient. This paper presents a method which improves the efficiency of searching by mobilizing all the nodes of information sharing platform. That is, updating metadata of all the nodes through the synchronizing mechanism of metadata catalog service, to make each node has backup of other nodes’ metadata. This synchronizing mechanism is achieved by the way of message-driven mechanism and calling remote web services.
Lifetime maximization for connected target coverage in wireless sensor networks
Authors: Qun Zhao, Mohan Gurusamy
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In this paper, we consider the connected target coverage (CTC) problem with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity among all the active sensors and the sink.We model the CTC problem as a maximum cover tree (MCT) problem and prove that the MCT problem is NP-Complete. We determine an upper bound on the network lifetime for the MCT problem and then develop a (1+w) H (M) approximation algorithm to solve it, where is an arbitrarily small number, H(M) = Σ1≤i≤M (1/i) and M is the maximum number of targets in the sensing area of any sensor. As the protocol cost of the approximation algorithm may be high in practice, we develop a faster heuristic algorithm based on the approximation algorithm called Communication Weighted Greedy Cover (CWGC) algorithm and present a distributed implementation of the heuristic algorithm. We study the performance of the approximation algorithm and CWGC algorithm by comparing them with the lifetime upper bound and other basic algorithms that consider the coverage and connectivity problems independently. Simulation results show that the approximation algorithm and CWGC algorithm perform much better than others in terms of the network lifetime and the performance improvement can be up to 45% than the best-known basic algorithm. The lifetime obtained by our algorithms is close to the upper bound. Compared with the approximation algorithm, the CWGC algorithm can achieve a similar performance in terms of the network lifetime with a lower protocol cost.
The PLASTIC Framework and Tools for Testing Service-Oriented Applications
Authors: Antonia Bertolino, Guglielmo Angelis, Lars Frantzen, Andrea Polini
Venue: Software Engineering: International Summer Schools, ISSSE 2006-2008, Salerno, Italy, Revised Tutorial Lectures (2009)

The emergence of the Service Oriented Architecture (SOA) is changing the way in which software applications are developed. A service-oriented application consists of the dynamic composition of autonomous services independently developed by different organizations and deployed on heterogenous networks. Therefore, validation of SOA poses several new challenges, without offering any discount for the more traditional testing problems. In this chapter we overview the PLASTIC validation framework in which different techniques can be combined for the verification of both functional and extra-functional properties, spanning over both off-line and on-line testing stages. The former stage concerns development time testing, at which services are exercised in a simulated environment. The latter foresees the monitoring of a service live usage, to dynamically reveal possible deviations from the expected behaviour. Some techniques and tools which fit within the outlined framework are presented.