ppxscal/embedding_network huggingface dataset:
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Authors: D. Burago, D. Grigoriev, A. Slissenko
Venue: Theoretical Computer Science (2004)

We consider two three-dimensional situations when a polytime algorithm for approximating a shortest path can be constructed. The main part of the paper treats a well-known problem of constructing a shortest path touching lines in R3: given a list of straight lines L = (L1,..., Ln) in R3 and two points s and t, find a shortest path that, starting from s, touches the lines Li in the given order and ends at t. We remark that such a shortest path is unique. We show that it can be length--position ε-approximated (i.e. both its length and its position can be found approximately) in time (Rn/dα)16 + O(n2 log log 1/ε), where d is the minimal distance between consecutive lines of L, α˜ is the minimum of sines of angles between consecutive lines, and R is the radius of a ball where the initial approximation can be placed (such a radius can be easily computed from the initial data).As computational model we take real RAM extended by square and cubic roots extraction. This problem of constructing a shortest path touching lines is known for quite some time to be a challenging problem. The existing methods for approximating shortest paths based on adding Steiner points which form a grid and subsequently applying Dijkstra's algorithm for finding a shortest path in the grid, provide a complexity bound which depends polynomially on 1/ε, while our algorithm for the problem under consideration has complexity linear in log log 1/ε. Our algorithm is motivated by the observation that the shortest path in question is a geodesic in a certain length space of non-positive curvature (in the sense of A.D. Alexandrov), and it relies on the (elementary) theory of CAT(0)-spaces.In the second part of the paper we analyze very simple grid approximations. We assume that a parameter a > 0 describing separability of obstacles is given and the part of a grid with mesh size a outside the obstacles is built (for semi-algebraic obstacles all these precalculations are polytime). We show that there is an algorithm of time complexity O((1/a)6) which, given a-separated obstacles in a unit cube, finds a path (between given vertices s and t of the grid) whose length is bounded from above by (84π* + 96a), where π* is the length of a shortest path. On the other hand, as we show by an example, one cannot approximate the length of a shortest path better than 7π* if one uses only grid polygons (constructed only from grid edges). For semi-algebraic obstacles our computational model is bitwise. For a general type of obstacles the model is bitwise modulo constructing the part of the grid admissible for our paths. Observe that the existing methods for approximating shortest paths are not directly applicable for semi-algebraic obstacles since they usually place the Steiner points forming a grid on the edges of polyhedral obstacles.
Design of Quaternary Logic Gate Using Double Pass-Transistor Logic with Neuron MOS Down Literal Circuit
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

A multi-valued Logic (MVL) pass gate is an important element to configure multi-valued logic. Multiple logical levels which are different from binary pass gates are required to be discriminated in MVL pass gates [1]. In this paper, we designed the Quaternary MIN (QMIN)/negated MIN (QMIN) gate, the Quaternary MAX (QMAX)/negated MAX (QNMAX) gate using double pass-transistor logic (DPL) with neuron MOS (vMOS) threshold gate. And also we designed Quaternary Truncated Difference (QTD) gate using vMOS down literal circuit (DLC). DPL is improved the gate speed without increasing the input capacitance. It has a symmetrical arrangement and double-transmission characteristics. The threshold gates are composed by vMOS DLC. The proposed gates get the valued to realize various multi threshold voltages. In this paper, these circuits are used 3V power supply voltages and parameter of 0.35um N-Well 2-poly 4-metal CMOS technology, and also represented HSPICE simulation results.
A Systematic Approach for Identifying Operational Relationships in Embedded Computer Control Systems
Authors: DeJiu Chen, Martin Torngren
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Embedded computer control systems are a kind of safety critical real-time system, formed by a synergetic integration of various functions, technologies, and engineering disciplines. To modularize the design and to define the embodiments of functional modules in terms of software components, a more precise modeling of systems and support for assessments of modularity and related tradeoffs in designs is necessary. However, little support exists in this area. Existing system models and modularity metrics such as coupling and cohesion are often either too general or too specific by targeting only a specific implementation technology. This paper proposes a meta-level model for the systems and a fine-grained classification of relationship patterns established by communication, synchronization, and implementation. The work emphasizes a system perspective and aims to support a more precise assessment of coupling, considered as one of the most important criterion for component creation and integration as well as structuring.
Belief revision for adaptive information retrieval
Authors: Raymond Y.K. Lau, Peter D. Bruza, Dawei Song
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Applying Belief Revision logic to model adaptive information retrieval is appealing since it provides a rigorous theoretical foundation to model partiality and uncertainty inherent in any information retrieval (IR) processes. In particular, a retrieval context can be formalised as a belief set and the formalised context is used to disambiguate vague user queries. Belief revision logic also provides a robust computational mechanism to revise an IR system's beliefs about the users' changing information needs. In addition, information flow is proposed as a text mining method to automatically acquire the initial IR contexts. The advantage of a belief-based IRsystem is that its IR behaviour is more predictable and explanatory. However, computational efficiency is often a concern when the belief revision formalisms are applied to large real-life applications. This paper describes our belief-based adaptive IR system which is underpinned by an efficient belief revision mechanism. Our initial experiments show that the belief-based symbolic IR model is more effective than a classical quantitative IR model. To our best knowledge, this is the first successful empirical evaluation of a logic-based IR model based on large IR benchmark collections.
A contracts course for software engineers
Authors: Eric C. Frankel
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Software engineering practitioners are often called upon to provide technical support in marketing and contracting. That support is more useful when the contributors have a firm understanding of the goals and techniques of these two business oriented activities. Of course, software engineers seeking advancement into higher levels of management should possess a more comprehensive knowledge and expertise.This paper describes a graduate level course designed to prepare software engineering students for efficient participation in the technical support of marketing and contracting activities.
Information retrieval using hierarchical dirichlet processes
Authors: Philip J. Cowans
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

An information retrieval method is proposed using a hierarchical Dirichlet process as a prior on the parameters of a set of multinomial distributions. The resulting method naturally includes a number of features found in other popular methods. Specifically, tf.idf-like term weighting and document length normalisation are recovered. The new method is compared with Okapi BM-25 [3] and the Twenty-One model [1] on TREC data and is shown to give better performance.
Cluster-based retrieval using language models
Authors: Xiaoyong Liu, W. Bruce Croft
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Previous research on cluster-based retrieval has been inconclusive as to whether it does bring improved retrieval effectiveness over document-based retrieval. Recent developments in the language modeling approach to IR have motivated us to re-examine this problem within this new retrieval framework. We propose two new models for cluster-based retrieval and evaluate them on several TREC collections. We show that cluster-based retrieval can perform consistently across collections of realistic size, and significant improvements over document-based retrieval can be obtained in a fully automatic manner and without relevance information provided by human.
Oxide-Nitride-Oxide layer optimisation for reliable embedded SONOS memories
Authors: Rob van Schaijk, Michiel van Duuren, Wan Yuet Mei, Kees van der Jeugd, Aude Rothschild, Marc Demand
Venue: Microelectronic Engineering (2004)

The better scaling perspective of semiconductor-oxide-nitride-oxide-semiconductor (SONOS) memories, together with the ease of integration in a base line CMOS process makes SONOS an excellent candidate for embedded flash in the 90 nm node and beyond, in this paper, the ONO layer optimisation to achieve the best compromise between program/erase voltage, endurance and retention is discussed. The Vt window easily exceeds 2 V with program/erase voltages down to ±11 V and program/erase times in the order of 1-100 ms. Excellent endurance with reasonable retention can be obtained with these devices.
Fault Detection Enhancement in Cache Memories Using a High Performance Placement Algorithm
Authors: Hamid R. Zarandi, Seyed Ghassem Miremadi, Hamid Sarbazi-Azad
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

Data integrity of words coming out of the caches needsto be checked to assure their correctness. This paperproposes a cache placement scheme, which provides highperformance as well as high fault detection coverage. Inthis scheme, the cache space is divided into sets ofdifferent sizes. Here, the length of tag fields associated toeach set is unique and is different from the other sets. Theother remained bits of tags are used for protecting the tagusing a fault detection scheme e.g., generalized parity.This leads to protect the cache without compromisingperformance and area with respect to the similar one,fully associative cache. The results obtained fromsimulating some standard trace files reveal that theproposed scheme exhibits a performance near to fullyassociative but achieves a considerable fault detectioncoverage which is suitable to be used in the dependable computing.
MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies
Authors: Patricia Buendia, Giri Narasimhan
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A new computational method to study within-host viral evolution is explored to better understand the evolution and pathogenesis of viruses. Traditional phylogenetic tree methods are better suited to study relationships between contemporaneous species, which appear as leaves of a phylogenetic tree. However, viral sequences are often sampled serially from a single host. Consequently, data may be available at the leaves as well as the internal nodes of a phylogenetic tree. Recombination may further complicate the analysis. Such relationships are not easily expressed by traditional phylogenetic methods. We propose a new algorithm, called MinPD, based on minimum pairwise distances. Our algorithm uses multiple distance matrices and correlation rules to output a MinPD tree or network. We test our algorithm using extensive simmulations and apply it to a set of HIV sequence data isolated from one patient over a period of ten years. The proposed visualization of the phylogenetic tree\network further enhances the benefits of our methods.
Models and implementation of a dynamic element matching DAC
Authors: Niklas U. Andersson, K. Ola Andersson, Mark Vesterbacka, J. Jacob Wikner
Venue: Analog Integrated Circuits and Signal Processing (2003)

The dynamic element matching (DEM) techniques for digital-to-analog converters (DACs) has been suggested as a promising method to improve matching between the DAC's reference levels. However, no work has so far taken the dynamic effects that limit the performance for higher frequencies into account. In this paper we present a model describing the dynamic properties of a DEM DAC and compare the simulated results with measurements of a 14-bit current-steering DEM DAC implemented in a 0.35-µm CMOS process. The measured data agrees well with the results predicted by the used model. It is also shown that the DEM technique does not necessarily increase the performance of a DAC when dynamic errors are dominating the achievable performance.
Solder man
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A story of creation, evolution and problem solving. After experiencing a problem with his creation, solder man looks to solve his dilemma the only way that he knows how, by soldering. With great effort he is successful, but finds himself in much worse shape. Then as luck or fate would have it, he stumbles across a substance that greatly expands his horizons. Life though is never without its problems, and in the end we are left wondering how much he has grown. 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
Intelligent product builder: a rapid prototyping environment for software in context aware hardware products
Authors: Adinda Freudenthal, Marc P. A. J. de Hoogh, David V. Keyson
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

Intelligence in products can be used to adapt user-product interaction to the context of usage. Input from sensors connected to hardware and to the user and readings from a database are processed to define the reactions of the system. However, there are no rapid prototyping tools, which support quick and easy building of software in hardware products by product-designers. Design students lack the possibility to evaluate the actual functioning of their designed intelligence with real users, since it is only expressed when tested with real hardware, in changing situations, and during longer periods of time. To support design students a rapid prototyping environment, called QuintPro Builder, is being developed at TU Delft. QuintPro Builder is currently being used in student projects for programming and to enable user tests.
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders
Authors: Uwe Leck
Venue: Combinatorica (2004)

We consider the poset SO(n) of all words over an n-element alphabet ordered by the subword relation. It is known that SO(2) falls into the class of Macaulay posets, i. e. there is a theorem of Kruskal&#x2013;Katona type for SO(2). As the corresponding linear ordering of the elements of SO(2) the vip-order can be chosen.Daykin introduced the V-order which generalizes the vip-order to the n&#x2265;2 case. He conjectured that the V-order gives a Kruskal&#x2013;Katona type theorem for SO(n).We show that this conjecture fails for all n&#x2265;3 by explicitly giving a counterexample. Based on this, we prove that for no n&#x2265;3 the subword order SO(n) is a Macaulay poset.
A method for multiple attribute decision-making with the fuzzy preference relation on alternatives
Authors: Zhi-Ping Fan, Guo-Fen Hu, Si-Han Xiao
Venue: Computers and Industrial Engineering (2004)

This paper investigates the multiple attribute decision-making (MADM) problem with preference information on alternatives. A new method is proposed to solve the MADM problem, where the decision maker (DM) gives his/her preference on alternatives in a fuzzy relation. To reflect the DM's subjective preference information, a linear goal programming model is constructed to determine the weight vector of attributes and then to rank the alternatives. Finally, a numerical example is used to illustrate the use of the proposed method.
A challenge towards next-generation research infrastructure for advanced life science
Authors: Haruki Nakamura, Susumu Date, Hideo Matsuda, Shinji Shimojo
Venue: New Generation Computing (2004)

Recently, life scientists have expressed a strong need for computational power sufficient to complete their analyses within a realistic time as well as for a computational power capable of seamlessly retrieving biological data of interest from multiple and diverse bio-related databases for their research infrastructure. This need implies that life science strongly requires the benefits of advanced IT. In Japan, the Biogrid project has been promoted since 2002 toward the establishment of a next-generation research infrastructure for advanced life science. In this paper, the Biogrid strategy toward these ends is detailed along with the role and mission imposed on the Biogrid project. In addition, we present the current status of the development of the project as well as the future issues to be tackled.
Hierarchical production planning with demand constraints
Authors: Hong-Sen Yan, Xiao-Dong Zhang, Min Jiang
Venue: Computers and Industrial Engineering (2004)

This paper explores the hierarchical production planning (HPP) problem of flexible automated workshops (FAWs), each of which has a number of flexible manufacturing systems (FMSs). The objective is to decompose medium-term production plans (assigned to an FAW by ERP/MRP II) into short-term production plans (to be executed by FMSs in the FAW) so as to minimize cost on the condition that demands have just been met. Herein, the HPP problem is formulated by a linear programming model with the overload penalty different from the underload penalty and with demand constraints. Since the scale of the model for a general workshop is too large to be solved in the simplex method on a personal computer within acceptable time, Karmarkar's algorithm and an interaction/prediction algorithm, respectively, are used to solve the model, the former for the large scale problems and the latter for the very large scale. With the help of the above-mentioned algorithms and HPP examples, Karmarkar's algorithm and the interaction/prediction algorithm are compared and analyzed, the results of which show that the proposed approaches are quite effective and suitable for both 'push' and 'pull' production.
Fast optical layer mesh protection using pre-cross-connected trails
Authors: Timothy Y. Chow, Fabian Chudak, Anthony M. Ffrench
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which promises significant bandwidth savings. Unfortunately, most shared mesh protection schemes cannot guarantee that failed traffic will be restored within the 50-ms timeframe that SONET standards specify. A notable exception is the p-cycle scheme of Grover and Stamatelakis. We argue, however, that p-cycles have certain limitations, e.g., there is no easy way to adapt p-cycles to a path-based protection scheme, and p-cycles seem more suited to static traffic than to dynamic traffic. In this paper we show that the key to fast restoration times is not a ring-like topology per se, but rather the ability to pre-cross-connect protection paths. This leads to the concept of a pre-cross-connected trail or PXT, which is a structure that is more flexible than rings and that adapts readily to both path-based and link-based schemes and to both static and dynamic traffic. The PXT protection scheme achieves fast restoration speeds, and our simulations, which have been carefully chosen using ideas from experimental design theory, show that the bandwidth efficiency of the PXT protection scheme is comparable to that of conventional shared mesh protection schemes.
Electrical characterization and reliability aspects of Zirconium Silicate films obtained from novel MOCVD precursors
Authors: M. Lemberger, A. Paskaleva, S. Zürcher, A. J. Bauer, L. Frey, H. Ryssel
Venue: Microelectronic Engineering (2004)

For future technology generations, the replacement of silicon dioxide as gate dielectric in metal-oxide semiconductor devices becomes a challenging issue. Metal silicates are promising candidates in this context. In this paper, the potential of zirconium silicate films obtained by metal-organic chemical vapor deposition from a novel single-source precursor is shown. On basis of metal insulator semiconductor capacitors, data from capacitance-voltage, current-voltage, constant voltage stress, and constant current stress measurements are presented. Detected charge trapping phenomena, conduction mechanisms, and polarity dependence of device degradation are discussed.
Calculating the Smarandache numbers
Authors: Jon Perry
Venue: Smarandache Notions Journal (2004)

The Smarandache Numbers are: 1,2,3,4,5,3,7,4,6,5,11,4,13,7,5,6,17,6,19,5,7,11,23,4,10,13,9,7,29,5,31,8,11,17,7,6,37, 19,13,5,41,7,43,11,6,23,47,6,14,10,17,13,53,9,11,7,19,29,59,5,61,31,7,8,13,11,67,17, 23,7,71,6,73,37,10,19,11,13,79,6,9,41,83,7, ... and defined as the smallest integer m such that n divides m! Finding the exact value of a(n) is an open problem, and this paper presents an effective algorithm for determining the value of a(n).
DGCVis: An Exploratory 3D Visualization of Graph Pyramids
Authors: Andreas Kerren, Florian Breier, Philip Kugler
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

Hierarchies of plane graphs, called graph pyramids, are used for collecting, storing and analyzing geographical information based on satellite images or other input data. Important for the better understanding of the geographical data, like landscape properties or thematical maps, is the appropriate visualization of graph pyramids and related information. In this paper, we present an interactive visualization tool that supports several coordinated views on graph pyramids, subpyramids, thematical maps, etc. Furthermore, some implementation details and application results are discussed.
Fairing of Point Based Surfaces
Authors: U. Clarenz, M. Rumpf, A. Telea
Venue: Proceedings of the Computer Graphics International (2004)

We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework allows an efficient and effective way to bring well-established PDE-based surface processing techniques to the field of point-based representations. We demonstrate the method by a PDE-based surface fairing application.
Assisting Seller Pricing Strategy Selection for Electronic Auctions
Authors: Jia Zhang, Ning Zhang, Jen-Yao Chung
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

This research examines sellersý pricing strategy oriented to biddersý risk preferences, within the context of an electronic auction. A business model is then proposed to predict the probability of potential biddersý risk preference, which sellers can consider to set pricing strategy to maximize their profits. A tailored intelligent auction registry engine is constructed based upon an initial version of our business model. Because the eXtensible Markup Language (XML)-based Simple Object Access Protocol (SOAP) is utilized to support interactions with other resources, our engine is decoupled from the underlying technology choices; therefore, it can be deployed to different platforms.