ppxscal/embedding_network huggingface dataset:
GINI: a user-level toolkit for creating micro internets for teaching & learning computer networking
Authors: Muthucumaru Maheswaran, Alexis Malozemoff, Daniel Ng, Sheng Liao, Song Gu, Balasubramaneyam Maniymaran, Julie Raymond, Reehan Shaikh, Yuanyuan Gao
Venue: ACM SIGCSE Bulletin (2009)

GINI (GINI Is Not Internet) is an open-source toolkit for creating virtual micro Internets for teaching and learning computer networking. It provides lightweight virtual elements for machines, routers, switches, and wireless devices that can be interconnected to create virtual networks. The virtual elements run as unprivileged user-level processes. All processes implementing a virtual network can run within a single machine or can be distributed across a set of machines. The GINI provides a user-friendly GUI-based tool for designing, starting, inspecting, and stopping virtual network topologies. This paper describes the different components of GINI, briefly discusses ways of using the toolkit in a computer networking course, and reports on user feedback on an early (incomplete) version of the toolkit.
Abstract Storage Devices
Authors: Robert König, Ueli Maurer, Stefano Tessaro
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

The purpose of this paper is to initiate the study of a combinatorial abstraction, called abstract storage device (ASD), which models deterministic storage devices with the property that only partial information about the state can be read, but that there is a degree of freedom as to which partial information should be retrieved.We study combinatorial problems related to ASD's, including reducibility among ASD's, which is proved to be $\mathcal{NP}$-complete, and the factorization of ASD's. In particular, we prove that the factorization into binary-output ASD's (if it exists) is unique.
Recycled paper visual indexing for quality control
Authors: Jose Orlando Maldonado, Manuel Graña
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we describe the development of a system for evaluating an specific quality characteristic of recycled paper sheets using techniques of image analysis and pattern recognition. We call Bumpiness the phenomenon of interest, which is new in the literature on paper quality. This phenomenon is characterized by the appearance of macroscopic undulations on the paper sheet surface that may emerge shortly or some time after its production. We explore the detection and measurement of this defect by means of computer vision and statistical pattern recognition techniques that may allow early detection at the production site. Our goal is to give an scalar continuous measure of Bumpiness. We propose features computed from Gabor filter banks (GFB) and discrete wavelet transforms (DWT) for the characterization of paper sheet surface Bumpiness in recycled paper images. The starting point is to state the problem as a classification of the paper sheet images into two classes: low and high Bumpiness. In this setting we obtain, with both proposed texture modelling approaches (GFB and DWT), classification accuracies comparable to the agreement between human observers. The best performance is obtained using DWT features. Finally, we propose as the scalar index of Bumpines the fisher discriminant analysis (FDA) function defined on the space of the best features for the classification task. We perform an innovative validation process of this Bumpiness index, based on the ordering of random pairs of images, obtaining a very high agreement with the human observers.
Three Little Pigs in the CG theater
Authors: Yuko Yamanouchi, Takashi Fukaya, Hideki Mitsumine, Hidehiko Okubo
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

NHK has developed a new style of content creation for a puppet show. The performers operate the actual puppets in a CG environment called "Uncompleted Contents," and the complete contents are produced with them in real time. This production style presents limitless possibilities not only for TV programming, but also for interactive elements.
Optimal Formation Reconfiguration Using Genetic Algorithms
Authors: Jichao Tian, Naigang Cui, Rongjun Mu
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Spacecraft formation flying has received an enormous amount of attention over the past few years, researcher have begun to consider the advantages of spacecraft formation compared to large, complex, single purpose spacecrafts, the use of spacecraft formation has the potential to expand functionality, distribute risk and reduce cost and also it involves tremendous challenges ranging from spacecraft formation keeping to reconfiguration or configuration. The spacecrafts in orbit may undergo differential disturbances from gravitational perturbation due to Earth's oblateness, atmospheric drag, and solar radiation pressure and so on, consequently these effects have to be taken into account in order to implement formation reconfiguration. Whereas the consumption of fuel on board is one of the key formation reconfiguration problems, it is important to have a formation with saving fuel for orbit maintenance, whilst collision avoidance is also a significant constraint condition on formation reconfiguration. In order to deal with these challenges, many methods have been considered. With a view to tackle these problems, the present study is carried out. The nonlinear equations of relative motion on formation flying are investigated and the same geometry and mass of spacecrafts are assumed in this present paper. In this model the disturbances coming from the non spherical Earth is more important than others and then considered. In the present study, optimal controllers based on genetic algorithms are developed for spacecraft formation reconfiguration including the constraints of minimum fuel, avoiding collision and final configuration. Genetic algorithms (GA) are especially powerful techniques for the research of optimal control, GA are such methods that may be used to solve search and optimization problems. They are based on the genetic evolution process of biological organisms, over many generations, natural populations evolved according to the principles of natural selection, by mimicking this process, GA are able to evolve solutions to real world problems. The numerical results were be analyzed that demonstrated the good performance of the control strategy proposed for reconfiguration. The method proposed may be viable for future space mission.
Monsieur Cok
Authors: Franck Dion
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Monsieur Cok is the owner of a large bomb factory. Looking for efficiency and profit, he decides to replace his workers with elaborate robots. But one of the workers does not accept being discarded so easily.
Making filters smart in distributed data stream environments
Authors: Cheqing Jin, Bolin Ding, Jeffrey Xu Yu
Venue: Information Sciences: an International Journal (2009)

Monitoring aggregate queries in real-time over distributed streaming environments appears to be a great challenge not only because of the huge data volume and high rate, but also because of the limitation of the network transmission bandwidth. Consequently, ensuring qualified approximate results with economical network consumption becomes one of the most important goals in such scenarios. In this paper, we study how to monitor aggregate queries continuously over distributed environments efficiently by disposing numerous filters at remote sites, in order to transmit only a small part of incoming data to the query site and therefore save the network resource significantly. We also show how to adjust the parameters of a filter continuously when the incoming data distribution at the corresponding remote site changes. Analysis and extensive experimental results demonstrate that our approach outperforms the existing work.
The business process model for IT service management
Authors: Chen Zhao, Fei Gao
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

The article primary deals with IT Service Management (ITSM) and IT Infrastructure Library (ITIL), as a process based method. Providing IT services with better, guaranteed quality has been the aim of many diverse efforts, undertaken under the common denominator ITSM. To develop an architecture for information technology service management and design integrated solutions, it is necessary to establish a common framework for delivering IT services. The model is a framework for organizing the assets that constitute an ITSM design. Using this framework, an organization can document the available set of IT services offered and understand how they are composed from finer-grained services delivered by internal or external providers. This processing model can be used by management software vendors to describe the capabilities of their ITSM offerings and to align those with the needs of different customers. An introduction to the terminology and icons used in the Business Process Model are applied in Enterprise Architect's Business Process Model.
Aircraft design optimization
Authors: J. J. Alonso, P. LeGresley, V. Pereyra
Venue: Mathematics and Computers in Simulation (2009)

In this paper we describe briefly a set of procedures for the optimal design of full mission aerospace systems. This involves multi-physics simulations at various fidelity levels, surrogates, distributed computing and multi-objective optimization. Low-fidelity analysis is used to populate a database of inputs and outputs of the system simulation and Neural Networks are then designed to generate inexpensive surrogates. Higher fidelity is used only where is warranted and also to do a local exploration after global optimization techniques have been used on the surrogates in order to provide plausible initial values. The ideas are exemplified on a generic supersonic aircraft configuration, where one of the main goals is to reduce the ground sonic boom.
The Evaluation and Research of Knowledge Flow in Supply Chain Based on Fuzzy Comprehensive Analysis
Authors: Wu-yi Zhang, Xiao-liang Li, Yun-long Deng, Lian-lian Hua
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

In this article, the fuzzy comprehensive analysis is applied to the evaluation and research of knowledge flow in supply chain by fuzzy mathematical theory. Firstly, this article designs an evaluation index system of knowledge flow in supply chain by means of questionnaire, and then it establishes the fuzzy comprehensive evaluation model of knowledge flow in supply chain, finally, it realizes grade comprehensive evaluation of knowledge flow in supply chain through the practical example. This article shows the fuzzy comprehensive analysis can be widely used in the evaluation of knowledge flow in supply chain owing to its strong interoperability and good effect.
A data sorting system using a high speed bus
Authors: P. M. Thompson, Z. H. Glanz
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The access time for content addressed data can be significantly improved if it is filed according to an appropriate set of descriptors. A further improvement can be obtained if hardware, rather than software, techniques are used to implement the file or sorting memory. The paper discusses the design of a hardware implemented system which can sort and re-sort digital data according to any set of descriptors chosen. The main limitation to the speed of sorting and re-sorting is the intercommunication system between the various parts of the store. The application of segmented ring bus techniques gives a high sorting speed and a flexible system. The memory design is suitable for LSI because it consists of a number of similar units capable of integration using silicon technology.
Computation and data transfer co-scheduling for interconnection bus minimization
Authors: Cathy Qun Xu, Chun Jason Xue, Bessie C. Hu, Edwin H. M. Sha
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

High Instruction-Level-Parallelism in DSP and media applications demands highly clustered architecture. It is challenge to design an efficient, flexible yet cost saving interconnection network to satisfy the rapid increasing inter-cluster data transfer needs. This paper presents a computation and data transfer co-scheduling technique to minimize the number of partially connected interconnection buses required for a given embedded application while minimizing its schedule length. Previous researches in this area focused on scheduling computations to minimize the number of inter-cluster data transfers. The proposed co-scheduling technique in this paper not only schedules computations to reduce the number of inter-cluster data transfers, but also schedules inter-cluster data transfers to minimize the number of required partially connected buses for inter-cluster connection network. Experimental results indicate that 39.4% fewer buses required compared to current best known technique while achieving the same schedule length minimization.
3Gmap L-systems: an application to the modelling of wood
Authors: Olivier Terraz, Guillaume Guimberteau, St&#x00e9;phane M&#x00e9;rillou, Dimitri Plemenos, Djamchid Ghazanfarpour
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

In this paper an extension of L-systems is proposed, based on three-dimensional (3D) generalized maps that allow an easier control of the internal structure of 3D objects. A first and original application of this extension is also proposed: wood modelling by growth simulation. Numerous other applications of our work are possible, in the area of computer graphics, as well as in botanical science.
Two power-decreasing derivation restrictions in generalized scattered context grammars
Authors: Tomáš Masopust, Alexander Meduna, Jiří Šimáček
Venue: Acta Cybernetica (2008)

The present paper introduces and discusses generalized scattered context grammars that are based upon sequences of productions whose left-hand sides are formed by nonterminal strings, not just single nonterminals. It places two restrictions on the derivations in these grammars. More specifically, let k be a positive integer. The first restriction requires that all rewritten symbols occur within the first k symbols of the first continuous block of nonterminals in the sentential form during every derivation step. The other restriction defines derivations over sentential forms containing no more than k occurrences of nonterminals. As its main result, the paper demonstrates that both restrictions decrease the generative power of these grammars to the power of context-free grammars.
Cooperative spectrum sensing for cognitive radio networks with amplify and forward relaying over correlated log-normal shadowing
Authors: Marco Di Renzo, Laura Imbriglio, Fabio Graziosi, Fortunato Santucci
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

In this paper, a general framework for performance evaluation of cooperative spectrum sensing methods over realistic propagation environments is proposed. In particular, the framework accounts for correlated Log-Normal shadowing in both sensing and reporting channels, and yields simple and easy-to-use formulas for computing the Detection Probability of a distributed network of secondary users using Amplify and Forward (AF) relying for data reporting to the fusion center. Numerical results are also shown to substantiate the accuracy of the proposed framework.
Representing architectural aspects with a symmetric approach
Authors: Alessandro Fabricio Garcia, Eduardo Magno Lages Figueiredo, Claudio Nogueira Sant'Anna, Monica Pinto, Lidia Fuentes
Venue: Proceedings of the 15th workshop on Early aspects (2009)

Aspect-oriented (AO) techniques are emerging as promising approaches to enhance the representation of crosscutting concerns throughout the software lifecycle. This includes new AO specification mechanisms for the architectural design stage that is at the heart of the software process. However, existing modelling languages have failed short to provide simple and scalable notations for visually representing the so-called "architectural aspects". This paper reports our ongoing effort on the definition of a visual architecture representation for aspect-oriented systems. Our proposal follows a symmetric approach and provides a more expressive set of visual elements in order to: (i) provide a more intuitive notation for expressing aspectual compositions, (ii) facilitate a symbiotic transition of AO requirements specifications to AO architecture designs, (iii) make the transition of architectural descriptions to AO detailed designs more straightforward, and (iv) improve the early detection of modularity anomalies in aspect-oriented design. We discuss the advantages and drawbacks of our modelling proposal in terms of two applications from different domains.
Secure and Anonymous Source Routing Protocol for Wireless Ad Hoc Networks
Authors: Li Xu, Sisheng Chen
Venue: International Journal of Distributed Sensor Networks (2009)

Wireless ad hoc network is formed by a group of mobile hosts that communicate through radio transmissions. In the hostile environment, this kind of network is vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. So, anonymous routing protocol for ad hoc networks is an important thing and has attracted more and more attention recently. In this paper, we propose a novel, secure, and anonymous source routing, called SADSR (Secure and Anonymous Dynamic Source Routing) based on DSR. During the routing request of the SADSR, in order to hide the identity, the source node uses its current pseudonym to sponsor the routing request. And it uses the hash value of the changing share key between the source and destination as the tag of the destination. Meanwhile, it employs an initialized Bloom Filter as the routing record table to record the route. When the intermediate nodes receive the routing request, it randomly chooses a secret key and adds its identity into the Bloom Filter with seeding the secret key. So, when the destination node receives the routing request, the Bloom Filter has recorded the route information. Because the feature of the pseudonym employed in our scheme, the destination node can authenticate the source node and updates their share secret key when it replies to the routing request. During the routing reply phase, the intermediate node can determine whether it is the router by checking the Bloom Filter in the reply packet. The router applies the pseudonym based signature to protect the message during the routing reply phase, which makes sure that the neighborhood node en route can authenticate the upstream node and does not disclose its identity. SADSR also contains the routing maintenance and secure anonymous data transmission which are separately used by the end-to-end validate mechanism and HMAC strategy. The performance of security and anonymity of SADSR is analyzed by both in theory and simulation. Compared to the other anonymous routing protocols, SADSR is not only an anonymous routing protocol, but also a secure one. It can provide authentication and integrity, anonymous neighborhood, identity anonymity, and route anonymity. The simulation results using NS-2 indicate that though SADSR is a secure and anonymous routing protocol, but the efficiency of SADSR is close to the secure routing protocol SDSR and anonymous routing protocol AnonDSR.
Image Indexing and Retrieval Using Image-Derived, Geometrically and Illumination Invariant Features
Authors: Ronald Alferez, Yuan-Fang Wang
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we propose novel image-derived features for image indexing and retrieval in digital library applications. The new features capture the intrinsic geometry and color properties of an imaged object. That is, these features are insensitive to the change of an object's appearance due to incidental environmental factors such as rigid motion, affine shape deformation, changes of parameterization and scene illumination, and view point change. Recording both intrinsic shape and color information of an imaged object, these features allow the similarity between two objects to be accurately measured. Hence, they can be used to index objects of the same class with similar appearance (e.g., different airplanes) instead of objects of different classes (e.g., airplanes vs. automobiles).
Moving Video Object Edge Detection Using Complex Wavelets
Authors: Turgay Celik, Kai-Kuang Ma
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, an unsupervised moving video object edge detection method based on the dual-tree complex wavelet transform (DT-CWT) domain is proposed, and its performance is compared with that of the discrete wavelet transform (DWT). In the proposed DT-CWT-based approach, an interframe change detection method with adaptive thresholding on six DT-CWT subbands is developed to detect moving video object edges, with assist of the edge map generated by exploiting the Canny edge detector in the corresponding frame. The performance of the proposed method is demonstrated both numerically and visually, and shows its clear superiority over the DWT-based approach.
Investigation of a Biological Repair Scheme
Authors: Vincent Danos, Jérôme Féret, Walter Fontana, Russell Harmer, Jean Krivine
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

This note details an interaction pattern for the allocation of a scarce biological resource where and when it is needed. It is entirely based on a mass action stochastic dynamics. Domain-domain binding plays a crucial role in the design of the pattern which we therefore present using a rule-based approach where binding is an explicit primitive. We also a use a series of refinements, starting from a very simple interaction set, which we feel gives an interesting and intuitive rationale for the working of the final repair scheme.
A Method of Query over Encrypted Data in Database
Authors: Lianzhong Liu, Jingfen Gai
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The encryption mechanism is an effective way to protect the sensitive data in database from various attacks. When the data is encrypted, the query performance degrades greatly. How to query encrypted data efficiently becomes a challenge. In this paper, a scheme to support query over encrypted data is proposed. Firstly, we extend two-phase framework to complete query, constructing different indexes for different data types. A new method to construct Bucket index for numeric data is proposed and bloom filter compression algorithm is used for the character string, which will be saved in database as a numeric data. We analyzed the false positive probability of bloom filter to get optimal parameters. Experiment results show the performance of our scheme has improved.
Numerical study on incomplete orthogonal factorization preconditioners
Authors: Zhong-Zhi Bai, Iain S. Duff, Jun-Feng Yin
Venue: Journal of Computational and Applied Mathematics (2009)

We design, analyse and test a class of incomplete orthogonal factorization preconditioners constructed from Givens rotations, incorporating some dropping strategies and updating tricks, for the solution of large sparse systems of linear equations. Comprehensive accounts about how the preconditioners are coded, what storage is required and how the computation is executed for a given accuracy are presented. A number of numerical experiments show that these preconditioners are competitive with standard incomplete triangular factorization preconditioners when they are applied to accelerate Krylov subspace iteration methods such as GMRES and BiCGSTAB.