ppxscal/embedding_network huggingface dataset:
Priority-Driven Scheduling and Bandwidth Allocation for MPEG-2 Decoding
Authors: Jinhwan Kim, Bonggyou Lee, Yong Ho Song
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In this paper, we propose an efficient algorithm to schedule real-time multimedia tasks for streaming MPEG-2 video clips. In our task model, each frame is decoded by a separate multimedia task whose priority is decided based on the precedence and importance of the corresponding frame in the video stream. We develop a priority-driven scheduling policy in order to effectively allocate the CPU bandwidth to multimedia tasks for MPEG-2 decoding. We show how to dynamically control the fraction of the allocated bandwidth according to the priority. The goal of the proposed scheduling method is to minimize the number of decoding tasks that have missed their deadlines while reducing the decoding times of these multimedia tasks. The performance of this scheduling method is compared against that of a similar technique with no priority scheme through simulation experiments.
Duality gap in convex programming
Authors: T. Champion
Venue: Mathematical Programming: Series A and B (2004)

In this paper, we consider general convex programming problems and give a sufficient condition for the equality of the infimum of the original problem and the supremum of its ordinary dual. This condition may be seen as a continuity assumption on the constraint sets (i.e. on the sublevel sets of the constraint function) under linear perturbation. It allows us to generalize as well as treat previous results in a unified framework. Our main result is in fact based on a quite general constraint qualification result for quasiconvex programs involving a convex objective function proven in the setting of a real normed vector space.
A session-based search engine
Authors: Smitha Sriram, Xuehua Shen, Chengxiang Zhai
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this poster, we describe a novel session-based search engine, which puts the search in context. The search engine has a number of session-based features including expansion of the current query with user query history and clickthrough data (title and summary of clicked web pages) in the same search session and the session boundary recognition through temporal closeness and probabilistic similarity between query terms. In addition, the search engine visualizes the rank change of web pages as different queries are submitted in the same search session to help the user reformulate the query.
A New CMOS Rail-to-Rail Low Distortion Balanced Output Transconductor
Authors: Mohamed A. Youssef, Ahmed M. Soliman
Venue: Analog Integrated Circuits and Signal Processing (2004)

This paper presents a new CMOS transconductor providing low distortion for rail-to-rail signals. The circuit is based on using the anti-phase common source topology with the floating current source to extend its linearity range. The difference in the biasing currents of the floating current source is compensated to maintain the two output currents balanced by subtracting it at the output nodes. The proposed transconductor is suitable for applications requiring wide dynamic ranges. Rail-to-rail operation is achieved with THD less than &minus;37 dB. The bandwidth achieved by the transconductor is 67.5 MHz using a supply voltage of &plusmn;1.5 V.
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
Authors: Xiaoming Sun, Andrew C. Yao, Shengyu Zhang
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

In decision tree models, considerable attention has beenpaid on the effect of symmetry on computational complexity.That is, for a permutation group ¿, how low can thecomplexity be for any boolean function invariant under ¿?In this paper we investigate this question for quantum decisiontrees for graph properties, directed graph properties,and circular functions. In particular, we prove that the n-vertexScorpion graph property has quantum query complexity\widetilde\Theta (n^{1/2}), which implies that the minimum quantumcomplexity for graph properties is strictly less than thatfor monotone graph properties (known to be \widetilde\Theta (n^{2/3})). Adirected graph property, SINK, is also shown to have the\widetilde\Theta (n^{1/2}) quantum query complexity. Furthermore, we givean N-ary circular function which has the quantum querycomplexity \widetilde\Theta (n^{1/4}). Finally, we show that for any permutationgroup ¿, as long as ¿ is transitive, the quantumquery complexity of any function invariant to ¿ is at least\widetilde\Theta (n^{1/4}), which implies that our examples are (almost) thebest ones in the sense of pinning down the complexity forthe corresponding permutation group.
Two-level languages for program optimization
Authors: Cristiano Calcagno
Venue: Theoretical Computer Science (2004)

Two-level languages incorporate binding time information inside types, that is, whether a piece of code is completely known at compile-time, or needs some more inputs and can be evaluated only at run-time. We consider the use of 2-level languages in the framework of partial evaluation, and use a 2-level version of the simply typed lambda calculus with recursion. We give an operational semantics, an equational theory and a denotational semantics, that give an account of the distinction between compilation and execution phases. An adequacy theorem is given to relate the two semantics, showing in particular how they agree on non-termination at compile time. We finally give a more refined model using functor categories.
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Authors: Philippe Raïpin Parvédy, Michel Raynal
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Consensus is a central problem of fault-tolerant distributed computing that, in the context of synchronous distributed systems, has received a lot of attention in the crash failure model and in the Byzantine failure model. This paper considers synchronous distributed systems made up of n processes, where up to t can commit failures by crashing or omitting to send or receive messages when they should ("process omission" failure model). It presents a protocol solving uniform consensus in such a context. This protocol has several noteworthy features. First, it is particularly simple. Then, it is optimal both in (1) the number of communication steps needed for processes to decide and stop, namely, min(f+2,t+1) where f is the actual number of faulty processes, and (2) the number of processes that can be faulty, namely t<n/2. Moreover, (3) it ensures that no process (be it correct or faulty) executes more than min(f+2,t+1) rounds, thereby extending the decision lower bound to the full completion time. The design of a uniform consensus protocol with such optimality requirements was an open problem. Interestingly, as min(f+2,t+1) is a lower bound to solve uniform consensus in the synchronous crash failure model, the proposed protocol shows that uniform consensus is not "harder'' in the omission failure model than in the crash failure model. The protocol is also message size efficient as, in addition to values, a message has to piggyback only n bits of control information.
Performance of ILU preconditioning techniques in simulating anisotropic diffusion in the human brain
Authors: Ning Kang, Jun Zhang, Eric S. Carlson
Venue: Future Generation Computer Systems (2004)

We conduct simulations for the unsteady state anisotropic diffusion process in the human brain by discretizing the governing diffusion equation on a face-centered cubic grid and adopting a high performance differential-algebraic equation solver, IDA, to deal with the resulting large-scale system of DAEs. Incomplete LU preconditioning techniques are used with the GMRES method to accelerate the convergence rate of the iterative solution. We then investigate and compare the efficiency and effectiveness of a number of ILU preconditioners, and find out that the ILUT with a dual dropping strategy gives the best overall performance when it is provided with the optimum choices of the fill-in parameter and the threshold dropping tolerance.
On the performance of parallel factorization of out-of-core matrices
Authors: Eddy Caron, Gil Utard
Venue: Parallel Computing (2004)

In this paper, we present an analytical performance model of the parallel left-right looking out-of-core LU factorization algorithm for cluster-like architectures. We show the accuracy of the performance prediction model for the ScaLAPACK library. We analyze the overhead introduced by the out-of-core part of the algorithm and we outline a limitation which was never seen before: for large problems the algorithm has a poor efficiency. This overhead is divided into an IO part and a communication part. We derive an overlapping scheme and minimum memory requirement to avoid the IO overhead. The new scheme is validated by a prototype implementation in ScaLAPACK. We show the impact of the communication overhead on two-dimensional distributions. Then we show that with similar memory requirements a second overlapping scheme may be implemented to avoid the communication overhead. If the size of the physical main memory is proportional to the matrix order (O(N) bytes), then performance of the out-of-core algorithm is similar to that of the in-core algorithm which requires O(N2) bytes. This paper demonstrates that there is no memory limitation for the factorization of huge matrices.
A Life Support System for Stimulation of and Recording from Rodent Neuron Networks Grown on Multi-Electrode Arrays
Authors: Lawrence Pfeffer, David Ide, Craig Stewart, Dietmar Plenz
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

One promising approach to studying how large numbers of neurons interact is thecombination of neuronal cell cultures with multi-electrode arrays (MEAs.) Together, theseallow simultaneous recording from many neurons. A particular challenge has been the long-term growth of organotypic neuronal cultures on MEAs. These cultures need alternateexposure to air and a liquid growth medium. Continuous rotary motion (of suitable closedchambers) provides this, but greatly complicates recording of large numbers of low-levelelectrical signals. An alternative approach is to rock chambers incorporating MEAs cyclicallythrough a limited angle, thus facilitating direct connections. A variable speed trajectorybalances cycle frequency against the shear forces acting to dislodge the tissue. Differenttrajectories can be used to optimize culture health during different development periods. Wediscuss the design of a microprocessor based life-support system that implements such alimited-angle, variable-speed cycle to culture rat brain slices on MEAs, while maintainingdirect electrical connections. We show some of the neurophysiological results thus madepossible, and consider improvements for a subsequent life-support system for future research.
An Approach to Help Select Trustworthy Web Services
Authors: Jia Zhang, Liang-Jie Zhang, Jen-Yao Chung
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The emerging paradigm of Web services opens a new way of Web application design and development to quickly develop and deploy Web applications by integrating independently published Web services components to conduct new business transactions. However, how to choose the most appropriate Web services components remains a challenge. In this paper we propose a user-centered, mobile agent-based, fault injection-equipped, and assertion-oriented approach to assist Web services requesters to select trustworthy Web services components. Our approach can largely enhance the efficiency of Web services components selection process, and provide a more cost-efficient method to help service requesters make better decisions.
VLSI Design of a Digital RFI Cancellation Scheme for VDSL Transceivers
Authors: L. Fanucci, R. Locatelli, E. Petri
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper a digital RFI (Radio Frequency Interference) canceller for DMT (Discrete MultiTone modulation) based VDSL (Very high speed Digital Subscriber Line) systems is presented. The adopted algorithm is optimized in terms of performance vs. complexity and size of the involved memories. High level, maximum precision system simulations showed the effectiveness of the cancellation scheme, considering VDSL performance parameters such as bit rate and efficiency in counteracting performance degradation due to RFI. The canceller has been implemented as a hardware macro-cell: the design space already explored at algorithm level to meet a good complexity/performance trade-off, has been deeply investigated during the bit true analysis to fix the finite numeric representation, the micro-architecture definition and the final technology mapping. Results of logic synthesis on a standard cells 0.18 µm CMOS technology are reported, in terms of area and energy consumption.
An analysis of software development environments
Authors: Dan Prentice
Venue: ACM SIGSOFT Software Engineering Notes (1981)

Software development environments are now being proposed as a way to solve problems of software development such as high costs and hidden errors. These environments have tremendous potential to structure the programming process, making it more reliable and error free. The potential also exists to ignore important costs associated with these environments. The large impact of software development environments makes them worthy of discussion. Topics of interest include 1) the package of a software development environment and 2) recurring dilemmas associated with the use of software development environments in organizations. A definition of a software development environment is provided and the dominant trends, with respect to costs, benefits and users, are discussed.
Specification and Timing Analysis of Real-Time Systems
Authors: Shuhua Wang, Grace Tsai
Venue: Real-Time Systems (2004)

The correctness of hard real-time systems depends not only on the correct functional behavior but also on the correct temporal behavior. That is, the designed hard real-time system should meet all its functional and timing requirements even in the worst case. By performing timing analysis in early stages of the system life cycle, it is possible to reduce the overall development costs. This is due to the fact that the detection of the deadline violation in hard real-time systems will often lead to a complete redesign. Therefore the integration of system specification and timing analysis will be very helpful in the design of hard real-time systems. In this paper a method is proposed which supports both functional and timing verification of the specified system. The method integrates the extended specification and description language (SDL) and message sequence chart (MSC) specifications with the task allocation and schedulability analysis algorithms. The extensions of SDL and MSC are annotations in form of embedded comments in the original languages. They are used to describe the timing requirements of the specified system. The usability of the proposed method is illustrated through a case study.
Steady-state analysis of a split-connection scheme for internet access through a wireless terminal
Authors: Feng Xie, Joseph L. Hammond, Daniel L. Noneaker
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

TCP does not perform well in a connection that includes a lossy wireless link. Techniques intended to improve the performance of TCP for such connections can be grouped into three categories: end-to-end, link layer and split-connection approaches. Some simulations and experimental results indicate that split-connection protocols yield better performance than the other two approaches. Although analytical modeling of the end-to-end and link-layer approaches has been presented, no comparable performance analysis for split-connection protocols has been reported previously. In this paper, a stochastic model is developed and used to analyze the performance of a class of split-connection protocols which deploy TCP on the wireline network and a light-weight transport protocol on the wireless final hop. The final hop is provided by a digital TDMA cellular system. The condition of heavy source traffic to the wireless terminal is considered. The model relates the throughput and some useful auxiliary performance measures to key system parameters such as propagation delays, the base-station buffer size, the ARQ protocol and channel-error process of the wireless link. The usefulness of the analysis is illustrated by its application to the problem of sizing the TCP receiving buffer in a base station.
A study on visual, auditory, and haptic feedback for assembly tasks
Authors: Bernd Petzold, Michael F. Zaeh, Berthold Faerber, Barbara Deml, Hans Egermeier, Johannes Schilp, Stella Clarke
Venue: Presence: Teleoperators and Virtual Environments (2004)

Telepresent tasks involve removal of the human operator from an immediate working area and relocation to a remote environment that offers the operator all necessary control features. In this remote location, the operator must be provided with adequate feedback information such that the task at hand can be effectively executed. This research explores the effectiveness of various feedback methods. More specifically, graphical feedback in the form of video streamed images is compared against rendered 3D models, the overall effectiveness of haptic feedback is analyzed, and the influences of sensory augmentation and sensory substitution are examined. This study involved 48 participants, each of whom executed a simple clockwork assembly task under various feedback mechanisms. The results support the use of 3D models as opposed to live video streams for graphical presentation, utilization of haptic feedback (which was found to significantly enhance operation effectiveness), and the use of sensory augmentation and substitution under specific circumstances.
Dolittle " Experiences in Teaching Programming at K12 Schools
Authors: Susumu Kanemune, Takako Nakatani, Rie Mitarai, Shingo Fukui, Yasushi Kuno
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

The Japanese government has been promoting IT education,including programming, at elementary and secondary(K12) schools since 2002. We have developed Dolittle, anobject-oriented programming language suitable for K12 education,and evaluated it through the teaching opportunitiesavailable in classrooms. This paper describes the outline andthe future outlook of Dolittle, and reports on the examples ofhow it is used in classes.
A Protocol for Reputation Management in Super-Peer Networks
Authors: Shalendra Chhabra, Ernesto Damiani, Sabrina De Capitani di Vimercati, Stefano Paraboschi, Pierangela Samarati
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Peer-to-Peer (P2P) applications have recently seen an enormous success and have reached millions of users. The main reason of this success is the anonymity the users enjoy. However, as recent experiences with P2P networks show, this anonymity offers an opportunity to exploit the network for abuses (e.g., the spread of malware). In this paper we extend our previous work on P2PRep, a reputation management protocol for pure P2P networks, in the case of super-peer networks. We present the design and implementation of reputation-aware servents.
Fractal modeling of human isochronous serial interval production
Authors: Guy Madison
Venue: Biological Cybernetics (2004)

The Hurst exponent (H) was estimated for series of 256 time intervals produced by human participants, collected in 5 sessions performed on different days. Each series was obtained during the continuation phase following synchronization with 25 isochronous intervals generated by a computer and presented through headphones. Dispersional analysis yielded estimates of H > 0.5. These were sufficiently stable to yield statistically significant differences between participants and between each target interval duration (0.5, 0.8, 1.1, and 1.5&#x2009;s). The results indicate that variability in isochronous serial interval production (ISIP) can be modeled as fractional Gaussian noise, which corroborates and qualifies previous research indicating positive serial dependency or long memory in ISIP data in terms of drift and 1/f noise characteristics. It is concluded that ISIP is a more complex process than is assumed by influential timing models and theories, and that realistic modeling of human timing must account for nonlinear variability patterns.
Force Mapping
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

In this paper, a new technique, force mapping, isdeveloped for the representation of surfaces atdifferent levels of detail. A force map records theapplied forces and their distributions. By applyingthese forces on a relatively simple surface anddeforming it, a detailed surface is created. Thistechnique can be used for surface compression,reconstruction and editing. As an alternative todisplacement mapping, our method benefits from thefact that physical properties are integrated into ageometric surface explicitly.
Psychosocial implications of computer software development and use: Zen and the art of computing
Authors: Peter G. Neumann
Venue: ACM SIGSOFT Software Engineering Notes (1982)

This paper considers both software development and computer system use from the viewpoint of the human effort involved. It attempts to identify various factors contributing to the successful development and use of computer programs and systems. For example, the "software factory" notion itself can become a large part of the problem unless considered thoughtfully. Various recommendations are made for increasing human productivity in this context.
Shining Lore
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A legend of eight heroes that connect the Age of Legend and the Age of Water. It has been several hundred years since the ocean disappeared and the world is slowly becoming a desert. In this scene Rune and three young heroes are protecting the secret they have discovered that will bring the waters again. Originally released as an online game and now slated for a Korean television series. Copyright held by creator. 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
Estimates for the spreading velocity of an epidemic model
Authors: O. Alves, C. E. Ferreira, F. P. Machado
Venue: Mathematics and Computers in Simulation (2004)

We present numerical estimates for the spreading velocity of an epidemic model. The model consists of a growing set of simple random walks (SRWs) on Zd (d = 1, 2), also known as frog model. The dynamics is described as follows. It is a discrete time process in which at any time there are active particles, which perform independent SRWs on Zd, and inactive particles, which initially do not move. When an inactive particle is hit by an active particle, the former becomes active too. We consider the case where initially there is one inactive particle per site except for the active particle which is placed at the origin. Alves et al. [Ann. Appl. Probab. 12 (2) (2002) 533] have recently proved that the set of the original positions of all active particles, re-scaled by the elapsed time, converges to a compact convex set A without being able to identify rigorously the actual limit shape. Numerical estimates coming from simulations show that for d = 2 the limit shape A is not an Euclidean ball.