ppxscal/embedding_network huggingface dataset:
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Authors: Alok Singh
Venue: Applied Soft Computing (2009)

Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks on this graph a spanning tree of minimum weight among all the spanning trees of the graph that have at least @? leaves. In this paper, we have proposed an artificial bee colony (ABC) algorithm for the LCMST problem. The ABC algorithm is a new metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm. We have compared the performance of our ABC approach against the best approaches reported in the literature. Computational results demonstrate the superiority of the new ABC approach over all the other approaches. The new approach obtained better quality solutions in shorter time.
Robust concurrent online testing of network-on-chip-based SoCs
Authors: Praveen S. Bhojwani, Rabi N. Mahapatra
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Lifetime concerns for complex systems-on-a-chip (SoC) designs due to decreasing levels in reliability motivate the development of solutions to ensure reliable operation. A precursor to any proposed recovery scheme would require the identification of failures in the system. Non-concurrent infield testing is an impractical solution due to prohibitive costs in terms of testpower and test time. This novel research proposes the use of concurrent online testing (COLT) to circumvent these issues. A test infrastructure-intellectual property (TI-IP) is deployed within network-on-chip (NoC)-based SoC designs to provide online test support while managing intrusion of test into executing applications within the system. This research describes the architecture and operation of a TI-IP capable of COLT. To address scalability of this solution, we show how these would operate when more than one is deployed in an SoC. In the absence of benchmarks for the analysis of COLT, two baseline and eight TI-IP configuration variations within SoC test configurations were developed using application and test benchmarks from the research domain. The power profiles from the NoCSim simulation environment are reported here demonstrating how different configurations of TI-IPs would operate. A robust TI-IP protocol is also specified and possible hazards and their mitigations are identified.
The effect of representation location on interaction in a tangible learning environment
Authors: Sara Price, Taciana Pontual Falcão, Jennifer G. Sheridan, George Roussos
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Drawing on the 'representation' TUI framework [21], this paper reports a study that investigated the concept of 'representation location' and its effect on interaction and learning. A reacTIVision-based tangible interface was designed and developed to support children learning about the behaviour of light. Children aged eleven years worked with the environment in groups of three. Findings suggest that different representation locations lend themselves to different levels of abstraction and engender different forms and levels of activity, particularly with respect to speed of dynamics and differences in group awareness. Furthermore, the studies illustrated interaction effects according to different physical correspondence metaphors used, particularly with respect to combining familiar physical objects with digital--based table-top representation. The implications of these findings for learning are discussed.
An integrated fuzzy model for supplier management: A case study of ISP selection and evaluation
Authors: Saman Hassanzadeh Amin, Jafar Razmi
Venue: Expert Systems with Applications: An International Journal (2009)

Supplier selection is a multi-criteria decision-making problem which consists of both qualitative and quantitative metrics. A lot of investigations have been published in the supplier selection area and it has been notified that in the majority of these publications supplier selection and evaluation and development have the same meaning. However, one needs integrated models to cover all of these stages. In addition, most of the proposed models focused on manufacturing environments and a few papers have been allocated for service industries. To our knowledge, no Internet service provider (ISP) selection and evaluation has been published up to now. In this paper, we propose a new framework on the basis of company's strategy for supplier management including supplier selection, evaluation, and development. In the first phase, quality function deployment (QFD) is utilized to rank the best ISPs based on qualitative criteria. Then, a quantitative model is adopted to consider quantitative metrics. Finally, we compose two models and select the best ISPs. In the next phase, we propose a novel algorithm to evaluate selected ISPs from three perspectives: customer, performance, and competition. Meanwhile, the fuzzy logic and triangular fuzzy numbers are utilized to deal with vagueness of human thought. Furthermore, a case study is conducted to illustrate the stages of ISP selection and evaluation. The implementation of the proposed model is easy and do not need optimization background.
Test-driven data structures: revitalizing CS2
Authors: Joel Adams
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Software testing is an increasingly important topic in engineering reliable software systems, and test-driven development is an increasingly popular methodology for building reliable systems. However, most software engineering instructors' courses are already very full, so that increasing coverage of testing in those courses can only occur at the expense of another topic. In this paper, we argue that testing should be introduced early in the CS curriculum, that the Data Structures (CS2) course is an especially natural place to emphasize unit testing and test-driven development, and that doing is a way to revitalize the CS2 course.
SoCWire: A Robust and Fault Tolerant Network-on-Chip Approach for a Dynamic Reconfigurable System-on-Chip in FPGAs
Authors: Björn Osterloh, Harald Michalik, Björn Fiethe
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Individual Data Processing Units (DPUs) are commonly used for operational control and specific data processing of scientific space instruments. These instruments have to be suitable for the harsh space environment in terms of e.g. temperature and radiation. Thus they need to be robust and fault tolerant to achieve an adequate reliability. The Configurable System-on-Chip (SoC) solution based on FPGA has successfully demonstrated flexibility and reliability for scientific space applications like the Venus Express mission. Future space missions demand high-performance on board processing because of the discrepancy of extreme high data volume and low downlink channel capacity. Furthermore, in-flight reconfiguration ability and dynamic reconfigurable modules enhances the system with maintenance potential and at run-time adaptive functionality. To achieve these advanced design goals a flexible Network-on-Chip (NoC) is proposed for applications with high reliability, like space missions. The conditions for SRAM-based FPGA in space are outlined. Additionally, we present our newly developed NoC approach, System-on-Chip Wire (SoCWire) and outline its performance and suitability for robust dynamic reconfigurable systems.
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Authors: Miriam Allalouf, Yuval Shavitt
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths (e.g., MPLS tunnels). This paper presents an algorithm for finding an optimal and global per-commodity max-min fair rate vector in a polynomial number of steps. In addition, we present a fast and novel distributed algorithm where each source router can find the routing and the fair rate allocation for its commodities while keeping the locally optimal max-min fair allocation criteria. The distributed algorithm is a fully polynomial epsilon-approximation (FPTAS) algorithm and is based on a primal-dual alternation technique. We implemented these algorithms to demonstrate its correctness, efficiency, and accuracy.
The Dryad data repository: a Singapore framework metadata architecture in a DSpace environment
Authors: Hollie C. White, Sarah Carrier, Abbey Thompson, Jane Greenberg, Ryan Scherle
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

This report presents recent metadata developments for Dryad, a digital repository hosting datasets underlying publications in the field of evolutionary biology. We review our efforts to bring the Dryad application profile into conformance with the Singapore Framework and discuss practical issues underlying the application profile implementation in a DSpace environment. The report concludes by outlining the next steps planned as Dryad moves into the next phase of development.
Robust Tracking for Processing of Videos of Communication's Gestures
Authors: Frédérick Gianni, Christophe Collet, Patrice Dalle
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This paper presents a method of image processing used in a mono-vision system in order to study semiotic gestures. We present a robust method to track the hands and face of a person performing gestural communication and the Signs' language communication. A model of skin is used to compute the observation density as a skin colour distribution in the image. Three particle filter trackers are implemented, with re-sampling and annealed update steps to increase their robustness to occultation and high acceleration variations of body parts'. Evaluations of the trackers with and without these enhancements, show the improvement that they bring.
A Policy-Based Resource Reservation Service for Maritime Tactical Networks
Authors: David Kidston, Isabelle Labbé, Francis St-Onge, Thomas Kunz
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

Naval at sea (maritime tactical) networks are characterised by a dynamic, heterogeneous, and low-bandwidth environment. There is a critical need for Traffic Engineering (TE) mechanisms to support traffic prioritisation and resource optimisation in this environment. A desirable management service in this environment is end-to-end guaranteed bandwidth for critical application flows. Solutions such as RSVP are not appropriate for the maritime environment where links are error prone and easily overloaded. This paper describes the Resource Reservation Service (RRS), a policy-enabled flow-based TE management service developed specifically for the low-bandwidth, high-error rate, and mobility of the maritime environment. This service includes several novel features including multi-path probing, bi-directional reservations, and full policy control. The value of multi-path probing is demonstrated by simulation.
An Evaluation Study of Mobile Agent Technology: Standardization, Implementation and Evolution
Authors: Menelaos K. Perdikeas, Fotis G. Chatzipapadopoulos, Iakovos S. Venieris
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper examines the current status of standardization efforts concerning mobile agent technology and presents five Java-based mobile agent platforms (MAPs). Standards relating to mobile agent technology are presented first, followed by a comparative presentation of five Java-based mobile agent platforms. The presentation addresses mainly qualitative characteristics of the platforms from the application developer?s point of view. Some performance measurements are also presented. The paper concludes with some general remarks on the future of this technology.
Milling Wear Monitoring Study Based on Cutting Power
Authors: Chuangwen Xu, Wu Xiaohong, Luo Wencui, Fan Xing
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Multi-parameter signals of the milling tools wear are pretreated. Using feature fusion pattern, structural levels project of the signal level, the model level, the characteristic level and class structure are established. The optical control strategies of the tools compensation system is proposed through training samples fuzzy wavelet neural network approach system, so that tool wear is estimated. This contrast results from the experiments, the forecast accuracy of the artificial neural network models is in the context. When the tool wear is small reversely, and the relative error of the model is larger. Because the effective power caused by the tool wear is small, and the measured results are influenced easily by the other factors. When the tool wear is large, the relative error of the model is small. Results of experiment show that the model is applicable to the monitor milling tool wear in different milling process and can more accurately monitor acute wear.
Dreamweaver CS4 For Dummies
Authors: Janine C. Warner
Venue: For Dummies (2008)

Whether youre a seasoned pro or a Web design newbie, Dreamweaver CS4 For Dummies shows you the quickest, easiest way to get up to speed on Dreamweaver. Youll be able to create professional, great-looking, user-friendly websites in no time at all. Take advantage of the new, more customizable interface, improved integration with Flash and Photoshop, a handy new AJAX coding feature, and Live View, which lets you see your work as you create it.Understand Dreamweaver basics, set up your site and create new pages, and work with text, graphics, and links. You can manage, test, and publish a site, define and apply styles with CSS, coordinate your design work, add audio, video, and Flash files to your site, build a dynamic Web site, and use Dreamweavers database features. Know how to:Design, build, and deploy professional-looking Web sites Use Dreamweavers new, more versatile preset layouts Fine-tune styles with enhanced CSS support Keep your pages cutting-edge with SmartObjects Take advantage of the new, more customizable interface Understand browser differences, make the most of CSS, build dynamic sites Create and optimize Web graphics Learn to maximize Cascading Style Sheets and Dreamweavers Layers features for creating fluid layouts Complete with lists of ten resources, ten timesaving tips, and ten great Web sites designed in Dreamweaver, Dreamweaver CS4 For Dummies is your one-stop guide to setting up, working with, and making the most of Dreamweaver.
A clinical information system (CIS) for ambulatory care
Authors: Clement McDonald, Bharat Bhargava, David Jeris
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

In this paper we wish to present an evolving ambulatory care information system (CIS) which has been in use by physicians since July 1, 1973. The noteworthy features of this system include: 1. Implementation in a high level interpretive language on a mini computer. 2. Paper based (optically read turn-around documents) rather than electronic terminal I/O. 3. Automated clinical surveillance (the computer works for the physician by searching out errors and danger conditions rather than being a passive repository of data). 4. Data base management orientation to better cope with the constant companion of change.
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Authors: Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This paper considers two natural Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph G&thinsp;=&thinsp;(V,E), with |V|&thinsp;=&thinsp;n and |E|&thinsp;=&thinsp;m. Our results, together with the definition of the two problems, are listed below. The Maximum Degree-Bounded Connected Subgraph problem (MDBCS d ) takes as input a weight function $\omega : E \rightarrow \mathbb R^+$ and an integer d&thinsp;&ge;&thinsp;2, and asks for a subset E&prime;&thinsp;&sube;&thinsp;E such that the subgraph G&prime;&thinsp;=&thinsp;(V,E&prime;) is connected, has maximum degree at most d, and &sum;&thinsp; e&thinsp;&isin;&thinsp;E&prime; &omega;(e) is maximized. This problem is one of the classical NP-hard problems listed by Garey and Johnson in [Computers and Intractability, W.H. Freeman, 1979], but there were no results in the literature except for d&thinsp;=&thinsp;2. We prove that MDBCS d is not in Apx for any d&thinsp;&ge;&thinsp;2 (this was known only for d&thinsp;=&thinsp;2) and we provide a $(\min \{m/ \log n,\ nd/(2 \log n)\})$-approximation algorithm for unweighted graphs, and a $(\min\{n/2,\ m/d\})$-approximation algorithm for weighted graphs. We also prove that when G has a low-degree spanning tree, in terms of d, MDBCS d can be approximated within a small constant factor in unweighted graphs. The Minimum Subgraph of Minimum Degree &thinsp;&ge;&thinsp;d (MSMD d ) problem requires finding a smallest subgraph of G (in terms of number of vertices) with minimum degree at least d. We prove that MSMD d is not in Apx for any d&thinsp;&ge;&thinsp;3 and we provide an $\mathcal{O}(n/\log n)$-approximation algorithm for the class of graphs excluding a fixed graph as a minor, using dynamic programming techniques and a known structural result on graph minors.
Brief Communication: A model of influenza virus spread as a function of temperature and humidity
Authors: Tomasz Żuk, Franciszek Rakowski, Jan P. Radomski
Venue: Computational Biology and Chemistry (2009)

The influence that atmospheric conditions might have on the efficiency of the spread of influenza virus is important for epidemiological and evolutionary research. However, it has not been satisfactorily recognized and quantified so far. Here we provide a statistical model of influenza transmission between individuals. It has been derived from the results of recent experiments, which involved infecting guinea pigs with influenza at various temperatures and relative air humidity levels. The wide range of transmission rates in those experiments reflects the ensemble-independent phenomena. The correlation between most of our simulations and the experimental results is satisfactory. For several different conditions, we obtained transmissibility values which seem to be sufficiently accurate to provide partial input for an intended large-scale epidemiological study in the near future.
Perspectives on router buffer sizing: recent results and open problems
Authors: Arun Vishwanath, Vijay Sivaraman, Marina Thottan
Venue: ACM SIGCOMM Computer Communication Review (2009)

The past few years have witnessed a lot of debate on how large Internet router buffers should be. The widely believed rule-of-thumb used by router manufacturers today mandates a buffer size equal to the delay-bandwidth product. This rule was first challenged by researchers in 2004 who argued that if there are a large number of long-lived TCP connections flowing through a router, then the buffer size needed is equal to the delay-bandwidth product divided by the square root of the number of long-lived TCP flows. The publication of this result has since reinvigorated interest in the buffer sizing problem with numerous other papers exploring this topic in further detail - ranging from papers questioning the applicability of this result to proposing alternate schemes to developing new congestion control algorithms, etc. This paper provides a synopsis of the recently proposed buffer sizing strategies and broadly classifies them according to their desired objective: link utilisation, and per-flow performance. We discuss the pros and cons of these different approaches. These prior works study buffer sizing purely in the context of TCP. Subsequently, we present arguments that take into account both real-time and TCP traffic. We also report on the performance studies of various high-speed TCP variants and experimental results for networks with limited buffers. We conclude this paper by outlining some interesting avenues for further research.
Design and application of electronically programmable LSI arrays
Authors: D. Hampel, R. L. Barron, D. Cleveland
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

It has been shown that arrays of calculating elements, providing various functions of their input variables, can be used as general-purpose signal processors. Such elements could, in general, operate on binary, analog, or numerical inputs. Networks or arrays composed of elements in each of these domains have advantages in particular applications. The numerical processing element and its use in programmable arrays is the subject of this paper.
Web-Scale Image Annotation
Authors: Jiakai Liu, Rong Hu, Meihong Wang, Yi Wang, Edward Y. Chang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we describe our experiments using Latent Dirichlet Allocation (LDA) to model images containing both perceptual features and words. To build a large-scale image tagging system, we distribute the computation of LDA parameters using MapReduce. Empirical study shows that our scalable LDA supports image annotation both effectively and efficiently.
On optimisation of the rough set-based decision rule extraction
Authors: Urszula Stanczyk
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Extraction of decision rules that comprise a decision algorithm constitutes one of crucial steps within the rough set approach to the problem of classification. It follows the phase of finding all reducts of conditional attributes and for the one which is chosen the succeeding procedure of establishing all valid value reducts. From the variety of possible solutions there is required the one with the highest accuracy of classification as well as simplicity of implementation which is reflected by the lowest number of conditional clauses within the decision algorithm. In the paper there is described such optimising methodology employed to the rough set-based approach to the stylometric problem of authorship attribution.
Note: An improved randomized approximation algorithm for maximum triangle packing
Authors: Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
Venue: Discrete Applied Mathematics (2009)

This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expected ratio of 4383(1-@e)(~0.518(1-@e)) for any constant @e>0. By modifying their algorithm, we obtain a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio of 0.5257(1-@e) for any constant @e>0.