ppxscal/embedding_network huggingface dataset:
Improved Lower Bounds for Data-Gathering Time in Sensor Networks
Authors: Yoram Revah, Michael Segal
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Many-to-one packet routing and scheduling are fundamental operations of sensor networks. It is well known that many sensor network applications rely on data collection from the nodes (the sensors) by a central processing device. There is a wide range of data gathering applications like: target and hazard detection, environmental monitoring, battlefield surveillance, etc. Consequently, efficient data collection solutions are needed to improve the performance of the network. In this paper, we assume a known distribution of sources (each node wants to transmit at most one packet) and one common destination (called base station). We provide via simple mathematical models, a transmission schedule for routing all the messages to the base station, jointly minimizing both the completion time and the average packet delivery time. We present improved lower bounds for linear, two-branch, and star (or multi-branch) network topologies. All our algorithms run in polynomial time.
Distributed processing in the home using a PC with a wireless speech interface
Authors: D. Chowdhury
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The personal computer is evolving from a purely personal device to one that can support multiple applications in different locations simultaneously. This paper describes how the connectivity and processing capability of the PC can be used in a distributed manner in the home to provide a variety of services like speech activated environmental command and control functions, digital video decoding, Internet telephony and entertainment control. As they are architected today, current PCs are challenged when trying to perform intensive signal processing tasks while managing several external connections (e.g. dial-up Internet) and multiple internal connections (e.g. cordless phone interface) at the same time. We describe some of these challenges, and what remains to be done to make the PC more capable in undertaking such a multifunctional challenge.
Maximum likelihood carrier phase synchronization in FPGA-based software defined radios
Authors: M. Rice
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Digital signal processing techniques are applied to maximum likelihood carrier phase synchronization for QPSK and QAM in an all-digital sampled data receiver. To achieve the flexibility required by modern software defined radios (SDRs), this task must either be performed in a DSP processor (reconfigurable software) or in an FPGA (reconfigurable hardware). This paper describes the design process for an FPGA-based design and summarizes the FPGA resources required for QPSK carrier phase synchronization.
Development of a cross-disciplinary mechatronics course
Authors: C. D. Rahn, D. M. Dawson, F. W. Paul
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The paper details the development of a cross disciplinary course in mechatronics between the Mechanical Engineering and Electrical and Computer Engineering Departments at Clemson University. The course objective is to provide electrical and mechanical engineering students with the opportunity to work together on hardware design projects with substantially coupled, mechanical and electrical subsystems. The course structure, topical coverage and laboratory facilities are discussed.
Using lessons from health care to protect the privacy of library users: Guidelines for the de-identification of library data based on HIPAA
Authors: Scott Nicholson, Catherine Arnott Smith
Venue: Journal of the American Society for Information Science and Technology (2007)

Although libraries have employed policies to protect the data about use of their services, these policies are rarely specific or standardized. Since 1996, the U.S. health care system has been grappling with the Health Insurance Portability and Accountability Act (HIPAA; Health Insurance Portability and Accountability Act, 1996), which is designed to provide those handling personal health information with standardized, definitive instructions as to the protection of data. In this work, the authors briefly discuss the present situation of privacy policies about library use data, outline the HIPAA guidelines to understand parallels between the two, and finally propose methods to create a de-identified library data warehouse based on HIPAA for the protection of user privacy. &copy; 2007 Wiley Periodicals, Inc.
Finding Errors in Interoperating Components
Authors: Mark Grechanik
Venue: Proceedings of the Second International Workshop on Incorporating COTS Software into Software Systems: Tools and Techniques (2007)

Two or more components (e.g., objects, modules, or programs) interoperate when they exchange data, such as XML data. Currently, there is no approach that can detect a situation at compile time when one component modifies XML data so that it becomes incompatible for use by other components, delaying discovery of errors to runtime. Our solution, a Verifier for Interoperating cOmponents for finding Logic fAults (Viola) builds abstract programs from the source code of components that exchange XML data. Viola symbolically executes these abstract programs thereby obtaining approximate specifications of the data that would be output by these components. The computed and expected specifications are compared to find errors in XML data exchanges between components. We describe our approach, implementation, and give our error checking algorithm. We used Viola on open source and commercial systems and discovered errors that were not detected during their design and testing.
A Schwarz Waveform Moving Mesh Method
Authors: Ronald D. Haynes, Robert D. Russell
Venue: SIAM Journal on Scientific Computing (2007)

An $r$-refinement (moving mesh) method is considered for solving time dependent partial differential equations (PDEs). The resulting coupled system, consisting of the physical PDE and a moving mesh PDE, is solved by a Schwarz waveform relaxation method. In particular, the computational space-time domain is decomposed into overlapping subdomains and the solution obtained by iteratively solving the system of PDEs on each subdomain. Dirichlet boundary conditions are used to pass solution information between neighboring regions. The efficacy of this approach is demonstrated for some model problems. For problems where the solutions evolve on disparate time scales in different regions of the spatial domain, this approach demonstrates the significant savings in computational time and effort which are possible.
Local Graph Matching for Object Category Recognition
Authors: Ehsan Fazl-Ersi, John S. Zelek
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

A novel model for object category recognition in real-world scenes is proposed. Images in our model are represented by a set of triangular labelled graphs, each containing information on the appearance and geometry of a 3-tuple of distinctive image regions. In the learning stage, our model automatically learns a set of codebooks of model graphs for each object category, where each codebook contains information about which local structures may appear on which parts of the object instances of the target category. A two-stage method for optimal matching is developed, where in the first stage a Bayesian classifier based on ICA factorization is used efficiently to select the matched codebook, and in the second stage a nearest neighbourhood classifier is used to assign the test graph to one of the learned model graphs of the selected codebook. Each matched test graph casts votes for possible identity and poses of an object instance, and then a Hough transformation technique is used in the pose space to identify and localize the object instances. An extensive evaluation on several large datasets validates the robustness of our proposed model in object category recognition and localization in the presence of scale and rotation changes.
Some steps towards implementing E-government
Authors: Mehdi Sagheb-Tehrani
Venue: ACM SIGCAS Computers and Society (2007)

Governments around the world are implementing electronic government. Today governments at all levels reply to millions of citizen queries electronically. Electronic-government (e-government) promises accurate, agile, transactions and delivery of services and information to businesses, citizens and governments agencies. More, e-government plays a part towards the enhancement of democracy. Beyond doubt businesses continue to interact electronically with other businesses and their clients because they have to do so, in order to be efficient. E-government utilizes information technology (IT) to provide all the access to a wide range of public services. This paper puts forward some steps for a better implementation of electronic government. The paper disputes that several key success factors are appropriate for e-government implementation.
Remedying inconsistent sets of premises
Authors: Philippe Besnard
Venue: International Journal of Approximate Reasoning (2007)

The Lang-Marquis framework for reasoning in the presence of inconsistencies, which is based on the so-called forget operation, is generalized here. Despite extending the original proposal, a simpler structure is used. A notion of equivalence is introduced which is proven to provide extensionality for the framework. Some other formal properties are also given which illustrate the versatility of the definitions.
Segmentation of non-rigid bodies in affine motion: a new framework
Authors: S. Narang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this paper a new technique for partitioning a non-rigid body (human body), when it is in affine motion is presented. The technique is based on finding the contour in the "modified difference frame". These contours can then be used in identifying the regions of interest. Results show that the technique eliminates a lot of stationary regions and thus can reduce the amount of computational time required for the processing of the image. It reduces significantly the total bit rate required for transmission. It also provides an algorithm for contour tracing using extended boundary concept and contour compression by contour merging.
Pandora: a flexible network monitoring platform
Authors: Simon Patarin, Mesaac Makpangou
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

This paper presents Pandora, a network monitoring platform that captures packets using purely passive techniques. Pandora addresses current needs for improving Internet middleware and infrastructure by providing both in-depth understanding of network usage and metrics to compare existing protocols. Pandora is flexible and easy to use and deploy. The elementary monitoring tasks are encapsulated as independent entities we call monitoring components. The actual packet analysis is performed by stacking the appropriate components. Pandora also preserves user privacy by allowing control of the "anonymization" policy. Finally, the evaluation we conducted shows that overheads due to Pandora's flexibility do not significantly affect performance. Pandora is fully functional and has already been used to collect Web traffic traces at INRIA Rocquencourt.
Introduction to the Information Technology in Health Care Track
Authors: G. William
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The information technology in health care track at HICSS serves as a forum at which health care, computer science, and information systems professionals can come together to discuss issues related to the application of information technology in health care. While the medical, technical, and managerial perspectives each contributes to particular aspects of the health care problems, the complexity of today's problems requires more than one perspective. As a unique opportunity for cross-disciplinary interaction, we hope this track will give our conference participants and the readers of these proceedings new insights into the problems they face.
Towards Trustworthy Spatial Messaging
Authors: Michel Deriaz, Jean-Marc Seigneur
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Spatial messaging is a term that defines the virtual publication of data in physical places. Generally, anyone in the neighborhood of such a publication point gets the message. Frameworks allowing the users to publish freely spatial messages already exist. However, the experiences realized with volunteers showed that there is only little interest in posting such notes. To our view, the main reason is that there are currently no trust and security mechanisms that inform about the trustworthiness of the messages, thus preventing any serious application. Filling this gap will promote the success of spatial messaging and the growing success of localization and mobile techniques will provide a good support for this concept. This paper describes the spatial messaging services that we are in the process to deploy with our new spatial messaging framework, which includes trust and security mechanisms.
Wireless Sensor Networks for Home Health Care
Authors: Chris R. Baker, Kenneth Armijo, Simon Belka, Merwan Benhabib, Vikas Bhargava, Nathan Burkhart, Artin Der Minassians, Gunes Dervisoglu, Lilia Gutnik, M. Brent Haick, Christine Ho, Mike Koplow, Jennifer Mangold, Stefanie Robinson, Matt Rosa, Miclas Schwartz, Christo Sims, Hanns Stoffregen, Andrew Waterbury, Eli S. Leland, Trevor Pering, Paul K. Wright
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Sophisticated electronics are within reach of average users. Cooperation between wireless sensor networks and existing consumer electronic infrastructures can assist in the areas of health care and patient monitoring. This will improve the quality of life of patients, provide early detection for certain ailments, and improve doctor-patient efficiency. The goal of our work is to focus on health-related applications of wireless sensor networks. In this paper we detail our experiences building several prototypes and discuss the driving force behind home health monitoring and how current (and future) technologies will enable automated home health monitoring.
Using Jade agent framework to prototype an e-Science workflow bus
Authors: Zhiming Zhao, Adam Belloum, Cees De Laat, Pieter Adriaans, Bob Hertzberger
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Most of the existing Scientific Workflow Management Systems (SWMS) are driven by applications from specific domains and are developed in academic projects. It is challenging to introduce an existing SWMS to a new domain; not only the workflow model and description language do not easily fit in new problem domains, but also the unstable development state of existing systems does not provide all functionality required by the new applications and thus gives high risk for the development. Aggregating different workflow systems as one generic environment enables the sharing on both components and processes between experiments, and promotes the knowledge transfer between domains. A workflow bus approach is to integrate different e- Science workflow engines via a software bus. In this paper, we present the basic idea of workflow bus, and discuss how Jade agent framework can be used to prototype the runtime infrastructure of a workflow bus.
A distributed integrated request processing algorithm for QoS assurance in large-scale media-based systems
Authors: Zhonghang Xia, Wei Hao, I-Ling Yen
Venue: Journal of Parallel and Distributed Computing (2007)

In this paper, we discuss a comprehensive mechanism for distributed media request processing to achieve performance improvement and QoS enhancement in media-based application systems. The approach makes use of the proxy infrastructure to handle media requests in a widely distributed manner. The proxy server handles integrated request processing, including distributed admission control, batched patch, and prefix caching. A proxy assistant is designed to realize the proxy site request processing approach. A novel distributed admission control algorithm is proposed for the proxy assistant. It is based on the discrete time queuing system due to the consideration of batching. Also, to fully utilize prefix caching, we allow a request to stay at the proxy to wait for the disk bandwidth of the media server to become available before the cached contents are exhausted. Furthermore, a bandwidth allocation algorithm considering media systems with multiple servers is proposed. We develop a cost-effective approach for a proxy server to reserve bandwidth from the optimal subset of the media servers so that the final media delivery cost is minimal. Experimental studies show that our request processing approach, including all the proposed algorithms, significantly improves the network traffic, media server load, and response time.
Comparative characterization of SPEC CPU2000 and CPU2006 on Itanium® architecture
Authors: Arun Kejariwal, Gerolf F. Hoflehner, Darshan Desai, Daniel M. Lavery, Alexandru Nicolau, Alexander V. Veidenbaum
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

Recently SPEC1 released the next generation of its CPU benchmark, widely used by compiler writers and architects for measuring processor performance. This calls for characterization of the applications in SPEC CPU2006 to guide the design of future microprocessors. In addition, it necessitates assessing the change in the characteristics of the applications from one suite to another. Although similar studies using the retired SPEC CPU benchmark suites have been done in the past, to the best of our knowledge, a thorough characterization of CPU2006 and its comparison with CPU2000 has not been done so far. In this paper, we present the above; specifically, we analyze IPC (instructions per cycle), L1, L2 data cache misses and branch prediction, especially in CPU2006.
A java beans component architecture for cryptographic protocols
Authors: Pekka Nikander, Arto Karila
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

Global networking has brought with it both new opportunities and new security threats on a worldwide scale. Since the Internet is inherently insecure, secure cryptographic protocols and a public key infrastructure are needed. In this paper we introduce a protocol component architecture that is well suited for the implementation of telecommunications protocols in general and cryptographic protocols in particular. Our implementation framework is based on the Java programming language and the Conduits+ protocol framework. It complies with the Beans architecture and security API of JDK 1.1, allowing its users to implement application specific secure protocols with relative ease. Furthermore, these protocols can be safely downloaded through the Internet and run on virtually any workstation equipped with a Java capable browser*. The framework has been implemented and tested in practice with a variety of cryptographic protocols. The framework is relatively independent of the actual cryptosystems used and relies on the Java 1.1 public key security API. Future work will include Java 1.2 support, and utilization of a graphical Beans editor to further ease the work of the protocol composer.
Multi-level Topological Relations Between Spatial Regions Based Upon Topological Invariants
Authors: Min Deng, Tao Cheng, Xiaoyong Chen, Zhilin Li
Venue: Geoinformatica (2007)

Topological relations have played important roles in spatial query, analysis and reasoning. In a two-dimensional space (IR2), most existing topological models can distinguish the eight basic topological relations between two spatial regions. Due to the arbitrariness and complexity of topological relations between spatial regions, it is difficult for these models to describe the order property of transformations among the topological relations, which is important for detailed analysis of spatial relations. In order to overcome the insufficiency in existing models, a multi-level modeling approach is employed to describe all the necessary details of region---region relations based upon topological invariants. In this approach, a set of hierarchically topological invariants is defined based upon the boundary---boundary intersection set (BBIS) of two involved regions. These topological invariants are classified into three levels based upon spatial set concept proposed, which include content, dimension and separation number at the set level, the element type at the element level, and the sequence at the integrated level. Corresponding to these hierarchical invariants, multi-level formal models of topological relations between spatial regions are built. A practical example is provided to illustrate the use of the approach presented in this paper.
A Proposal for an Autonomic Grid Management System
Authors: Ron Desmarais, Hausi Muller
Venue: Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems (2007)

This paper presents a proposal for an autonomic grid management system (AGMS) using IBM's Autonomic Toolkit. The AGMS proposed would be knowledgeable on grid workflow patterns be able to sense and change grid resources and services according to a set of grid policies. The AGMS will perform preventative and corrective maintenance procedures on the grid to ensure its workflows are being completed properly. This should result in improved grid service reliability and job submission resiliency.
Rapid prototyping for mixed architectures
Authors: V. Fresse
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The aim of our work is to achieve a rapid prototyping dedicated to mixed architectures, made up of one multi-DSP part (software) and a FPGA architecture (dedicated hardware). We have determined a complete codesign methodology enabling to implement a complete digital signal or image processing line. The starting description associated with this methodology, is only a functional description, represented by a data flow graph. This global process developed for an automatic implementation enables the user to develop complex applications at a high level onto a complex architecture without any implementation pre-requirements.
Breaking the liardet-smart randomized exponentiation algorithm
Authors: Colin D. Walter
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

In smartcard encryption and signature applications, randomised algorithms are used to increase tamper resistance against attacks beased on side channel leakage. Recently several such algorithms have appeared which are suitable for RSA exponentiation and/or EOC point multiplication. We show that under certain apparently reasonable hypotheses about the countermeasures in place and the attacker's monitoring equipment, repeated use of the same secret key with the algorithm of Liardet and Smart is insecure against any side channel which leaks enough data to differentiate between the adds and doubles in a single scalar multiplication. Thus the scalar needs to be blinded in the standard way, or some other suitable counter-measures employed, if the algorithm is to be used safely in such a context.