ppxscal/embedding_network huggingface dataset:
Designing UI techniques for handwritten mathematics
Authors: Robert Zeleznik, Timothy Miller, Chuanjun Li
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

We discuss the design of user interface techniques for visualizing and controlling the recognition of handwritten mathematics. In particular, we present a range of visualization styles for displaying the result of math recognition. These styles offer different trade-offs between ease of user correction of errors in recognition and impact on the user's entry of math. We also describe recognition control techniques, including using user-controlled mappings of allographs to achieve more robust symbol recognition and provide extensions to notation, and UI control of non-spatial information used in recognition. We generally do not discuss the precise user interface implementation necessary to use these techniques, for example whether to use menus or gestures, but just the functionality required. Finally, we provide, in an appendix, a sketch of the recognition and display implementation behind our techniques.
Proceedings of the 2008 international workshop on Data management in peer-to-peer systems
Venue: DaMaP; Vol. 261 (2008)

This volume contains papers selected for presentation at the International Workshop on Data Management in Peer-to-Peer Systems (DAMAP 2008), held on March 25th 2008, in Nantes (France), in conjunction with the 11th International Conference on Extending Database Technology (EDBT 08). The purpose of this first edition of the Damap workshop is to bring together researchers who are involved in designing, managing and implementing peer-to-peer systems for large scale data management applications. The goal is to provide a forum for the exchange of ideas, knowledge and experiences in this domain, and to debate new issues and directions for research and development work in the future. After thorough review process for each of the 14 submissions, we have selected 9 papers. The program also included a keynote speech by Wolfgang Neijdl, researcher at the University of Hannover, Germany.
TuneFPGA: post-silicon tuning of dual-Vdd FPGAs
Authors: Stephen Bijansky, Adnan Aziz
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Modern CMOS manufacturing processes have significant variability, which necessitates guard banding to achieve reasonable yield. We study an FPGA architecture with a dual voltage supply wherein the supply voltage for individual CLBs can be assigned after fabrication; this yields a mechanism for fixing chips that fail because of manufactured transistors being slower than designed. The fundamental advance our work makes is that we assign voltages based on manufactured data rather than designed values. The key contributions of our work are a CAD methodology and a detailed quantitative study using realistic data on the latest process technologies of the impact of post-manufacturing tuning on yield and power for dual-Vdd FPGAs. We find that, for a representative modern process, post-manufacturing tuning can increase the yield by up to 10 &times; compared with a conventional dual-Vdd design that selects the voltage supply pre-manufacturing, even with guard banding. Overall, the geometric mean of yield/power ratio is 27% greater using post-manufacturing tuning.
The Method Engineering Process for Multi-Agent System Development
Authors: Xue Xiao, Zhang Xueyan
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The agent-oriented (AO) methodology is an effective means for constructing distributed systems. Despite a great deal of research, a number of challenges still exist before making agent-based computing a widely accepted paradigm in software engineering practice. In order to solve the problem of "difficult to implement", the paper presents a method engineering development process for facilitating building up new agent system by reusing method meta models and design patterns. As the supporting tool, the hierarchical development architecture(HDA) plays a key role in the process. To exemplify its feasibility and effectiveness, the construction of C4I system is presented as a case study.
Methodologies and Tools for Exploring Transport Protocols in the Context of High-Speed Networks
Authors: Romaric Guillier, Pascale Vicat-Blanc Primet
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

This PhD work aims at proposing a methodology and tools for the evaluation of transport protocols in the context of large scale computing environment based on high speed networks. The goal is to define and validate a benchmark for comparing different transport and congestion control approaches. Our contribution concerns the definition of metrics, scenarios, experiments and pilot demonstrations for high demanding distributed applications. After stating the problem of evaluating transport protocols in high speed networks, we present existing methodologies for this purpose. We introduce our proposal of a tool to help users performing network experiments. We illustrate our approach with a few examples of results obtained from experiments in our Grid'5000 testbed which complements other existing approaches.
Efficient broadcasting using network coding
Authors: Christina Fragouli, Jörg Widmer, Jean-Yves Le Boudec
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of log n, where n is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.
Cataclysm: Scalable overload policing for internet applications
Authors: Bhuvan Urgaonkar, Prashant Shenoy
Venue: Journal of Network and Computer Applications (2008)

In this paper we present the Cataclysm server platform for handling extreme overloads in hosted Internet applications. The primary contribution of our work is to develop a low overhead, highly scalable admission control technique for Internet applications. Cataclysm provides several desirable features, such as guarantees on response time by conducting accurate size-based admission control, revenue maximization at multiple time-scales via preferential admission of important requests and dynamic capacity provisioning, and the ability to be operational even under extreme overloads. Cataclysm can transparently trade-off the accuracy of its decision making with the intensity of the workload allowing it to handle incoming rates of several tens of thousands of requests/second. We implement a prototype Cataclysm hosting platform on a Linux cluster and demonstrate the benefits of our integrated approach using a variety of workloads.
Real-time feature-aware video abstraction
Authors: Hanli Zhao, Xiaogang Jin, Jianbing Shen, Xiaoyang Mao, Jieqing Feng
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

This paper presents a novel feature-aware rendering system that automatically abstracts videos and images with the goal of improving the effectiveness of imagery for visual communication tasks. We integrate the bilateral grid to simplify regions of low contrast, which is faster than the separable approximation to the bilateral filter, and use a feature flow-guided anisotropic edge detection filter to enhance regions of high contrast. The edges detected in this paper are smoother, more coherent and stylistic than those of the isotropic difference-of-Gaussian filter. The presented algorithms are highly parallel, allowing a real-time performance on modern GPUs. The implementation of our approach is straightforward. Several experimental examples are given at the end of the paper to demonstrate the effectiveness of our approach.
Wavelet decomposition of hyperspectral data: a novel approach to quantifying pigment concentrations in vegetation
Authors: G. A. Blackburn
Venue: International Journal of Remote Sensing (2007)

This paper reports a new approach for quantifying vegetation pigment concentrations through wavelet decomposition of hyperspectral remotely sensed data. Wavelets are a group of functions that vary in complexity and mathematical properties, that are used to dissect data into different frequency components and then characterize each component with a resolution appropriate to its scale. Wavelet analysis of a reflectance spectrum is performed by scaling and shifting the wavelet function to produce wavelet coefficients that are assigned to different frequency components. By selecting appropriate wavelet coefficients, a spectral model can be established between the coefficients and biochemical concentrations. Hence, wavelet analysis has the potential to capture much more of the information contained within high-resolution spectra than previous approaches and offers the prospect of developing robust, generic methods for pigment determinations. The capabilities of the wavelet-based technique were examined using reflectance spectra and pigment data collected for a range of plant species at leaf and canopy scales. For the combined data set and all of the individual vegetation types, methods based on wavelet decomposition appreciably outperformed narrowband spectral indices and stepwise selection of narrowband reflectance. However, there was variation between vegetation types in the relative performance of the three different feature extraction techniques employed for selecting the wavelet coefficients for use in predictive models. There was also considerable variability in the performance of predictive models according to the wavelet function used for spectral decomposition and the optimum wavelet functions differed between vegetation types and between individual pigments within the same vegetation type. The research indicates that wavelet analysis holds promise for the accurate determination of chlorophyll a and b and the carotenoids, but further work is needed to refine the approach.
Privacy-preserving logical vector clocks using secure computation techniques
Authors: Florian Kerschbaum, Julien Vayssiere
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Systems of logical clocks are commonly found in distributed systems for establishing causality between events occurring in concurrent communicating processes. Vector clocks are a popular type of logical clocks which require processes to attach to each message a logical timestamp that contains information about the sender process&#x2019;s view of the state of the distributed computation at the time of message sending. Causality between two events can then be determined by comparing their two logical timestamps. However, by doing so, processes leak potentially sensitive information about the advancement of their computation and the computations performed by the processes they communicate with. The contribution presented in this paper is a protocol, based on secure computation techniques, which preserves the privacy of each process&#x2019;s local logical clock while being strictly equivalent to regular vector clocks.
Application of the Floyd algorithm to the asymptotic analysis of networks with unreliable ribs
Authors: G. Sh. Tsitsiashvili, A. S. Losev
Venue: Automation and Remote Control (2008)

The problem of finding parameters of asymptotic relations for the probability of operation of a graph with unreliable ribs is solved. These parameters are expressed through minimax functions of lengths of ribs. To compute them, an economical modification of the Floyd algorithm is constructed.
Reflections about the construction of a platform LCMS in open code
Authors: Manuel Benito, Jesus Romo, Javier Portillo
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The management of e-learning environments requires the existence of resources and software tools that make it possible. In the immediate past, there have been two large axis of development: the construction of LMS (Learning Management System)platforms that permit an adequate users management but lack of content management, and the CMS (Content Management System) platforms that permit an efficient management of the contents but not thus of the users. Nevertheless, neither one nor another way has a true LCMS (Learning Content Management System), mainly because they have not used the RLO (Reusable Learning Object) as the basic unit in order to build educational and formative resources suitable to the needs of the users. Anyway, the obtained products should adopt the standards (IMS, AICC, SCORM) in order to be exportable to other contents management environments. In this document, we review the main antecedents of the problem, the initially adopted solutions, some strategic decisions and the reflections that necessarily accompany the development of dynamic experiences, such in this case.
WISA: a novel web image semantic analysis system
Authors: Hongtao Xu, Xiangdong Zhou, Lan Lin
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We present a novel Web Image Semantic Analysis (WISA) system, which explores the problem of adaptively modeling the distributions of the semantic labels of the web image on its surrounding text. To deal with this problem, we employ a new piecewise penalty weighted regression model to learn the weights of the contributions of the different parts of the surrounding text to the semantic labels of images. Experimental results on a real web image data set show that it can improve the performance of web image semantic annotation significantly.
The Application of X-Ray Detection System
Authors: Peng Wan
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

A nondestructive detection system based on X-ray for grocery check, thickness measure, wire ropes conveyer belt, the measure of the density of bone, and customs inspection, is designed by using X-ray detection technology. In this paper X-ray detection principle is analyzed, a design scheme of the system is consisted of detector, X-ray source, photovoltaic transformation board,image processing software and X-ray acquisition receiving board which is designed with the use of FPGA and DSP; image processing of the systems is researched and image processing algorithms are given; the software of the system is programmed by C#.NET on WIN XP platform. The experiment indicates the system can implement remote real-time detection of the systems images. The system is directly perceived, strongly real-time and highly accurate.
The role of information in the cop-robber game
Authors: Volkan Isler, Nikhil Karnad
Venue: Theoretical Computer Science (2008)

We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges in turns. The cops win the game if they can move onto the robber's vertex. In the standard formulation, it is assumed that the players can ''see'' each other at all times. A graph G is called cop-win if a single cop can capture the robber on G. We study the effect of reducing the cop's visibility. On the positive side, with a simple argument, we show that a cop with small or no visibility can capture the robber on any cop-win graph (even if the robber still has global visibility). On the negative side, we show that the reduction in cop's visibility can result in an exponential increase in the capture time. Finally, we start the investigation of the variant where the visibility powers of the two players are symmetrical. We show that the cop can establish eye contact with the robber on any graph and present a sufficient condition for capture. In establishing this condition, we present a characterization of graphs on which a natural greedy pursuit strategy suffices for capturing the robber.
Verifying the Safety of User Pointer Dereferences
Authors: Suhabe Bugrara, Alex Aiken
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Operating systems divide virtual memory addresses into kernel space and user space. The interface of a modern operating system consists of a set of system call procedures that may take pointer arguments called user pointers. It is safe to dereference a user pointer if and only if it points into user space. If the operating system dereferences a user pointer that does not point into user space, then a malicious user application could gain control of the operating system, reveal sensitive data from kernel space, or crash the machine. Because the operating system cannot trust user processes, the operating system must check that the user pointer points to user space before dereferencing it. In this paper, we present a scalable and precise static analysis capable of verifying the absence of unchecked user pointer dereferences. We evaluate an implementation of our analysis on the entire Linux operating system with over 6.2 million lines of code with false alarms reported on only 0.05% of dereference sites.
Towards Secure Mobile Payment Based on SIP
Authors: Ge Zhang, Feng Cheng, Christoph Meinel
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Mobile payment has some unique advantages over more traditional payment methods in, for example, TV shopping and mobile multimedia services. Unfortunately, most existing mobile payment solutions rely heavily on underlying communication infrastructures, which are platform-dependent and have no unified implementation criteria. This limitation is reducing, however, through the rapid spread of the Voice over IP (VoIP) telephony service and its integration with mobile phones. The Session Initiation Protocol (SIP) is currently the standard signalling protocol of VoIP. Mobile payment is expected to be implemented and deployed in an SIP environment in order to keep pace with the evolution of the mobile phone network. The goal of this paper is firstly to propose a new mobile payment scheme based on SIP. The protocol of the proposed framework is thoroughly analysed. Secondly, we evaluate security issues and propose enhanced solutions to make this new framework applicable in practise.
Performance Analysis of an Energy Efficient MAC Protocol for Sensor Networks
Authors: Jun Zhang, Farid Naït-Abdesselam, Brahim Bensaou
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

In this paper we derive a qualitative model for O-MAC, an energy efficient MAC protocol designed for sensor networks. Through this model we study how each parameter, such as packet sending rate, node density and end-to-end hop lengths, affects the performance of O-MAC and the limitation of current O-MAC protocol. Moreover, the model gives us the direction of with which to modify the current O-MAC protocol to improve its performance.
Poster abstract: an evaluation study of routing reliability in opportunistic networks
Authors: Che-Liang Chiou, Ling-Jyh Chen
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

An opportunistic network is a type of challenged network that has attracted increasing attention recently. While a number of schemes have been proposed to facilitate data forwarding in opportunistic networks, an implicit assumption is made in common that each participating peer is collaborative in the network. Consequently, these schemes become vulnerable when there exist uncooperative peers in the network. In this study, we evaluate two widely used routing schemes in opportunistic networks with three types of uncooperative behaviors, namely free riders, black holes, and wormholes. Using simulation as well as realistic network scenarios, we show that the data forwarding performance degrades significantly as the number of free riders increases. Moreover, we show that the epidemic scheme is more resilient against black holes than the PROPHET scheme, while both schemes are robust against wormholes.
A Note on the Fast BRAIN Learning Algorithm
Authors: Shuo Xu, Lan Tao, Xin An, Lin Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, an underlying problem on the fast BRAIN learning algorithm is pointed out, which is avoided by introducing the quantity count (•, •). In addition, its speed advantage can still be enjoyed only at a cost of a little additional space. The improved fast BRAIN learning algorithm is also given, and the experiments on NN269 dataset validate our analysis.
Medium-Contention Based Energy-Efficient Distributed Clustering (MEDIC) for Wireless Sensor Networks
Authors: Liang Zhao, Qilian Liang
Venue: International Journal of Distributed Sensor Networks (2007)

In this paper, we utilize clustering to organize wireless sensors into an energy-efficient hierarchy. We propose a Medium-contention based Energy-efficient DIstributed Clustering (MEDIC) scheme, through which sensors self-organize themselves into energy-efficient clusters by bidding for cluster headship. This scheme is based on a new criterion that can be used by each sensor node to make a distributed decision on whether electing to be a cluster head or a non-head member, which is a fully distributed approach. Although MEDIC uses only local information, it achieves better performance in terms of effective lifetime and its Data/Energy Ratio is 25% higher than native LEACH (Low-Energy Adaptive Clustering Hierarchy), which relies on other routing algorithms to access global information. A complementary exponential data correlation model is also introduced to simulate different data aggregation effect.
The Voynich Manuscript: Evidence of the Hoax Hypothesis
Authors: Andreas Schinner
Venue: Cryptologia (2007)

In this article, I analyze the Voynich manuscript, using random walk mapping and token/syllable repetition statistics. The results significantly tighten the boundaries for possible interpretations; they suggest that the text has been generated by a stochastic process rather than by encoding or encryption of language. In particular, the so-called Chinese theory now appears less convincing.