ppxscal/embedding_network huggingface dataset:
Studying of hot-carrier effect in floating body SOI MOSFETs by the transient charge pumping technique
Authors: Mikhail Nagoga, Serguei Okhonin, Pierre Fazan
Venue: Microelectronic Engineering (2004)

The newly introduced transient charge pumping (TCP) technique is used to characterize hot-carrier effects in floating body SOI MOSFETs for the first time. Its unique advantage is the possibility to characterize SOI transistors without a body contact. The method was tested on state-of-the-art 0.13-µm partially depleted devices. TCP measurements performed in the course of a hot-carrier stress allow monitoring the interface traps density. It was observed that the measured trap density kineties correlates well with the device parameter degradation. The results obtained demonstrate a high potential for our TCP method in the evaluation of the reliability of floating body transistors.
Design, Implementation and Performance of Fault-Tolerant Message Passing Interface (MPI)
Authors: A. David Selvakumar, P. M. Sobha, G. C. Ravindra, R. Pitchiah
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Fault Tolerant MPI (FTMPI) enables fault tolerance to the MPICH, an open source GPL licensed implementation of MPI standard by Argonne National Laboratoryýs Mathematics and Computer Science Division. FTMPI is a transparent fault-tolerant environment, based on synchronous checkpointing and restarting mechanism. FTMPI relies on non-multithreaded single process checkpointing library to synchronously checkpoint an application process. Global replicated System Controller and cluster node specific Node Controller monitors and controls check pointing and recovery activities of all MPI applications within the cluster. This paper details the architecture to provide fault tolerance mechanism for MPI based applications running on clusters and the performance of NAS parallel benchmarks and parallelized medium range weather forecasting models, P-T80 and P-T126. The architecture addresses the following issues also: ¿ Replicating System Controller to avoid single point of failure. ¿ Ensuring consistency of checkpoint files based on distributed two phase commit protocol, ¿ Robust fault detection hierarchy.
The random oracle methodology, revisited
Authors: Ran Canetti, Oded Goldreich, Shai Halevi
Venue: Journal of the ACM (JACM) (2004)

We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".The main result of this article is a negative one: There exist signature and encryption schemes that are secure in the Random Oracle Model, but for which any implementation of the random oracle results in insecure schemes. In the process of devising the above schemes, we consider possible definitions for the notion of a "good implementation" of a random oracle, pointing out limitations and challenges.
SIGGRAPH 2003 papers review
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

The SIGGRAPH Papers Review is an opportunity to showcase video segments from the Papers Sessions within the Computer Animation Festival. This year's review includes new ideas for skinning models, rendering skin, calculating shadows, and simulating cloth, smoke and collisions. The narration reflects the light tone given to the piece, featuring the vocal talents of Chris Miller. Edited by Maurissa Horwitz with music by Kristin Dyrud. Copyright held by creator.
Cryptographic File Systems Performance: What You Don't Know Can Hurt You
Venue: Proceedings of the Second IEEE International Security in Storage Workshop (2003)

Securing data is more important than ever, yet cryptographicfile systems still have not received wide use. Onebarrier to the adoption of cryptographic file systems is thatthe performance impact is assumed to be too high, but infact is largely unknown. In this paper we first survey availablecryptographic file systems. Second, we perform a performancecomparison of a representative set of the systems,emphasizing multiprogrammed workloads. Third, we discussinteresting and counterintuitive results. We show theoverhead of cryptographic file systems can be minimal formany real-world workloads, and suggest potential improvementsto existing systems. We have observed not only generaltrends with each of the cryptographic file systems wecompared but also anomalies based on complex interactionswith the operating system, disks, CPUs, and ciphers.
Bifurcation analysis on a two-neuron system with distributed delays
Authors: Xiaofeng Liao, Shaowen Li, Guanrong Chen
Venue: Neural Networks (2004)

In this paper, a general two-neuron model with distributed delays and a strong kernel is investigated. By applying the frequency domain approach and analyzing the associated characteristic equation, the existence of bifurcation parameter for the model is determined. Furthermore, if the mean delay used as a bifurcation parameter, it is found that Hopf bifurcation occurs for the strong kernel. This means that a family of periodic solutions bifurcates from the equilibrium when the bifurcation parameter exceeds a critical value. The direction and stability of the bifurcating periodic solutions are determined by the Nyquist criterion and the graphical Hopf bifurcation theorem. Some numerical simulations are given to justify the theoretical analysis results.
Tuning transmission power for TCP fairness in next generation wireless networks: an analytical paradigm
Authors: L. Galluccio, A. Leonardi, G. Morabito
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

It is well known that TCP is unfair when connections with different round trip times (RTTs) share the same bottleneck. In the literature TCP fairness in wired networks has been widely studied but little effort has been devoted to this issue in wireless networks, where new problems arise. As known, in fact, due to the wireless medium characteristics, the frequent link errors and consequent losses are interpreted as congestion clue and the transmission rate is drastically reduced. The objective of this paper is to investigate the possibility of achieving TCP fairness through power management in next generation wireless networks which are expected to use CDMA-based MAC schemes. The basic idea is to allow long RTT connections, which are usually the most disadvantaged, to have higher signal-to-interference ratios. To this aim, an analytical framework is introduced to calculate the appropriate transmission power, giving fairness to each mobile terminal. The impact of this power management scheme on fairness and overall throughput performance is evaluated by means of both analysis and simulations.
Reducing Group Management Overhead in Group-Based Location Management
Authors: Gary Hoi Kit Lam, Hong Va Leong, Stephen Chi Fai Chan
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Location management is fundamental in supporting location-dependent applications in a mobile environment. It is crucial to reduce the high uplink communication cost in reporting the location of mobile hosts. Group-based location updating scheme is able to exploit the spatial locality of mobile hosts to generate an aggregated location update from a group leader, thereby reducing the number of high cost individual location updates to the server. Under such a scheme, group management becomes an integral component for maintaining hosts' membership. A mechanism is needed for a mobile host to find a suitable group for joining. Those tasks induce more local messages. Based on our preliminary work, host interaction in the group finding process becomes a dominant factor in generating a high local communication overhead. Two improved variants of the group joining procedure are proposed for reducing the overhead. Performance study indicates that both variants do lead to a drastic reduction in local message count and hence the aggregated communication cost.
Decoupling BRDFs from surface mesostructures
Authors: Jan Kautz, Mirko Sattler, Ralf Sarlette, Reinhard Klein, Hans-Peter Seidel
Venue: Proceedings of Graphics Interface 2004 (2004)

We present a technique for the easy acquisition of realistic materials and mesostructures, without acquiring the actual BRDF. The method uses the observation that under certain circumstances the mesostructure of a surface can be acquired independently of the underlying BRDF.The acquired data can be used directly for rendering with little preprocessing. Rendering is possible using an offline renderer but also using graphics hardware, where it achieves real-time frame rates. Compelling results are achieved for a wide variety of materials.
Colorful XML: one hierarchy isn't enough
Authors: H. V. Jagadish, Laks V. S. Lakshmanan, Monica Scannapieco, Divesh Srivastava, Nuwee Wiwatwattana
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

XML has a tree-structured data model, which is used to uniformly represent structured as well as semi-structured data, and also enable concise query specification in XQuery, via the use of its XPath (twig) patterns. This in turn can leverage the recently developed technology of structural join algorithms to evaluate the query efficiently. In this paper, we identify a fundamental tension in XML data modeling: (i) data represented as deep trees (which can make effective use of twig patterns) are often un-normalized, leading to update anomalies, while (ii) normalized data tends to be shallow, resulting in heavy use of expensive value-based joins in queries.Our solution to this data modeling problem is a novel multi-colored trees (MCT) logical data model, which is an evolutionary extension of the XML data model, and permits trees with multi-colored nodes to signify their participation in multiple hierarchies. This adds significant semantic structure to individual data nodes. We extend XQuery expressions to navigate between structurally related nodes, taking color into account, and also to create new colored trees as restructurings of an MCT database. While MCT serves as a significant evolutionary extension to XML as a logical data model, one of the key roles of XML is for information exchange. To enable exchange of MCT information, we develop algorithms for optimally serializing an MCT database as XML. We discuss alternative physical representations for MCT databases, using relational and native XML databases, and describe an implementation on top of the Timber native XML database. Experimental evaluation, using our prototype implementation, shows that not only are MCT queries/updates more succinct and easier to express than equivalent shallow tree XML queries, but they can also be significantly more efficient to evaluate than equivalent deep and shallow tree XML queries/updates.
Metric Embeddings&#x2014;Beyond One-Dimensional Distortion
Authors: Robert Krauthgamer, Nathan Linial, Avner Magen
Venue: Discrete Computational Geometry (2004)

The extensive study of metric spaces and their embeddings has so far focused on embeddings that preserve pairwise distances. A very intriguing concept introduced by Feige allows us to quantify the extent to which larger structures are preserved by a given embedding. We investigate this concept, focusing on several major graph families such as paths, trees, cubes, and expanders. We find some similarities to the regular (pairwise) distortion, as well as some striking differences.
Human versus machine in the topic distillation task
Authors: Mingfang Wu, Gheorghe Muresan, Alistair McLean, Muh-Chyun (Morris) Tang, Ross Wilkinson, Yuelin Li, Hyuk-Jin Lee, Nichloas J. Belkin
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper reports on and discusses a set of user experiments using the TREC 2003 Web interactive track protocol. The focus is on comparing humans and machine algorithms in terms of performance in a topic distillation task. We also investigated the effect of the search results layout in supporting the users' effort.We have demonstrated that machines can perform nearly as well as people on the topic distillation task. Given a system tailored to the task there is significant performance improvement and finally, given a presentation that supports the task, there is strong user satisfaction.
XML Constraints Preservation in Relational Schema
Authors: Yunsheng Liu, Hao Zhong, Yi Wang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

XML has become the universal format for the representation and exchange of information over the Internet, but relational database is still the dominant data repository. So it is also useful in information exchange and data integration for preserving the semantics of data originating in relational databases. Although several approaches exist, they are incomplete in the sense that they focus only on a part of constraints and ignore the constraints for XML DTDs. In the paper, we first analyze both constraints in XML and constraints for XML. We also discuss what makes good XML document, and how to guarantee these constraints. At last we present our methods to preserve these constraints with relational schema. Comparing with other methods, our approach can preserve more XML constraints, reduce nesting and redundant data, and avoid storing bad DTDs.
Completeness in two-party secure computation: a computational view
Authors: Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

A Secure Function Evaluation (SFE) of a two-variable function f(·,·) is a protocol that allows two parties with inputs x and y to evaluate f(x,y) in a manner where neither party learns "more than is necessary". A rich body of work deals with the study of completeness for secure two-party computation. A function f is complete for SFE if a protocol for securely evaluating f allows the secure evaluation of all (efficiently computable) functions. The questions investigated are which functions are complete for SFE, which functions have SFE protocols unconditionally and whether there are functions that are neither complete nor have efficient SFE protocols.The previous study of these questions was mainly conducted from an Information Theoretic point of view and provided strong answers in the form of combinatorial properties. However, we show that there are major differences between the information theoretic and computational settings. In particular, we show functions that are considered as having SFE unconditionally by the combinatorial criteria but are actually complete in the computational setting. We initiate the fully computational study of these fundamental questions. Somewhat surprisingly, we manage to provide an almost full characterization of the complete functions in this model as well. More precisely, we present a computational criterion (called computational row non-transitivity) for a function f to be complete for the asymmetric case. Furthermore, we show a matching criterion called computational row transitivity for f to have a simple SFE (based on no additional assumptions). This criterion is close to the negation of the computational row non-transitivity and thus we essentially characterize all "nice" functions as either complete or having SFE unconditionally.
Automatic TV Program Production with APEs
Authors: Masaki Hayashi, Mamoru Douke, Narichika Hamaguchi
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Although TV programs are an easy way to conveymessages, thoughts or images to other people,program production is still difficult for individuals.We have been studying TV program Making Language(TVML) to enable individuals to create their own TVprograms. TVML is a language to describe TVprograms and the TVML Player interprets the TVMLscript and creates the TV program in real time. Tosimplify program production for the user, we are nowstudying a technique for producing TV programsautomatically. Using this technique, a user can makea TV program merely by inputting key informationinto an automatic production module, which is namedAPE (Automatic Production Engine). APE is a verysimple unit that processes given text data and alsooutputs text data. APE converts XML input text intoTVML to create a TV program. The user can createvarious types of TV programs on a PC by simplydownloading favorite APEs and providing some inputto the APE.
Wire Delay is Not a Problem for SMT (In the Near Future)
Authors: T. N. Vijaykumar, Zeshan Chishti
Venue: ACM SIGARCH Computer Architecture News (2004)

Previous papers have shown that the slow scaling of wiredelays compared to logic delays will prevent superscalar performancefrom scaling with technology.In this paper we showthat the optimal pipeline for superscalar becomes shallowerwith technology, when wire delays are considered, tighteningprevious results that deeper pipelines perform only as well asshallower pipelines.The key reason for the lack of performancescaling is that superscalar does not have sufficient parallelismto hide the relatively-increased wire delays.However,Simultaneous Multithreading (SMT) provides the much-neededparallelism.We show that an SMT running a multiprogrammedworkload with just 4-way issue not only retains theoptimal pipeline depth over technology generations, enablingat least 43% increase in clock speed every generation, but alsoachieves the remainder of the expected speedup of two pergeneration through IPC.As wire delays become more dominantin future technologies, the number of programs needs tobe scaled modestly to maintain the scaling trends, at least tillthe near-future 50nm technology.While this result ignoresbandwidth constraints, using SMT to tolerate latency due towire delays is not that simple because SMT causes bandwidthproblems.Most of the stages of a modern out-of-order-issuepipeline employ RAM and CAM structures.Wire delays in conventional,latency-optimized RAM/CAM structures preventthem from being pipelined in a scaled manner.We show thatthis limitation prevents scaling of SMT throughput.We use bitlinescaling to allow RAM/CAM bandwidth to scale with technology.Bitline scaling enables SMT throughput to scale at therate of two per technology generation in the near future.
A Scalable Approach to Approximating Aggregate Queries over Intermittent Streams
Authors: Shanzhong Zhu, Chinya Ravishankar
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

We present a novel approach to approximate evaluationof standing aggregate queries over streaming data, subjectto user-specified error bounds. Our method models thebehavior of aggregates as Brownian motions, and adaptivelyupdates the model according to stream characteristics.This approach has two advantages. First, it greatly improvessystem scalability since we can defer query evaluationas long as the difference between the returned andtrue aggregate values remains within user-specified bounds.Second, we are able to provide approximate answers duringstream interruptions by estimating the rate at which thestreams and the aggregate drift during the blackout periods.We also study processor allocation issues in such approximateaggregate evaluation systems. Our experiments showthat our model captures the behavior of real-world streamssuch as sensor data and stock traces with excellent fidelity,and scales very well for large numbers of standing queries.
PCell: A 2D Program for Visualizing Convective Plasma Cells
Authors: Rodrigo Carboni, Francisco Frutos-Alfaro
Venue: Computing in Science and Engineering (2004)

The PCell program helps visualize the magnetic field's evolution in different convective plasmas. We wrote the program in C (part of the program was translated from Fortran to C); it runs on Linux or Unix. Any interested user can download the program from our Web site:http://bellatrix.efis.ucr.ac.cr/astromod/convection.
VAX DEBUG: an interactive, symbolic, multilingual debugger
Authors: Bert Beander
Venue: ACM SIGSOFT Software Engineering Notes (1983)

Digital Equipment Corporation's VAX-11 Debugger, usually called VAX DEBUG or simply DEBUG, is an interactive, symbolic, and multilingual debugger which runs on the VAX-11 series of computers under the VMS operating system. The following gives an overview of VAX DEBUG and examines how it solves some of the problems inherent in the design of any such debugger. Particular attention is paid to how its command language is designed, how it distinguishes between addresses and values in command input, how it solves the problem of accessing and organizing symbol table information, and how it exercises control over the user program.
Fine-Grain Matrix Graph Representation for Predicting Mutations Leading to Conformational Rearrangements in Small RNAs
Authors: Assaf Avihoo, Nir Dromi, Danny Barash
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Previously, it was shown that predicting selective mutations leading to topological transitions in the secondary structure of RNAs can be achieved by a coarse-grain Laplacian matrix tree graph representation using its second eigenvalue. When applying the coarse-grain tree graph representation, introduced by Shapiro and co-workers in the 80ýs, it is possible to predict mutations leading to conformational rearrangements in RNAs of around 50 nt and higher. However, for small RNAs, such representations at the level of stems, bulges, and loops become ineffective. Recently, there is an interest in investigating secondary structure rearrangements in small RNAs, following their structural probing by comparative imino proton NMR spectroscopy. For computational predictions of mutations leading to the structure rearrangements of small RNAs, it is necessary to use a fine-grain graph representation as introduced by Waterman in the 70ýs at the level of nucleotides. Each nucleotide becomes a node in the graph and its equivalent Laplacian matrix is of the size N × N for a sequence of N nucleotides. Conformational rearrangements caused by mutations can be studied using measures to assess the differences between Laplacian matrices of fine-grain graph representations. The second eigenvalue of the Laplacian matrix can be used to filter mutations that lead to a structure similar to the wildtype but additional measures are needed. Image analysis techniques, by moving a sliding window over Laplacian matrices, can facilitate in differentiating between local rearrangements and global rearrangements.