ppxscal/embedding_network huggingface dataset:
Distortion-Driven Video Streaming over Multihop Wireless Networks with Path Diversity
Authors: Xiaolin Tong, Yiannis Andreopoulos, Mihaela van der Schaar
Venue: IEEE Transactions on Mobile Computing (2007)

Multi-hop networks provide a flexible infrastructure that is based on a mixture of existing access points and stations interconnected via wireless links. These networks present some unique challenges for video streaming applications due to the inherent infrastructure unreliability. In this paper, we address the problem of robust video streaming in multi-hop networks by relying on delay-constrained and distortion-aware scheduling, path diversity and retransmission of important video packets over multiple links to maximize the received video quality at the destination node. To provide an analytical study of this streaming problem, we focus on an elementary multi-hop network topology that enables path-diversity, which we term "elementary cell". Our analysis is considering several cross-layer parameters at the physical and medium access control (MAC) layers, as well as application-layer parameters such as the expected distortion-reduction of each video packet and the packet scheduling via an overlay network infrastructure. In addition, we study the optimal deployment of path diversity in order to cope with link failures. The analysis is validated in each case by simulation results with the elementary cell topology, as well as with a larger multi-hop network topology. Based on the derived results, we are able to establish the benefits of using path-diversity in video streaming over multi-hop networks, as well as identify the cases where path diversity does not lead to performance improvements.
Using Tag-Match Comparators for Detecting Soft Errors
Authors: Gulay Yalcin, Oguz Ergin
Venue: IEEE Computer Architecture Letters (2007)

Soft errors caused by high energy particle strikes are becoming an increasingly important problem in microprocessor design. With increasing transistor density and die sizes, soft errors are expected to be a larger problem in the near future. Recovering from these unexpected faults may be possible by reexecuting some part of the program only if the error can be detected. Therefore it is important to come up with new techniques to detect soft errors and increase the number of errors that are detected. Modern microprocessors employ out-of-order execution and dynamic scheduling logic. Comparator circuits, which are used to keep track of data dependencies, are usually idle. In this paper, we propose various schemes to exploit on-chip comparators to detect transient faults. Our results show that around 50% of the errors on the wakeup logic can be detected with minimal hardware overhead by using the proposed techniques.
An Algebra for Logic Systems Switching Circuits Application
Authors: P. L. Tison
Venue: IEEE Transactions on Computers (1971)

The goal of this note is to present a new logical variable, the "degree of freedom," which is more refined than the usual Boolean variable, and also the very general algebra which may be formulated using the concept of "degree of freedom."
Up and coming SIGWEB supported conferences
Authors: Darren Lunn
Venue: ACM SIGWEB Newsletter (2007)

SIGWEB supports several specialized conferences, short courses, and workshops, as well as the Annual Hypertext Conference. SIGWEB sponsored conferences focus on timely topics in applied and computational hypertext and Web disciplines and provide a place for members and the entire applied Hypermedia and Web community to exchange ideas and to meet with and expand their network of colleagues. In this article, we provide a brief overview of SIGWEB sponsored conferences for delegates and other interested parties.
Reconfigurable CMOS Low Noise Amplifier Using Variable Bias Circuit for Self Compensation
Authors: S. Fukuda, D. Kawazoe, K. Okada, K. Masu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper proposes a self compensation technique. For LNAs, large power gain and large input signal results in too large output signal and distortion. To make matters worse, input power varies by process variation, temperature, simulation error, and so on. To solve the problem, the proposed LNA is equipped with variable bias circuit and can be reconfigured by bias voltage of transistors. It contributes to power reduction, compensation of intermodulation. The proposed LNA achieves more than 33 dBm in DeltaIM3, if the input power increases more than -30 dBm. Moreover the output power is less than about -12 dBm, which is 87 % of power reduction.
Chinese Question Classification Based on Ensemble Learning
Authors: Keliang Jia, Kang Chen, Xiaozhong Fan, Yu Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, a method of Chinese question classification based on ensemble learning is proposed. Words and Bi-gram are extracted from question as classific features and feature classifiers are constructed. The classifiers are kinds of simple classifier and their generalization ability are not strong enough, but they are a qualified base learner for ensemble because of their low computational cost, and the generalization feasibility improved with the help of ensemble learning. We translate and modify the UIUC question set and TREC2001 question set as Chinese question set. Experimental results on the corpus show that the proposed method can achieve good performance, the classification precision reaches 87.6%, under the fine grained question types.
A Wirelist Compare Program for Verifying VLSI Layouts
Authors: K. L. Kodandapani, Edward McGrath
Venue: IEEE Design Test (1986)

We will describe a wirelist compare program that, together with a VLSI node extractor, is used to verify VLSI IC layout connectivity.Engineers at Digital Equipment Corporation have successfully used this tool in a production environment to debug layout errors.The program is based on a graph isomorphism algorithm and provides graphical and textual guides to pinpoint errors. We willexamine this algorithm, its error outputs, and provide run-time statistics.
Short term load forecasting using fuzzy neural network modified by the similarity and subsethood measures
Authors: M. R. Ganjavi, C. Lucas, M. H. Javidi
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

In this paper the linguistic approximate reasoning method is used for short term load forecasting. A neural structure for inference processing units is put forward. Two different &mdash; Analogical and Deductive &mdash; approaches to the inference method have been distinguished. Correspondingly, two different architectures &mdash; Analogical and Deductive fuzzy neural networks &mdash; are introduced in this paper. The accuracy of the load forecasting, as well as the size of the required rule base have been compared for Analogical, Deductive, and conventional fuzzy neural networks. It is shown that Analogical and Deductive approaches have superior performance in this application.
Some Industrial Applications of Minicomputers
Authors: R. A. Henzel
Venue: Computer (1971)

Industrial applications have been one of the key markets motivating the development of minicomputers. Some of the first small computers were designed specifically to perform tasks in process control, manufacturing and laboratories. Thus the history of industrial applications is as long and varied as the history of minicomputers themselves. 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
Self-Adaptive PD Control of Robot Manipulator
Authors: Ge Dongyuan, Jiang Shousheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In the first place mathematic model of manipulator is established according to the dynamic theories. Then self-adaptive PD controller is designed in lined with its disturbance's supremum which is not ascertain. The self-adaptive PD controller could make the systems' PD feedback control take main effects, which could avoid too large initial torque while the initial errors is large at first. while the disturbances errors decrease the self-adaptive controller take predominance acts to make the systems have good dynamic performances.
Advanced Flow-control Mechanisms for the Sockets Direct Protocol over InfiniBand
Authors: P. Balaji, S. Bhagvat, D. K. Panda, R. Thakur, W. Gropp
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

The Sockets Direct Protocol (SDP) is an industry standard to allow existing TCP/IP applications to be executed on high-speed networks such as InfiniBand (IB). Like many other high-speed networks, IB requires the receiver process to inform the network interface card (NIC), before the data arrives, about buffers in which incoming data has to be placed. To ensure that the receiver process is ready to receive data, the sender process typically performs flow-control on the data transmission. Existing designs of SDP flow-control are naive and do not take advantage of several interesting features provided by IB. Specifically, features such as RDMA are only used for performing zero-copy communication, although RDMA has more capabilities such as sender-side buffer management (where a sender process can manage SDP resources for the sender as well as the receiver). Similarly, IB also provides hardware flow-control capabilities that have not been studied in previous literature. In this paper, we utilize these capabilities to improve the SDP flow-control over IB using two designs: RDMA-based flow-control and NIC-assisted RDMA-based flow-control. We evaluate the designs using micro-benchmarks and real applications. Our evaluations reveal that these designs can improve the resource usage of SDP and consequently its performance by an order-of-magnitude in some cases. Moreover we can achieve 10-20% improvement in performance for various applications.
Design and Performance Evaluation of Multipath Extensions for the DYMO Protocol
Authors: Juan Jose Galvez, Pedro M. Ruiz
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we propose a multipath extension to Dynamic MANET On-demand (DYMO) Routing protocol. Multipath protocols have been shown to benefit on-demand routing in MANETs, where the knowledge of alternate paths allows to reduce the frequency of route discovery in the presence of link failures. Route discovery is an operation which accounts for most of the overhead of these protocols. This is specially helpful in scenarios with node mobility where link failures are frequent. Our extension is based on AOMDV. It can discover multiple disjoint paths in one route discovery with minimal additional overhead over DYMO. We analyze the performance gains of using alternate path information with DYMO. Simulation results show that multipath routing greatly benefits DYMO in reducing overhead and therefore increasing performance.
ESP3: A Language for Pattern Description and a System for Pattern Recognition
Authors: L. G. Shapiro
Venue: IEEE Transactions on Software Engineering (1977)

Extended Snobol picture pattern processor (ESP3) is a programming language and pattern recognition system which was designed for generating, recognizing, and manipulating two-dimensional line drawings. An ESP3 picture pattern describes a class of line drawings just as a Snobol pattern describes a class of strings. During pattern matching, a subject picture is searched for the occurrence of a sub-picture which matches a given picture pattern. The search of the subject picture is ordered left-to-right and top-to-bottom, and the search program uses scanner guidance information found in the picture pattern to limit the area of the subject picture to be searched. An experimental implementation of ESP3 has been developed to test the feasibility of the system. This paper describes the ESP3 picture patterns, the pattern matching operation, and the experimental implementation of ESP3.
Exploiting Postdominance for Speculative Parallelization
Authors: Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam S. Stone, Matthew I. Frank
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that the immediate postdominators of conditional branches provide a larger set of parallel tasks than existing task-seletion heuristics, which are limited to programming language constructs (such as loops or procedure calls). Our evaluation shows that postdominance-based task selection achieves, on average, more than double the speedup of the best individual heuristic, and 33% more speedup than the best combination of heuristics. The specific contributions of this paper include, first, a description of task selection based on immediate postdominance for a system that speculatively creates tasks. Second, our experimental evaluation demonstrates that existing task-selection heuristics based on loops, procedure calls, and if-else statements are all subsumed by compilergenerated immediate postdominators. Finally, by demonstrating that dynamic reconvergence prediction closely approximates immediate postdominator analysis, we show that the notion of immediate postdominators may also be useful in constructing dynamic task selection mechanisms.
A Low Complexity MPEG Video Decoder with Arbitrary Downscaling Capability
Authors: Shu Shi, Feng Liu, Xu Cheng
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

This paper presents some new techniques to implement arbitrary downscaling in decoding MPEG video with very low complexity. The DCT block recomposition method, which was used in resizing static image, is introduced to downscale video in frequency domain with arbitrary factors. New motion compensation based on the block group motion evaluation is proposed to correspond to the downscaled IDCT. Block groups of regular motion and irregular motion are handled respectively to balance the computation cost and picture quality. Analysis indicates the great complexity reduction and experiments show the decoder performance on the MPEG-4 video sequence. These techniques will be beneficial to the video applications on the mobile devices and many other low end embedded systems
Micro-displacement Super-resolution Based on Video Image Restoration
Authors: Mei Han, Minghui Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

When the sub-pixel displacement among low-resolution images (LR) is "0.5" unit pixel, current micro-displacement super-resolution (SR) method can reconstruct encouraging high-resolution images (HR). But if actual LR video images are processed in the same way, some severe motion blur will appear in the restored image. Because of the quality difference, a new selection method based on the relative displacements and included angles errors among the LR images is proposed. And we can choose the optimum gather of LR frames to reconstruct the best HR images by micro-displacement algorithm. In the end, the experiment proves that our new micro-displacement method is feasible.
A Survey of Analytic Models of Rollback and Recovery Stratergies
Authors: K. M. Chandy
Venue: Computer (1975)

There are several ways to increase system reliability. Choosing the most cost-effective one is not easy, but models such as those outlined in this paper can help.
Some Existence Theorems for Probabilistically Diagnosable Systems
Authors: H. Fujiwara
Venue: IEEE Transactions on Computers (1978)

This correspondence is concerned with probabilistic fault diagnosis for digital systems. The model considered in this correspondence is the diagnostic model introduced by Maheshwari and Hakimi where each unit has a probability of failure. For this model under both fault assumptions by Maheshwari-Hakimi and by Barsi-Grandoni-Maestrini, some existence theorems are obtained for probabilistically diagnosable systems. 1) Necessary and sufficient conditions for the existence of testing links to form probabilistically t-diagnosable systems with and without repair. 2) Necessary and sufficient conditions for the existence of probabilities of failure of all units to form probabilistically t-diagnosable systems with and without repair which have no hardcore.
Credit based Fairness Control in Wireless Sensor Network
Authors: Shanshan Li, Xiangke Liao, Shaoliang Peng, Peidong Zhu, Jie Jiang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Fairness is an essential problem in congestion control, which is to ensure all data sources have equal or weighted access to end-to-end network bandwidth. In this paper, we propose a practical fairness model CFRC to allocate congested bandwidth based on the credit of each sensor source instead of uniformly. Credit represents the effective amount of sensed information of packet generated in sensor source. In CFRC, a low-cost credit computation method ACCA is proposed for each source node to compute its credit locally based on the sensed area of it and its neighbors; Aggregation node computes the credit of aggregated packets using simple sum operation. Furthermore, an interferer aware fair rate allocation algorithm IFRA is proposed in CFRC to allocated bandwidth not only among all upstream neighbors, but also among congested nodes and its interferers. Simulation results verify the performance of CFRC.
D-Calib: Calibration Software for Multiple Cameras System
Authors: Yuko Uematsu, Tomoaki Teshima, Hideo Saito, Cao Honghua
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents calibration software "D-Calib" for multiple cameras, which can calibrate all cameras at the same time with easy operation. Our calibration method consists of two steps: initialization of camera parameters using planar marker pattern, optimization of initial parameters by tracking two markers attached to a wand. By weak calibration and multi-stereo reconstruction by multiple cameras, the initial parameters can be optimized in spite of few markers. Even if the cameras are placed in a large space, the calibration can be achieved by swinging the wand around the space. This method is completed as commercial software which achieves 0.27 % of average errors against the marker pattern size.
Enumeration of three kinds of rooted maps on the Klein bottle
Authors: Wenzhong Liu, Yanpei Liu
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper, 2-essential rooted maps on the Klein bottle are counted and an explicit expression with the size as a parameter is given. Further, the numbers of singular maps and the maps with one vertex on the Klein bottle are derived.
Cuenet?A Distributed Computing Facility
Authors: T. Radhakrishnan, C. Grossner
Venue: IEEE Micro (1985)

This flexible system, supporting any interconnection topology specified by a programmer, allows system analysts to experiment with alternate program decomposition strategies.
Hardware Test Technology
Authors: K. R. Anderson
Venue: Computer (1979)

The testing of digital systems has grown increasingly complex. LSI circuits, commonplace in today's systems, require thorough testing at the component level. VLSI adds even more complexity. How are these challenges being met? This special issue surveys the state-of-the-art and attempts to answer the question.
The Applications of Minicomputers
Authors: D. L. House
Venue: Computer (1971)

The first application of electronic computers was in the field of business accounting. The computer replaced punched card equipment and performed simple, repetitive clerical tasks. The system configurations and the application programs in this area have become quite standardized and homogeneous from system to system. The minicomputer was first applied in a far more academic atmosphere. From a curiosity in the laboratory, small computers became elements in many weird-and-wonderous systems used to monitor and control tests and experiments. Because it was there and interesting, scientists and engineers put the minicomputer to work in hundreds of different ways. Because it was sold as a basic system module, because it was easy to use and understand, and because it was inexpensive, the minicomputer became part of many different systems. The lack of standardization in input/output configurations and devices witnesses the variety of ways the minicomputer is applied.
On the impact of QoS-sensitivity on correlation structures
Authors: Kazumasa Oida
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

This paper assesses the feasibility of detecting the existence of network users who are dissatisfied with degradations in quality-of-service (QoS) through traffic data analysis. The dynamics of the number of streams on a link are described using a Markov chain, including human user actions of canceling data transfers in congestion. The correlation length, the time until the autocorrelation function drops to a specified value, is mathematically expressed. Numerical results show that the cancellations considerably decrease the ratio of two correlation lengths measured at different traffic loads under three conditions. First, the link capacity is small and/or every stream consumes a large amount of bandwidth. Second, the maximum number of data streams is large. Third, the stream lifetime is at least 10 times longer than the human response time.
Convergence of Web 2.0 and Semantic Web: A Semantic Tagging and Searching System for Creating and Searching Blogs
Authors: Gina Hope, Taehyung (George) Wang, Shan Barkataki
Venue: Proceedings of the International Conference on Semantic Computing (2007)

During the last several years, the volume of user-generated content on the web has skyrocketed. Today, the major Internet players such as MySpace, Wordpress, and YouTube all provide a variety of Web 2.0 based applications that allow users to post photos, share video, and manage blogs with multimedia content. Keyword-based tags are used to classify the submitted content and to conduct searches for retrieval. Use of simple keyword-based tags provide less than optimal classification leading to poor search results. This work examines several proposed solutions to this problem and proposes a solution based on semantic tagging of online contents. These proposed semantic tags are intended to be "understandable to both machines and humans; additionally we allow the user to specify a context for each tag. The combination of these measures permits searches based on inferences and synonyms in addition to simple keyword matches. Initial tests demonstrate that use of the proposed scheme leads to more accurate content classification and search results with a greater number of hits and higher relevancy. We describe the design and, implementation of a prototype system as proof of concept of our proposed solution. The prototype has been implemented with extensive use of open source software such as Jena, jBoss, the Spring framework, PostgreSQL database, and other freely available resources such as Wordnet.