ppxscal/embedding_network huggingface dataset:
Realising aura for initiating interactions in real environments
Authors: Victor Juay, Maria Indrawan, Sea Ling
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Information overload and spam are serious problems that plague our society today. In the advent of context aware systems and applications, these problems will inevitably continue to cause anguish among users. The problems stem primarily from the lack of user control over the interactions and services they receive. In search of a feasible solution to enable user controllable trade-offs over interactions, we study how the spatial model of interaction from the virtual environment domain addresses these interaction issues and find that recent research that uses similar concepts from the spatial model of interactions does not fully make use of the concept of Aura from the spatial model. This paper presents a modified spatial model of interactions focused on the abstract concept of Aura and tailored for implementation in real environments to resolve the interaction issues in context aware systems. We also conceptualise a system architecture to implement the modified spatial model of interaction and develop a fully functional prototype application as a proof of concept to demonstrate the model's operational feasibility.
Automatic analysis of firewall and network intrusion detection system configurations
Authors: Tomás E. Uribe Steven Cheung
Venue: Journal of Computer Security (2007)

Firewalls and network intrusion detection systems (NIDSs) are widely used to secure computer networks. Given a network that deploys multiple firewalls and NIDSs, ensuring that these security components are correctly configured is a challenging problem. Although models have been developed to reason independently about the effectiveness of firewalls and NIDSs, there is no common framework to analyze their interaction. This paper presents an integrated, constraint-based approach for modeling and reasoning about these configurations. Our approach considers the dependencies among the two types of components, and can reason automatically about their combined behavior. We have developed a tool for the specification and verification of networks that include multiple firewalls and NIDSs, based on this approach. This tool can also be used to automatically generate NIDS configurations that are optimal relative to a given cost function.
CRYPTEX Model for Software Source Code
Authors: ByungRae Cha
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

There are management and security of software source code equivalent to assembly lines of important infrastructure in the early stage of information society directly. A support technology and framework to protect software source code are so poor state. In this paper, the proposed model that is support protection and access control between software source code as object and subject that is not authenticated safely was named CRYPTEX model. And we propose active business model to provide delegate, mobile, and security/access control function for passive software source code in document state using CRYPTEX.
"Go with the winners" algorithms
Authors: D. Aldous
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We can view certain randomized optimization algorithms as rules for randomly moving a particle around in a state space; each state might correspond to a distinct solution to the optimization problem, or more generally, the state space might express some other structure underlying the optimization algorithm. In this setting, a general paradigm for designing heuristics is to run several simulations of the algorithm simultaneously, and every so often classify the particles as "doing well" or "doing badly", and move each particle that is "doing badly" to the position of one that is "doing well". In this paper, we give a rigorous analysis of such a "go with the winners" scheme in the concrete setting of searching for a deep leaf in a tree. There are two relevant parameters of the tree: its depth d, and another parameter /spl kappa/ which is a measure of the imbalance of the tree. We prove that the running time of the "go with the winners" scheme (to achieve 99% probability of success) is bounded by a polynomial in d and /spl kappa/. By contrast, the simple restart scheme: run several independent simulations and pick the deepest leaf encountered takes time exponential in /spl kappa/ and d in the worst-case. We also show that any algorithm that guarantees a constant probability of success must have worst case running time at least /spl kappa/d.
Location-Based Services: Back to the Future
Authors: Paolo Bellavista, Axel Küpper, Sumi Helal
Venue: IEEE Pervasive Computing (2008)

What was wrong with first-generation location-based services? A brief historical overview identifies five factors that collectively laid the foundation for a new generation of LBSs.
Approximate graph coloring by semidefinite programming
Authors: D. Karger, R. Motwani
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We consider the problem of coloring k-colorable graphs with the fewest possible colors. We give a randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with min {O(/spl Delta//sup 1/3/log/sup 4/3//spl Delta/), O(n/sup 1/4/ log n)} colors where /spl Delta/ is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this marks the first non-trivial approximation result as a function of the maximum degree /spl Delta/. This result can be generalized to k-colorable graphs to obtain a coloring using min {O/spl tilde/(/spl Delta//sup 1-2/k/), O/spl tilde/(n/sup 1-3/(k+1/))} colors. Our results are inspired by the recent work of Goemans and Williamson who used an algorithm for semidefinite optimization problems, which generalize linear programs, to obtain improved approximations for the MAX CUT and MAX 2-SAT problems. An intriguing outcome of our work is a duality relationship established between the value of the optimum solution to our semidefinite program and the Lovasz /spl thetav/-function. We show lower bounds on the gap between the optimum solution of our semidefinite program and the actual chromatic number; by duality this also demonstrates interesting new facts about the /spl thetav/-function.
Texture Characteristics for Classification of the Ultrasonic Images of Roator Cuff Disease
Authors: Ming-Huwi Horng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This article proposes a study on applied the texture analysis method to classify the different disease groups that are normal, tendon inflammation, calcific tendonitis and rotator cuff tear. The supraspinatus tendon is usually involved among above-mentioned diseases progression. Four texture analysis methods that texture feature coding method, gray-level co-occurrence matrix, fractal dimension and texture spectrum are used to extract features of tissue characteristic of supraspinatus tendon. The mutual information method is independently used to select powerful feature among four texture analysis method, further, the radial basis function network to classify the ones into the four disease group. Experimental results tested on 85 images reveal that the proposed system can achieves 84% accurate rate.
An Efficient and Deadlock-Free Network Reconfiguration Protocol
Authors: Olav Lysne, Jose Miguel Montanana, Jose Flich, Jose Duato, Timothy Mark Pinkston, Tor Skeie
Venue: IEEE Transactions on Computers (2008)

Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over time. Such changes may require the network to be reconfigured such that the existing routing function is replaced by one which enables packets to reach their intended destinations amid the changes. Efficient reconfiguration methods are desired that allow the network to function uninterruptedly over the course of the reconfiguration process while remaining free from deadlocking behavior. In this paper, we propose, evaluate, and prove deadlock freedom of a new network reconfiguration protocol that overlaps various phases of "static" reconfiguration processes traditionally used in commercial and research systems to provide performance efficiency on par with that of recently proposed "dynamic" reconfiguration processes, but without their complexity. Simulation results show that the proposed Overlapping Static Reconfiguration protocol can reduce reconfiguration time by up to 50%, reduce packet latency by several orders of magnitude, reduce packet dropping by an order of magnitude, and provide unhalted packet injection as compared to traditional static reconfiguration while allowing network throughput similar to dynamic reconfiguration.
Tunable Universal OTA-C Frequency Filter Design Using Signal-Flow Graphs
Authors: M. Minarcik, K. Vrba
Venue: Proceedings of the Third International Conference on Systems (2008)

This article deals with OTA–C frequency filter design using the Mason–Coates signal–flow graphs. The procedure of universal circuit design that can realize low–pass, high–pass, band–pass, band–rejection and all–pass frequency filters working in the current mode as well in the voltage mode is shown. The cut–off frequency and quality factor of the frequency filters can be controlled independently. Controlling the circuit is realized by changing the transconductance of the OTA amplifiers used.
On Average Distortion of Embedding Metrics into the Line
Authors: Yuri Rabinovich
Venue: Discrete Computational Geometry (2008)

We introduce and study the notion of the average distortion of a nonexpanding embedding of one metric space into another. Less sensitive than the multiplicative metric distortion, the average distortion captures well the global picture and, overall, is a quite interesting new measure of metric proximity, related to the concentration of measure phenomenon. The paper mostly deals with embeddings into the real line with a low (as much as it is possible) average distortion. Our main technical contribution is that the shortest-path metrics of special (e.g., planar, bounded treewidth, etc.) undirected weighted graphs can be embedded into the line with constant average distortion. This has implications, e.g., on the value of the MinCut&#x2013;MaxFlow gap in uniform-demand multicommodity flows on such graphs.
A pipelined-loop-compatible architecture and algorithm to reduce variable-length sets of floating-point data on a reconfigurable computer
Authors: Gerald R. Morris, Viktor K. Prasanna
Venue: Journal of Parallel and Distributed Computing (2008)

Reconfigurable computers (RCs) combine general-purpose processors (GPPs) with field programmable gate arrays (FPGAs). The FPGAs are reconfigured at run time to become application-specific processors that collaborate with the GPPs to execute the application. High-level language (HLL) to hardware description language (HDL) compilers allow the FPGA-based kernels to be generated using HLL-based programming rather than HDL-based hardware design. Unfortunately, the loops needed for floating-point reduction operations often cannot be pipelined by these HLL-HDL compilers. This capability gap prevents the development of a number of important FPGA-based kernels. This article describes a novel architecture and algorithm that allow the use of an HLL-HDL environment to implement high-performance FPGA-based kernels that reduce multiple, variable-length sets of floating-point data. A sparse matrix iterative solver is used to demonstrate the effectiveness of the reduction kernel. The FPGA-augmented version running on a contemporary RC is up to 2.4 times faster than the software-only version of the same solver running on the GPP. Conservative estimates show the solver will run up to 6.3 times faster than software on a next-generation RC.
Low-Rate Personal Area Networks: Enabling Wireless Sensors with IEEE 802.15.4, Second edition
Authors: Jose Gutierrez; Edgar Callaway; Raymond Barrett
Venue:  (2007)

This SECOND EDITION of Low-Rate Wireless Personal Area Networks: Enabling Wireless Sensors with IEEE 802.15.4 is the newest handbook in the IEEE Standards Wireless Networks Series. This updated book now includes detailed information from the revised IEEE Std 802.15.4-2006, which includes the amendment IEEE 802.15.4b. IEEE Std 802.15.4 was developed to address low-cost and low-power design to enable applications in the fields of industrial, agricultural, vehicular, residential, and medical sensors and actuators. This book offers the reader an insider's view of the standard. Features include an overview of the standard, the motivation and vision behind it, background on the technology, technical features and components, application scenarios, and material not covered in the standard related to the network layer functionality for applications. The book also focuses on implementation and system design considerations, including an analysis of system-level, real-world issues that will be important for prospective implementers to consider. Presented in a concise and easy to read format by experts intimately involved in the development and writing of the standard, this guide is an invaluable resource to the standard for those interested in the field of "simple" wireless connectivity. Low-Rate Wireless Personal Area Networks, 2nd Edition, is a MUST READ for anyone who wants to fully understand the inner-workings and possibilities of the IEEE 802.15.4 standard.
Styx Grid Services: Lightweight middleware for efficient scientific workflows
Authors: J. D. Blower, A. B. Harrison, K. Haines
Venue: Scientific Programming (2006)

The service-oriented approach to performing distributed scientific research is potentially very powerful but is not yet widely used in many scientific fields. This is partly due to the technical difficulties involved in creating services and workflows and the inefficiency of many workflow systems with regard to handling large datasets. We present the Styx Grid Service, a simple system that wraps command-line programs and allows them to be run over the Internet exactly as if they were local programs. Styx Grid Services are very easy to create and use and can be composed into powerful workflows with simple shell scripts or more sophisticated graphical tools. An important feature of the system is that data can be streamed directly from service to service, significantly increasing the efficiency of workflows that use large data volumes. The status and progress of Styx Grid Services can be monitored asynchronously using a mechanism that places very few demands on firewalls. We show how Styx Grid Services can interoperate with with Web Services and WS-Resources using suitable adapters.
An asset management system based on RFID, WebGIS and SMS
Authors: Shengguang Meng, Wei Chen, Gang Liu, Shitong Wang, Liu Wenyin
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

In this paper, we propose an asset management system using technologies of Radio Frequency Identification (RFID), Web Geographic Information System (WebGIS) and Short Message Service (SMS) for intelligent management of assets. The proposed method tracks and monitors the changes of locations of the assets and shows their statuses on a geographical map, preventing the loss of assets due to unclear reasons. The movement of assets can be automatically identified using the RFID technique. The corresponding data are transferred by the GSM module in real time, enabling the spatial information of assets to be displayed on an electronic geographical map using WebGIS. The proposed method also facilitates automated notification of asset movement and malfunction alarm through SMS. Preliminary experiments show that the proposed method can improve information availability of assets and reduce asset management cost dramatically.
The introduction of an environmental cooling method is proved by using a reduced tool life cycle time method
Authors: B. Boswell, T. T. Chandratilleke
Venue: International Journal of Computer Integrated Manufacturing (2007)

Heat generation at the tool-chip interface has long been recognized as a major factor that causes sudden tool failure and shortened tool life in machining operations. Cooling fluids have traditionally been used to remove heat from the tool tip in an attempt to prolong tool life. Numerous health issues linked to the prolonged exposure of cooling fluids and pollution concerns require costly and regulated disposal process of the cooling fluid. Metal cutting using alternative cooling methods has been considered by the manufacturing industry as a possible alternative to liquid-based cooling. However, low heat removal rates or the expense of alternative cooling processes have resulted in the manufacturing industry's continued use of liquid cooling. To assist in determining the most effective cooling process a tool life model for the cutting tool is used to reduce the lifecycle testing. The work presented in this paper examines the effectiveness of an air-cooling technique based on jet impingement to prolong the effective life cycle of cutting tools. Results obtained so far clearly indicate a highly significant reduction in tool tip temperature with the air-jet arrangement, and at an economical cost. The cooling effectiveness of this technique is found to be comparable to liquid coolants with no significant decrease in tool life with air jet cooling.
Reality is our laboratory: communities of practice in applied computer science
Authors: M. Rohde, R. Klamma, M. Jarke, V. Wulf
Venue: Behaviour & Information Technology (2007)

The present paper presents a longitudinal study of the course 'High-tech Entrepreneurship and New Media'. The course design is based on socio-cultural theories of learning and considers the role of social capital in entrepreneurial networks. By integrating student teams into the communities of practice of local start-ups, we offer learning opportunities to students, companies and academia. The student teams are connected to each other and to their supervisors in academia and practice through a community-system. Moreover, the course is accompanied by a series of lectures and group discussions. In this paper we want to present our experiences and to reflect upon the design changes between the first and the second instance of the course. The evaluation of the course showed that the work on real-world problems and the collaboration in teams together with partners from start-up companies were evaluated as very positive, although design flaws, and cultural and professional diversities limited the success of the first instance in 2001. For the second course in 2002, the didactical design was improved significantly according to evaluation results, which brought evidence that the design changes resulted in better collaborative practices and more stable relationships between start-up companies and students. Furthermore, it was found that especially the differences in cultural background and different historical experiences between the two distinct groups of 'students' and 'entrepreneurs' might make processes of social identification more difficult and, therefore, successful community-building less likely'.
Bootstrapping spoken dialogue systems by exploiting reusable libraries
Authors: Giuseppe Di fabbrizio, Gokhan Tur, Dilek Hakkani-tÜr, Mazin Gilbert, Bernard Renger, David Gibbon, Zhu Liu, Behzad Shahraray
Venue: Natural Language Engineering (2008)

Building natural language spoken dialogue systems requires large amounts of human transcribed and labeled speech utterances to reach useful operational service performances. Furthermore, the design of such complex systems consists of several manual steps. The User Experience (UE) expert analyzes and defines by hand the system core functionalities: the system semantic scope (call-types) and the dialogue manager strategy that will drive the human–machine interaction. This approach is extensive and error-prone since it involves several nontrivial design decisions that can be evaluated only after the actual system deployment. Moreover, scalability is compromised by time, costs, and the high level of UE know-how needed to reach a consistent design. We propose a novel approach for bootstrapping spoken dialogue systems based on the reuse of existing transcribed and labeled data, common reusable dialogue templates, generic language and understanding models, and a consistent design process. We demonstrate that our approach reduces design and development time while providing an effective system without any application-specific data.
Workshop report: information visualization-human-centered issues in visual representation, interaction, and evalution
Authors: Andreas Kerren, John T. Stasko, Jean-Daniel Fekete, Chris North
Venue: Information Visualization (2007)

From 28 May to 1 June 2007, a seminar on 'Information Visualization-Human-Centered Issues in Visual Representation, Interaction, and Evaluation' took place at the International Conference and Research Center for Computer Science, Dagstuhl Castle, Germany. One important aim of this seminar was to bring together researchers and practitioners from Information Visualization and related fields, as well as from application areas, for lively discussion and interaction. The seminar allowed critical reflection on actual research efforts, the state of field, evaluation challenges, and other important topics. This report summarizes the event.
An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
Authors: Kenneth Holmström
Venue: Journal of Global Optimization (2008)

Powerful response surface methods based on kriging and radial basis function (RBF) interpolation have been developed for expensive, i.e. computationally costly, global nonconvex optimization. We have implemented some of these methods in the solvers rbfSolve and EGO in the TOMLAB Optimization Environment ( http://www.tomopt.com/tomlab/ ). In this paper we study algorithms based on RBF interpolation. The practical performance of the RBF algorithm is sensitive to the initial experimental design, and to the static choice of target values. A new adaptive radial basis interpolation (ARBF) algorithm, suitable for parallel implementation, is presented. The algorithm is described in detail and its efficiency is analyzed on the standard test problem set of Dixon---Szegö. Results show that it outperforms the published results of rbfSolve and several other solvers.
EC-XAMAS: SUPPORTING E-COMMERCE ACTIVITIES BY AN XML-BASED ADAPTIVE MULTI-AGENT SYSTEM
Authors: Pasquale De Meo, Domenico Rosaci, Giuseppe M. L. Sarnè, Domenico Ursino, Giorgio Terracina
Venue: Applied Artificial Intelligence (2007)

In this aricle we propose EC-XAMAS, an XML-based adaptive multi-agent system for handling e-commerce activities. More specifically, EC-XAMAS aims at supporting a customer visiting an e-commerce site in the search of products and/or services present therein and appearing to be appealing according to her past interests and behavior. The system is adaptive with respect to the profile of both the customer and the device she is exploiting for visiting the site. Finally, it is XML based since XML is exploited for both storing the agent ontologies and handling the agent communication.