ppxscal/embedding_network huggingface dataset:
Design and Measurement of an Inductance-Oscillator for Analyzing On-Chip Inductance Impact on Wire Delay
Authors: Takashi Sato, Hiroo Masuda
Venue: Analog Integrated Circuits and Signal Processing (2005)

A newly devised inductance-oscillator (iOSC) has been developed which evaluates inductance impact on on-chip wire delay. iOSC is a ring oscillator which is comprised of a set of wires each with different loop inductance and accurate on-chip counter. The equivalent distance to the nearest ground grid, which serves as the current return path, is varied to control wire inductance.A test chip using 0.13-¿m node process is fabricated to demonstrate concept of the iOSC. Four wire structures are implemented as imperfect coplanar waveguide, imitating clock lines or high-frequency global signal lines. The structure with largest inductance variation measured 99 ps delay difference while newly proposing twisted ground structure which has small inductance variation measured 6 ps both for 3-mm wires. This experiment also provides designers with a guideline for ground density from inductance standpoint. iOSC confirms that the inductance impact on delay has to be adequately analyzed and controlled to estimate a timing in high-speed LSI designs.
The current status and future work of design automation in Japan
Authors: Stephen Y. H. Su
Venue: ACM SIGDA Newsletter (1974)

The Japanese computer industry is very active and has done a great deal of work in the Design Automation area. The author has had the opportunity to talk to some of the people working for the leading Japanese computer manufacturers.
EasyGrid: towards a framework for the automatic Grid enabling of legacy MPI applications: Research Articles
Authors: Cristina Boeres, Vinod E. F. Rebello
Venue: Concurrency and Computation: Practice Experience (2004)

One of the goals of the Grid is to aggregate collections of shared, heterogeneous, and distributed resources to provide computational &lsquo;power&rsquo; to parallel applications. However, designing applications capable of exploiting this potential with ease remains a challenge. This paper outlines the EasyGrid methodology for the efficient and robust execution of (legacy) MPI programs across distributed computing clusters. The principal objective of this work is to identify the application-oriented middleware necessary for, as well as to develop a framework to automatically generate, system-aware applications capable of executing in dynamic, unstable, distributed environments such as computational Grids. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Steady State Analysis of Finite Fluid Flow Models Using Finite QBDs
Authors: Soohan Ahn, J. Jeon, V. Ramaswami
Venue: Queueing Systems: Theory and Applications (2005)

The Markov modulated fluid model with finite buffer of size β is analyzed using a stochastic discretization yielding a sequence of finite waiting room queueing models with iid amounts of work distributed as exp (n¿). The n-th approximating queue's system size is bounded at a value qn such that the corresponding expected amount of work qn/(n¿) ¿ β as n ¿ ¿. We demonstrate that as n ¿ ¿, we obtain the exact performance results for the finite buffer fluid model from the processes of work in the system for these queues. The necessary (strong) limit theorems are proven for both transient and steady state results. Algorithms for steady state results are developed fully and illustrated with numerical examples.
CoLab: A Flexible Collaborative Web Browsing Tool
Authors: Guillermo de Jesus Hoyos-Rivera, Roberta Lima-Gomes, Jean-Pierre Courtiat
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Collaborative Web Browsing aims at extending currently available Web browsing capabilities in order to allow several users getting their browsing activity synchronized. This is a new and promising research area whose possibilities have not yet been exhaustively covered. From our point of view a Collaborative Web Browsing system should provide all the necessary facilities to allow users to get synchronized and desynchronized in a flexible way. Synchronization relies on a simple authorization protocol through which users can invite other users to create and release browsing synchronization relations. Additionally, special synchronization operators, intended to be used by privileged users, are also proposed with the purpose of overriding the authorization protocol. In this paper we present our proposal for modeling and implementing a Collaborative Web Browsing system called CoLab [1], which has been developed using Java¿ technology; we present the main features of our current development prototype: CoLab 2.0.
On the security of some proxy blind signature schemes
Authors: Hung-Min Sun, Bin-Tsan Hsieh, Shin-Mu Tseng
Venue: Journal of Systems and Software (2005)

A proxy blind signature scheme is a digital signature scheme which combines the properties of proxy signature and blind signature schemes. Recently, Tan et al. proposed two proxy blind signature schemes based on DLP and ECDLP respectively. Later, compared with Tan et al.'s scheme, Lal and Awasthi further proposed a more efficient proxy blind signature scheme. In this paper, we show that both Tan et al.'s schemes do not satisfy the unforgeability and unlinkability properties. Moreover, we also point out that Lal and Awasthi's scheme does not possess the unlinkability property either.
Welcome to a New Era of IT in 2005
Authors: Frank Ferrante
Venue: IT Professional (2005)

Organizations must deal with a growing number of regulatory issues, and at the same time not miss the opportunities in new technologies like Web services.
Adaptive mathematical morphology for edge linking
Authors: Frank Y. Shih, Shouxian Cheng
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

In this paper, adaptive mathematical morphology and its application to edge linking are presented to fill in the gaps between edge segments. Broken edges are extended along their slope directions by using the adaptive dilation operation with the suitable sized elliptical structuring elements. The size and orientation of the structuring element are adjusted according to the local properties, such as slope and curvature. Postprocesses of thinning and pruning are also applied. The edge-linking operation is performed in an iterative manner, so that the broken edges can be linked up gradually and smoothly while the details of the object shape are preserved.
Book review: Inside TOPS: The Complete Guide to Networking Macs, PCs, and Printers, ed. by Jesse Berst, (New Riders Pub., 1989)
Venue: ACM SIGSMALL/PC Notes (1991)

TOPS is a local area network designed to link Apple Macintoshes and IBM PC's. It comes with software (and hardware for PC's) for translating data files for exchange between Macs and PC's. It also comes with a print spooler. It uses an Appletalk network, but unlike the original Appletalk, it doesn't require a dedicated file server. 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
Scalable cache memory design for large-scale SMT architectures
Authors: Muhamed F. Mudawar
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for band-width. The size of the L1 data cache did not scale over the past decade. Instead, larger unified L2 and L3 caches were introduced. This cache hierarchy has a high overhead due to the principle of containment. It also has a complex design to maintain cache coherence across all levels. Furthermore, this cache hierarchy is not suitable for future large-scale SMT processors, which will demand high bandwidth instruction and data caches with a large number of ports.This paper suggests the elimination of the cache hierarchy and replacing it with one-level caches for instruction and data. Multiple instruction caches can be used in parallel to scale the instruction fetch bandwidth and the overall cache capacity. A one-level data cache can be split into a number of block-interleaved cache banks to serve multiple memory requests in parallel. An interconnect is used to connect the data cache ports to the different cache banks, thus increasing the data cache access time. This paper shows that large-scale SMTs can tolerate long data cache hit times. It also shows that small line buffers can enhance the performance and reduce the required number of ports to the banked data cache memory.
Parallel scheduling problems in next generation wireless networks
Authors: L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, A. Vitaletti, S. Diggavi, S. Muthukrishnan, T. Nandagopal
Venue: Networks (2005)

Next-generation 3G&sol;4G wireless data networks allow multiple codes &lpar;or channels&rpar; to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks poses the two-dimensional challenge of assigning both power &lpar;rate&rpar; and codes to every user. This gives rise to a new class of parallel scheduling problems. We abstract general downlink scheduling problems suitable for proposed next-generation wireless data systems. Our contribution includes a communication-theoretic model for multirate wireless channels. In addition, while conventional focus has been on throughput maximization, we attempt to optimize the maximum response time of jobs, which is more suitable for streams of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, on-line algorithms for approximating the optimal maximum response time. We also perform an experimental study with realistic data of channel conditions and user requests that strengthens our theoretical results. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;1&rpar;, 9&ndash;22 2005
Discourse understanding at the U. of Rochester
Authors: James F. Allen, Steven L. Small
Venue: Issue 79 (January 1982) (1982)

Current participants in the discourse understanding project at the University of Rochester are James Allen, Steven Small, Gary Cottrell, Alan Frisch, Andy Haas, Hans Koomen, Diane Litman, Lokendra Shastri, and Marc Vilain. The project is studying dialogues that concern some task that one agent is assisting the other to perform, or some complex behavior that one agent is attempting to explain to the other. Thus there is a well defined set of goals that are pursued throughout the dialogue. In such dialogues, there is extensive use of utterances that consist of short sentence fragments. In addition, clarification subdialogues arise frequently in which previous misunderstandings are corrected. In order to model such dialogues, many sources of knowledge must be exploited. In particular, we emphasize
Fault Collapsing for Flash Memory Disturb Faults
Authors: Mohammad Gh. Mohammad, Laila Terkawi
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Disturb failures are considered the most predominant failure mode in flash memories. Disturb faults are highly dependant on the core memory cell structure, manufacturing technology, and array organization and operation. In this paper, we develop appropriate fault primitives for all possible disturb faults in flash memories. Further, we analyze the origins of such disturbs and propose a method that uses cell structure and array organization information to identify the relevant disturbs to create reduced list of faults. As an example, the method was used to create a minimized faults list for NOR and NAND flash memory arrays. Moreover, we show how the reduced fault list developed can be used to devise more efficient test algorithms.
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms
Authors: Jun Xu, Richard J. Lipton
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

We clarify, extend, and solve a long-standing open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end delay bounds. We first focus on the difference between the time a packet finishes service in a scheduling algorithm and its virtual finish time under a GPS (General Processor Sharing) scheduler, called GPS-relative delay. We prove that, under a slightly restrictive but reasonable computational model, the lower bound computational complexity of any scheduling algorithm that guarantees O(1) GPS-relative delay bound is Ω(log n). We also discover that, surprisingly, the complexity lower bound remains the same even if the delay bound is relaxed to O(na) for O < a < 1. This implies that the delay-complexity tradeoff curve is flat in the "interval" [O(1), O(n)). We later conditionally extend both complexity results (for O(1) or O(na) delay) to a much stronger computational model, the linear decision tree. Finally, we show that the same complexity lower bounds are conditionally applicable to guaranteeing tight end-to-end delay bounds, if the delay bounds are provided through the Latency Rate (LR) framework.
HCI Education News: VALIDATING THE ACM SIGCHI CURRICULA FOR HUMAN-COMPUTER INTERACTION
Authors: Jean B. Gasen
Venue: ACM SIGCHI Bulletin (1993)

In August 1988, the ACM SIGCHI Executive Committee voted to authorize a multi-year project to develop a set of curriculum recommendations for education in Human-Computer Interaction. A Curriculum Development Group, established and coordinated by Tom Hewett, met in six face-to-face meetings over the course of two years.1 In addition, two open SIG meetings at CHI' 89 and CHI'90, a tutorial session at CHI'91 and several volunteer reviewers provided feedback on various drafts of the Curriculum Development Group's efforts.
Real-time interactive volumetric animation of the heart's electrical cycle from automatically synchronized ECG: Research Articles
Authors: John Ryan, Carol O'Sullivan, Christopher Bell
Venue: Computer Animation and Virtual Worlds (2004)

We present a novel method for representing the electrical depolarisation and repolarisation of cardiac cells using real-time volumetric animation techniques. The visual representation coincides with automatically synchronized electrocardiogram (ECG) input. Whilst other projects in similar fields use super-computers or vastly complex cellular structures, one of the aims of this project is to simplify the process for real-time optimization. The current techniques are being used in a teaching tool and also are being implemented in a myocardial infarction diagnostic tool. Cellular automata are used to demonstrate the electrical progression with a multi-pass nearest-neighbour algorithm and automatic ECG recognition and detection algorithms are used to synchronize the animation with the inputted ECG. We use texture-based slices to represent the myocardial volume to improve speed. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Realizing Small Involuntary Movements in Reading English
Authors: Yukio Ishihara, Satoru Morita
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The fixations which include small involuntary movements in reading English document are simulated on a computer by decreasing the capacity of the information that foveated vision obtains and by increasing the frequency of short-distance eye movements. We determine the relationship between information capacity and movement frequency to realize small involuntary movements while reading English.
Target tracking by time difference of arrival using recursive smoothing
Authors: Kutluyil Doǧançay, Ahmad Hashemi-Sakhtsari
Venue: Signal Processing (2005)

The paper presents a simple recursive solution to passive tracking of maneuvering targets using time difference of arrival (TDOA) measurements. Firstly, an iterative Gauss-Newton algorithm is developed for stationary target localization based on a constrained weighted least-squares (CWLS) criterion. The advantages of the CWLS estimate are its inherent stability due to the absence of local minima at infinity and its capability to match the performance of the maximum-likelihood (ML) estimate. To track maneuvering targets, a computationally efficient recursive least-squares (RLS) algorithm is developed, which smoothes successive stationary target location estimates obtained from the ML or CWLS solution using a constant-acceleration motion model. In simulation studies, the proposed recursive tracking algorithm is compared with a Kalman tracking algorithm that estimates the target track directly from the TDOA measurements, and is shown to be capable of outperforming the Kalman tracker.
Moral Property Rights in Bargaining with Infeasible Claims
Authors: Simon Gächter, Arno Riedl
Venue: Management Science (2005)

In many business transactions, labor-management relations, international conflicts, and welfare-state reforms, bargainers hold strong entitlements that are often generated by claims that are not feasible anymore. These entitlements seem to shape negotiation behavior considerably. By using the novel setup of a "bargaining with claims" experiment, we provide new systematic evidence tracking the influence of entitlements and obligations through the whole bargaining process. We find strong entitlement effects that shape opening offers, bargaining duration, concessions, and (dis)agreements. We argue that entitlements constitute a "moral property right" that is influential independent of negotiators' legal property rights.
Repacking on demand for speed-sensitive channel assignment
Authors: Hsien-Ming Tsai, Ai-Chun Pang, Yung-Chun Lin, Yi-Bing Lin
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

In mobile telecommunications networks, radio channels are limited resources that should be carefully allocated. To increase network capacity, channel assignment can be exercised in a hierarchical cellular network (HCN). By considering the speeds of MSs, we propose an HCN channel assignment approach called repacking on demand (ROD). A simulation model is developed to investigate the performance of RoD and some previously proposed approaches for HCN. Our study quantitatively shows that RoD significantly outperforms the previous proposed approaches.
Contractible bonds in graphs
Authors: Sean McGuinness
Venue: Journal of Combinatorial Theory Series B (2005)

This paper addresses a problem posed by Oxley (Matroid Theory, Cambridge University Press, Cambridge, 1992) for matroids. We shall show that if G is a 2-connected graph which is not a multiple edge, and which has no K5-minor, then G has two edge-disjoint non-trivial bonds B for which G/B is 2-connected.
Vertigo: automatic performance-setting for Linux
Authors: Krisztián Flautner, Trevor Mudge
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Combining high performance with low power consumption is becoming one of the primary objectives of processor designs. Instead of relying just on sleep mode for conserving power, an increasing number of processors take advantage of the fact that reducing the clock frequency and corresponding operating voltage of the CPU can yield quadratic decrease in energy use. However, performance reduction can only be beneficial if it is done transparently, without causing the software to miss its deadlines. In this paper, we describe the implementation and performance-setting algorithms used in Vertigo, our power management extensions for Linux. Vertigo makes its decisions automatically, without any application-specific involvement. We describe how a hierarchy of performance-setting algorithms, each specialized for different workload characteristics, can be used for controlling the processor's performance. The algorithms operate independently from one another and can be dynamically configured. As a basis for comparison with conventional algorithms, we contrast measurements made on a Transmeta Crusoe-based computer using its built-in LongRun power manager with Vertigo running on the same system. We show that unlike conventional interval-based algorithms like LongRun, Vertigo is successful at focusing in on a small range of performance levels that are sufficient to meet an application's deadlines. When playing MPEG movies, this behavior translates into a 11%-35% reduction of mean performance level over LongRun, without any negative impact on the framerate. The performance reduction can in turn yield significant power savings.
Surface plasmon waves in nanoelectronic circuits: Research Articles
Authors: Árpád I. Csurgay, Wolfgang Porod
Venue: International Journal of Circuit Theory and Applications (2004)

Plasma dynamics in nanoscale metal-dielectric structures is reviewed, and circuit models for potential plasma wave nanodevices and circuits are developed. Circuit representations for surface-plasmon waveguides, nanoantennas, and for surface plasmon generators based on attenuated total reflection (ATR), are presented. In metal&ndash;insulator&ndash;metal (MIM) structures tunnelling also excites surface plasmon waves, and the equivalent circuit introduced in this paper helps the design of circuits exploiting surface plasmon waves. These nanoelectronic circuits might have an impact on the future of terahertz and infrared electronics. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Wireless SOAP: optimizations for mobile wireless web services
Authors: Naresh Apte, Keith Deutsch, Ravi Jain
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose a set of optimization techniques, collectively called Wireless SOAP (WSOAP), to compress SOAP messages transmitted across a wireless link. The Name Space Equivalency technique rests on the observation that exact recovery of compressed messages is not required at the receiver; an equivalent form suffices. The WSDL Aware Encoding technique obtains further savings by utilizing knowledge of the underlying WSDL by means of an offline protocol we define. We summarize the design, implementation and performance of our Wireless SOAP prototype, and show that Wireless SOAP can reduce message sizes by 3x-12x compared to SOAP.
Web-Based Shape Modeling with Hyperfun
Authors: Richard Cartwright, Valery Adzhiev, Alexander A. Pasko, Yuichiro Goto, Tosiyasu L. Kunii
Venue: IEEE Computer Graphics and Applications (2005)

We present a project on research and development of the high-level language HyperFun for shape modeling using implicit surfaces and the more general function representation (FRep). An approach to collaborative Web-based shape modeling using HyperFun is described in detail. The presented empirical HyperFun shape modeling system based on empirical modeling principles provides users with an unusual degree of mutual interaction through the Web.