ppxscal/embedding_network huggingface dataset:
Hierarchical Probabilistic Macromodeling for QCA Circuits
Authors: Saket Srivastava, Sanjukta Bhanja
Venue: IEEE Transactions on Computers (2007)

With the goal of building an hierarchical design methodology for quantum-dot cellular automata (QCA) circuits, we put forward a novel, theoretically sound, method for abstracting the behavior of circuit components in QCA circuit, such as majority logic, lines, wire-taps, cross-overs, inverters, and corners, using macromodels. Recognizing that the basic operation of QCA is probabilistic in nature, we propose probabilistic macromodels for standard QCA circuit elements based on conditional probability characterization, defined over the output states given the input states. Any circuit model is constructed by chaining together the individual logic element macromodels, forming a Bayesian network, defining a joint probability distribution over the whole circuit. We demonstrate three uses for these macromodel-based circuits. First, the probabilistic macromodels allow us to model the logical function of QCA circuits at an abstract level—the "circuit” level—above the current practice of layout level in a time and space efficient manner. We show that the circuit level model is orders of magnitude faster and requires less space than layout level models, making the design and testing of large QCA circuits efficient and relegating the costly full quantum-mechanical simulation of the temporal dynamics to a later stage in the design process. Second, the probabilistic macromodels abstract crucial device level characteristics such as polarization and low-energy error state configurations at the circuit level. We demonstrate how this macromodel-based circuit level representation can be used to infer the ground state probabilities, i.e., cell polarizations, a crucial QCA parameter. This allows us to study the thermal behavior of QCA circuits at a higher level of abstraction. Third, we demonstrate the use of these macromodels for error analysis. We show that low-energy state configurations of the macromodel circuit match those of the layout level, thus allowing us to isolate weak points in circuits design at the circuit level itself.
A general domain CMOS companding integrator
Authors: Ana Isabela Araujo Cunha, Ali Niknejad
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

This work presents a new architecture of companding integrator for application in CMOS current-mode filters. Since MOS transistors can operate in the whole inversion region, this circuit can be classified either as log-domain or as square-root domain. Due to the higher bias currents allowed, signal-to-noise(distortion) ratio is improved in comparison to the log-domain counterparts. Circuit complexity is intermediate between log-domain and square-root domain companding integrators.
Fully dynamic all pairs shortest paths with real edge weights
Authors: Camil Demetrescu, Giuseppe F. Italiano
Venue: Journal of Computer and System Sciences (2006)

We present the first fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with real-valued edge weights. Given a dynamic directed graph G such that each edge can assume at most S different real values, we show how to support updates in O(n2.5√Slog3n) amortized time and queries in optimal worst-case time. This algorithm is deterministic: no previous fully dynamic algorithm was known before for this problem. In the special case where edge weights can only be increased, we give a randomized algorithm with one-sided error that supports updates faster in O(S ċ n log3 n) amortized time. We also show how to obtain query/update trade-offs for this problem, by introducing two new families of randomized algorithms. Algorithms in the first family achieve an update bound of Õ(S ċ k ċ n2)1 and a query bound of Õ(n/k), and improve over the previous best known update bounds for k in the range (n/S)1/3≤k<(n/S)1/2. Algorithms in the second family achieve an update bound of Õ(S ċ k ċ n2) and a query bound of Õ(n2/k2), and are competitive with the previous best known update bounds (first family included) for k in the range (n/S)1/6 ≤ k < (n/S)1/3.
Augmented Reality Visualisation of the Built Environment To Support Design Decision Making
Authors: Jules Moloney
Venue: Proceedings of the conference on Information Visualization (2006)

This paper reviews current approaches to design visualization in the built environment and establishes a gap in theory and practice. While it has been acknowledged for some time that the temporal component is an important aspect of visualisation there has been minimal attempts to integrate this approach into design practice. We articulate an approach to visualization which we term 'temporal context'. This approach has two aspects: (1) the evaluation of designs in terms of spatial sequence and multiple viewpoints over time; (2) perceptual change over time due to changing light and atmospheric conditions. Building on our previous research in the use of video game technology to facilitate design, we evaluate the potential of augmented reality (AR) technology to address temporal context. We describe proposals for two innovative screen based AR systems, which incorporate a multi-camera capture mechanism, a video data base and a unique illumination data capture approach.
From the OntoBayes Model to a Service Oriented Decision Support System
Authors: Yi Yang, Jacques Calmet
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The aim of this paper is to propose a service oriented decision support system based on an ontology-driven uncertainty model (OntoBayes). OntoBayes consists of knowledge and decision model parts. The former is the integration of ontologies and Bayesian Networks while the latter can describe different decision models. OntoBayes gives a solution to deal with uncertainty and structure complexity and provides decision models by decision making. In order to construct a decision support system, a service oriented framework and architecture will be introduced finally.
Position paper on operating systems for small systems: the UNIX operating system
Authors: Robert C. Gammill
Venue: ACM SIGSMALL Newsletter (1981)

Sixteen bit microcomputers appear likely to be a major factor in the 1980's, just as eight bit microcomputers have dominated the late 1970's. The operating system that appears most likely to monopolize these sixteen bit microcomputers is UNIX, from Bell Laboratories, or its look-alikes. We shall examine some reasons why this should be so, and evaluate constraints upon a sixteen bit computer which must provide satisfactory hardware support for UNIX. Since many sixteen bit processors are being designed and purchased now, such discussion is essential to assuring that these machines can properly support this popular operating system. At the outset we can assert that if a powerful and flexible microprocessor is used (such as the Zilog Z8000, Motorola 68000, Intel 8086 or DEC LSI 11/23), then the issues focus upon suitable memory management with sufficient address space and protection, and upon powerful DMA disk I/O that allows efficient swapping of process images with little overhead. More detailed discussion of these issues follows. First we shall examine some reasons why UNIX appears a likely contender for champion of the sixteen bit microcomputer operating systems.
A study on different affordances of communication media
Authors: Hokyoung Ryu
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

This paper intends to review different affordances of two media on mobile phones, i.e., voice calls vs. text messages. The two empirical studies of mobile media use showed that Habermas' theory could partially explain this aspect.
Acoustic echo cancellation using a fast QR-RLS algorithm and multirate schemes
Authors: F. Capman, J. Boudy, P. Lockwood
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

High quality acoustic echo cancellation is now required by hands-free systems used in mobile radio and teleconference communications. The demand for fast convergence, good tracking capabilities, and reduced complexity cannot be met by classical adaptive filtering algorithms. In this paper, a new echo canceller using multirate systems and a fast QR-decomposition based RLS algorithm is investigated. Simulation results demonstrate the efficiency of this new combined structure for acoustic echo cancellation, and a fixed-point implementation of the proposed scheme confirms the expected numerical robustness of the fast QR-RLS algorithm.
All Things Considered: Inspecting Statecharts by Model Transformation
Authors: Michael Breen
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Inspections are a cost-effective way of finding errors. However, checklist-based inspections of statecharts can only find a limited class of flaws while scenario-based inspections can never practically traverse the vast numbers of possible combinations of states in complex models made up of multiple communicating finite state machines. A technique for systematic and comprehensive validation of such models is described, based on partitioning the overall behaviour into sets of transitions which show the system-level response in a simple and explicit way. This process is supported by a tool, Statestep, which helps the user to deal methodically and thoroughly with (for example) millions of possibilities. As an example, a subtle error is exposed in a small but non-trivial published statechart design. The technique offers the possibility of detecting any error, no matter how obscure the scenario in which it occurs.
Wolverine Software Corp.
Authors: James O. Henriksen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Wolverine Software will present an introduction to its SLX and GPSS/H simulation languages and its Proof Animation Software. The tutorial will include a number of small, but complete and illustrative examples, exposing attendees to our products' architecture and underlying philosophy.
A Steganalysis Method Based on the Distribution of First Letters of Words
Authors: Xin-guang Sui, Hui Luo, Zhong-liang Zhu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Semantic steganograhpy is a method using texts to hide secret messages, which embeds messages into texts at the level of linguistic understanding. This paper studies the semantic steganography method, and analyzes the statistical features to search the differences between stego-texts and natural texts by modeling the latter. And a steganalysis method is designed based on the distribution of first letters of words according to the differences. The method is easy to achieve, and experiments prove the efficiency and reliability of the method.
Research of the Query Technology in Wide Area Sensor Databases
Authors: Guohua Liu, Shuzhi Zhang, Dongming Zhang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Wide area sensor databases are a hotspot research area internationally at present. The query processing technology in wide area sensor databases is analyzed in detail. Based on it, the method of query equal decomposition is proposed. Firstly, the complexness query is divided into a number of sub-queries equally. Secondly, these sub-queries are processed respectively. Finally, all the results of sub-queries are united and the final query results are sent to the user. Experiment results demonstrate that the method can not only dramatically reduce the users' query response times, but also reduce the messages that transmitting in the sensor network largely and improve the utilization ratio of the network bandwidth.
On the Bernstein-Bézier form of Jacobi polynomials on a simplex
Authors: Shayne Waldron
Venue: Journal of Approximation Theory (2006)

Here, we give a simple proof of a new representation for orthogonal polynomials over triangular domains which overcomes the need to make symmetry destroying choices to obtain an orthogonal basis for polynomials of fixed degree by employing redundancy. A formula valid for simplices with Jacobi weights is given, and we exhibit its symmetries by using the Bernstein-Bézier form. From it, we obtain the matrix representing the orthogonal projection onto the space of orthogonal polynomials of fixed degree with respect to the Bernstein basis. The entries of this projection matrix are given explicitly by a multivariate analogue of the 3F2 hypergeometric function. Along the way we show that a polynomial is a Jacobi polynomial if and only if its Bernstein basis coefficients are a Hahn polynomial. We then discuss the application of these results to surface smoothing problems under linear constraints.
A VLSI Architecture of the Square Root Algorithm for V-BLAST Detection
Authors: Zhan Guo, Peter Nilsson
Venue: Journal of VLSI Signal Processing Systems (2006)

MIMO has been proposed as an extension to 3G and Wireless LANs. As an implementation scheme of MIMO systems, V-BLAST is suitable for the applications with very high data rates. The square root algorithm for V-BLAST detection is attractive to hardware implementations due to its low computational complexity and numerical stability. In this paper, the fixed-point implementation of the square root algorithm is analyzed, and a low complexity VLSI architecture is proposed. The proposed architecture is scalable for various configurations, and implemented for a 4 × 4 QPSK V-BLAST system in a 0.35 $\mu$ m CMOS technology. The chip core covers 9 $mm^2$ and 190 K gates. The detection throughput of the chip depends on the received symbol packet length. When the packet length is larger than or equal to 100 bytes, it can achieve a maximal detection throughput of 128 $\sim$ 160 Mb/s at a maximal clock frequency of 80 MHz. The core power consumption, measured at 2.7 V and room temperature, is about 608 mW for 160 Mb/s data rate at 80 MHz, and 81 mW for 20 Mb/s at 10 MHz. The proposed architecture is shown to meet the requirements for emerging MIMO applications, such as 3G HSDPA and IEEE 802.11n.
MojaveFS: Providing Sequential Consistency in a Distributed Objects System
Authors: Cristian Tapus, David Noblet, Vlad Grama, Jason Hickey
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

This paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability and fault tolerance. We employ a hybrid hash-based and tree-based lookup mechanism for files that, combined with an efficient caching scheme, provides fast access to files in the system. MojaveFS uses a novel data storage strategy where files are split into smaller objects to increase data availability. It also uses a group communication protocol with guarantees for a total order on messages sent within the system, enabling MojaveFS to support the traditional sequential consistency model for concurrent access.
fMRI Evidence for Cortical Modification during Learning of Mandarin Lexical Tone
Authors: Yue Wang, Joan A. Sereno, Allard Jongman, Joy Hirsch
Venue: Journal of Cognitive Neuroscience (2003)

Functional magnetic resonance imaging was employed before and after six native English speakers completed lexical tone training as part of a program to learn Mandarin as a second language. Language-related areas including Broca's area, Wernicke's area, auditory cortex, and supplementary motor regions were active in all subjects before and after training and did not vary in average location. Across all subjects, improvements in performance were associated with an increase in the spatial extent of activation in left superior temporal gyrus (Brodmann's area 22, putative Wernicke's area), the emergence of activity in adjacent Brodmann's area 42, and the emergence of activity in right inferior frontal gyrus (Brodmann's area 44), a homologue of putative Broca's area. These findings demonstrate a form of enrichment plasticity in which the early cortical effects of learning a tone-based second language involve both expansion of preexisting language-related areas and recruitment of additional cortical regions specialized for functions similar to the new language functions.
Active: A Unified Platform for Building Intelligent Web Interaction Assistants
Authors: Didier Guzzoni, Charles Baur, Adam Cheyer
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Computer systems keep growing in complexity, processing power and web connectivity. To leverage this rich environment and to better assist users, a new type of intelligent assistant software is required. Building intelligent assistants is a difficult task that requires expertise in many AI and engineering related fields. We believe that providing a unified tool and a set of associated methodologies to create end-to-end intelligent software will bring many benefits to this area of research. Our solution, the Active framework, introduces the original concept of Active Ontologies to model and implement intelligent applications in a single and coherent software environment. As an example, this paper illustrates how Active has been used to create an intelligent assistant to help mobile users retrieve online information using a multimodal dialog approach.
Numerical algorithms for nonlinear observer-based control
Authors: S. B. Tkachev, S. G. Alexeenkov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

We develop a numerical observer design method for an affine system. We present an example of the state estimation of chemical reactor using the numerical algorithm. If an observer for a nonlinear system is designed then we consider it as a dynamical system with inputs. We show that it is possible to design a stabilizing feedback for an observer instead of the original system and this feedback also stabilizes the original system. Example of an observer-based stabilization of a desired state for a chemical reactor is considered.
A stable queue-based adaptive controller for improving AQM performance
Authors: Xiaolin Chang, Jogesh K. Muppala
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

Active queue management (AQM) mechanisms are designed to provide better support for end-to-end congestion control mechanisms of transmission control protocol (TCP) in TCP/IP networks. This paper introduces a stable queue-based adaptive proportional-integral (Q-SAPI) controller for AQM and presents an implementation. The starting points of our approach are the recently developed fluid-flow modeling and control theoretic interpretation of the TCP/AQM dynamics, and the recently developed fixed-gain proportional-integral (PI) controller for AQM. Q-SAPI aims to improve the transient performance of the fixed-gain PI controller while maintaining its steady-state performance over a wide range of uncertainties in round-trip time (RTT) and the number of active TCP flows. The robustness of Q-SAPI is studied in detail, which provides guidelines for selecting control parameters. Through extensive simulations, we demonstrate the ability of Q-SAPI in controlling queue length in both transient and steady states. Q-SAPI achieves this by adapting the controller gains according to the queue length.
Smart Clients versus Web Forms
Authors: Narayan Veeramani
Venue: Computer (2006)

Microsoft .NET bridges the gap between smart clients and Web forms.
Teaching Grid Computing in North Carolina: Part I
Authors: Barry Wilkinson, Clayton Ferner
Venue: IEEE Distributed Systems Online (2006)

North Carolina students are learning and applying grid computing techniques in the first undergraduate-level grid computing course with numerous geographically distributed participating sites. This course, which was classroom-tested in 2004 and 2005, includes state-of-the-art presentations from internationally known guest speakers. The second part of this article appears in IEEE Distributed Systems Online's July 2006 Education department.
Modeling Delegation through an i*-based Approach
Authors: S. Dehousse, L. Liu, S. Faulkner, M. Kolp, H. Mouratidis
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper introduces generic delegation patterns modeled with the strategic actors of the i* framework. We argue that this modeling approach together with reasoning mechanisms offers a potentially more substantive approach to understand the nature of delegation relationships in a variety of social and technical contexts. Furthermore, we hope that understanding the underlying assumptions and constructs through the use of the delegation modeling framework will not only inform analysts of a better design for delegation policies, but also assist in the understanding of intricate situations in which different delegation models appear.
Coercing shared knowledge in collaborative learning environments
Authors: Paul A. Kirschner, Pieter Jelle Beers, Henny P. A. Boshuizen, Wim Gijselaers
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Multidisciplinary teams are used in industry, government and education for solving complex problems because their use allows for different perspectives to be brought to bear on a problem. This, in turn, is expected to allow for rich problem analyses and solutions. On the other hand, these same differences can cause discussions in multidisciplinary teams to become veritable towers of Babel. This is because team members assume that what they say is properly understood (actually interpreted) by other team members and vice versa. Unfortunately, these differences in domain specific knowledge, background, opinions, et cetera stand in the way of this mutual understanding. Both meaning and position need to be understood and accepted before team members achieve the common ground necessary. The research reported on here shows how a negotiation formalism that was implemented in and ICT-tool coerced team members to negotiate both the meaning of each others contributions to the solution of a complex problem and their positions with respect to each others contributions so as to achieve more common ground. The results show that this coercion had positive effects on common ground without negatively affecting interaction within the teams.