ppxscal/embedding_network huggingface dataset:
A Web Page Segmentation Algorithm Based on Iterated Dividing and Shrinking
Authors: Cao Jiuxin, Mao Bo, Luo Junzhou
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Based on image processing technology and the web page special characteristics, a new web page segmentation algorithm-Iterated Dividing and Shrinking Algorithm is proposed. Image dividing conditions are introduced, and the dividing zone concept is given. Based on that, the web page is first transformed into image, and then by shrinking and splitting repeatedly, the image is divided into subimages which are consentaneous in vision. Experiments show that the algorithm is suitable for web page segmentation, and does well in expansibility and performance.
Architecture of a Small Low-Cost Satellite
Authors: D. Del Corso, C. Passerone, L. M. Reyneri, C. Sansoe, M. Borri, S. Speretta, M. Tranchero
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper presents the architecture of a small university satellite that we have developed. The main design criteria were low cost and fault tolerance, which have been achieved by using Commercial Off The Shelf components and by replicating all critical functions, while monitoring the state of the system for failures. The focus of the paper is on overall organization, design partitioning and details of the actual hardware. We show that the development of a low-cost satellite is feasible with a very limited budget.
SynPAM—A Distance Measure Based on Synonymous Codon Substitutions
Authors: Adrian Schneider, Gaston Gonnet, Gina Cannarozzi
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

Measuring evolutionary distances between DNA or protein sequences forms the basis of many applications in computational biology and evolutionary studies. Of particular interest are distances based on synonymous substitutions, since these substitutions are considered to be under very little selection pressure and therefore assumed to accumulate in an almost clock-like manner. SynPAM, the method presented here, allows the estimation of distances between coding DNA sequences based on synonymous codon substitutions. The problem of estimating an accurate distance from the observed substitution pattern is solved by maximum-likelihood with empirical codon substitution matrices employed for the underlying Markov model. Comparisons with established measures of synonymous distance indicate that SynPAM has less variance and yields useful results over a longer time range.
Calculation of document similarity using cellular structured space template
Authors: Pizzanu Kanongchaiyos
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Calculation of similarity between corresponding documents becomes a major task in information retrieval from a textual database (e.g., electronic books or electronic dictionaries). The comparison between documents can be conducted by constructing associative feature vectors or set of terms and computing distance between the corresponding vectors or sets. While Boolean distance seems not practical and set similarity cannot handle with the case that some terms are more effective in retrieval than others, statistics of terms in documents is recognized as a good for computing document relevance. However, the efficiency of the calculation is based on only the size of the statistical data while the documents discourse or additional meaning from the structure of text is not considered. In this research, cellular structured space templates are used for building input documents. The concept of the cellular structured space template for specifying the basic layout and semantics of the document is a reasonable compromised between time-consuming manual document retyping process and unavailable totally automated document recognition process. Semantics-based similarity between documents is computed attached calculation of cellular structured vectors which are n-dimensional context vectors of the documents. The experimental result shows the improvement of similarity between relevance documents compared with the normal retrieval methods.
On the detection and origin identification of mobile worms
Authors: Sandeep Sarat, Andreas Terzis
Venue: Proceedings of the 2007 ACM workshop on Recurring malcode (2007)

Mobility can be exploited to spread malware among wireless nodes moving across network domains. Because such mobile worms spread across domains by exploiting the physical movement of mobile nodes, they cannot be contained by existing defenses. In this paper we address this new challenge using techniques for detecting the existence of stealthy mobile worms in the early stages of their infection and identifying the origins of such infections. The proposed mechanisms are based on random moonwalks which were originally used in post mortem analysis of Internet worms. However as we demonstrate, the original technique fails against mobile worms which are inherently stealthier than existing malware. In this paper, we extend the moonwalk algorithm by considering new heuristics and show that the proposed mechanism can reliably detect mobile worms during the early stages of infection. Our simulation results, based on network traces collected from a university-wide wireless network, show that a mobile infection can be reliably detected before it infects 10% of the vulnerable population. Furthermore, the proposed mechanism identifies the origin of the infection, by limiting the search for the initial victims to within 2% of the mobile node population
An analytical study of low delay multi-tree-based overlay multicast
Authors: György Dán, Viktória Fodor
Venue: Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV (2007)

In this paper we propose an analytical model that describes the temporal evolution of the end-to-end loss characteristics for live multicast streaming. We consider push-based architectures combined with retransmissions and forward error correction (FEC). We use the model to identify the primary sources of delay in overlay multicast, and to investigate the possible ways of decreasing the required playback delay. Based on the results we argue that in order to achieve good quality with low playback delays independent of the overlay's size, these systems have to adjust the FEC code rate dynamically. Our findings show that the available upload capacity is the key to efficient overlay multicast with low delay bounds.
On a Ternary Model of Gate Networks
Authors: J. A. Brzozowski
Venue: IEEE Transactions on Computers (1979)

In this paper we formalize a ternary model which is being used to study the behavior of binary sequential gate networks. We first describe a binary model which is capable of a detailed description of network behavior, but involves a number of steps that grows exponentially in the number of gates. The complexity of the ternary model is linear in the number of gates;however, only partial information is obtained in generaL A mathematical theory is developed making precise these two models and the comparison between them. A number of examples illustrate these results. This work generalizes previously reported research.
RFID Anti-collision Protocol for Dense Passive Tag Environments
Authors: Kashif Ali, Hossam Hassanein, Abd-Elhamid M. Taha
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Tag collisions can impose a major inefficiency in RFID systems, resulting in low identification rates, short reading range and ineffective resource utilization. They are more problematic in passive tags due to limitations on power and functionality. In this paper, we present a novel approach to overcome the passive tag collision problem. The novelty in our scheme is that it requires no additional memory, results in a higher identification rate and reduces power and medium consumption. The proposed scheme can be augmented to tree-based anti-collision proposals, both existing and to come, and substantially improve their performance. Performance results indicate that the augmented schemes bear significant gains that are achieved by reducing collision, overhead and delay.
Identity boxing: secure user-level containment for the grid
Authors: D. Thain
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Today, a public key infrastructure allows grid users to be identified with strong cryptographic credentials and and a descriptive, globally-unique name such as /O=UnivNowhere/CN=Fred. This powerful security infrastructure allows users to perform a single login and then access a variety of remote resources on the grid without further authentication steps. However, once connected to a specific system, a user's grid credentials must somehow be mapped to a local namespace. This creates a significant burden upon the administrator of each site to manage a continuously-changing user list. Large systems have worked around this by employing the old insecure standby of shared user accounts. A single user may be known by a different account name at every single site that he or she accesses, in addition to a variety of identity names given by certificate authorities. In order to access a resource, the user may need to have a local account generated. In order to share resources, each user must know the local identities of users that he/she wishes to share with. To solve these problems, we introduce the technique of identity boxing. An identity box is a well-defined execution space in which all processes and resources are associated with an external identity that need not have any relationship to the set of local accounts. That is, within an identity box, a program runs with an explicit grid identity string rather than with a simple integer UID. As a program executes, all access controls are performed using the high level name rather than the low-level account information. A single Unix account may be used to securely manage several identity boxes simultaneously, thus eliminating the need to services to run as root merely to change identities.
E-studium: an Italian experience of blended e-learning E-studium: an Italian experience of blended e-learning
Authors: Emanuela Falcinelli, Candida Gori, Judit Jasso, Alfredo Milani, Simonetta Pallottelli
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In the radically changing framework of education and training, the E-studium project (http://e-studium.unipg.it) developed at the University of Perugia, proposes a dynamic and versatile education system, managing effectively the learning process and using new ICT technologies to respond individually to the needs of a wide audience of students disseminated in the country. The organization model is an integrated e-learning system, known as blended e-learning (realized through the course management system Moodle), aiming at a renewal of academic education with a focus on quality of teaching, on support of in-class teaching by on-line services and materials, allowing better use and participation by both full-time and part-time students. Beside students, also academic teachers work as experimental subjects for the technologies implemented. In this work the "E-studium" project is presented showing the different phases of development, implementation and analysis of results including usage.
Comparative Study of Clustering Techniques for the Organization of Software Repositories
Authors: Ronaldo C. Veras, Silvio R. L. Meira, Adriano L. I. Oliveira, Bruno J. M. Melo
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Software reuse is essential for improving the productivity and quality of software projects. One of the key issues to promote the adoption of software reuse in companies is the development of effective repositories of software components. It is also very important to have good methods for searching and retrieval of the components. Clustering techniques can help by providing a visualization of the repository of software components as well as in helping to refine the searches by grouping together similar components. In this paper we quantitatively compare two clustering techniques, namely, self-organizing maps (SOM) and growing hierarquical SOM (GHSOM) for clustering a repository of classes from a Java API for building mobile systems. The performance measure was the quantization error. The simulations have shown that GHSOM outperforms SOM in these tasks. GHSOM is more suitable for this task because it is a constructive technique, which is an advantage in tackling the growth of the repository of software components.
Niche Genetic Algorithm for Robot Path Planning
Authors: Xuanzi Hu, Cunxi Xie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Robot path planning has been an active research area, and many methods have been developed to tackle this problem recently, especially traditional GA is applied in path planning for mobile robots successfully, but traditional Genetic Algorithm (GA) has some common drawbacks, one is time-consuming when dealing with a large population, and the other is premature convergence. In this paper, robot path planning method based on Niche Genetic Algorithm (NGA) is first presented, and to make NGA more effective, four specialized operators are designed. Experimental results indicate that presented method has more capability and higher speed of obtaining an optimal or near-optimal collision free path planning than the traditional GA.
Explaining quantity implicatures
Authors: Tikitu de Jager, Robert van Rooij
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We give derivations of two formal models of Gricean Quantity1 implicature and strong exhaustivity (Van Rooij and Schulz, 2004; Schulz and Van Rooij, 2006), in bidirectional optimality theory and in a signalling games framework. We show that, under a unifying model based on signalling games, these interpretative strategies are game-theoretic equilibria when the speaker is known to be respectively minimally and maximally expert in the matter at hand. That is, in this framework the optimal strategy for communication depends on the degree of knowledge the speaker is known to have concerning the question she is answering. In addition, and most importantly, we give a game-theoretic characterisation of the interpretation rule Grice (formalising Quantity1 implicature), showing that under natural conditions this interpretation rule occurs in the unique equilibrium play of the signalling game.
Design and Implementation of a Real-Time Video Player on Tiled-Display System
Authors: Giseok Choe, Jeongsoo Yu, Jeonghoon Choi, Jongho Nang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper presents a design and implementation of re- altime video player that operates on a tiled-display system consisting of multiple PCs to provide a very large and high resolution display. In the proposed system, the master pro- cess transmits a compressed video stream to multiple PCs using UDP multicast. All slaves(PC) receive the same video stream, decompress, clip their designated areas from the decompressed video frame, and display it to their displays while being synchronized with each other. A simple syn- chronization mechanism based on the H/W clock of each slave is proposed to avoid the skew between the tiles of the display, and a flow-control mechanism based on the bit-rate of the video stream and a pre-buffering scheme are pro- posed to prevent the jitter. The proposed system is imple- mented with Microsoft DirectX filter technology in order to decouple the video/audio codec from the player. Exper- imental results on a tiled display system with 28 PCs show that the proposed system could display a video stream in a realtime without jitter and skew.
An agent of behaviour architecture for unmanned control of a farming vehicle
Authors: L. García-Pérez, M. C. García-Alegre, A. Ribeiro, D. Guinea
Venue: Computers and Electronics in Agriculture (2008)

This paper presents a hybrid agent of behaviour architecture to deal with the autonomous navigation of a farming vehicle. To this end, a conventional vehicle was fitted with a set of sensors and actuators to acquire continuous location and environmental data to safely and appropriately interact with a dynamic environment. The vehicle autonomously performs local piloting, following a tentative path initially specified by the human operator through a set of intermediate positions. A wireless LAN is used to get a bi-directional communication between the farming vehicle and the human supervisor. Sensor-fusion algorithms are proposed to overcome the lack of GPS signals so as to obtain continuous and precise positioning. From a set of basic motion agents ADVANCE, TURN, STOP, AVOID OBSTACLE, more specific agents related to the agricultural operation are defined, such as FOLLOW STRAIGHT LINE and CHANGE OF ROW. Some results are presented to show global navigation.
An Accurate and Scalable Clock Synchronization Protocol for IEEE 802.11-Based Multihop Ad Hoc Networks
Authors: Dong Zhou, Ten H. Lai
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

This paper studies the fundamental problem of clock synchronization in IEEE 802.11-based multihop ad hoc networks. Clock synchronization is important for power saving, network throughput and efficiency of many protocols in an IEEE 802.11-based mobile ad hoc network. The scalability problem of 802.11 timing synchronization has been studied extensively in single hop ad hoc networks and good solutions are available. These solutions, however, do not perform well in a multihop environment. A few multihop solutions for clock synchronization have been proposed recently, but the performances are still not very good. The maximum clock offset is still over 200 µs for these protocols. This paper proposes an adaptive protocol through beacon transmission prioritization, frequency adjustment and construction of dominating set. The frequency adjustment is proved to be bounded. Simulation studies show that the proposed protocol is able to limit the maximum clock offset to under 50μs after protocol stabilization. The improvement is more than 400% over the current solutions. The proposed protocol also shows great long-term stability, and it handles mobility very well.
Special Feature: Instruction in MOS LSI Systems Design
Authors: C. H. Sequin
Venue: Computer (1980)

Designers of next-generation computers will employ a building-block approach reflecting the interdependence of system architecture and IC design. This course prepares for that approach.
A word from the editor
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2007)

Welcome to ACM Computers in Entertainment, a premier online magazine featuring video interviews with leading professionals and interesting articles on entertainment technology and its applications. 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
Programming Styles in Nial
Authors: M. A. Jenkins
Venue: IEEE Software (1986)

The programming language Nial several styles f supports several styles of programming including imperative, procedural, applicative, and lambda-free. Nial tools can be built to illustrate relational and object-oriented styles of programming.
Mapping Small Worlds
Authors: Matteo Dell'Amico
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Social networks are usually navigable small worlds: individuals are able to find short chains of acquaintances connecting pairs of unrelated nodes. This property can be explained by the fact that nodes are characterized by a series of properties, such as geographical position, work or educational background; the navigation proceeds towards the node that is "most similar" to the destination. Since nodes are likely to be linked with similar individuals, this strategy permits to quickly reach the destination. We approach the problem of creating the information that makes a network navigable. Starting from a given network, and without any other information, we show how nodes can reconstruct, with a scalable and decentralized algorithm, a "network map: a d-dimensional layout that places nodes in a way that reflects the network structure, so that navigability is achieved. Euclidean distance on the layout is used as a measure for node similarity, and efficient routing can be simply achieved by iteratively jumping towards the neighbor that is closest to the destination. The network map provides a means for implementing routing on social networks that can be used in "darknets", that is, anonymous networks where nodes establish connections only if they are mutually trusted. Moreover, the distance between nodes on the network map can be used as a measure of node affinity, and may help in various types of network analysis, for instance to help evaluate reputation in webs of trust, or in order to perform "personalized" ranking.
BDA information management and decision support based on DW
Authors: Ma Zhi-jun, Chen Li, Zhang Yi-zhen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In modern battle field, Battle Damage Assessment (BDA) is one of the most important bases for battle decision. With increasing intensity of war, more and more BDA data created, how to effectively store, manage and make a good use of these BDA data becomes an important matter. Data warehouse (DW) is a decision support tool developed in recent decades, having powerful capability of data management and decision support. Paper discussed building of BDA data warehouse, management of BDA data and BDA decision based on DW.
An efficient wake-up schedule during power mode transition considering spurious glitches phenomenon
Authors: Yu-Ting Chen, Da-Cheng Juan, Ming-Chao Lee, Shih-Chieh Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

During the power mode transition, a large surge current may lead to the malfunctions in a power-gating design. In this paper, we introduce several important properties of the surge current during the power mode transition for the Distributed Sleep Transistor Network (DSTN) designs. Based on these properties, we propose an accurate estimation of surge current and provide an efficient schedule on the DSTN structure. Our experiment achieved significantly better results than previous works---on average, 332 times wake-up time reduction and 35.48% less energy loss during the power mode transition.
Streaming maximum-minimum filter using no more than three comparisons per element
Authors: Daniel Lemire
Venue: Nordic Journal of Computing (2006)

The running maximum-minimum (MAX-MIN) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparatively, no algorithm is known to compute the running maximum (or minimum) filter in 1.5 comparisons per element, in the worst case. Our algorithm has reduced latency and memory usage.