ppxscal/embedding_network huggingface dataset:
Tracing secure information flow through mode changes
Authors: Colin Fidge, Tim McComb
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Communications devices intended for use in security-critical applications must be rigorously evaluated to ensure they preserve data confidentiality. This process includes tracing the flow of classified information through the device's circuitry. Previous work has shown how this can be done using graph analysis techniques for each of the device's distinct operating modes. However, such analyses overlook potential information flow between modes, via components that store information in one mode and release it in another. Here we show how graph-based analyses can be extended to allow for information flow through sequences of consecutive modes.
A surface acoustic wave tactile display on Phantom
Authors: Masaya Takasaki, Takeo Sakurada, Hiroyuki Kotani, Takeshi Mizuno
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper introduces integration of a force feedback device and a tactile display. The tactile display uses progressive surface acoustic wave and is installed on a stylus of Phantom as the force feedback device. The integrated system works successfully.
Asynchronous circuit design on reconfigurable devices
Authors: R. U. R. Mocho, G. H. Sartori, R. P. Ribas, A. I. Reis
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

This paper presents the design of asynchronous circuits on synchronous FPGAs and CPLDs. Different design styles have been investigated through the implementation of dual-rail full adders and ripple carry adders, as well as self-timed ring based applications. The comparison analysis has been carried out by prototyping the circuits on standard programmable logic devices, and using the development tools provided by vendors. Although the feasibility of asynchronous circuits has been demonstrated in such devices, the experimental results clearly show the inefficiency of such a kind of digital system implementation. This is mainly due to the architecture characteristics of the programmable devices and the logic synthesis realized by the development environments. Remarks and suggestions are derived from this study for a new FPGA architecture devoted to asynchronous design.
Complexity and succinctness of public announcement logic
Authors: Carsten Lutz
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The most basic such extension is public announcement logic (PAL), which is obtained from EL by adding an operator for truthful public announcements. In this paper, we consider the computational complexity of PAL and show that it coincides with that of EL. This holds in the single- and multi-agent case, and also in the presence of common knowledge operators. We also prove that there are properties that can be expressed exponentially more succinct in PAL than in EL. This shows that, despite the known fact that PAL and EL have the same expressive power, there is a benefit in adding the public announcement operator to EL: it exponentially increases the succinctness of formulas without having negative effects on computational complexity.
XML Mapping technology: making connections in an XML-centric world
Authors: M. Roth, M. A. Hernandez, P. Coulthard, L. Yan, L. Popa, H. C.-T. Ho, C. C. Salter
Venue: IBM Systems Journal (2006)

Extensible Markup Language (XML) has grown rapidly over the last decade to become the de facto standard for heterogeneous data exchange. Its popularity is due in large part to the ease with which diverse kinds of information can be represented as a result of the self-describing nature and extensibility of XML itself. The ease and speed with which information can be represented does not extend, however, to exchanging such information between autonomous sources. In the absence of controlling standards, such sources will typically choose differing XML representations for the same concept, and the actual exchange of information between them requires that the representation produced by one source be transformed into a representation understood by the other. Creating this information exchange "glue" is a tedious and error-prone process, whether expressed as Extensible Stylesheet Language Transformation (XSLT), XQuery, JavaTM, Structured Query Language (SQL), or some other format. In this paper, we present an extensible XML mapping architecture that elevates XML mapping technology to a fundamental integration component that promotes code generation, mapping reuse, and mapping as metadata.
Optical pulsars and black arrows: discovery's work in 'hot' and 'cold' science
Authors: Timothy Koschmann, Alan Zemel
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Prior research in science education has explored differences in professional scientific inquiry and classroom science, what has been characterized as hot and cold discovery. We compare here two previously analyzed instances of 'doing discovery.' The first is the discovery of an optical pulsar reported by Cocke, Disney, and Taylor (1969) and analyzed in some detail by Garfinkel, Lynch, and Livingston (1981). The second is an example of practical reasoning performed by two students working in a microworld analyzed by Roschelle (1992). One can observe differences across the two cases in the nature of the things discovered and in the practices of inquiry that led to their discovery, though the interactional of doing discovery is remarkably similar. It is a work of noticing, of directing partners' attention, and of seeking, negotiating, and securing ratification of an understanding. We propose further inquiry into the interactional organization of discovery's work.
A Simple Geometric Approach for Ear Recognition
Authors: Dasari Shailaja, Phalguni Gupta
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

With the increase in need for strong security systems, the biometric systems are becoming more and more popular. These systems are based on human traits which, unlike passwords or pins, cannot be lost, stolen or forgotten. One such trait is ear. With the initial doubts on uniqueness of ear, ear biometrics could not attract much attention. But after it has been said that it is almost impossible to find two ears with all the parts identical, ear biometrics has gained its pace. In this paper a simple scale and rotation invariant two-stage geometric approach which is based on the concept of max-line, the longest line that has both its end-points on the edges of the ear, is proposed.
Model based anticontrol of chaos
Authors: O. Morgul
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

We will consider model based anticontrol of chaotic systems. We consider both continuous and discrete time cases. We first assume that the systems to be controlled are linear and time invariant. Under controllability assumption, we transform these systems into some canonical forms. We assume the existence of chaotic systems which has similar forms. Then by using appropriate inputs, we match the dynamics of the systems to be controlled and the model chaotic systems. 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
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Authors: A. Paul, N. Harel, S. Adhikari, B. Agarwalla, U. Ramachandran, K. Mackenzie
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

Emerging application domains such as interactive vision, animation, and multimedia collaboration need specialized runtime systems that provide support mechanisms to enable plumbing, cross module data transfer, buffer management, synchronization and so on. Using Stampede, a cluster programming system that is designed to meet the requirements of such applications, we quantify the performance of such mechanisms. We have developed a timing infrastructure that helps tease out the time spent by an application in different layers of software, viz., the main algorithmic component, the support mechanisms, and the raw messaging. Several interesting insights have surfaced from this study. First, memory allocation does not take up a significant amount of the execution time despite the interactive and dynamic nature of the application domain. Second, the Stampede runtime adds a minimal overhead over raw messaging for structuring such applications. Third, the results suggest that the thread scheduler on Linux may be more responsive than the one on Solaris. Fourth, the messaging layer spends quite a bit of time in synchronization operations. Perhaps the most interesting result of this study is that general-purpose operating systems such as Linux and Solaris are quite adequate to meet the requirements of emerging dynamic interactive stream-oriented applications.
Representation characterizations of chordal bipartite graphs
Authors: Jing Huang
Venue: Journal of Combinatorial Theory Series B (2006)

A bipartite graph is chordal bipartite if it does not contain an induced cycle of length at least six. We give three representation characterizations of chordal bipartite graphs. More precisely, we show that a bipartite graph is chordal bipartite if and only if the complement is the intersection graph of a family of pairwise compatible claws in a weighted hypercircle. (A hypercircle is a graph which consists of internally vertex disjoint paths between two distinguished vertices, and a claw in a hypercircle is a connected subgraph containing exactly one of the two distinguished vertices.) We also introduce two classes of bipartite graphs, both containing interval bigraphs and interval containment bigraphs. They are compatible subtree intersection bigraphs and compatible subtree containment bigraphs. We show that these two classes are identical to the class of chordal bipartite graphs.
Allpass filter design and applications
Authors: M. Lang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The problem of allpass filter design for phase approximation and equalization in the Chebyshev sense is solved by using a generalized Remez algorithm. Convergence to the unique optimum is guaranteed and is achieved rapidly in the actual implementation. The well-known numerical problems for higher degree filters are analyzed and solved by a simple approach. Possible applications are: design of filters with a desired phase response (e.g., a delay element), the design of phase equalizers, or the design of recursive filters with magnitude prescriptions using parallel allpass filters. For the latter the algorithm can be modified to allow arbitrary tolerance schemes for the magnitude response.
FRoots: A Fault Tolerant and Topology-Flexible Routing Technique
Authors: Ingebjorg Theiss, Olav Lysne
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Existing solutions for fault-tolerant routing in interconnection networks either work for only one given regular topology, or require slow and costly network reconfigurations that do not allow full and continuous network access. In this paper, we present FRroots, a routing method for fault tolerance in topology-flexible network technologies. Our method is based on redundant paths, and can handle single dynamic faults without sending control messages other than those that are needed to inform the source nodes of the failing component. Used in a modus with local rerouting, the source nodes need not be informed and no control messages are necessary for the network to stay connected despite of a single fault. In fault-free networks under nonuniform traffic our routing method performs comparable to, or even better than, topology specific routing algorithms in regular networks like meshes and tori. FRoots does not require any other features in the switches or end nodes than a flexible routing table, and a modest number of virtual channels. For that reason, it can be directly applied to several present day technologies like InfiniBand and Advanced Switching.
Algorithmic aspects of the time synchronization problem in large-scale sensor networks
Authors: An-swol Hu, Sergio D. Servetto
Venue: Mobile Networks and Applications (2005)

We study the time synchronization problem for large-scale wireless sensor networks in the high-density regime. Our interest in this problem arises from a sensor networking application, where a large number of power-constrained radio transmitters coordinate their access to a Gaussian multiple access channel to cooperate in generating a waveform stronger than any individual node would be able to generate. In a companion paper to this one, we study theoretical aspects of a time synchronization mechanism that is optimal in the limit of asymptotically high network densities. In this work we summarize those results, and explore practical implementation issues of that mechanism in the context of networks with large, but finite, numbers of nodes. Through simulations, we find that the synchronization mechanism performs very well for finite (and relatively small) networks, maintaining tight clock synchronization indefinitely.
A Modified Chi2 Algorithm Based on the Significance of Attribute
Authors: Hao Zhang, Duoqian Miao, Ruizhi Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Discretization is one of the important components of the data preprocessing. Discretization can turn numeric attributes into discrete ones. There are many different kinds of discretization methods. This paper describes the Chi2 algorithm which is a simple and general discretization algorithm. In this algorithm, the \chi^2 statistic value is used as an evaluative standard to discretize the numeric attributes. However, the Chi2 algorithm dose not consider the sequence of discretization for each attribute in the second phase. And the inconsistency rate cannot fully reflect the characteristic of dataset. These drawbacks will affect the result of discretization finally. In this paper, some concepts of the rough set are introduced to improve the Chi2 algorithm.
Design and verification of high-speed VLSI physical design
Authors: Dian Zhou, Rui-Ming Li
Venue: Journal of Computer Science and Technology (2005)

With the rapid development of deep submicron (DSM) VLSI circuit designs, many issues such as time closure and power consumption are making the physical designs more and more challenging. In this review paper we provide readers with some recent progress of the VLSI physical designs. The recent developments of floorplanning and placement, interconnect effects, modeling and delay, buffer insertion and wire sizing, circuit order reduction, power grid analysis, parasitic extraction, and clock signal distribution are briefly reviewed.
Data Fusion in Sensor Networks
Authors: Hugh Durrant-Whyte
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

There is a growing excitement about the potential application of large scale sensor networks in diverse applications such as precision agriculture, geophysical and environment monitoring, remote health care, and security. Rapid progress in sensing hardware, communications and low-power computing has resulted in a profusion of commercially available sensor nodes. The big challenge now is to develop effective methods for the automatic fusion and interpretation of the information generated by large-scale sensor networks. The success of future applications is predicated on finding solutions to this data fusion challenge. This talk will focus on probabilistic models and Bayesian data fusion methods appropriate to describing and solving sensor network data fusion problems. Over a number of years, we have used such methods to develop decentralised algorithms for point-target estimation in sensor networks. More recently, other researchers have developed distributed Bayesian algorithms for sensor networks to estimate field properties, such as temperature or humidity over an area. The prospect of developing holistic Bayesian methods for fusion in sensor networks now looks to be a real and exciting possibility. This talk will describe these potential developments. Notions of divergence and information appear naturally in probabilistic fusion algorithms. In turn these provide a handle on two other sensor network data fusion problems; how to model and manage sensor node performance and how to learn patterns in or interpret sensor network information. These ideas will also be developed in this talk. Interspersed amongst these developments we will describe some real sensor network applications, some solved, some currently being addressed, and some that remain as a challenge to network data fusion methods.
A Shadow Buffer Technique for Simulating Snow-Covered Shapes
Authors: Kohe Tokoi
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Displaying a natural phenomenon is effective for improving the reality of computer graphics. A display of snow especially plays an important role in expressing a sense of the season. However, since geometric modeling of the various shapes of snow by hand is very troublesome, it is desirable that snow coverage shapes be automatically generated by simulation. This paper proposes a high-speed modeling technique of snow coverage. This technique takes account of the following three conditions: "snowfall blocked by an object," "irregular motion of falling snow," and "drifting snow." It applies the shadow buffer method to detect an object which blocks snowfall, calculates the influence of irregular motion of snow, and then determines the final snow-covered shape by moving the snow to a stable position.
Cooperative Limiting Localization Schemes for Wireless Sensor Networks
Authors: Wenping Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. A reliable and low cost localization scheme will provide great advantage for the application of wireless sensor network. In this paper, a RSSI-based cooperative limiting localization algorithm is proposed. The wireless node monitors all neighbor nodes' signals, not only from beacons but also from other sister nodes. The signals are iteratively used to refine the node region by applying the theoretic signal propagation constrains. The algorithm is easy deployment and does not need pre-training. Simulation results indicate that localization precision is satisfied even deploying a few of beacons in the environment.
Identifying Color in Motion in Video Sensors
Authors: Gang Wu, Amir Rahimi, Edward Y. Chang, Kingshy Goh, Tomy Tsai, Ankur Jain, Yuan-Fang Wang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Identifying or matching the surface color of a moving object in surveillance video is critical for achieving reliable object-tracking and searching. Traditional color models provide little help, since the surface of an object is usually not flat, the object's motion can alter the surface's orientation, and the lighting conditions can vary when the object moves. To tackle this research problem, we conduct extensive data mining on video clips collected under various lighting conditions and distances from several video-cameras. We observe how each of the eleven culture colors can drift in the color space when an object's surface is in motion. In the color space, we then learn the drift pattern of each culture color for classifying unseen surface colors. Finally, we devise a distance function taking color drift into consideration to perform color identification and matching. Empirical studies show our approach to be very promising: achieving over 95% color-prediction accuracy.
Visualization Research Challenges: A Report Summary
Authors: Robert Moorhead, Chris Johnson, Tamara Munzner, Hanspeter Pfister, Penny Rheingans, Terry S. Yoo
Venue: Computing in Science and Engineering (2006)

In 2004, the NSF and the US National Institutes of Health convened the Visualization Research Challenges Executive Committee to report on visualization's potential as a technology. The reports' authors summarize their findings and present examples of useful visualization technologies.
Low-Power Radio Design for Wireless Smart Sensor Networks
Authors: Wai-Chi Fang, Tsung-Hsien Lin
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A low-power radio has been developed as an embedded communication core for wireless sensor networks system-on-chip designs. Energy constraints and sensor network design considerations due to the limited battery energy supply are described. Lowpower receiver and transmitter architectures for wireless sensor networks are presented. Associated low-power RF circuit design methodologies are also illustrated.
A Novel Image Compression Algorithm Based on Sixteen Most Lately Used Encoded Codewords
Authors: Chin-Chen Chang, Yung-Chen Chang, Jau-Ji Shen
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The side-match vector quantization (SMVQ) technique has been widely used in various image compression and hiding techniques. It effectively decreases the bit rates of image with a great compressed quality. However, the prediction is not precise while the variation between the encoded block and its neighboring upper and left blocks is large. Due to the imprecision will cause derailment problem, to solve this problem, this paper proposed an EDPSMVQ scheme which is based on edge-directed prediction (EDP) to precisely predict the side-match pixels avoiding the derailment problem. The experimental results showed that the scheme achieves a high compression ratio with an acceptable image quality.
Towards a Low Power Virtual Machine forWireless Sensor Network Motes
Authors: Hitoshi Oi, C. J. Bleakley
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Virtual Machines (VMs) have been proposed as an efficient programming model for Wireless Sensor Network (WSN) devices. However, the processing overhead required for VM execution has a significant impact on the power consumption and battery lifetime of these devices. This paper analyses the sources of power consumption in the Mate VM for WSNs. The paper proposes a generalised processor architecture allowing for hardware acceleration of VM execution. The paper proposes a number of hardware accelerators for Mate VMexecution and assesses their effectiveness.