ppxscal/embedding_network huggingface dataset:
Performance Study of Routing Schemes in Delay Tolerant Networks
Authors: Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, Cheng-Fu Chou
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In conventional networks, such as the Internet, it is assumed that there exists a fully connected path between any pair of nodes at any time. In Delay Tolerant Networks (DTN), however, the connected path may be broken, and nodes may be partitioned into two disconnected subsets because of the movement or failure of some nodes. Thus, the data transmission requirements can not be satisfied by traditional routing schemes. How to efficiently route data in DTNs has therefore become a critical and challenging issue. To address the problem, we propose a contact-duration-based probabilistic routing scheme (PR_CD) based on the probabilistic routing scheme PRoPHET[16] (PR). Each node in the PR_CD scheme predicts the current network condition by using contact information, and then chooses appropriate relay nodes to improve the delivery rate as well as reduce the transmission latency and transmission overhead. To evaluate the efficacy of the proposed scheme, we use simulations to conduct a comprehensive study of different DTN routing mechanisms. We believe such a study is important because the ability to characterize the behavior and performance of routing schemes plays a key role in the understanding and design of DTNs.
Privacy and communication complexity
Authors: E. Kushilevitz
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Each of two parties P/sub 1/ and P/sub 2/ holds an n-bit input, x and y, respectively. They wish to compute privately the value of f(x,y). Two questions are considered: (1) Which functions can be privately computed? (2) What is the communication complexity of protocols that privately compute a function f (in the case in which such protocols exist)? A complete combinatorial characterization of privately computable functions is given. This characterization is used to derive tight bounds on the rounds complexity of any privately computable function and to design optimal private protocols that compute these functions. It is shown that for every 1
An XML Firewall on Embedded Network Processor
Authors: Wei Wang, Jun Li
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

XML-based services with flexible and intelligent structures for data expression and exchange are quickly gaining popularity. Enterprises are deploying XML-based services as a central component of the application integration. As the application data are crucial to the enterprises, the XML messages must be secured to ensure the reliability of these services. This paper presents the design of an embedded XML firewall with XML identification, XML validation, XML encryption and decryption, XML signature and signature verification, which is implemented on Intel IXP425, an embedded network processor for small and medium enterprise solutions. Suitable for enterprises to deploy XML security for their IT infrastructure, the XML firewall provides confidentiality, integrity and authenticity for XML-based services. Improvements are introduced and evaluated, including schema preprocessing and hardware acceleration for security processing. Ideas about future work of XML firewall based on this platform are also proposed.
A Novel Algorithm for Dynamic Mining of Association Rules
Authors: Wu Jian, Li Xing Ming
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

complex, once there occurs a failure, there will result in multi-alarm-events which require relevant transactions. This paper describes the alarm correlation in communication networks based on data mining. The association rules from self-adaptation for dynamic network resource and service that build new rule by fully utilizing and maintaining rules formed before while transactions grow/delete or minimum support changes which enables the framework is easily updated and new discovery methods be readily incorporated within it. Both theoretical analysis and computer simulations illustrate outstanding performance of the proposed models, which can be further optimized by experiments for specific environment.
Micro power management of active 802.11 interfaces
Authors: Jiayang Liu, Lin Zhong
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Wireless interfaces are major power consumers on mobile systems. Considerable research has improved the energy efficiency of elongated idle periods or created more elongated idle periods in wireless interfaces, often requiring cooperation from applications or the network infrastructure. With increasing wireless mobile data, it has become critical to improve the energy efficiency of active wireless interfaces. In this work, we present micro power management (μPM), a solution inspired by the mismatch between the high performance of state-of-the-art 802.11 interfaces and the modest data rate requirements by many popular network applications. μPM enables an 802.11 interface to enter unreachable power-saving modes even between MAC frames, without noticeable impact on the traffic flow. To control data loss, μPM leverages the retransmission mechanism in 802.11 and controls frame delay to adapt to demanded network throughput with minimal cooperation from the access point. Based on a theoretical framework, we employ simulation to systematically investigate an effective and efficient implementation of μPM. We have built a prototype μPM on an open-access wireless hardware platform. Measurements show that more than 30% power reduction for the wireless transceiver can be achieved with μPM for various applications without perceptible quality degradation.
On the chromatic number of an oriented matroid
Authors: Winfried Hochstättler, Robert Nickel
Venue: Journal of Combinatorial Theory Series B (2008)

We prove that the chromatic number of an oriented matroid O of rank r>=3 is at most r+1 with equality if and only if O is the oriented matroid of an orientation of K"r"+"1, the complete graph on r+1 vertices.
Classification of functional data: A segmentation approach
Authors: Bin Li, Qingzhao Yu
Venue: Computational Statistics Data Analysis (2008)

We suggest a classification and feature extraction method on functional data where the predictor variables are curves. The method, called functional segment discriminant analysis (FSDA), combines the classical linear discriminant analysis and support vector machine. FSDA is particularly useful for irregular functional data, characterized by spatial heterogeneity and local patterns like spikes. FSDA not only reduces the computation and storage burden by using a fraction of the spectrum, but also identifies important predictors and extracts features. FSDA is highly flexible, easy to incorporate information from other data sources and/or prior knowledge from the investigators. We apply FSDA to two public domain data sets and discuss the understanding developed from the study.
A smoothing-type algorithm for solving system of inequalities
Authors: Zheng-Hai Huang, Ying Zhang, Wei Wu
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we consider system of inequalities. By constructing a new smoothing function, the problem is approximated via a family of parameterized smooth equations. A Newton-type algorithm is applied to solve iteratively the smooth equations so that a solution of the problem concerned is found. We show that the algorithm is globally and locally quadratically convergent under suitable assumptions. Preliminary numerical results are reported.
Aesthetic journeys
Authors: Johanna Brewer, Scott Mainwaring, Paul Dourish
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Researchers and designers are increasingly creating technologies intended to support urban mobility. However, the question of what mobility is remains largely under-examined. In this paper we will use the notion of aesthetic journeys to reconsider the relationship between urban spaces, people and technologies. Fieldwork on the Orange County bus system and in the London Underground leads to a discussion of how we might begin to design for multiple mobilities.
Declarative approach for model composition
Authors: Julia Rubin, Marsha Chechik, Steve M. Easterbrook
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

Model-based development involves construction, integration, and maintenance of complex models. One of the key problems in model-based development is composing a set of distributed models into a single seamless model. In this paper we propose a declarative approach for model composition, which augments and strengthens existing structural and heuristic approaches. In our approach, the desired model compositions are constrained by a set of declarative properties, which drive the merge process. Only model compositions that satisfy the specified properties and, possibly, additional model composition restrictions are automatically generated and presented to the model analyst for a review and further modifications. Since our framework is iterative, properties and restrictions can be reviewed and refined as well. We illustrate our ideas by defining a proof-of-concept prototype implementation of the declarative model composition framework using the Alloy Analyzer.
Practical Support for Lean Six Sigma Software Process Definition Using IEEE Software Engineering Standards, Pap/Cdr edition
Authors: Susan K. Land, Douglas B. Smith, John W. Walz
Venue:  (2008)

Discusses Six Sigma and Lean Manufacturing - What is Lean Six Sigma? Includes document templates that can be tailored and used in a wide variety of software development projects Covers the integration of these templates for their entire product development life cycle Provides detailed documentation guidance: detailed organizational policy descriptions; artifacts required in support of assessment; organizational delineation of process documentation
Fine-grained parallelization of the Car-Parrinello ab initio molecular dynamics method on the IBM Blue Gene/L supercomputer
Authors: E. Bohm, A. Bhatele, L. V. Kalé, M. E. Tuckerman, S. Kumar, J. A. Gunnels, G. J. Martyna
Venue: IBM Journal of Research and Development (2008)

Important scientific problems can be treated via ab initio-based molecular modeling approaches, wherein atomic forces are derived from an energy Junction that explicitly considers the electrons. The Car-Parrinello ab initio molecular dynamics (CPAIMD) method is widely used to study small systems containing on the order of 10 to 103 atoms. However, the impact of CPAIMD has been limited until recently because of difficulties inherent to scaling the technique beyond processor numbers about equal to the number of electronic states. CPAIMD computations involve a large number of interdependent phases with high interprocessor communication overhead. These phases require the evaluation of various transforms and non-square matrix multiplications that require large interprocessor data movement when efficiently parallelized. Using the Charm++ parallel programming language and runtime system, the phases are discretized into a large number of virtual processors, which are, in turn, mapped flexibly onto physical processors, thereby allowing interleaving of work. Algorithmic and IBM Blue Gene/L™ system-specific optimizations are employed to scale the CPAIMD method to at least 30 times the number of electronic states in small systems consisting of 24 to 768 atoms (32 to 1,024 electronic states) in order to demonstrate fine-grained parallelism. The largest systems studied scaled well across the entire machine (20,480 nodes).
Unified media UI structure and design for mobile devices
Authors: Timo-Pekka Viljamaa, Tuomas Vaittinen
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)

In this paper we describe our research on unified media experience for the end-users. The research focused on unified mobile media player supporting different media types with one unified UI structure and design for all media types. The created UI structure and design was based on our earlier study of finding an optimal information architecture model for mobile multimedia devices. Unified mobile media player demo was then implemented and validated in Finland and Hong Kong, and after analyzing the validation findings the UI structure and design were updated. Our research findings show that there are similarities between different media types, and it is possible to create unified UI structure and design, but also some media type specific restrictions exists.
A root cause analysis toolkit for TCP
Authors: Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. Biersack, Denis Collange
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

TCP is the most widely used protocol for data transfer over the Internet and for most applications the performance metric of interest is throughput. Identifying the reasons for the throughput limitation of an observed connection is a complex task. We present a set of techniques, called the TCP root cause analysis toolkit, that allow users to determine from a passively captured packet trace the primary cause for the throughput limitation. We present the details of the toolkit and its validation and apply the toolkit to carry out a case study of ADSL traffic.
Automatic plate detection using genetic algorithm
Authors: V. P. de Araújo, R. D. Maia, M. F. S. V. D'Angelo, G. N. R. D'Angelo
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

This paper use genetic algorithm for solve the problem of automatic plate detection. In the first moment, is used image filtering, edge detection, polygons analysis and plate detection. In the second moment, is used the genetic algorithm for the recognition of characters. The methodology is detailed in text corp.
Content Development for CPR over Handheld Devices
Authors: Chiu-Pin Lin, Meei-Hwey Lee, Kuo-Pin Liu
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Handheld devices are portable lightweight devices. Its advantages are changing location, more immediate interaction, and small enough to fit in a pocket. Learning by doing simulation content development for Cardiopulmonary Resuscitation, (CPR) over handheld devices can take us to a place that we are unable to experience directly. They may provide an opportunity to experiences life-like situations and react to unexpected and challenging problems. The richer knowledge and experience is more effective while adopting CPR.
End-to-end available bandwidth as a random autocorrelated QoS-relevant time-series
Authors: Alexander Chobanyan, Matt Mutka, Vidiadhar Mandrekar, Ning Xi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Estimating the reliability of an end-to-end network path is critically important for applications that support remote real-time task execution. Available bandwidth defined as a minimum spare capacity of links constituting a network path is an important QoS characteristic of the path. In this work we demonstrate a new approach to modeling available bandwidth behavior from a time-series analysis prospective. In particular, we introduce a notion of crossing probability - the probability that the available bandwidth drops below the QoS critical threshold for the period of time required for the real-time task execution. We estimate the ''crossing probability'' by an application of the ARCH^2 (AutoRegressive Conditional Heteroscedasticity) model to the available bandwidth behavior. We characterize the network path by model coefficients @b"0 and @b"1, which may be evaluated and updated dynamically. We use these coefficients to quickly output the ''crossing probability'' for arbitrary values of the threshold and length of the real-time task. The model was evaluated on real bandwidth measurements across multiple network paths.
GPU-based point radiation for interactive volume sculpting and segmentation
Authors: Hungi-Li Jason Chen, Faramarz F. Samavati, Mario Costa Sousa
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Internal structures, features, and properties in volumetric datasets are mostly obscured and hidden. In order to reveal and explore them, appropriate tools are required to remove and carve the occluding materials and isolate and extract different regions of interest. We introduce a framework of interactive tools for real-time volume sculpting and segmentation. We utilize a GPU-based point radiation technique as a fundamental building block to create a collection of high-quality volume manipulation tools for direct drilling, lasering, peeling, and cutting/pasting. In addition, we enable interactive parallel region growing segmentation that allows multiple seed planting by direct sketching on different volumetric regions with segmentation results dynamically modified during the process. We use the same point radiation technique to create high-quality real-time feedback of the segmented regions during the seed growing process. We present results obtained from raw and segmented medical volume datasets.
Optimizing imprecise fixed-point arithmetic circuits specified by Taylor Series through arithmetic transform
Authors: Yu Pang, Katarzyna Radecka
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We consider synthesis of arithmetic DSP circuits with finite precision fixed-point operations. The aim is to choose the lowest cost implementation that matches a real-valued specification within the allowed imprecision. Starting from Taylor Series or real-valued polynomials, we demonstrate first a method to obtain satisfying implementations that uses intermediate Arithmetic Transform polynomials as an analytical apparatus suitable to precision analysis for both the quantization (bit-width) and approximation sources of imprecision. We then derive the precision optimization algorithm that explores multiple precision parameters in a branch-and-bound search.
Image texture classification using gray level co-occurrence matrix and neural network
Authors: Muhammad Suzuri Hitam, Mohd Yahyal Haq Muslan, Mustafa Mat Deris, Md. Yazid Mohd Saman
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents the use of Grey Level Co-occurrence Matrix (GLCM) method together with multilayer fully-connected feed-forward perceptron (MLP) for image texture classification. GLCM method was employed as a features extractor technique and MLP was used as a image texture classifier. A range of Brodatz textures were employed to evaluate the proposed system. Results from various experimental investigations including general image textures, noise added images textures and rotated image textures showed that the MLP with GLCM works well as a texture classifier.
Microsoft Excel 2007 Charts & Tables Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for Charts (graphs) and Table features of Microsoft Office Excel 2007. This card is suitable as an accompaniment for Intermediate level Excel training. The following topics are covered: Excel Charts: Inserting a Chart, Resizing and Moving Chart Objects, Changing Chart Type, Charting Non-Adjacent Data, Adjusting Scale, Two-Scaled Charts, Adding, Removing and Formatting: Legend, Gridlines, Data Series, Explanatory Text, Callouts, Arrows and Circles, Data Labels, Adding a Projection or Trendline to a Data Series, Setting the Default Chart, Creating the Default Chart with one Keystroke, Creating Chart Templates, Applying Custom Chart Types, Changing Chart Location (Chart Object vs. Chart Sheet). Excel Tables: Creating an Excel Table, Excel Table vs. Normal Range, Changing the Table Area, Adding New Rows or Columns to the Table, Toggle Total Row, Table Selection Shortcuts, Sorting a List, Multi-Level Sorting, Custom Sort Orders, Subtotals, Filtering a Table: AutoFilter & Advanced Filters, Creating Pivot Tables, Rearranging PivotTables, Adding/Removing PivotTable Fields, Show/Hide the PivotTable Field List, Refreshing a PivotTable, Creating a PivotChart, Changing the Summary Function, Filtering in a PivotTable, Sorting in a PivotTable, Grouping by Dates or Time. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Cooperation models for mobile television in Europe
Authors: Olivier Braet, Pieter Ballon
Venue: Telematics and Informatics (2008)

This article examines the emerging cooperation models between the various stakeholders piloting mobile broadcasting in Europe. It adopts a generic business model design framework to systematically compare recent trials of mobile broadcasting technologies. The article illustrates the cross-impact of cooperation agreements between the various stakeholders on their technological, service-related and financial design choices, and provides insights on a number of business models issues in the upcoming commercialization phase of mobile digital TV broadcasting in Europe.
ComeBack!: a refactoring-based tool for binary-compatible framework upgrade
Authors: Ilie Savga, Michael Rudolf, Sebastian Goetz
Venue: Companion of the 30th international conference on Software engineering (2008)

Maintenance of a software framework often requires restructuring its API (refactoring). Upon framework upgrade structural API changes may invalidate existing plugins - modules that used one of its previous versions. To preserve plugins, we use refactoring trace to automatically create an adaptation layer that translates between plugins and the framework. For each encountered refactoring we formally define a comeback - a refactoring to construct adapters. Given an ordered set of refactorings occured between two framework versions our tool ComeBack! executes the corresponding comebacks and yields the adaptation layer.
Design and Implementation for EPC System Method to Authentication and Cryptography
Authors: Dae-Jung Kim, Jeong-Jai Kim, Seung-Min Lee, Moon-Seog Jun
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This study is, thus, to suggest the way of sending safely messages for the web-based service constituting EPCglobal Network, of verifying whether the received messages are effective, of encoding the messages for safer sending and of certifying between systems, and then to implement the way.
Selecting a Networked Virtual Environment Platform and the Design of a Collaborative e-Learning Environment
Authors: Konstantinidis Andreas, Thrasyvoulos Tsiatsos
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Our goal was to create a 3D virtual environment which could be used to carry out online lectures and which would offer the most popular features of current CVEs. This paper initially discusses the potential of 3D networked virtual environments for supporting collaborative learning and presents the assets of such systems. Furthermore, the paper reviews the features of five such software applications, through the comparison of the tools and services they offer. These include tools for supporting communication, sharing applications, organizing and coordinating the teaching process, and for interacting with the virtual environment through an avatar. Based on that comparison, we justify our choice of platform and discuss design and implementation issues. Finally, future work regarding the assessment of the virtual environment is discussed.