ppxscal/embedding_network huggingface dataset:
A processing path dispatcher in network processor MPSoCs
Authors: Rainer Ohlendorf, Michael Meitinger, Thomas Wild, Andreas Herkersdorf
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Multi-field packet classification problems discussed in the literature are typically constrained to the Internet five-tuple and primarily address the problem of network quality-of-service (QoS) support and access control. In this paper, we present a solution for a classification problem that is used for optimized packet assignment to different data paths within a network processor system-on-chip (SoC). In contrast to the five-tuple-based rules discussed in the prior art, our problem has rules that consider a larger set of fields from the packet header. However, for each individual rule a different sub-set of fields is relevant and the number of rules is smaller. Based on a specification of the usage case for our classifier we derive heterogeneous decision graph algorithm (HDGA), a heuristic approach to construct a decision tree classifier that integrates external lookup results for certain types of rules. We evaluate various parameters for optimizing the proposed decision tree and present simulation results to show the scalability of HDGA for typical problem sizes. This paper is concluded with the results of an implementation on our field-programmable gate-array (FPGA)-based prototyping platform.
Optimal Order FEM for a Coupled Eigenvalue Problem on 2D Overlapping Domains
Authors: A. B. Andreev, M. R. Racheva
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper we present a numerical approach to a nonstandard second-order elliptic eigenvalue problem defined on two overlapping rectangular domains with a nonlocal (integral) boundary condition. Usually, for this class of problems error estimates are suboptimal. By introducing suitable degrees of freedom and a corresponding interpolation operator we derive optimal order finite element approximation. Numerical results illustrate the efficiency of the proposed method.
Coding-Based Oblivious Transfer
Authors: Kazukuni Kobara, Kirill Morozov, Raphael Overbeck
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

We present protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 OT based on the assumptions related to security of the McEliece cryptosystem and two zero-knowledge identification (ZKID) schemes, Stern's from Crypto '93 and Shamir's from Crypto '89, which are based on syndrome decoding and permuted kernels, respectively. This is a step towards diversifying computational assumptions on which OT --- cryptographic primitive of central importance --- can be based.As a by-product, we expose new interesting applications for both ZKID schemes: Stern's can be used for proving correctness of McEliece encryption, while Shamir's --- for proving that some matrix represents a permuted subcode of a given code.Unfortunately, it turned out to be difficult to reduce the sender's security of both schemes to a hard problem, although the intuition suggests a successful attack may allow to solve some long-standing problems in coding theory.
LOHD: Location-Oblivious Hybrid data Diffusion in wireless sensor networks
Authors: Xu Cheng, Feng Wang, Jiangchuan Liu
Venue: Ad Hoc Networks (2009)

Data-centric design has been widely adopted in wireless sensor networks thanks to its efficiency, as PUSH and PULL are two common data dissemination algorithms for such networks. The two algorithms work well with only a few sources or a few sinks, respectively. However, when there are many sources and many sinks, both of them become inefficient. In this paper, we take advantage of these two algorithms, and propose a novel Location-Oblivious Hybrid PUSH-PULL data Diffusion (LOHD) algorithm, which suits a wide range of network settings. Different from most of the existing approaches, LOHD does not rely on any location information, as it adaptively selects an ultra-node in the middle of sources and sinks through a well-controlled flooding, and the ultra-node establishes and maintains the gradients between sources and sinks. LOHD also incorporates enhanced PUSH and PULL to deliver messages along the gradients instead of flooding. We model and analyze the algorithms and perform extensive simulations. The results show that LOHD performs much better than both PUSH and PULL, particularly when the number of sources and sinks increases. We also show that the initialization overhead well resists to such increase, and thus LOHD is highly scalable.
Hybrid Ant Colony Algorithm and Its Application on Function Optimization
Authors: Bo Liu, Huiguang Li, Tihua Wu, Qingbin Zhang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A new hybrid ant colony algorithm was proposed. Firstly, weight factor was introduced to the binary ant colony algorithm, and then we obtained a new probability by combining probability model of Population based incremental learning (PBIL) with transfer probability of ants pheromone . The new population are produced by probability model of PBIL, transfer probability of ants pheromone and the probability of proposed algorithm so that population polymorphism is ensured and the optimal convergence rate and the ability of breaking away from the local minima are improved. Optimization simulation results based on the benchmark test functions show that the hybrid algorithm has higher convergence rate and stability than binary ant colony algorithm (BACA) and Population based incremental learning (PBIL).
The TOMAS inter-trial testbed - An evaluation platform for S-UMTS services, applications and components
Authors: Timm-Giel
Venue: Space Communications (1999)

TOMAS is an R&D-project within the EU-funded ACTS Programme. The main objective of the TOMAS project is to realise a Satellite-UMTS trial platform (testbed) for multimedia services with data rates up to 2 Mbit/s using existing geostationary satellites and to evaluate and enhance this inter-trial platform in Joint Trials with co-operating ACTS and non-ACTS projects. With the TOMAS service and application trials being performed before the introduction of UMTS and before further development of its satellite component, its results, including assessment of user requirements and user acceptance as well as system performance, can be used to improve the design of satellite services and systems complementing UMTS. This paper presents the TOMAS project, its objectives, the technical approach taken, and the results achieved in Joint Trials with different other R&D projects and user groups. TOMAS&rsquo; main objective is to test and evaluate Satellite-UMTS applications, components and services. The project&rsquo;s focus is on high-quality services with data rates from 64 kbit/s to 2 Mbit/s, provided globally by existing geostationary satellites. Within the project framework a testbed was set up using Inmarsat satellites and the ESA/EMS space segment onboard Italsat F2. To access the space segments, existing mobile terminals and earth stations were upgraded to TOMAS&rsquo; requirements. The performance of the testbed and the services was evaluated in end-user trials in telemedicine and construction site applications.
Principal Component Hashing: An Accelerated Approximate Nearest Neighbor Search
Authors: Yusuke Matsushita, Toshikazu Wada
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Nearest Neighbor (NN) search is a basic algorithm for data mining and machine learning applications. However, its acceleration in high dimensional space is a difficult problem. For solving this problem, approximate NN search algorithms have been investigated. Especially, LSH is getting highlighted recently, because it has a clear relationship between relative error ratio and the computational complexity. However, the p-stable LSH computes hash values independent of the data distributions, and hence, sometimes the search fails or consumes considerably long time. For solving this problem, we propose Principal Component Hashing (PCH), which exploits the distribution of the stored data. Through experiments, we confirmed that PCH is faster than ANN and LSH at the same accuracy.
Robotic harvesting of Gerbera Jamesonii based on detection and three-dimensional modeling of cut flower pedicels
Authors: Thomas Rath, Marco Kawollek
Venue: Computers and Electronics in Agriculture (2009)

Within the present study, a system for the automated harvest of Gerbera jamesonii pedicels with the help of image analytic methods was developed. The study can be divided mainly into two parts: the development of algorithms for the identification of pedicels in digital images and the development of procedures for harvesting these pedicels with a robot. Images of plants were taken with a stereo camera system, which consisted of two high-resolution CCD-cameras with near-infrared filters. The plant was positioned on a rotatable working desk and images of eight different positions were shot. The developed image processing algorithm segmented the potential pedicel regions in the images, removed noise, differentiated overlapping pedicels by using different algorithms and combined the remaining regions to pedicel objects. From the data of both images and eight plant positions three-dimensional models of the pedicels were created by triangulation. The remaining parts of the plants were modeled in a simple fashion. The evaluated 3D model is used to calculate spatial coordinates for the applied robot control. For harvesting the pedicels, an industrial robot with six axes (plus an additional linear axis) was used. A pneumatic harvest grabber was developed, which harvested the pedicels by cutting them off. In order to guarantee the collision free path of the robot, a path planning module was integrated, which includes the three-dimensional model of the plant and the test facility. With the applied techniques it was possible to correctly detect all pedicels on about 72% of the images. Regarding the whole image series of the respective plant, all pedicels could be detected in at least one photographing position in 97% of all cases. In the harvest experiments 80% of all pedicels could be harvested. The harvest rates decreased with increasing numbers of pedicels on a plant. Therefore, 98% of the pedicels could be harvested of plants with one or two pedicels, but only 51% were harvested of plants with five or more pedicels. In horticultural practice, an identification system for evaluating the stage of maturity should be included. An implementation for harvesting pedicels of different species with similar basic characteristics is imaginable.
Human factors in the guidance of uninhabited vehicles: oxymoron or tautology?: The potential of cognitive and co-operative automation
Authors: Axel Schulte, Claudia Meitinger, Reiner Onken
Venue: Cognition, Technology and Work (2009)

Today&#x2019;s automation is typically tied into work processes as tools actively supporting the human operator in fulfilling certain well-defined sub-tasks. The human operator is in the role of the high-end decision component determining and supervising the work process. With emergent technology highly automated work systems can be beneficial on the one hand, but automation may as well cause problems on its own. A new way of introducing automation into work systems shall be advocated by this article overcoming the classical pitfalls of automation and simultaneously taking the benefit as wanted. This shall be achieved by so-called cognitive automation, i.e. providing human-like problem-solving, decision-making and knowledge processing capabilities to machines in order to obtain goal-directed behaviour and effective operator assistance. A key feature of cognitive automation is the ability to create its own comprehensive representation of the current situation and to provide reasonable action. By additionally providing full knowledge of the prime work objectives to the automation it will be enabled to co-operate with the human operator in supervision and decision tasks, then being intelligent machine assistants for the human operator in his work place. Such assistant systems understand the work objective and will be heading for the achievement of the overall desired work result. They will understand the situation (e.g. opportunities, conflicts) and actions of team members&#x2014;whether humans or assistant systems&#x2014;and will pursue goals for co-operation and co-ordination (e.g. task coverage, avoidance of redundancy or team member overcharge). On the other hand, cognitive automation can be emerged towards being highly automated intelligent agents in charge of certain supportive tasks to be performed in a semi-autonomous mode. These cognitive semi-autonomous systems and the cognitive assistants shall be denoted as the two faces of dual-mode cognitive automation (Onken and Schulte, in preparation).
Training and process change: a collaborative telehealth case study
Authors: Duncan Stevenson
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

The next generation of telehealth systems running over broadband Internet will offer opportunities to change the way clinicians provide health services. This case study is a component of a larger research project which explores the implications of broadband telehealth in a tertiary healthcare setting. The research question of this case study addresses how to train and prepare clinicians to do their job using the next generation of telehealth systems. This case study presents observations of twelve clinicians during the training sessions conducted for them as they prepared to use a research prototype telehealth system in a pilot trial at their hospital. The telehealth system was purpose-designed to address the range of needs of the clinicians involved and clinicians very rapidly understood the affordances of the system. Our observations show that the clinicians spent the bulk of the training sessions dealing with process change. They focused on three areas: collaborating with their remotely located clinical assistant, adapting their clinical practice in order to use the system and identifying areas where the telehealth system need to be changed to support their specific needs. Our observations also show that each of the senior surgeons amongst the clinicians (working in a different sub-specialty) dealt differently with the process changes. We conclude that for complex tertiary healthcare telehealth applications the distinction between training given to the clinicians and process change identified by the clinicians is worth considering when preparing clinicians to use the next generation of telehealth systems. We suggest that teams developing advanced telehealth systems consider these issues of process change as they develop ways to prepare clinicians to use their system.
A novel Toffoli network synthesis algorithm for reversible logic
Authors: Yexin Zheng, Chao Huang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input output correspondence which makes the logic synthesis for reversible functions differs greatly from traditional Boolean functions. Exact synthesis methods can provide optimal solutions in terms of the total number of reversible gates in the synthesis results. Unfortunately, they may suffer from long computation time, due to the fact that the search space is likely to grow exponentially as the circuit size increases. Therefore, in this paper, we propose an efficient synthesis heuristic which provides high quality synthesis results of Toffoli network in more reasonable computation time. We use a weighted, directed graph for reversible function representation and complexity measurement. The proposed algorithm maximally decreases function complexity during synthesis steps. It has the ability to climb out of local minimums and guarantees algorithm convergence. The experimental results show that our algorithm can achieve optimal or very close to optimal solutions with computation time several orders of magnitude less than the exact methods. Compared with other heuristics, our method demonstrates superior performance in terms of reversible gate count as well as computation time.
Pro Spring Dynamic Modules for OSGi Service Platforms
Authors: Daniel Rubio
Venue:  (2009)

Spring and OSGis features are a natural fit; they are orthogonal to each other: OSGi is about packaging, deployment, and versioning issues, while Spring is about providing the necessary foundation to wire up Java classes in their most basic form using dependency injection and aspect orientation to fulfill an applications purpose. Pro Spring Dynamic Modules for OSGi Service Platforms by Daniel Rubio is the first book to cover OSGi as practically implemented by the worlds most popular, agile, and open source enterprise Java framework, Spring. Author Daniel Rubio covers the ease at which OSGi is used with the Spring Framework in development, packaging, versioning, and deployment. Enterprises are trusting Spring more and more, and this book leverages OSGi in a way that can complete the use of Spring in the enterprise, as OSGi is already being trusted and adopted by IBM, BEA, and others. The text discusses how Spring OSGi makes your Spring applications trusted SOA applications. What youll learn Understand the fundamentals of OSGi and Spring, and combine the two. Take your Spring applications and bundles, and incorporate OSGi for productionready packaging, versioning practices, and deployment. Create productionready Spring Beans by packaging and versioning, and then deploy them. Develop data access methods and means for your Spring OSGi projects. Build and use GUIs for Spring OSGi. Test, scale, and optimize your Spring OSGi applications for deployment and performance. Who is this book for? This book is for Java developers using the Spring Framework who are looking to take advantage of OSGi features, and Java developers in general looking to explore OSGis role on serverside development. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
Computers and sports: a natural marriage
Authors: Thomas A. Eifler
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The use of computers to score and time the outcome of various athletic events is almost as fast-growing as several of the sports themselves. From Austria to Atlanta, from Switzerland to Cleveland, in bowling alleys, on basketball courts, and at the finish lines of long distance foot races, computers are rapidly becoming as much a part of the world of athletic competition as the joy of victory and the agony of defeat. Whether serving as surrogate officials, omniscient scorekeepers, or stationary superscouts, these perfectly objective machines are adding to the enjoyment of both spectator and participant alike. 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
Twinkle box: a three-dimensional computer input device
Authors: Robert P. Burton, Ivan E. Sutherland
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

During the past fifteen years, use of two-dimensional computer input/output devices has become commonplace. Since the earliest uses of the light pen for target identification in air defense systems it has been obvious that two-dimensional input would be interesting and useful. A large number of two-dimensional tablets and digitizers have been developed and have come into quite effective use. These devices have made use of mechanical, electrical, magnetic, optical, and acoustic phenomena. (See bibliographical references.)
On choosing a nonlinear initial iterate for solving the 2-D 3-T heat conduction equations
Authors: Heng-Bin An, Ze-Yao Mo, Xiao-Wen Xu, Xu Liu
Venue: Journal of Computational Physics (2009)

The 2-D 3-T heat conduction equations can be used to approximately describe the energy broadcast in materials and the energy swapping between electron and photon or ion. To solve the equations, a fully implicit finite volume scheme is often used as the discretization method. Because the energy diffusion and swapping coefficients have a strongly nonlinear dependence on the temperature, and some physical parameters are discontinuous across the interfaces between the materials, it is a challenge to solve the discretized nonlinear algebraic equations. Particularly, as time advances, the temperature varies so greatly in the front of energy that it is difficult to choose an effective initial iterate when the nonlinear algebraic equations are solved by an iterative method. In this paper, a method of choosing a nonlinear initial iterate is proposed for iterative solving this kind of nonlinear algebraic equations. Numerical results show the proposed initial iterate can improve the computational efficiency, and also the convergence behavior of the nonlinear iteration.
Co-ordination and Co-operation in Agent Systems: Social Laws and Argumentation
Authors: Katie Atkinson, Trevor Bench-Capon
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

The social laws paradigm represents an important approach to the co-ordination of behaviour in multi-agent systems. In this paper we examine the relationship between social laws and rational behaviour, by which we mean behaviour that can be justified by a defensible argument. We describe how social laws have previously been defined and used within the context of Action-Based Alternating Transition Systems (AATSs). We then show how an account of argumentation for practical reasoning in agent systems, also based on AATSs, can be used to determine what is rational for the agents to do in the absence and presence of such laws. The reasoning involved is both of a practical and epistemic nature: agents need to make decisions about what to do based upon the assumptions that they make about the states they find themselves in, and crucially, they also need to reason about what the other agents in the scenario will do. What is rational for the agents to do has implications for the need for social laws, the ways in which social laws can help the situation, the form the social laws should take, and the likelihood of compliance with the social laws. This paper demonstrates how we can think about social laws and rational behaviour in a single framework, so as to identify these implications in particular scenarios, and so frame social laws accordingly.
Detecting botnets
Authors: Grzegorz Landecki
Venue: Linux Journal (2009)

Using Darknet to secure environments from threats in the wild.