ppxscal/embedding_network huggingface dataset:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
Authors: Alexander Razborov, Avi Wigderson, Andrew Yao
Venue: Combinatorica (2002)

We investigate read-once branching programs for the following search problem: given a Boolean m &#x00d7; n matrix with m > n, &#xfb01;nd either an all-zero row, or two 1&#x2019;s in some column. Our primary motivation is that this models regular resolution proofs of the pigeonhole principle $$PHP^{m}_{n}$$, and that for m > n2 no lower bounds are known for the length of such proofs. We prove exponential lower bounds (for arbitrarily large m!) if we further restrict this model by requiring the branching program either to finish one row of queries before asking queries about another row (the row model) or put the dual column restriction (the column model).Then we investigate a special class of resolution proofs for $$PHP^{m}_{n}$$ that operate with positive clauses of rectangular shape; we call this fragment the rectangular calculus. We show that all known upper bounds on the size of resolution proofs of $$PHP^{m}_{n}$$ actually give rise to proofs in this calculus and, inspired by this fact, also give a remarkably simple &#x201c;rectangular&#x201d; reformulation of the Haken&#x2013;Buss&#x2013;Tur&#x00e1;n lower bound for the case m &#x226a; n2. Finally we show that the rectangular calculus is equivalent to the column model on the one hand, and to transversal calculus on the other hand, where the latter is a natural proof system for estimating from below the transversal size of set families. In particular, our exponential lower bound for the column model translates both to the rectangular and transversal calculi.
New Methods for Exploiting Program Structure and Behavior in Computer Architecture
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

Micro-architectural techniques of the next decade will have to be more efficient and scalable in order to handle growing workloads and longer communication and memory latencies. We believe that information about program structure, the data and control relationships between instructions, can be used as a powerful framework for new techniques. We argue that program structure information has several inherent advantages over frameworks that associate information either with instructions in isolation or with data. We present summaries of four novel methods that apply program structure information to memory system problems from disambiguation and data cache bandwdith to prefetching and coherence optimization.
Mathematical modelling of syneresis of cheese curd
Authors: E. Tijskens, J. De Baerdemaeker
Venue: Mathematics and Computers in Simulation (2004)

A mathematical model for syneresis of cheese curd in one dimension is presented based on the theory of mechanics of porous media. The simple mathematics leave room for surprising physical considerations and several interesting observations are made. Model parameters are estimated and validated using one-dimensional experiments. The agreement between experiment and simulation is reasonable given the speculative nature of the constitutive equations. The model also reproduces the qualitative aspects as observed by MRI experiments.
National borders emerge in cyberspace
Authors: Aaron Weiss
Venue: netWorker (2002)

Amidst the high-flying, oxygen-deprived hype at the zenith of the Internet economic bubble several truths had seemed inevitable: that notions of career and workplace would forever be changed, that generation of wealth would follow a brand new set of rules, and that political boundaries would sink below the rising tide of the global Internet. But as Web surfers around the world are starting to discover, national borders don't necessarily disappear as soon as you switch on the computer.
Statistical Timing Analysis Considering Spatial Correlations using a Single Pert-Like Traversal
Authors: Hongliang Chang, Sachin S. Sapatnekar
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We present an efficient statistical timing analysis algorithm thatpredicts the probability distribution of the circuit delay while incorporatingthe effects of spatial correlations of intra-die parametervariations, using a method based on principal component analysis.The method uses a PERT-like circuit graph traversal, and hasa run-time that is linear in the number of gates and interconnects,as well as the number of grid partitions used to model spatial correlations.On average, the mean and standard deviation valuescomputed by our method have errors of 0.2% and 0.9%, respectively,in comparison with a Monte Carlo simulation.
Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths
Authors: Yuanyuan Yang, Jianchao Wang
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Permutation is a frequently-used communication patternin parallel and distributed computing systems and telecommunicationnetworks. Node-disjoint routing has important applications in guidedwave optical interconnects where the optical "crosstalk" between messagespassing the same switch should be avoided. In this paper, weconsider routing arbitrary permutations on an optical baseline network(or reverse baseline network) with node-disjoint paths. We first provethe equivalence between the set of admissible permutations (or semi-permutations)of a baseline network and that of its reverse network basedon a step-by-step permutation routing. We then show that an arbitrarypermutation can be realized in a baseline network (or a reverse baselinenetwork) with node-disjoint paths in four passes, which beats the existingresults [Strictly nonblocking directional-coupler-based switching networks under crosstalk constraint], [Design of photinic rearrangeable networks with zero first-order switching-element-crosstalk] that a permutation can be realized in an n x n banyan networkwith node-disjoint paths in O(n^{\frac{1}{2}}) passes. This represents the currentlybest-known result for the number of passes required for routingan arbitrary permutation with node-disjoint paths in unique-path multi-stagenetworks. Unlike other unique path MINs (such as omega networksor banyan networks), only baseline networks have been found to possesssuch four-pass routing property. We present routing algorithms in bothself-routing style and central-controlled style. Different from the recentwork in [Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects], which also gave a four-pass node-disjoint routing algorithmfor permutations, the new algorithm is efficient in transmission time formessages of any length, while the algorithm in [Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects] can work efficientlyonly for long messages. Comparisons with previous results demonstratethat routing in a baseline network proposed in this paper could be a betterchoice for routing permutations due to its lowest hardware cost andnear-optimal transmission time.
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
Authors: Paul Pop, Petru Eles, Zebo Peng, Viacheslav Izosimov
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

We present an approach to partitioning and mapping for multiclusterembedded systems consisting of time-triggered and event-triggeredclusters, interconnected via gateways. We have proposeda schedulability analysis for such systems, including a worst-casequeuing delay analysis for the gateways responsible for routing inter-cluster traffic. Based on this analysis, we address design problemscharacteristic to multi-clusters: partitioning of the systemfunctionality into time-triggered and event-triggered domains, andmapping of processes onto architecture nodes. We present abranch-and-bound algorithm for solving these problems. Our algorithmis able to find schedulable implementations under limitedresources, achieving an efficient utilization of the system. The developedalgorithms are evaluated using extensive experiments anda real-life example.
MetaData for Efficient, Secure and Extensible Access to Data in a Medical Grid
Authors: Jean-Marc Pierson, Ludwig Seitz, Hector Duque, Johan Montagnat
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we present the metadata usage in a medical imaging project grid. Metadata represent data about the data: In our case, the data are medical images and the metadata store relative information on the patient and hospital records, or even data about the image algorithms used in our application platform. Metadata are either static or dynamically constructed after computations on data. We show how the metadata is used, produced and stored to provide a secure and efficient access to medical data (and metadata) through a dedicated architecture. Experiments include times to access data and to secure the transactions.
Face Recognition Using Computer-Generated Database
Authors: Won-Sook Lee, Kyung-Ah Sohn
Venue: Proceedings of the Computer Graphics International (2004)

Many face database and recognition systems havebeen constructed in specially designed studios withvarious illuminations, poses, and expressions.However, none of these databases yet satisfies a largevariation of poses and illuminations that permit thestudy of systematic 3D human face information, whichresults in an unsatisfactory success rate. It is causedprimarily by the difficulty of data collection of facialimages to satisfy the large variation of poses andilluminations to fully represent the 3D characteristicsof human faces. We present how computer-generateddatabase can be used for face recognition experimentfocused on multi-view face recognition/descriptor. Weshow multi-view face data collection using renderingof 3D models. We also illustrate our approach how tobuild a face descriptor containing 3D information ofhuman face using multi-view concepts. This multi-viewface recognition descriptor is a 3D descriptor usingthe concept how much powerful a view influences overnearby views, so called as "quasi-view" size.
RuO2-SiO2 composite thin films with wide resistivity range
Authors: Emil V. Jelenkovic, K. Y. Tong, W. Y. Cheung, S. P. Wong
Venue: Microelectronic Engineering (2004)

RuO2-SiO2 composite thin films were deposited on oxidised silicon wafers by reactive sputtering of Ru and quartz in argon-oxygen plasma. Post-deposition annealing was performed in a furnace in the temperature range from 200 to 600 °C in nitrogen ambient. The composition of the films was determined by Rutherford backscattering, while the crystallographic properties were monitored by X-ray diffraction and Raman spectroscopy. Electrical characterisation of the films was carried out using the Van der Pauw technique. A wide range of resistivity between 200 × 10-6 and 120 × 10-3 Ωcm was obtained by varying the proportion of SiO2 in the films. It was shown that by appropriate annealing conditions, tuning of the thermal coefficient of resistance to almost zero value could be obtained for most of the resistivity range of the investigated films.
The SSAHA Trace Server
Authors: Zemin Ning, William Spooner, Adam Spargo, Steven Leonard, Mark Rae, Antony Cox
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We present a client/server database system with the potential to make all DNA sequences searchable. The database estimated to be approximately 200 Gbps, contains various types of sequences, including WGS and clone reads, draft assemblies, finished sequences, refSeq etc. The search engine will be SSAHA2, a package combined SSAHA [1] (Sequence Search and Alignment by Hashing Algorithm) with cross_match [2]. Matching seeds of a few kmer words are detected by the SSAHA algorithm. Both query and subject sequences are cut off according to the locations of the matching seeds and then passed to cross_match for full alignment. We aim to develop a platform-independent client/server system which can provide a near real-time (under 10 seconds) search service for a clustered database.
Field-testing IMPACT EPIC research results in Itanium 2
Authors: John W. Sias, Sain-zee Ueng, Geoff A. Kent, Ian M. Steiner, Erik M. Nystrom, Wen-mei W. Hwu
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

Explicitly-Parallel Instruction Computing (EPIC) providesarchitectural features, including predication and explicitcontrol speculation, intended to enhance the compiler'sability to expose instruction-level parallelism (ILP) incontrol-intensive programs. Aggressive structural transformationsusing these features, though described in theliterature, have not yet been fully characterized in completesystems. Using the Intel Itanium 2 microprocessor,the SPECint2000 benchmarks and the IMPACT Compilerfor IA-64, a research compiler competitive with thebest commercial compilers on the platform, we providean in situ evaluation of code generated using aggressive,EPIC-enabled techniques in a reality-constrained microarchitecture.Our work shows a 1.13 average speedup(up to 1.50) due to these compilation techniques, relativeto traditionally-optimized code at the same inlining andpointer analysis levels, and a 1.55 speedup (up to 2.30) relativeto GNU GCC, a solid traditional compiler. Detailedresults show that the structural compilation approach providesbenefits far beyond a decrease in branch mispredictionpenalties and that it both positively and negatively impactsinstruction cache performance. We also demonstratethe increasing significance of runtime effects, such as datacache and TLB, in determining end performance and theinteraction of these effects with control speculation.
Equilogical spaces
Authors: Andrej Bauer, Lars Birkedal, Dana S. Scott
Venue: Theoretical Computer Science (2004)

It is well known that one can build models of full higher-order dependent-type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra. But the idea of categories of PERs and ERs (total equivalence relations) can be applied to other structures as well. In particular, we can easily define the category of ERs and equivalence-preserving continuous mappings over the standard category Top0 of topological T0-spaces; we call these spaces (a topological space together with an ER) equilogical spaces and the resulting category Equ. We show that this category--in contradistinction to Top0--is a cartesian closed category. The direct proof outlined here uses the equivalence of the category Equ to the category PEqu of PERs over algebraic lattices (a full subcategory of Top0 that is well known to be cartesian closed from domain theory). In another paper with Carboni and Rosolini (cited herein), a more abstract categorical generalization shows why many such categories are cartesian closed. The category Equ obviously contains Top0 as a full subcategory, and it naturally contains many other well known subcategories. In particular, we show why, as a consequence of work of Ershov, Berger, and others, the Kleene-Kreisel hierarchy of countable functionals of finite types can be naturally constructed in Equ from the natural numbers object N by repeated use in Equ of exponentiation and binary products. We also develop for Equ notions of modest sets (a category equivalent to Equ) and assemblies to explain why a model of dependent type theory is obtained. We make some comparisons of this model to other, known models.
Efficient Generation of Monitor Circuits for GSTE Assertion Graphs
Authors: Alan J. Hu, Jeremy Casas, Jin Yang
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Generalized symbolic trajectory evaluation (GSTE) is a powerful,new method for formal verification that combines the industrially-provenscalability and capacity of classical symbolic trajectoryevaluation with the expressive power of temporal-logic modelchecking. GSTE was originally developed at Intel and hasbeen used successfully on Intel's next-generation microprocessors.However, the supporting algorithms and tools for GSTE are stillrelatively immature.GSTE specifications are given as assertion graphs, an extensionof ¿-automata. This paper presents a linear-time, linear-size translationfrom GSTE assertion graphs into monitor circuits, which canbe used with dynamic verification both as a quick "sanity check" ofthe specification before effort is invested in abstraction and formalverification, and also as means to reuse GSTE specifications withother validations methods. We present experimental results usingreal GSTE assertion graphs for real industrial circuits, showing thatthe circuit construction procedure is efficient in practice and that themonitor circuits impose minimal simulation overhead.
A comparison of implicit time integration methods for nonlinear relaxation and diffusion
Authors: Robert B. Lowrie
Venue: Journal of Computational Physics (2004)

Several time integration methods for nonlinear systems are compared. All of the time discretizations are based on the θ-method, but differ in their treatment of the implicit nonlinear terms. One method converges the implicit nonlinear terms to a small tolerance and is often referred to as nonlinearly consistent (NC). Newton's method, or its approximation Newton-Krylov, is used to converge the nonlinearities. The other methods considered are linearized and comparisons are made for a relaxation problem and a radiation diffusion problem. The linearized one-step method that uses the full Jacobian is shown to have similar accuracy as NC methods. The lagged linearization method and an extension that is second-order accurate are also studied. A trunction error analysis complements the numerical results, For the relaxation problem, it is shown that each of the second-order accurate linearized methods may be more accurate than an NC method, depending on the degree of nonlinearity in the problem. For the radiation diffusion problem, in general the NC method is most accurate and allows a larger time step. However, the linearized methods perfom surprisingly well.
Supporting informal collections of digital images: organizing, browsing and sharing
Authors: Ianus Keller, Pieter Jan Stappers, Sander Vroegindeweij
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

Digital techniques are rapidly becoming popular for the recording of images, but current applications for handling image collections still lag behind the varied and fluent ways of interacting that traditional informal collections offer. In this paper we report a field study of how home users use traditional ways of storing and organizing their personal photo collections. We compare this to the possibilities and limitations of current tools for digital image collections. Findings indicate that the interfaces of current digital tools provide excellent support for solution-oriented indexing, but limited support for browsing and storytelling. Finally, an alternative interface is presented which combines real world interaction with the possibilities of new media for interacting with digital images.
Emotion recognition from physiological signals using wireless sensors for presence technologies
Authors: Fatma Nasoz, Kaye Alvarez, L. Lisetti, Neal Finkelstein
Venue: Cognition, Technology and Work (2004)

In this article we describe a new approach to enhance presence technologies. First, we discuss the strong relationship between cognitive processes and emotions and how human physiology is uniquely affected when experiencing each emotion. Secondly, we introduce our prototype multimodal affective user interface. In the remainder of the paper we describe the emotion elicitation experiment we designed and conducted and the algorithms we implemented to analyse the physiological signals associated with emotions. These algorithms can then be used to recognise the affective states of users from physiological data collected via non-invasive technologies. The affective intelligent user interfaces we plan to create will adapt to user affect dynamically in the current context, thus providing enhanced social presence.
Introducing undergraduates to programming using robots in the general education curriculum
Authors: Chuck Leska
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper outlines some of the relevant components of our first offering of the Programming with Robots course and ideas we have for enhancing the "GenEdness" of the course.
Adding machines and logarithms: Franklin H. Giddings and computation for the exact science of sociology
Authors: David D. McFarland
Venue: Social Science Computer Review (2004)

Sociologists of earlier eras had much more limited computational tools available, but even in the founding era, there were slide rules and printed tables of mathematical functions, mechanical calculators were becoming more common, and punched card tabulating equipment was being developed. This article focuses on one particular founder, Franklin H. Giddings, and the kind of computations he did or did not do, using or not using various computational devices then available. Giddings's reputation, as the leading quantitative sociologist among the founders of the discipline, is compared with his published work. Giddings himself, although a prolific author, did very little original quantitative research. His main contribution to quantitative sociology consisted of his programmatic statements, which helped provide legitimation for subsequent scholars who actually performed quantitative research.
High-Order Variations for Families of Vector Fields
Authors: Ronald Hirschorn, Andrew D. Lewis
Venue: SIAM Journal on Control and Optimization (2004)

Sufficient conditions involving Lie brackets of arbitrarily high order are obtained for local controllability of families of vector fields. After providing a general framework for the generation of high-order control variations, we propose a specific method for generating such variations. The theory is applied to a number of nontrivial examples.
Radio-Triggered Wake-Up Capability for Sensor Networks
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Power management is an important technique to prolongthe lifespan of sensor networks.Many power-managementprotocols employ wake-up/sleep schedules, which are oftencomplicated and inefficient.We present power managementschemes that eliminate such wake-up periods unless the nodeindeed needs to wake up.This type of wake-up capabilityis enabled by a new radio-triggered hardware component.We evaluate the potential power saving in terms of the lifespanof a sensor network application, using experiment dataand SPICE circuit simulations.Comparing the result withalways-on and rotation-based power management schemes,we find the radio-triggered scheme saves 98% of the energyused in the always-on scheme, and saves over 70% of the energyused in the rotation-based scheme.Consequently, thelifespan increases from 3.3 days (always-on) or 49.5 days(rotation-based) to 178 days (radio-triggered).Furthermore,a store-energy technique can extend operating distance from10 feet to 22 feet, or even longer if longer latency is acceptable.We also present amplification and radio-triggered IDswhich can further enhance performance.
Polynomial Functions on a Central Relation
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

We Show that the algebra R = (R; \wedge ,\underline\vee,0,\overline {f_i } (x)(i \in I)) is central polynomially complete. Every central polynomially complete algebra is finite. The clones on a set can be found of any finite and infinite cardinality.