ppxscal/embedding_network huggingface dataset:
Challenge in QoS Supporting via Integrating Differentiated Service and Multipath Routing on Mobile Ad Hoc Network
Authors: M. Esmaeili, M. Abbaspour, H. Alipour, H. Mousavi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc OnDemand Distance Vector Routing (AODV), DestinationSequenced DistanceVector (DSDV) and Temporally Ordered Routing Algorithm (TORA) have been implemented. In this paper an attempt has been made to compare the performance of two prominent ondemand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol.. The performance differentials are analyzed using varying network load, mobility, and network size. an on demand NodeDisjoint Multipath Routing protocol with low broadcast redundancy proposed. Multipath routing allows the establishment of multiple paths between a single source and single destination node. It is also beneficial to avoid traffic congestion and frequent link breaks in communication because of the mobility of nodes. The important components of the protocol, such as path accumulation, decreasing routing overhead and selecting nodedisjoint paths, are explained. protocol significantly reduces the total number of Route Request packets, this results in an increased delivery ratio, smaller endtoend delays for data packets, lower control overhead and fewer collisions of packets. DiffServ is a standard approach for a more scalable way to achieve QoS in any IP network and could potentially be used to provide QoS in MANETs because it minimises the need for signalling. This can classify network traffic into different priority levels and apply priority scheduling and queuing management mechanisms to obtain QoS guarantees. Keywords: MANET, Ad hoc, Routing, Multipath
Experiences with a FPGA-based Reed/Solomon Encoding Coprocessor
Authors: Volker Hampel, Peter Sobe, Erik Maehle
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper we present an implementation of a Reed/Solomon (R/S) coprocessor to be used on a hybrid computing system, which combines general purpose CPUs with FPGAs. The coprocessor accelerates the encoding of user data to be stored block-wise on a distributed, failure tolerant storage system. We document design constraints and their impact on the resulting architecture. Measurements are presented to characterize the performance of the coprocessor in terms of computation bandwidth, latency, and the hardware-software interaction. For comparison, software based R/S encoding implementations are presented and evaluated as well. Finally, the performance of the hardware accelerated encoding is compared to a software based system.
Community Mining from Signed Social Networks
Authors: Bo Yang, William Cheung, Jiming Liu
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Many complex systems in the real world can be modeled as signed social networks that contain both positive and negative relations. Algorithms for mining social networks have been developed in the past, however most of them were designed primarily for networks containing only positive relations and thus not suitable for signed networks. In this work, we propose a new algorithm, called FEC, to mine signed social networks so that both positive within-group relations and negative between-group relations are dense. FEC considers both the sign and the density of relations as the clustering attributes, making itself effective for not only signed networks but also conventional social networks including only positive relations. Also, FEC adopts an agent-based heuristic that makes the algorithm efficient (in linear time with respect to the size of a network) and capable of giving nearly optimal solutions. FEC depends on only one parameter whose value can easily be set, and requires no prior knowledge on hidden community structures. The effectiveness and efficacy of FEC have been demonstrated through a set of rigorous experiments involving both benchmark and randomly-generated signed networks.
Cost, Performance, and Size Tradeoffs for Different Levels in a Memory Hierarchy*
Authors: S. L. Rege
Venue: Computer (1976)

Until recently, electronically addressable devices such as ferrite core, plated wire, semiconductor memories, and electromechanically addressable devices such as magnetic tapes, disks, and drums were the few technologies from which a computer system designer could build a memory system. A number of different new technologies and devices have been developed that close the "access gap"14between the two dissimilar technologies mentioned above. These include charge-coupled devices (CCD's),2bubble memories,4electron beam addressed memories (EBAM),17and domain tip propagation (DOT).16Other technologies like CMOS1and integrated injection logic (I2L),9compete directly with the existing technologies. Table 1 (see p. 46) shows the possibility of a six-level hierarchy and some cost and performance projections for these technologies.
An interaction visualisation tool for a learning management system
Authors: Sujana Jyothi, Claire McAvinia, John G. Keating
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Interaction design in a Learning Management System is the art of instigating interactions and facilitating communication between learners. In order to instigate interactions we need to first analyse and model these online interactions. This paper describes an automated, scalable, multi-browser, real-time visualisation software tool, which depicts the structure and design of the interaction between the students in an asynchronous conference. It gives an in-depth explanation of the tool and illustrates the purpose and management of interactions between the students in a. learning environment. The data examined in this study included a purposive sample of asynchronous, online discussion postings of students in our institution captured via forums and discussion-boards in a Moodle environment for the purpose of testing the software. This innovative tool is embedded into the Moodle environment and can be used by educators to evaluate students' activities and identify online behaviors and interaction patterns in the networked learning environment. Information provided by the software tool can be used for motivating the students and building an online socio-learning community.
Bottleneck discovery and overlay management in network coded peer-to-peer systems
Authors: Mahdi Jafarisiavoshani, Christina Fragouli, Suhas Diggavi, Christos Gkantsidis
Venue: Proceedings of the 2007 SIGCOMM workshop on Internet network management (2007)

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay; moreover, it is integrated in the normal content distribution. This work demonstrates another advantage of using network coding and complements previous work that showed network coding achieves high network-resource utilization.
Extending a Natural Language Interface with Geospatial Queries
Authors: Vinitha Reddy, Kyle Neumeier, Joshua McFarlane, Jackson Cothren, Craig W. Thompson
Venue: IEEE Internet Computing (2007)

The authors describe an extension of a menu-based natural language interface (MBNLI) to support geospatial queries. Their extension makes it easier for application analysts and even inexperienced users to phrase complex queries without knowing SQL, database schemas, spatial operators, or spatial indexes.
A Modified SOFM Segmentation Method in Reverse Engineering
Authors: Xue-mei Liu, Shu-sheng Zhong, Xiao-liang Bai
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The purpose of reverse engineering is to convert a large point cloud into a CAD model. In reverse engineering, the key issue is segmentation, i.e. studying how to subdivide the point cloud into smaller regions, where each of them can be approximated by a single surface. Segmentation is relatively simple, if regions are bounded by sharp edges and small blends; problems arise when smoothly connected regions need to be separated. In this paper, a modified self-organizing feature map neural network (SOFM) is used to solve segmentation problem. Eight dimensional feature vectors (3-dimensional coordinates, 3- dimensional normal vectors, Gaussian curvature and mean curvature) are taken as input for SOFM. The weighted Euclidean distance measure is used to improve segmentation result. The method not only can deal with regions bounded by sharp edges, but also is very efficient to separating smoothly connected regions. The segmentation method using SOFM is robust to noise, and it operates directly on the point cloud. An example is given to show the effect of SOFM algorithm.
Stochastic Model of Finite Buffer Priority Queuing System with Multi-type Batch Arrival and General Rejection
Authors: Attila Korosi, Balazs Szekely, Csaba Lukovszki
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper is motivated by the need of buffer dimension- ing and traffic management solution for DSL access lines providing quality assured service delivery. To provide exact performance evaluation of such systems often queuing mod- els are applied. The quality of service analysis of access lines using pre-emption option needs analysis of finite buffer priority queuing systems with batch arrival. The presented work extends this queuing model by introducing general re- jection and multi-type arrival. To derive numerical results for performance evaluation of queuing systems based on this model analytical framework is given and general ap- plication of the model is proven by showing examples of partial, complete and generally linear rejections.1
3D Caricature Generation System on the Mobile Handset Using a Single Photograph
Authors: Yeong-Kyu Lim, Alexander Fedorov, Shin-Dug Kim
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In this paper, we introduce the 3D caricature generations system working on the mobile handset. Mobile handset is quite a good research target because of popular use and has restrictions on using general method used on PC computing environment. We propose simple but quite effective algorithm on face detection and face modeling. These algorithms do not degrade the performance of the system and show good results at the experiment. The proposed system use our own OpenGL-ES implementation which shows good performance compared with commercial implementation result for 3D graphics. Based on the good 3D capability, we can implement efficient morphing algorithm and animation effect. Additionally, we can have the ability to change caricature's accessory, background image and put emotional effect, aging effect on generated caricature. Although the result image is not same with drawing image by artist but gets satisfactory feedback from users who used this system.
Pathological Voice Classification Based on a Single Vowel's Acoustic Features
Authors: Ce Peng, Wenxi Chen, Xin Zhu, Baikun Wan, Daming Wei
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This research focuses on the classification of pathological voice from healthy voice based upon 30 acoustic features derived from a single sound of vowel /a/. The method includes two steps. The first is the feature space transformation and data dimension reduction based on PCA. The second step is the classification of transformed features using support vector machine (SVM). The method was validated with a sound database provided by the Massachusetts Eye and Ear Infirmary (MEEI). 216 data files, collected from an identical phoneme vowel /a/ from subjects of healthy and pathological cases, were used for examination. The original 30 acoustic features and the transformed features derived with PCA were modeled by the SVM classifier using the radial basis function (RBF) as a kernel function. The deviation residual (DR) is employed as the index for performance evaluation. In the 5 fold cross-validation, the results show that the pathological cases suffered from various diseases were detected with classification rates of up to 98.1%, while the sensitivity and specificity were 92.5% and 99.4%, respectively. This preliminary result suggests that the highly promising feasibility of the detection of mental and physical status through analyzing a single tone of voice. Keywords: pathological voice, SVM, MEEI, RBF
Workshop Report Microcomputer Standardization Concepts
Authors: W. J. Dejka
Venue: Computer (1977)

As has often been observed, the microcomputer is causing a major revolution in system design and implementation. The advent of microcomputers has made it possible to achieve many designs that are unique and innovative. Many other designs have resulted in significant cost savings which were not considered possible until microelectronics technology produced the small, programmable computer-on-a-chip. 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
Multi-Language Information Searching Tool
Authors: Samira Sadaoui, Siritorn Srisodsai
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

This paper presents a tool, namely Multi-Language Information Searching (MLIS), for a meaning-oriented search. MLIS allows users to access the right information and provides the search results with knowledge from different cultures and languages. MLIS takes advantage of agent technology as well as web services to enhance the quality of existing search engines in terms of accessibility, usability and flexibility. Their are several advantages in using MLIS, including: MLIS simultaneously performs in different languages translation and search activities as background processes hidden from users; it provides a friendly graphical user interface that instantly displays the search results in separated tabs, categorizing them according to languages chosen by users; it is proposed with a flexible architecture to automatically create multiple web-service agents based on users' preferences; it is service-independent and can integrate, for the same session, several web services from different service providers.
Relaxed LMI conditions for closed-loop fuzzy systems with tensor-product structure
Authors: Carlos Ariño, Antonio Sala
Venue: Engineering Applications of Artificial Intelligence (2007)

Current fuzzy control research tries to obtain the less conservative conditions to prove stability and performance of fuzzy control systems. In many fuzzy models, membership functions with multiple arguments are defined as the product of simpler ones, where all possible combinations of such products conform a fuzzy partition. In particular, such situation arises with widely used fuzzy modelling techniques for nonlinear systems. These type of fuzzy models will be denoted as tensor-product (TP) fuzzy systems, because its expressions can be understood as operations on multi-dimensional arrays. This paper discusses the generalisation to TP fuzzy systems of the results in Kim and Lee [2000. New approaches to relaxed quadratic stability condition of fuzzy control systems. IEEE Transactions on Fuzzy Systems 2, 1571-1582] and Xiaodong and Qinling [2003. New approaches to H"~ controller designs based on fuzzy observers for T-S fuzzy systems via LMI. Automatica 39, 1571-1582]. The procedures here will allow to set up linear matrix inequality conditions which are less conservative than the cited ones, by exploiting the TP structure of the membership functions. A numerical example illustrates the achieved improvement.
Proceedings of the 2007 ACM workshop on Secure web services
Venue: Workshop On Secure Web Services (2007)

For many years, the ACM Workshop on Web Service Security (SWS) has been a major forum for presenting original research results, practical experiences, and innovative ideas in Web services applications and XML security. Looking back, it is difficult not to appreciate the full extent of the change that occurred in our field. Once considered afterthoughts in application design, Web service access control, data protection, privacy and trust have become the key problems of our day. This central role of security in designing and implementing all sorts of business processes and services has however brought increased responsibilities to the research community. Today, practitioners and researchers alike need to find new ways to cope with the increasing scale and complexity of the security problems that must be solved on Service Oriented Architectures. Like the previous editions, SWS 2007 has proved to be up to this challenge. The 2007 edition of SWS received 28 submissions, out of which the program committee selected 13 high quality papers covering a number of diverse research topics related to Web services and SOA security. We are glad to see that the final program contains a well-balanced mix of theoretical results and practical prototype systems, many of them converging and building off each other. Also, the SWS program includes a number of papers on new, emerging aspects of Web service security research.
Discrete Event Simulation: A Review of SimEvents
Authors: Michael A. Gray
Venue: Computing in Science and Engineering (2007)

A new entrant in the field of discrete event simulation systems, SimEvents has several desirable system features. It still has some catching up to do with Rockwell's popular Arena system in some areas, but SimEvents is particularly useful for existing Matlab and Simulink users looking to construct complex hybrid systems of discrete/continuous processing.
Design of Weighted Counters with Rational Scale Using Continued Fraction Expansion
Authors: E. J. Van Lantschoot
Venue: IEEE Transactions on Computers (1974)

Modulo qiscalers or counters are one-input Moore machines whose state set contains a unique subset (called cycle) of states which occur in cyclic succession.
Communication of Business's and Software Engineers
Authors: David Dupuis, Roger Lee, Haeng-Kon Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Communications for the purpose of creating useful software are imperative. Techniques need to be in place to facilitate the flow of correct information from the requestor, and the creator. Without this the software will be of little use and discarded before it should be. In this paper we will present a systematic way to creating a question and answer flow of information. Details of the difference are between using the question and answer system and not will be reported in various ways. Our results will show the increase in efficiency of software creation by having fewer changes later in the project and improved usefulness to the end user.
Proving Total Correctness of Parallel Programs
Authors: A. F. Babich
Venue: IEEE Transactions on Software Engineering (1979)

An approach to proving paralel programs correct is presented. The steps are 1) model the paralel program, 2) prove partial correctness (proper synchronization), and 3) prove the absence of deadlock, livelock, and infinite loops. The parallel program model is based on KeUler's model. The main contributions of the paper are techniques for proving the absence of deadlock and livelock. A connection is made between Keler's work and Dijkstra's work with serial non-deterministic programs. It is shown how a variant function may be used to prove finite termination, even if the variant function is not strictly decreasing, and how finite termination can be used to prove the absence of livelock. Handling of the finite delay assumption is also discussed. The illustrative examples indude one which occurred in a commercial environment and a classic synchronization problem solved without the aid of special synchronization primitives.
A kinetic Monte Carlo method on super-lattices for the study of the defect formation in the growth of close packed structures
Authors: Massimo Camarda, Antonino La Magna, Francesco La Via
Venue: Journal of Computational Physics (2007)

A modified Kinetic Lattice Monte Carlo model has been developed to predict growth rate regimes and defect formation in the case of the homo-epitaxial growth of close packed crystalline structures. The model is an improvement over standard Monte Carlo algorithms, which usually retain fixed atom positions and bond partners indicative of perfect crystal lattices. Indeed, we extend the concepts of Monte Carlo growth simulations on super-lattices containing additional sites (defect sites) with respect to those of the reference material. This extension implies a reconsideration of the energetic mapping, which is extensively presented, and allows to describe a complex phenomenology that is out of accessibility of standard stochastic approaches. Results obtained using the Kawasaki and the Bond-Counting rules for the transition probability of the Monte Carlo event are discussed in details. These results demonstrate how the defect types (local or extended), the formation mechanisms and the defect generation regimes can be characterized using our approach.
A Multi-subpopulation Accelerating Genetic Algorithm Based on Attractors (MAGA): Performance in Function Optimization
Authors: Zhiyi Lin, Yuanxiang Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

A multi-subpopulation accelerating genetic algorithm based on attractors(MAGA) is proposed to cope with the drawback of genetic algorithms. MAGA views the excellent individuals as attractors and generates local small popula- tions in the neighbor of them to maintain the diversity of the population. In the course of searching, MAGA constantly shrinks the searching neighbor and uses the accelerating operators to speed up the evolution of MAGA. The conver- gence analysis shows MAGA can converge to global opti- mization under some circumstances. Finally, MAGA's effi- ciency is validated through optimization of two benchmark functions.
A z-domain transfer function solution to the non-minimum phase acoustic beamformer
Authors: T. J. Moir
Venue: International Journal of Systems Science (2007)

The two input Griffiths-Jim acoustic beamformer is analysed in the frequency domain using a causal Wiener z-transfer function formulation. Unlike previous solutions the approach here examines the particular problem of non-minimum phase acoustic transfer functions which are encountered in many real filtering problems. The polynomial transfer function approach gives an elegant way of obtaining the frequency response of the beamformer. The effect of signal leakage is also considered and a general polynomial solution is given.