ppxscal/embedding_network huggingface dataset:
On Combining Distributed Joint Source-Channel-Network Coding and Turbo Equalization in Multiple Access Relay Networks
Authors: Javier Del Ser, Pedro M. Crespo, Babak H. Khalaj, Jesus Gutierrez-Gutuirrez
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

We consider a multiple access relay channel where two sources S1 and S2 send their data to a common destination node aided by a shared relay node. In this paper we ex- tend previous work on this topic by assuming that the out- put of both information sources are correlated with mem- ory. Furthermore, we consider frequency-selective fading channels, which introduce inter-symbol interference among the transmitted symbols. In this context, we propose an it- erative receiver which comprises Turbo Maximum a Pos- teriori (MAP) equalization and distributed source-channel- network decoding in an iterative fashion. Various relaying strategies such as network coding or time multiplexing are analyzed in detail. In addition, a suboptimal but less com- plex Minimum Mean Square Error (MMSE) linear equalizer is also utilized to account for communication scenarios with constrained complexity. Simulation results show that net- work coding based strategy outperforms, in all cases, the other considered forwarding schemes.
Influence of Threshold Voltage Deviations on 90nm SRAM Core-Cell Behavior
Authors: M. Bastian, V. Gouin, P. Girard, C. Landrault, A. Ney, S. Pravossoudovitch, A. Virazel
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Nanoscaled SRAMs are now becoming more and more prone to device parameter deviations. In this paper, we consider threshold voltage (Vt) deviations in 6T core-cells designed with 90nm technology. Static faults (transition and read destructive) but also dynamic faults (dynamic read destructive) are obtained as resulting faulty behaviors. Moreover, electrical data show that PVT (Process, Voltage, Temperature) corners that maximize the detection of these faults are quite unconventional. Especially, we show that Vt deviations have their main impact at low voltage while hard defects, such as resistiveopen defects in the core-cell, better manifest themselves at high voltage. This study of parameter deviations opens an additional problematic for the test of nanoscaled SRAMS that will be much more severe in deeper technologies (65nm and 45nm).
Simulation-based augmented reality for sensor network development
Authors: Ye Wen, Wei Zhang, Rich Wolski, Navraj Chohan
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Software development for sensor network is made difficult by resource constrained sensor devices, distributed system complexity, communication unreliability, and high labor cost. Simulation, as a useful tool, provides an affordable way to study algorithmic problems with flexibility and controllability. However, in exchange for speed simulation often trades detail that ultimately limits its utility. In this paper, we propose a new development paradigm, simulation-based augmented reality, in which simulation is used to enhance development on physical hardware by seamlessly integrating a running simulated network with a physical deployment in a way that is transparent to each. The advantages of such an augmented network include the ability to study a large sensor network with limited hardware and the convenience of studying a part of the physical network with simulation's debugging, profiling and tracing capabilities. We implement the augmented reality system based on a sensor network simulator with high fidelity and high scalability. Key to the design are "super" sensor nodes which are half virtual and half physical that interconnect simulation and physical network with fine-grained traffic forwarding and accurate time synchronization. Our results detail the overhead associated with integrating live and simulated networks and the timing accuracy between virtual and physical parts of the network. We also discuss various application scenarios for our system.
Oxygen tension modulates Ca^{2+} response to flow stimulus in endothelial cells exposed to hydrostatic pressure
Authors: Toshiro Ohashi, Naoya Sakamoto, Akiyo Iwao, Masaaki Sato
Venue: Technology and Health Care (2003)

The effects of oxygen gas tensions and hydrostatic pressure on intracellular calcium, [Ca^{2+}]_i, response to a flow stimulus in endothelial cells were investigated. Cultured bovine aortic endothelial cells (BAECs) were exposed to a hydrostatic pressure of 100 mmHg under low oxygen gas tensions and were subsequently subjected to a 1 minute mechanical stimulation of fluid shear stress of 20 dynes/cm^{2}. The [Ca^{2+}]_i response in BAECs was measured using a fluorescent indicator, Calcium Green-1. The maximum intensity for low oxygen tension was significantly lower than that for normal oxygen tension, which provides evidence that low oxygen tension regulates cellular functions downward. Moreover, preloading of hydrostatic pressure also reduced the increases in [Ca^{2+}]_i. These results suggest that BAECs in venous system, where oxygen tension and hydrostatic pressure are lower than those in arterial system, may be less sensitive to fluid flow. A separate observation showed that low oxygen tension did not significantly affect the cell morphology. In constrast, BAECs exposed to hydrostatic pressure showed marked elongation with no predominant orientation and the F-actin filament distributions were rearranged, indicating centrally located thick stress fibers. For better understanding of endothelial cell physiology, it is very important to elucidate the effect of oxygen gas tensions together with mechanical environment on endothelial cell responses.
Global Naming in Distributed Systems
Authors: R. Curtis
Venue: IEEE Software (1984)

This Unix-based global naming system, developed for debugging distributed programs, provides concise notation for accessing networks, tasks, modules, data, and files.
Random Sampling SVM Based Soft Query Expansion for Image Retrieval
Authors: Zhen Zhang, Rongrong Ji, Hongxun Yao, Pengfei Xu, Jicheng Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper focuses on the problem that relevance feedback schemes based on support vector machines (RF-SVM) always give a poor performance when the numbers of positive/negative feedback examples are strongly asymmetric. To address this issue, we propose a random sampling SVM based query expansion for relevance feedback learning. Firstly, we adopt a random sampling method to construct multiple Asymmetric Bagging SVM classifiers (hard or binary SVM each) and aggregate them to form a compound SVM classifier by classifier committee voting. Subsequently, the voting results are combined with Query Expansion to sort the final feedback ranking results. The proposed method can effectively restrain the negative effect of the sample asymmetry. Thus it provides a good error-tolerant ability to training data. Experimental results on a subset of COREL image database demonstrate the effectiveness and robustness of the proposed approach.
Automated detection of persistent kernel control-flow attacks
Authors: Nick L. Petroni,  Jr., Michael Hicks
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

This paper presents a new approach to dynamically monitoring operating system kernel integrity, based on a property called state-based control-flow integrity (SBCFI). Violations of SBCFI signal a persistent, unexpected modification of the kernel's control-flow graph. We performed a thorough analysis of 25 Linux rootkits and found that 24 (96%) employ persistent control-flow modifications; an informal study of Windows rootkits yielded similar results. We have implemented SBCFI enforcement as part of the Xen and VMware virtual machine monitors. Our implementation detected all the control-flow modifying rootkits we could install, while imposing unnoticeable overhead for both a typical web server workload and CPU-intensive workloads when operating at 10 second intervals.
Computer Society Bylaws Correction
Venue: Computer (1977)

Two lines were inadvertently left out of Article VI, Section 8, of the bylaws which appeared in the December issue. Section 8 is reprinted in its entirety, with the additional material in italics. 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
Monomode fibres for long haul transmission systems
Authors: J. E. Midwinter
Venue: BT Technology Journal (2007)

Today, monomode fibres seem set to replace graded-index fibre in new high-capacity trunk and undersea system installations. This paper reviews the background to that development and looks forward to the remaining untapped potential that is only now being uncovered.
Real-time expression cloning using appearance models
Authors: Barry-John Theobald, Iain A. Matthews, Jeffrey F. Cohn, Steven M. Boker
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Active Appearance Models (AAMs) are generative parametric models commonly used to track, recognise and synthesise faces in images and video sequences. In this paper we describe a method for transferring dynamic facial gestures between subjects in real-time. The main advantages of our approach are that: 1) the mapping is computed automatically and does not require high-level semantic information describing facial expressions or visual speech gestures. 2) The mapping is simple and intuitive, allowing expressions to be transferred and rendered in real-time. 3) The mapped expression can be constrained to have the appearance of the target producing the expression, rather than the source expression imposed onto the target face. 4) Near-videorealistic talking faces for new subjects can be created without the cost of recording and processing a complete training corpus for each. Our system enables face-to-face interaction with an avatar driven by an AAM of an actual person in real-time and we show examples of arbitrary expressive speech frames cloned across different subjects.
A Framework for Traffic Information Service Grid
Authors: Cuihua Tian, Guiran Chang, Xiaoxing Gao, Changsheng Miao, Wei Jia
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In this paper, Grid technologies are applied to intelligent transportation systems (ITS) to build a traffic Grid in order to eliminate "the information islands and to implement resource sharing and collaboration. A framework for traffic information service Grid (TISG) is proposed, which has a serviceoriented and hierarchical architecture. The implementation tools are presented, including Globus toolkit 4.0 (GT4) and some other tools. The key technologies of the implementation of TISG in different layers are investigated. The ultimate goal of building TISG is to improve the comprehensive utilization rate of physical transportation devices and to make use of traffic information infrastructure sufficiently. The implementation of TISG will not only promote the development and popularization of Grid applications but also offer information as a basic guarantee for the implementation of ITS.
Layereless Communications: From Dream to Reality?
Authors: Juha Saarnio, Rui Aguiar, I. Vijaya Kumar
Venue: Wireless Personal Communications: An International Journal (2008)

The paper summarizes the main results of one of the key panel session of the Workshop, focused on the investigation about the possible translation of the "layerless communications" from a dreaming vision to reality.
Fabric: Synergistic Proximity Neighbour Selection Method
Authors: Piotr Karwaczynski
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

In this paper1, verification of a synergistic, two-staged method for self-optimization of DHT-based overlay networks is presented. The method, named Fabric, minimizes overlay network stretch during a node insertion by using static, readily available information that does not involve costly periodic probing of many nodes. Furthermore, Fabric enables an overlay to optimize its topology at runtime in an adaptive manner.
Querying the internet with PIER
Authors: Ryan Huebsch, Joseph M. Hellerstein, Nick Lanham, Boon Thau Loo, Scott Shenker, Ion Stoica
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The database research community prides itself on scalable technologies. Yet database systems traditionally do not excel on one important scalability dimension: the degree of distribution. This limitation has hampered the impact of database technologies on massively distributed systems like the Internet. In this paper, we present the initial design of PIER, a massively distributed query engine based on overlay networks, which is intended to bring database query processing facilities to new, widely distributed environments. We motivate the need for massively distributed queries, and argue for a relaxation of certain traditional database research goals in the pursuit of scalability and widespread adoption. We present simulation results showing PIER gracefully running relational queries across thousands of machines, and show results from the same software base in actual deployment on a large experimental cluster.
Note: Davenport constant with weights and some related questions, II
Authors: Sukumar Das Adhikari, Yong-Gao Chen
Venue: Journal of Combinatorial Theory Series A (2008)

Let G be a finite abelian group of order n and let A@?Z be non-empty. Generalizing a well-known constant, we define the Davenport constant of G with weight A, denoted by D"A(G), to be the least natural number k such that for any sequence (x"1,...,x"k) with x"i@?G, there exists a non-empty subsequence (x"j"""1,...,x"j"""l) and a"1,...,a"l@?A such that @?"i"="1^la"ix"j"""i=0. Similarly, for any such set A, E"A(G) is defined to be the least t@?N such that for all sequences (x"1,...,x"t) with x"i@?G, there exist indices j"1,...,j"n@?N,1=
The Elements of Single-Chip Microcomputer Architecture
Authors: H. G. Cragon
Venue: Computer (1980)

Unique and sometimes obscure characteristics distinguish single-chip microcomputers from conventional architectures. Current examples show that no one section can be optimized at the expense of another.
Matching Scenarios Patterns by Using Linear Programming
Authors: Guoxing Zhao, Bin Luo, Jixin Ma
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper continues the work presented previously at ICNC-FSKD-05 for representing and matching scenario patterns. A unified scheme is presented to replace the two previous equivalent schemas for formalizing scenario patterns. In the unified scheme, a scenario is denoted in terms of a collection of states with the corresponding temporal constraints, where a state is defined as a set of Boolean-valued time- dependent fluents. The concept of a scenario graph is formally introduced as a directed, partially weighted and labeled simple graph. Based on such a graphical representation, an extended linear programming graph matching algorithm is proposed for recognizing scenario patterns.
Workflow-Based Distributed Visualization
Authors: Gao Shu, Nick J.Avis
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

This paper presents a novel workflow-based approach to the design and implementation of distributed visualization systems in a Grid computing environment. The approach extends the traditional dataflow visualization system into an environment in which visualization Web services can be linked with local visualization tools to form a pipeline using workflow technologies. A specific aim of our design is to provide a distributed visualization toolkit to fulfill a user's request for any particular visualization technique/algorithm, allowing a user to select the most appropriate resources and compose the visualization pipeline.
The Oregon Report Basic Technology
Authors: H. L. Caswell
Venue: Computer (1978)

Computer technology will continue to advance, and the capabilities we need will exist in VLSI. But capitalizing on them will require innovative design tools and architectures.
On efficient spatial matching
Authors: Raymond Chi-Wing Wong, Yufei Tao, Ada Wai-Chee Fu, Xiaokui Xiao
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This paper proposes and solves a new problem called spatial matching (SPM). Let P and O be two sets of objects in an arbitrary metric space, where object distances are defined according to a norm satisfying the triangle inequality. Each object in O represents a customer, and each object in P indicates a service provider, which has a capacity corresponding to the maximum number of customers that can be supported by the provider. SPM assigns each customer to her/his nearest provider, among all the providers whose capacities have not been exhausted in serving other closer customers. We elaborate the applications where SPM is useful, and develop algorithms that settle this problem with a linear number O(|P| + |O|) of nearest neighbor queries. We verify our theoretical findings with extensive experiments, and show that the proposed solutions outperform alternative methods by a factor of orders of magnitude.
Design of a Random-Pulse Computer for Classifying Binary Patterns
Authors: L. R. Goke
Venue: IEEE Transactions on Computers (1972)

This paper proposes a novel design for a parallel nonadaptive binary pattern classifier. The structure employs random-pulse (stochastic) computing elements to economically realize multimodal nonlinear discriminant functions similar in form to those used in potential function classifiers. The technique achieves efficient hardware utilization by employing a READ-ONLY memory (ROM) without addressing circuits to store modes and simultaneously execute parallel stochastic multiplications required in discriminant function computations.
Real-time auditory-visual distance rendering for a virtual reaching task
Authors: Luca Mion, Federico Avanzini, Bruno Mantel, Benoit Bardy, Thomas A. Stoffregen
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

This paper reports on a study on the perception and rendering of distance in multimodal virtual environments. A model for binaural sound synthesis is discussed, and its integration in a real-time system with motion tracking and visual rendering is presented. Results from a validation experiment show that the model effectively simulates relevant auditory cues for distance perception in dynamic conditions. The model is then used in a subsequent experiment on the perception of egocentric distance. The design and preliminary result from this experiment are discussed.
Query processing in spatial network databases
Authors: Dimitris Papadias, Jun Zhang, Nikos Mamoulis, Yufei Tao
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Despite the importance of spatial networks in real-life applications, most of the spatial database literature focuses on Euclidean spaces. In this paper we propose an architecture that integrates network and Euclidean information, capturing pragmatic constraints. Based on this architecture, we develop a Euclidean restriction and a network expansion framework that take advantage of location and connectivity to efficiently prune the search space. These frameworks are successfully applied to the most popular spatial queries, namely nearest neighbors, range search, closest pairs and e-distance joins, in the context of spatial network databases.
Dynamic frame length channel assignment in wireless multihop ad hoc networks
Authors: Chien-Min Wu
Venue: Computer Communications (2007)

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions but also enhance the channel spatial reuse to maximize the system throughput. From the channel assignment schemes in time division multiple access (TDMA) slot assignment protocols developed in previous studies, we have found that these protocols do not have a convenient frame length shrink scheme after the expansion of the frame length. As the network size grows, the frame length expands quickly, particularly when we set the frame length as a power of two. A very long frame may result in poor channel utilization when it contains many unused slots. In this paper, we propose a dynamic frame length expansion and recovery method called dynamic frame length channel assignment (DFLCA). This strategy is designed to make better use of the available channels by taking advantage of the spatial reuse concept. In DFLCA, the increase in the spatial reuse is achieved by adding certain amount of control overhead. We show that the bandwidth saved due to the channel spatial reuse is larger than the additional bandwidth spent on the control overhead.
Towards Paradigm-Independent Software Assessment
Authors: Sergio Bryton, Fernando Brito e. Abreu
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

The milestones of the history of software development are paradigm shifts. Each paradigm brought its own features and new ways of composing them to assemble software systems. Understanding the impact of paradigm shifts encompasses making comparisons among systems built with different paradigms. Performing this kind of assessments is a very difficult exercise since the characterization of software assets is generally performed using paradigm-specific quantifications. In this paper we propose a metamodel for describing software products (either source code or design models) that is paradigm-independent. This metamodel, combined with a formal quantification approach, can help performing paradigm-independent software systems assessment. We illustrate the use of the proposed metamodel on a case study comparing functionally-equivalent systems produced with OOP and AOP.
Geometric Modeling of Mechanical Parts and Processes
Authors: H. B. Voelcker
Venue: Computer (1977)

Geometry plays a crucial role in nearly all design and production activities in the discrete goods industries. Curiously, these industries' primary means for specifying geometry two-dimensional graphics has not changed significantly for more than a century. Dramatic changes are likely to occur in the next decade, however, because the deficiencies of current methods are retarding the progress of automation and are stimulating the development of new, computationally oriented schemes for handling mechanical geometry.
Solid Modeling: A Historical Summary and Contemporary Assessment
Authors: A. A. G. Requicha
Venue: IEEE Computer Graphics and Applications (1982)

A new generation of industrial geometry systems is emerging based on the technology of the 1970's. The generations of the eighties and nineties will require more research.
Sensitivity analysis for oscillators
Authors: Igor Vytyaz, David C. Lee, Pavan Kumar Hanumolu, Un-Ku Moon, Kartikeya Mayaram
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper presents an analysis for calculating sensitivities of an oscillator's periodic steady-state and perturbation projection vector to design, process, or environmental parameters. A general continuous-time formulation is described. Applications of the oscillator sensitivity analysis in design optimization and macromodeling are demonstrated through examples.