ppxscal/embedding_network huggingface dataset:
CPWCT: Making P2P Home Network Secure Virtual Multimedia Device
Authors: Yu Chen Zhou, Lei Ma, Julian A. Cerruti, Lin Ma
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Content management and protection are important features of emerging home network technologies. In this paper, we present the design of Content Protection for Workplace Client Technology (CPWCT), a novel secure content management system. In CPWCT, devices in a home network are organized in a secure P2P cluster leveraging the xCP Cluster Protocol. Additionally, a P2P content management mechanism is implemented which includes lightweight secure streaming and RDF based capability-aware content indexing technologies. We show how this approach can significantly enhance the ability to dynamically self-reorganize the underlying topology and deploy context sensitive functionality.
An Evaluation ofWeb-Com: Web-Based Education System
Authors: Kazuki Hiraki, Tatsuhiro Yonekura, Susumu Shibusawa
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

We have developed a system called "Web-Com" forWebbased education: the Web browser provides a multi-layer drawable canvas on which users can draw annotations on Web pages. Annotations can be shared with other users in real-time and non-real-time for use of synchronous and asynchronous learning. This paper mainly discusses the asynchronous function including processing of annotation by recorded voice. That is, it can replay the process of annotations including the process of voice recording, which enables asynchronous learning. In our previous work, we conducted a subject experiment to evaluateWeb-Com's synchronous functions. The experimental results showed that the learners could learn fairly interactively with an instructor in a Web-Based class. In this paper, we conducted a subject experiment in an actual class, to evaluate its asynchronous functions and validity of asynchronous learning. The experimental results indicate that Web-Com has advantages for the learners to understand given lectures.
A note on turing machine computability of rule driven systems
Authors: Isaiah Pinchas Kantorovitz
Venue: ACM SIGACT News (2005)

An abstract rule driven system is described. We prove that it is calculated by a restricted Turing Machine.
Xaviera's establishment
Authors: Susan L. Solomon
Venue: ACM SIGSIM Simulation Digest (1975)

Xaviera operates an entertainment facility in Nevada. In order to preserve her share of the market, she wishes to examine the level of service offered to her customers under the following alternative conditions.
Modelling concepts for unifying performance and reliability evaluation
Authors: John F. Meyer
Venue: ACM SIGSIM Simulation Digest (1977)

During the past decade, performance evaluation and reliability evaluation have emerged as important technical disciplines within computer science and engineering. Evaluations of computer performance and computer reliability are each concerned, in part, with the important question of computer system "effectiveness", i.e., the extent to which the user can expect to benefit from the tasks accomplished by a computer in its use environment. With regard to effectiveness issues, modelling of <u>computer performance</u> has stressed the need to represent the probabilistic nature of user demands (workload) and internal state behavior, under the assumption that the computer's structure is fixed, that is, there are no permanent changes in structure due to faults. On the other hand, modelling of <u>computer reliability</u> has stressed changes caused by transient and permanent faults of the computer. It has only been in some recent studies that reliability modelling has begun to account explicitly for the probabilistic nature of the use environment.
Peer reviews improve your writing
Authors: Gary M. Abshire
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1983)

So, you labored to meet all those unrealistic dates caused by an accelerated schedule. You sweated over that tough writing assignment. You may feel that your document is well written, but is it? Will a reader spot flaws that somehow you overlooked? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Game server selection for multiple players
Authors: Steven Gargolinski, Christopher St. Pierre, Mark Claypool
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

The increase in power and connectivity of computers has enabled a growth in network games, with many games having numerous servers to which a player can connect. The game server selected influences the game play, both by impacting the game type and map choice as well as the connection latency and server performance. Often, geographically spread-out friends, family and clan members want to play together on a centrally-located game server with good performance. Unfortunately, current game server selection tools only consider the perspective of a single client, with multiple players left to coordinate their game server selection manually through an out-of-band means, such as telephone or online chat. This manual server coordination process is time-consuming, at best, and error-prone, at worst, often resulting in the selection of a poorly performing game server. This paper presents an architecture that allows geographically dispersed players that want to play together to select the best game server for their shared game play. Implementation details of a working system based on the architecture are presented, including a preliminary evaluation illustrating the system's effectiveness.
Trust Infrastructure for Policy based Messaging In Open Environments
Authors: Gansen Zhao, David Chadwick
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Policy-based messaging (PBM) aims at carrying security policies with messages, which will be enforced at recipient systems to provide security features. PBM promotes a distributed mechanism for secure messaging. The openness of computing environments challenges the PBM model due to the varying trust relations between the different systems and their different behaviour. This paper present a design of a trust infrastructure which is developed based on a Public Key Infrastructure. The trust infrastructure publishes policy enforcement information about the messaging systems, and engenders trust throught consistent and mandatory policy enforcement by the systems. It incorporates policy-based management mechanisms to provide flexible and customised messaging services. Secure messaging is achieved by defining security related policies and confining messaging systems' behaviour to defined security constraints. The process of PBM is also described, including publishing certificates, sending messages, accessing messages, and enforcing policies.
Reconfigurable Networking Hardware: A Classroom Tool
Authors: Martin Casado, Greg Watson, Nick McKeown
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

We present an educational platform for teaching the design, debugging and deployment of real networking equipment in the operational Internet. The emphasis of our work is on teaching and, therefore, on providing an environment that is flexible, robust, low cost and easy to use. The platform is built around 'NetFPGAs' — custom boards containing eight ethernet ports and two FPGAs. NetFPGA boards, when used with VNS (Virtual Network System - another tool we have developed), can be integrated into dynamically configurable network topologies reachable from the Internet. VNS enables a user-space process running on any remote computer to function as a system controller for the NetFPGA boards. NetFPGA and VNS are used at Stanford in a graduate level networking course to teach router implementation in hardware and software.
Level set and PDE methods for computer graphics
Authors: David Breen, Ron Fedkiw, Ken Museth, Stanley Osher, Guillermo Sapiro, Ross Whitaker
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

Level set methods, an important class of partial differential equation (PDE) methods, define dynamic surfaces implicitly as the level set (iso-surface) of a sampled, evolving nD function. The course begins with preparatory material that introduces the concept of using partial differential equations to solve problems in computer graphics, geometric modeling and computer vision. This will include the structure and behavior of several different types of differential equations, e.g. the level set equation and the heat equation, as well as a general approach to developing PDE-based applications. The second stage of the course will describe the numerical methods and algorithms needed to actually implement the mathematics and methods presented in the first stage. The course closes with detailed presentations on several level set/PDE applications, including image/video inpainting, pattern formation, image/volume processing, 3D shape reconstruction, image/volume segmentation, image/shape morphing, geometric modeling, anisotropic diffusion, and natural phenomena simulation.
Social science computing curricula: guidelines for the seventies
Authors: Ronald E. Anderson
Venue: ACM SIGSOC Bulletin (1975)

Several decades ago a new body of techniques sprouted from the field of mathematics. This new technology, which came to be called statistics, grew into an autonomous academic field despite confining pressures. Although the invention of computer techniques historically lagged behind statistics, its entry into the academic world is strikingly similar. Both fields face issues of disciplinary autonomy and both are undergoing similar struggles between applied and theoretical interests. One outcome of these tensions in statistics has been the establishment of separate programs for applied statistics. While we do not dare make rigid predictions for computer science, we would anticipate similar structures, e.g., <u>applied</u> computer science curricula, to emerge.
Simulation of double pendulum motion
Authors: Randolph J. Taylor
Venue: ACM SIGSIM Simulation Digest (1978)

This study illustrates the development and use of a continuous simulation model as a tool for analyzing the motion of two connected pendulums. A mathematical model of the system is presented. The simulation model is developed from this system model and then validated.
Colour Morphological Scale-Spaces from the Positional Colour Sieve
Authors: David Gimenez, Adrian N. Evans
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Morphological sieves are a popular tool for scale-space image analysis. Recent work has considered the development of colour and multichannel sieves, and their application to image segmentation. This paper proposes a new colour sieve based on the geometry of the local convex hull, providing a more flexible approach to extrema definition. Results show the new approach to have a similar segmentation performance to existing colour sieves but with an improved performance in terms of noise reduction.
Distributed Peer-to-Peer Smart Cameras: Algorithms and Architectures
Authors: Wayne Wolf
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Advances in VLSI allow us to make cheap cameras and to supply them with powerful processors. To harness these capabilities, we need to move to peer-to-peer networks of smart cameras. Such systems perform distributed video analysis without a central server. Peer-to-peer systems save bandwidth and energy, are cheaper to install, and are more fault-tolerant. The Embedded Systems Group at Princeton University is developing smart cameras and peer-to-peer networks. After describing the application demands, we will briefly describe architectures for embedded real-time video processing in smart cameras. We will then describe video algorithms and network architectures for peer-to-peer gesture recognition and tracking.
Octopus: A Fault-Tolerant and Ef.cient Ad-hoc Routing Protocol
Authors: Roie Melamed, Idit Keidar, Yoav Barel
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

Mobile ad-hoc networks (MANETs) are failure-prone environments; it is common for mobile wireless nodes to intermittently disconnect from the network, e.g., due to signal blockage. This paper focuses on withstanding such failures in large MANETs: we present Octopus, a fault-tolerant and efficient position-based routing protocol. Fault-tolerance is achieved by employing redundancy, i.e., storing the location of each node at many other nodes, and by keeping frequently refreshed soft state. At the same time, Octopus achieves a low location update overhead by employing a novel aggregation technique, whereby a single packet updates the location of many nodes at many other nodes. Octopus is highly scalable: for a fixed node density, the number of location update packets sent does not grow with the network size. And when the density increases, the overhead drops. Thorough empirical evaluation using the ns2 simulator with up to 675 mobile nodes shows that Octopus achieves excellent fault-tolerance at a modest overhead: when all nodes intermittently disconnect and reconnect, Octopus achieves the same high reliability as when all nodes are constantly up.
Challenges of scholarly publications on the web to the evaluation of science: a comparison of author visibility on the web and in print journals
Authors: Dangzhi Zhao
Venue: Information Processing and Management: an International Journal (2005)

This article reveals different patterns of scholarly communication in the XML research field on the web and in print journals in terms of author visibility, and challenges the common practice of exclusively using the ISI's databases to obtain citation counts as scientific performance indicators. Results from this study demonstrate both the importance and the feasibility of the use of multiple citation data sources in citation analysis studies of scholarly communication, and provide evidence for a developing "two tier" scholarly communication system.
Multimedia information retrieval: what is it, and why isn't anyone using it?
Authors: Alejandro Jaimes, Mike Christel, Sébastien Gilles, Ramesh Sarukkai, Wei-Ying Ma
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

In this paper, the participants of the panel at the 7th ACM SIGMM International Workshop on Multimedia Information Retrieval answer questions about what multimedia is, how MIR is different from other kinds of retrieval, the most important technical challenges in MIR, killer applications, opportunities, and future directions.
RFID Information Grid for Blind Navigation and Wayfinding
Authors: Scooter Willis, Sumi Helal
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

We describe a navigation and location determination system for the blind using an RFID tag grid. Each RFID tag is programmed upon installation with spatial coordinates and information describing the surroundings. This allows for a self-describing, localized information system with no dependency on a centralized database or wireless infrastructure for communications. We describe the system and report on its characteristic performance, limitations, and lessons learned.
Systematic Incremental Development of Agent Systems, using Prometheus
Authors: Mikhail Perepletchikov, Lin Padgham
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

This paper presents a mechanism for dividing an agent oriented application into the three IEEE defined scoping levels of essential, conditional and optional. This mechanism is applied after the initial system specification, and is then used to direct incremental development with three separate releases. The scoping described can be applied at any stage of a project, in order to guide consistent scoping back if such is needed. The three levels of scoping that are used are consistent with the approach used in many companies. The approach to scoping requires that scenarios are prioritised manually on a five point scale. All other aspects are then prioritised automatically, based on this information. The approach used allows a developer to indicate what size partitions - based on number of scenarios - are required for each scoping level. The mechanisms are applied to the Prometheus development methodology and are integrated into the Prometheus Design Tool (PDT).
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic
Authors: Apurva Mudgal, Craig Tovey, Sam Greenberg, Sven Koenig
Venue: SIAM Journal on Discrete Mathematics (2005)

D* is a greedy heuristic planning method that is widely used in robotics, including several Nomad class robots and the Mars rover prototype, to reach a destination in unknown terrain. We obtain nearly sharp lower and upper bounds of $\Omega(n\log n/\log\log n)$ and O(n log n), respectively, on the worst-case total distance traveled by the robot, for the grid graphs on n vertices typically used in robotics applications. For arbitrary graphs we prove an O(n log2 n) upper bound.
Adoption of Mobile Services in Business Case study of Mobile CRM
Authors: Petteri Alahuhta, Heli Helaakoski, Alexander Smirnov
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The development of mobile technologies offers new opportunities for service providers to create more sophisticated and value added mobile services. These new mobile services can provide a way to deliver various kinds of information to the customers or to work as an interaction channel between service provider and customer. This paper shortly summarized mobile technologies that can be used for creating mobile services for mCommerce. The paper also discuss about success factors for mobile services. Furthermore the paper introduces a case study of a mobile Customer Relationship Management (CRM), that attempts to evaluate proposed success factors.
Progressive Matching Based On Segmentation for 3D reconstruction
Authors: Yong Zhuang, Ma Ma, Wei Jun, Liu Liu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Dense matching plays an important role for 3D Scene reconstruction. A simple rectified algorithm is given in this paper. Then the new matching algorithm starts from GCPS as seeds with rectified stereo pairs. First color segment is used to capture disparity discontinuity and the reliable seed point from GCPS which is computed by using fast ZNCC based on asymmetric window can propagate the other correspondence points according to continuity constraint in each region. The algorithm is demonstrated on standard images pairs and shows better applications on 3D reconstruction.
A conservative level set method for two phase flow
Authors: Elin Olsson, Gunilla Kreiss
Venue: Journal of Computational Physics (2005)

A conservative method of level set type for moving interfaces in divergence free velocity fields is presented. The interface is represented implicitly by the 0.5 level set of a function @F being a smeared out Heaviside function, i.e., a function being zero on one side of the interface and one on the other. In a transition layer of finite, constant thickness @F goes smoothly from zero to one. The interface is moved implicitly by the advection of @F, which is split into two steps. First @F is advected using a standard numerical method. Then an intermediate step is performed to make sure that the smooth profile of @F and the thickness of the transition layer is preserved. Both these steps are performed using conservative second order approximations and thus conserving @!@F. In this way good conservation of the area bounded by the 0.5 contour of @F is obtained. Numerical tests shows up to second order accuracy and very good conservation of the area bounded by the interface. The method was also coupled to a Navier-Stokes solver for incompressible two phase flow with surface tension. Results with and without topological changes are presented.
Control Code Obfuscation by Abstract Interpretation
Authors: Mila Dalla Preda, Roberto Giacobazzi
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Control code obfuscation is intended to prevent malicious reverse engineering of software by masking the program control flow. These obfuscating transformations often rely on the existence of opaque predicates, that support the design of transformations that break up the program control flow. We prove that an algorithm for control obfuscation by opaque predicate insertion can be systematically derived as an abstraction of a suitable semantic transformation. In this framework, deobfuscation is interpreted as an attacker which can observe the computational behaviour of programs up to a given precision degree. Both obfuscation and deobfuscation can therefore be interpreted as approximations of program semantics, where approximation is formalized using abstract interpretation theory. In particular we prove that abstract interpretation provides here the adequate setting to measure the potency of an obfuscation algorithm by comparing the degree of abstraction of the most abstract domains which are able to disclose opaque predicates. Keywords: Code Obfuscation, Abstract Interpretation, Program Transformation, Program analysis, Semantics.
Desktop data sonification: Comments on Flowers et al., ICAD 1996
Authors: John H. Flowers, Kimberly D. Turnage, Dion C. Buhman
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Sonification tools have not yet become typical components of data analysis software, despite dramatic advances in sound-production capabilities of personal computers over the past decade. However, we continue to believe that auditory displays have the potential to be highly useful for &ldquo;small scale&rdquo; exploration of data for normally sighted users as well as an alternative format for users with visual impairment. Demonstration of effective examples of auditory data displays and design of flexible software tools for data sonification will be key factors in determining the impact of this method of data representation.
Point-based computer graphics
Authors: Marc Alexa, Markus Gross, Mark Pauly, Hanspeter Pfister, Marc Stamminger, Matthias Zwicker
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course introduces points as a powerful and versatile graphics primitive. Speakers present their latest concepts for the acquisition, representation, modeling, processing, and rendering of point sampled geometry along with applications and research directions. We describe algorithms and discuss current problems and limitations, covering important aspects of point based graphics.
An Efficient Technique for Mining Usage Profiles Using Relational Fuzzy Subtractive Clustering
Authors: Bhushan Shankar Suryavanshi, Nematollaah Shiri, Sudhir P. Mudur
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

We propose an efficient technique for mining web usage profiles based on subtractive clustering that scales to large datasets. Unlike earlier clustering based techniques for the same purpose, our technique does not require user specification of any input parameter to obtain the desired clustering. Instead, we achieve this by searching in the cluster space for the best clustering of the given web usage data. To evaluate clustering quality, we have formulated a validity index for our algorithm. Our implementation of the proposed technique and the experiments with large real life datasets show that it indeed mines the desired usage profiles much faster than existing techniques.