ppxscal/embedding_network huggingface dataset:
A Novel Parallel Deadlock Detection Algorithm and Hardware for Multiprocessor System-on-a-Chip
Authors: Xiang Xiao, Jaehwan Lee
Venue: IEEE Computer Architecture Letters (2007)

Given the projected dramatic increase in the number of processors and resources in a system-on-a-chip, a quadratic increase in the likelihood of deadlock is predicted due to complex system behavior. To deal with this issue, we here present a novel parallel hardware-oriented deadlock detection algorithm with O(1) deadlock detection and O(min(m,n)) preparation, where m and n are the numbers of processes and resources, respectively. Our contributions are (i) the first O(1) deadlock detection hardware implementation and (ii) a new algorithmic method of achieving O(min(m,n)) overall run-time complexity. We implement our algorithm in Verilog HDL and demonstrate that deadlock detection always takes only two clock cycles regardless of the size of a system (i.e., m and n).
Revisiting the Need for Formal Education in Visualization
Authors: Holly Rushmeier, Jason Dykes, John Dill, Peter Yoon
Venue: IEEE Computer Graphics and Applications (2007)

In a Visualization Viewpoints article published in 2000, Gitta Domik posed the question, Do we need formal education in visualization? Domik held that we do, and the reasons she gave are just as valid today: Careless production of visualizations leads to misinterpretation, the design of visualizations of complex data is not trivial, and increasingly decision making is based on data-generated images. The need for formal education leads to more questions though: What should be taught in a visualization course? Who should take visualization courses? Who should teach those courses? Domik focused on answers to the first question and presented a series of eight core visualization topics based on the Education for Visualization subcommittee work of the ACM Siggraph Education Committee. In revisiting the topic for this article we focus on all three questions, and discuss some issues raised at the IEEE Visualization 2006 Workshop on Visualization Education for Non-Technical Majors.
A Prediction on Electric Signals Processing of Aloe Vera Var. Chinensis
Authors: Lanzhou Wang, Haixia Li, Dongsheng Li, Jiayin Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A novel model of the electric wave signal of the plant is established for the first time, there is x (n) =1.9591 x (n - 1) - 1.4927 x (n - 2) + 0.7205 x (n -3) - 0.80219 x (n - 4) + 0.44582 x (n - 5) - 0.30807 x (n - 6) + 0.19658 x (n - 7) - 0.34506 x (n - 8) + 0.52419 x (n - 9) - 0.339 x (n - 10) + 0.16681x (n - 11) - 0.09664 x ( n - 12) + 0.3625 x (n - 17) - 0.02005x ( n - 18); the fitting variance is 0.315951 and the standard deviation is 0.562095 in Aloe vera var. chinensis. It has a well effect that the fitting variance and standard deviation of models are the minimum. It is very well in the prediction effect of the AR model to the forecast 10 values of the plant electric wave signals respectively is well, and proves that the coefficient of AR model can represent main characters of plant electric wave signals. It is very importance that the function of plant electric wave signals are used to understand some regulations on the growth relationship between plants and environments.
In-VIGO virtual networks and virtual application services: automated grid-enabling and deployment of applications
Authors: M. Tsugawa, A. Matsunaga, Liping Zhu, V. Sanjeepan, H. Lam, R. J. Figueiredo, J. A. B. Fortes
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

This poster briefly introduces two resource-virtualization techniques needed for the creation of virtual(ized) grids: virtual networks and virtual application services. The former provides bidirectional network connectivity even in the presence of firewalls, network address translation gateways and proxies by creating virtual routers and virtual IP space. The later allows automated creation and deployment of legacy applications into grids by generating a virtual application service that allows the execution in shared resources of multiple isolated application instances with customized behavior.
Automatic Video Text Localization and Recognition
Authors: Ge Guo, Jin Jin, Xijian Ping, Tao Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Text in videos contains much semantic information that can be used for video indexing and summarization. In this paper, we design an integrated algorithm of locating horizontal text based on corner point detection and color clustering. First, we get candidate text regions by using the method based on corner point detection, and then identify candidate text regions and refine the bounding boxes by color clustering. Both the precision and recall rate of the new localization method are improved, and the processing time of the new method is less. On the aspect of locating accuracy, the new method gives tighter bounding boxes. We finally enhance the quality of the detected text region by multi-frame averaging and local thresholding. Our method can handle multi-language video text with complex background including a great range of font sizes and styles. The results after above steps can be directly processed by OCR system.
Round-trip privacy with nfsv4
Authors: Avishay Traeger, Kumar Thangavelu, Erez Zadok
Venue: Proceedings of the 2007 ACM workshop on Storage security and survivability (2007)

With the advent of NFS version 4, NFS security is more important than ever. This is because a main goal of the NFSv4 protocol is suitability for use on the Internet, whereas previous versions were used mainly on private networks. To address these security concerns, the NFSv4 protocol utilizes the RPCSEC GSS protocol and allows clients and servers to negotiate security at mount-time. However, this provides privacy only while data is traveling over the wire. We believe that file servers accessible over the Internet should contain only encrypted data. We present a round-trip privacy scheme for NFSv4, where clients encrypt file data for write requests, and decrypt the data for read requests. The data stored by the server on behalf of the clients is encrypted. This helps ensure privacy if the server or storage is stolen or compromised. As the NFSv4 protocol was designed with extensibility, it is the ideal place to add roundtrip privacy. In addition to providing a higher level of security than only over-the-wire encryption, our technique is more efficient, as the server is relieved from performing encryption and decryption. We developed a prototype of our round-trip privacy scheme. In our performance evaluation, we saw throughput increases of up to 24%, as well as good scalability.
A Reconfigurable Hardware Interface for a Modern Computing System
Authors: Philip Garcia, Katherine Compton
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Reconfigurable hardware (RH) is used in an increasing variety of applications, many of which require support for features commonly found in general purpose systems. In this work we examine some of the challenges faced in integrating RH with general purpose processors and memory systems. We propose a new CPU-RH-memory interface that takes advantage of on-chip caches and uses virtual memory for communication. Additionally we describe the simulator model we developed to evaluate this new architecture. This work shows that an efficient interface can greatly accelerate RH applications, and provides a strong first step toward multiprocessor reconfigurable computing.
Quantum Interpretation of Frequency Operator
Authors: Peng Wang, Jian-Ping Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The frequency operator of signal is obtained in this paper. It reflects the quantum characteristics of signal. It is a linear and hermitian operator. Eigenfunctions, eigenvalues and superposition principle of signal are researched by using the frequency operator. The frequency operator is used to prove the uncertainty principle of signal. The uncertainty principle of signal indicates that the signal can be considered as a kind of the quasi quantum system with wave-particle dualism. The frequency operator is a powerful tool to research the quantum characteristics of signal. The quantum interpretation of frequency operator explains the essence of signal and provides the theory support for applying the framework of quantum mechanics to the signal processing.
Skew aware polarity assignment in clock tree
Authors: Po-Yuan Chen, Kuan-Hsien Ho, TingTing Hwang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In modern sequential VLSI designs, clock tree plays an important role in synchronizing different components in a chip. To reduce peak current and power/ground noises caused by clock network, assigning different signal polarities to clock buffers is proposed in previous work. Althogh peak current and power/ground noises are minimized by signal polarities assignment, an assignment without timing information may increase the clock skew significantly. As a result, a timing-aware signal polarities assigning technique is necessary. In this paper, we propose a novel signal polarities assigning technique which can not only reduce peak current and power/ground noises simultaneously but also render the clock skew in control. The experimental result shows that the clock skew produced by our algorithm is 94% of original clock skew in average while the clock skew produced by three algorithms (Partition, MST, Matching) [5] are 235%, 272%, and 283%, respectively. Moreover, our algorithm is as efficient as the three algorithms of [5] in reducing peak current and power/ground noises.
High density self assembled nanoparticle film with temperature-controllable interparticle spacing for deep sub-wavelength nanolithography using localized surface plasmon modes on planar silver nanoparticle tunable grating
Authors: S. Lewis, R. Wheeler-Jones, V. Haynes, R. M. Perks
Venue: Microelectronic Engineering (2008)

A novel photolithographic technique using a periodic hexagonal close packed silver nanoparticle 2D array photo mask has been demonstrated to transfer a nano-pattern into a photoresist using G-I line proximity photolithography. This method can be made to precisely control the spacing between nanoparticles by using temperature. The high-density nanoparticle thin film is accomplished by self assembly through the Langmuir-Schaefer (LS) technique on a water surface and then transferring the particle monolayer to a temperature sensitive polymer membrane. A 30nm hexagonal close packed silver nanoparticle 2D array pattern with a 50nm period has been successfully transferred into S1813 photoresist using I-line exposure wavelength. The resultant feature sizes were 34nm with a period of 46nm, due to the surface plasmon resonance where the S1813 photoresist feature is approximately 11 times smaller than I-line exposure wavelength.
Network scheduling for data archiving applications in sensor networks
Authors: Yong Yao, S. M. Nazrul Alam, Johannes Gehrke, Sergio D. Servetto
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

Since data archiving in sensor networks is a communication intensive application, a careful power management of communication is of critical importance for such networks. An example is FPS, an adaptive power scheduling algorithm that combines slotted scheduling with a CSMA MAC [7]. In this paper, we first propose a new global power scheduling protocol called Multi-Flow Power Scheduling (MPS) that delivers more data and consumes less energy than existing power scheduling protocols. MPS sets up a transmission schedule through standard data aggregation and dissemination operations, however since it creates a global schedule it does not scale to large networks. We then present a new power scheduling protocol called Hybrid Power Scheduling (HPS) that retains the scalability of FPS while maintaining the energy efficiency and high data delivery rate of MPS. In a thorough simulation study, we compare HPS and MPS, and our results show the efficacy of HPS.
Fall Compcon78 Wrap-Up
Venue: Computer (1978)

Speaking before the opening-day session at COMPCON 78 Fall, Senator Harrison ("Jack") Schmitt of New Mexico proposed a national "communications highway" concept to be embodied in a new telecommunications act. 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
Robust equilibria under non-common priors
Authors: Daisuke Oyama, Olivier Tercieux
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior puts high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it consists of the unique rationalizable action profile. Set valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.
The Design and Implementation of a Domain-Specific Language for Network Performance Testing
Authors: Scott Pakin
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Abstract—CONCEPTUAL is a toolset designed specifically to help measure the performance of high-speed interconnection networks such as those used in workstation clusters and parallel computers. It centers around a high-level, domain-specific language which makes it easy for a programmer to express, measure, and report the performance of complex communication patterns. The primary challenge in implementing a compiler for such a language is that the generated code must be extremely efficient so as not to misattribute overhead costs to the messaging library. At the same time, the language itself must not sacrifice expressiveness for compiler efficiency or there would be little point in using a high-level language for performance testing.This paper describes the CONCEPTUAL language and the CONCEPTUAL compiler’s novel code-generation framework. The language provides primitives for a wide variety of idioms needed for performance testing and emphasizes a readable syntax. The core code-generation technique, based on unrolling CONCEPTUAL programs into sequences of communication events, is simple yet enables the efficient implementation of a variety of high-level constructs. The paper further explains how CONCEPTUAL implements time-bounded loops—even those which comprise blocking communication—in the absence of a timeout mechanism as this is a somewhat unique language/implementation feature.
Handoff Performance Enhancement for TCP-based Streaming Services in Heterogeneous Networks
Authors: Masanori Yoshimoto, Keita Kawano, Kazuhiko Kinoshita, Takahiro Matsuda, Koso Murakami
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The development and enhancement of wireless communication systems such as cellular network and Wireless LAN initiate the interests of heterogeneous networks where mobile users can make use of desirable wireless communication system. Furthermore, streaming services in a mobile environment have much attention with the wider bandwidth of wireless networks. Especially, TCP-based streaming service have more attention rather than UDP-based ones, since then can be used via some wide-accepted TCP-based protocols such as HTTP. However, in heterogeneous networks, the throughput of TCP-based communication is drastically degraded by decreasing of TCP congestion window size because of communication interrupt at vertical handoff. Therefore, QoS requirement of applications is not kept until the congestion window size increases enough again. In this paper, we proposed the method to immediately recover the TCP congestion window size by applying IEEE 802.11e EDCA. It can be implemented without extension of the existing TCP. Finally, we show the effectiveness of the proposed method by simulation experiments.
The effects of metadata corruption on nfs
Authors: Swetha Krishnan, Giridhar Ravipati, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Barton P. Miller
Venue: Proceedings of the 2007 ACM workshop on Storage security and survivability (2007)

Distributed file systems need to be robust in the face of failures. In this work, we study the failure handling and recovery mechanisms of a widely used distributed file system, Linux NFS. We study the behavior of NFS under corruption of important metadata through fault injection. We find that the NFS protocol behaves in unexpected ways in the presence of these corruptions. On some occasions, incorrect errors are communicated to the client application; inothers, the system hangs applications or crashes outright; in a few cases, success is falsely reported when an operation has failed. We use the results of our study to draw lessons for future designs and implementations of the NFS protocol.
Need for a systemic theory of classification in information science
Authors: Murat Karamuftuoglu
Venue: Journal of the American Society for Information Science and Technology (2007)

In the article, the author aims to clarify some of the issues surrounding the discussion regarding the usefulness of a substantive classification theory in information science (IS) by means of a broad perspective. By utilizing a concrete example from the High Accuracy Retrieval from Documents (HARD) track of a Text REtrieval Conference (TREC), the author suggests that the &ldquo;bag of words&rdquo; approach to information retrieval (IR) and techniques such as relevance feedback have significant limitations in expressing and resolving complex user information needs. He argues that a comprehensive analysis of information needs involves explicating often-implicit assumptions made by the authors of scholarly documents, as well as everyday texts such as news articles. He also argues that progress in IS can be furthered by developing general theories that are applicable to multiple domains. The concrete example of application of the domain-analytic approach to subject analysis in IS to the aesthetic evaluation of works of information arts is used to support this argument. &copy; 2007 Wiley Periodicals, Inc.
Automated design of multidimensional clustering tables for relational databases
Authors: Sam S. Lightstone, Bishwaranjan Bhattacharjee
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The ability to physically cluster a database table on multiple dimensions is a powerful technique that offers significant performance benefits in many OLAP, warehousing, and decision-support systems. An industrial implementation of this technique for the DB2® Universal DatabaseTM (DB2 UDB) product, called multidimensional clustering (MDC), which co-exists with other classical forms of data storage and indexing methods, was described in VLDB 2003. This paper describes the first published model for automating the selection of clustering keys in single-dimensional and multidimensional relational databases that use a cell/block storage structure for MDC. For any significant dimensionality (3 or more), the possible solution space is combinatorially complex. The automated MDC design model is based on what-if query cost modeling, data sampling, and a search algorithm for evaluating a large constellation of possible combinations. The model is effective at trading the benefits of potential combinations of clustering keys against data sparsity and performance. It also effectively selects the granularity at which dimensions should be used for clustering (such as week of year versus month of year). We show results from experiments indicating that the model provides design recommendations of comparable quality to those made by human experts. The model has been implemented in the IBM® DB2 UDB for Linux®, UNIX® and Windows® Version 8.2 release.
An enhanced neural network learning using a self-tuning fuzzy neuron controller
Authors: Peitsang Wu, Shu-Cherng Fang, Henry L. W. Nuttle
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

The performance of the "fuzzy-controlled curved search" method for back propagation neural network learning depends heavily upon the membership functions used in the fuzzy controller. Manually tuning the membership functions becomes a tedious job. In this paper, a fuzzy neuron controller with self-tuning capability is introduced to adjust the related membership functions in a self-adaptive manner. Computational results are included to illustrate the potential of this enhanced learning method.
On Transposing Large 2nx 2nMatrices
Authors: M. B. Ari
Venue: IEEE Transactions on Computers (1979)

This correspondence presents two variations on the algorithm of Eklundh for transposing large 2n x 2n matrices. The first variation shows how the number of accesses to secondary storage may be reduced at the expense of an increased amount of data transferred. Formulas for I/O time are derived from which we deduce the disk characteristics under which there is an improvement. The second variation shows that a small amount of additional secondary storage can be used to greatly improve the performance of the algorithm.
Kruskal's Algorithm for Query Tree Optimization
Authors: Pryscila Barvik Guttoski, Marcos Sfair Sunye, Fabiano Silva
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

This paper describes an implementation of Kruskal's algorithm in query optimization process for generation of a near optimal execution query tree. The open source PostgreSQL DBMS was used in the experiments since its query optimization is performed by Dynamic Programming and Genetic algorithm, which allows a concrete comparison with our approach. Kruskal's algorithm presents some advantages like its simplified code, its polynomial-time execution and the reduced search space to generate only one query tree, that will be the optimal tree. In most experiments, Kruskal's algorithm got the expected results in almost the same time as the results achieved by default PostgreSQL's optimization algorithms. The results confirm that Kruskal's algorithm is a feasible method for query optimization.
Keywords Extracting as Text Chance Discovery
Authors: Zhenya Zhang, Honemei Cheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Keyword auto-extracting is focused by researchers on information retrieval, data mining, chance discovery and others application. In this paper, new algorithm, CCG(Cognition & Concept Graph, for text chance discovery is presented based on cognition with data depth as measurement. When the keywords in a document are treated as chances in the document, those keywords can be extracted by CGC automatically. In CGC, concepts of a document are represented as maximum connected sub graphs of the basic graph for the document and the cognition of reader/author on a term is weighted with data depth. The correlation for word and concept is defined and the formula for the correlation calculating is given. Experimental results show that keywords extracted by CCG can describe the document and author/reader's cognition much better than keywords extracted by others technologies such as frequency accumulating or KeyGraph.