ppxscal/embedding_network huggingface dataset:
Response of the Rhône deltaic margin to loading and subsidence during the last climatic cycle
Authors: Gwenael Jouet, Eric W. H. Hutton, James P. M. Syvitski, Serge Berné
Venue: Computers Geosciences (2008)

Passive continental margin subsidence is initiated by the synrift mechanical stretching of the lithospheric upper brittle layer and continues during the postrift phase; the thermal cooling and contraction of the upwelled asthenosphere forces the margin to subside in addition to the overloads from sea water and sediments. Therefore, the total subsidence in stretched basins includes fault-controlled initial sinking, thermal subsidence and flexural isostatic compensations. Decoupling and estimating the different components of this subsidence from stratigraphic analysis and restricted geophysical and sedimentological databases remains problematic. In particular, backstripping the sediment layers requires a well-constrained geological framework. A method is proposed here to investigate the subsidence history of a margin based on forward stratigraphic modelling. Using the Sedflux model, several experiments are done using generally agreed upon assumptions on the parameters describing lithospheric rheology and isostatic behaviour of a margin. The stratigraphic modelling of the Rhone deltaic margin during the last climatic cycle (125kyr) provides an assessment of these parameter estimates and their influence on geohistory (tectonic/thermal subsidence and sediment loading). The model results confirm the important impact of water loading on vertical deflection along the platform between glacial low sea-level and interglacial high sea-level. Based on Gulf of Lions (NW Mediterranean) observations, a conceptual method that uses the stratigraphic simulations is produced in order to evaluate the different components of the total subsidence of a margin, and, in particular, the relative impact of tectonic subsidence and sediment load.
Hamiltonian chains in hypergraphs
Authors: Gyula Y. Katona, H. A. Kierstead
Venue: Journal of Graph Theory (1999)

A cyclic ordering of the vertices of a k-uniform hypergraph is called a hamiltonian chain if any k consecutive vertices in the ordering form an edge. For k = 2 this is the same as a hamiltonian cycle. We consider several natural questions about the new notion. The main result is a Dirac-type theorem that provides a sufficient condition for finding hamiltonian chains in k-uniform hypergraphs with large (k - 1)-minimal degree. If it is more than (1 - 1/2k)n + 4 - k - 5/2k than the hypergraph contains a hamiltonian chain. &copy; 1999 Wiley Sons, Inc. J Graph Theory 30: 205212, 1999
Discrimination with spike times and isi distributions
Authors: Kukjin Kang, Shun-ichi Amari
Venue: Neural Computation (2008)

We study the discrimination capability of spike time sequences using the Chernoff distance as a metric. We assume that spike sequences are generated by renewal processes and study how the Chernoff distance depends on the shape of interspike interval (ISI) distribution. First, we consider a lower bound to the Chernoff distance because it has a simple closed form. Then we consider specific models of ISI distributions such as the gamma, inverse gaussian (IG), exponential with refractory period (ER), and that of the leaky integrate-and-fire (LIF) neuron. We found that the discrimination capability of spike times strongly depends on high-order moments of ISI and that it is higher when the spike time sequence has a larger skewness and a smaller kurtosis. High variability in terms of coefficient of variation (CV) does not necessarily mean that the spike times have less discrimination capability. Spike sequences generated by the gamma distribution have the minimum discrimination capability for a given mean and variance of ISI. We used series expansions to calculate the mean and variance of ISIs for LIF neurons as a function of the mean input level and the input noise variance. Spike sequences from an LIF neuron are more capable of discrimination than those of IG and gamma distributions when the stationary voltage level is close to the neuron's threshold value of the neuron.
Characterizing multistage nonlinear drivers and variability for accurate timing and noise analysis
Authors: Peng Li, Zhuo Feng, Emrah Acar
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Nanoscale device characteristics and noise coupling have rendered traditional waveform-based gate delay models increasingly difficult to adopt. While the widely adopted delay models are built upon the assumption of simple ramp-like signal waveforms, realistic signal shapes in nanoscale designs can be far more complex. The need for considering process-voltage-temperature (PVT) variations imposes further accuracy requirement on gate models. We present a parameterizable waveform independent gate model (PWiM) where no assumption is made upon the input waveforms. The PWiM model is constructed by encapsulating the driver's intrinsic nonlinear dc and dynamic characteristics, which are important to model for complex signal waveforms, via novel and yet easy-to-implement characterization steps. As such, PWiM can provide near-SPICE accuracy for input signals that significantly deviate from simple ramps. While recently developed current-based models can only be applied to single channel-connected component, PWiM can work for multistage cells leading to improved library compactness and analysis efficiency. Our experiments have indicated that the proposed driver model not only provides up to two orders of magnitude speedups over SPICE for delay and noise analysis, it also offers accurate assessment of performance variability introduced by process and environmental variations.
Adaptive layout for dynamically aggregated documents
Authors: Evan Schrier, Mira Dontcheva, Charles Jacobs, Geraldine Wade, David Salesin
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present a system for designing and displaying grid-based document designs that adapt to many different viewing conditions and content selections. Our system can display traditional, static documents, or it can assemble dynamic documents "on the fly" from many disparate sources via the Internet. Our adaptive layouts for aggregated documents are inspired by traditional newspaper design. Furthermore, our system allows documents to be interactive so that readers can customize documents as they read them. Our system builds on previous work on adaptive documents, using constraint-based templates to specify content-independent page designs. The new templates we describe are much more flexible in their ability to adapt to different types of content and viewing situations. This flexibility comes from allowing the individual components, or "elements," of the templates to be mixed and matched, according to the content being displayed. We demonstrate our system with two example applications: an interactive news reader for the New York Times, and an Internet news aggregator based on MSN Newsbot.
Surface reconstruction via geodesic interpolation
Authors: N. Sprynski, N. Szafran, B. Lacolle, L. Biard
Venue: Computer-Aided Design (2008)

This paper is concerned with reconstruction of numerical or real surfaces based on the knowledge of some geodesic curves on the surface. So, considering two regular 3D-curves f"0(t) and f"1(t), our purpose is to construct a surface which interpolates these two curves in such a way that these two curves are geodesics on this surface. This will be accomplished using Hermite interpolation. For a real surface, it will be shown that geodesics can be acquired using a ribbon of micro-sensors.
Abstraction abstracted
Authors: Russ Abbott, Chengyu Sun
Venue: Proceedings of the 2nd international workshop on The role of abstraction in software engineering (2008)

An abstraction is the reification and conceptualization of a distinction. We use the process of forming abstractions to make sense of the world, i.e., to form concepts. Once created we are often able to externalize these concepts as software. Abstractions are what give software elegance. Abstractions build on each other, producing a hierarchical dependency structure that often creates challenges for understanding. We can teach the use of pre-packaged abstractions. It is more difficult to teach the self-awareness necessary for inventing new abstractions. The process of building abstractions is bottom-up. Thought externalization is where top-down meets bottom-up.
Stability of asynchronous variational integrators
Authors: William Fong, Eric Darve, Adrian Lew
Venue: Journal of Computational Physics (2008)

The adoption of multiple time step integrators can provide substantial computational savings for mechanical systems with multiple time scales. However, the scope of these savings may be limited by the range of allowable time step choices. In this paper we analyze the linear stability of the fully asynchronous methods termed AVI, for asynchronous variational integrators. We perform a detailed analysis for the case of a one-dimensional particle moving under the action of a soft and a stiff quadratic potential, integrated with two time steps in rational ratios. In this case, we provide sufficient conditions for the stability of the method. These generalize to the fully asynchronous AVI case the results obtained for synchronous multiple time stepping schemes, such as r-RESPA, which show resonances when the larger time step is a multiple of the effective half-period of the stiff potential. Additionally, we numerically investigate the appearance of instabilities. Based on the experimental observations, we conjecture the existence of a dense set of unstable time steps when arbitrary rational ratios of time steps are considered. In this way, unstable schemes for arbitrarily small time steps can be obtained. However, the vast majority of these instabilities are extremely weak and do not present an obstacle to the use of these integrators. We then applied these results to analyze the stability of multiple time step integrators in the more complex mechanical systems arising in molecular dynamics and solid dynamics. We explained why strong resonances are ubiquitously found in the former, while rarely encountered in the latter. Finally, in this paper we introduce a formulation of AVI that highlights the symplectic nature of the algorithm, complementing those introduced earlier by other authors.
Ink features for diagram recognition
Authors: Rachel Patel, Beryl Plimmer, John Grundy, Ross Ihaka
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

The ability to automatically recognize a sketch accurately is important to computer-based diagramming. Many recognition techniques have been proposed but few researchers have reported the use of formal methods to select the most appropriate ink features for recognition algorithms. We have used a statistical approach to identify the most important distinguishing features of ink for dividing text and shapes. We implemented these into an existing recognition engine and conducted a comparative evaluation. Our feature set more successfully classified a range of common diagram elements than two existing dividers.
Tone interference suppression in DS-SS systems with modified DFT
Authors: Yongmei Wei, Guoan Bi, Gang Li
Venue: Signal Processing (2008)

The performance of traditional interference excision methods based on the discrete Fourier transform (DFT) in direct sequence spread spectrum (DS-SS) systems varies significantly with the frequency of the interference because the DFT of the interference becomes more dispersive with the increase of grid biases in the DFT operation. This paper presents a new excision method using modified DFT (MDFT) with an estimated grid bias. Minimum dispersion of the interference is achieved in the MDFT domain. Both theoretical analysis and experimental simulation are presented to show that the interference can be excised with a minimum distortion of the desired signal in a large range of interference-to-signal ratio.
Dreadlocks: efficient deadlock detection
Authors: Eric Koskinen, Maurice Herlihy
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We present Dreadlocks, an efficient new shared-memory spin lock that actively detects deadlocks. Instead of spinning on a Boolean value, each thread spins on the lock owner's per-thread digest, a compact representation of a portion of the lock's waits-for graph. Digests can be implemented either as bit vectors (for small numbers of threads) or as Bloom filters (for larger numbers of threads). Updates to digests are propagated dynamically as locks are acquired and released. Dreadlocks can be applied to any spin lock algorithm that allows threads to time out. Experimental results show that Dreadlocks outperform timeouts under many circumstances, and almost never do worse.
Real time computation of difference equations
Authors: Carlos Celaya Borges, Jorges Illescas Chávez
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

A system for real time computation of difference equations is presented. The prototype was implemented with a PIC18F458 microcontroller; two applications are presented. First, by means of basic functions: adder, delay and attenuator, a complex audio processor was achieved. The second application, a digital control of a third order plant is implemented. The analog outputs are derived from a pulse width output of PWM signals and then an external A/D converter was not required. The program was written in 'C' language. As a result, we get a compact device programmable for audio processing and control.
Exact identification of circuits using fixed points of amplification functions
Authors: S. A. Goldman, M. J. Kearns, R. E. Schapire
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A technique for exactly identifying certain classes of read-once Boolean formulas is introduced. The method is based on sampling the input-output behavior of the target formula on a probability distribution which is determined by the fixed point of the formula's amplification function (defined as the probability that a 1 is output by the formula when each input bit is 1 independently with probability p). By performing various statistical tests on easily sampled variants of the fixed-point distribution, it is possible to infer efficiently all structural information about any logarithmic-depth target family (with high probability). The results are used to prove the existence of short universal identification sequences for large classes of formulas. Extensions of the algorithms to handle high rates of noise and to learn formulas of unbounded depth in L.G. Valiant's (1984) model with respect to specific distributions are described.
IBM POWER6 reliability
Authors: M. J. Mack, W. M. Sauer, S. B. Swaney, B. G. Mealey
Venue: IBM Journal of Research and Development (2007)

This paper describes the state-of-the art reliability features of the IBM POWER6™ microprocessor. The POWER6 microprocessor includes a high degree of detection of soft and hard errors in both dataflow and control logic, as well as a feature--instruction retry recovery (IRR)--usually available only on mainframe systems. IRR provides full hardware error recovery of those registers that are defined by the instruction set architecture. This is accomplished by taking a checkpoint of the defined state for both of the core threads and recovering the machine state back to a known good point. To allow changing memory accessibility without using different page table entries, the POWER6 microprocessor implements virtual page class keys, a new architectural extension that enables the OS (operating system) to manage eight classes of memory with efficiently modifiable access authority for each class. With this feature, malfunctioning kernel extensions can be prevented from destroying OS data that may, in turn, bring an OS down.
ASPicDB
Authors: T. Castrignanò, M. D’Antonio, A. Anselmo, D. Carrabino, A. D’Onorio De Meo, A. M. D’Erchia, F. Licciulli, M. Mangiulli, F. Mignone, G. Pavesi, E. Picardi, A. Riva, R. Rizzi, P. Bonizzoni, G. Pesole
Venue: Bioinformatics (2008)

Motivation: Alternative splicing has recently emerged as a key mechanism responsible for the expansion of transcriptome and proteome complexity in human and other organisms. Although several online resources devoted to alternative splicing analysis are available they may suffer from limitations related both to the computational methodologies adopted and to the extent of the annotations they provide that prevent the full exploitation of the available data. Furthermore, current resources provide limited query and download facilities. Results: ASPicDB is a database designed to provide access to reliable annotations of the alternative splicing pattern of human genes and to the functional annotation of predicted splicing isoforms. Splice-site detection and full-length transcript modeling have been carried out by a genome-wide application of the ASPic algorithm, based on the multiple alignments of gene-related transcripts (typically a Unigene cluster) to the genomic sequence, a strategy that greatly improves prediction accuracy compared to methods based on independent and progressive alignments. Enhanced query and download facilities for annotations and sequences allow users to select and extract specific sets of data related to genes, transcripts and introns fulfilling a combination of user-defined criteria. Several tabular and graphical views of the results are presented, providing a comprehensive assessment of the functional implication of alternative splicing in the gene set under investigation. ASPicDB, which is regularly updated on a monthly basis, also includes information on tissue-specific splicing patterns of normal and cancer cells, based on available EST sequences and their library source annotation. Availability: www.caspur.it/ASPicDB Contact: graziano.pesole@biologia.uniba.it Supplementary information: Supplementary data are available at Bioinformatics online.
Development platform for parallel image processing
Authors: Radu Dobrescu, Matei Dobrescu, Stefan Mocanu, Sebastian Taralunga
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

This paper describes a development distributed platform with client-server architecture that allows developing parallel primary image processing on a cluster with variable number of workstations. The principles of the software and hardware architecture of this platform are presented underlining the versatility and the capacity of adaptation to a specific application. Experimental results show that for a realistic image processing application performances are accurate and consequently the core of the architecture forms a powerful basis for automatic parallelization of a wide range of image processing software.
Particle swarm optimization for electric power systems
Authors: A. Giorgi, F. Riganti Fulginei, A. Salvini
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In the present paper will be analyzed the Swarm Algorithm and in particular the Particle Swarm Optimization (P.S.O.) applied in the field of electric power systems. The main purpose is to create a linear approach to analyze, to solve and to optimize a particular chosen circuit, that has been previously tested through classical and not linear mathematical methods. The generated code, observing the tolerances imposed by specifications concerning above all active and reactive power of the load, looks for an adaptive combination of input values, in order to minimize the ohmic power loss of the whole system.
Design and code reviews in the age of the internet
Authors: Bertrand Meyer
Venue: Communications of the ACM (2008)

New collaboration tools allow geographically distributed software-development teams to boost the venerable concept of code review.
An All-Digital High-Precision Built-In Delay Time Measurement Circuit
Authors: Ming-Chien Tsai, Ching-Hwa Cheng, Chiou-Mao Yang
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Delay testing has become a major issue for manufacturing advanced Systems on a Chip. Automatic Test Equipment and scan techniques are usually applied in delay testing. However, the circuits under test have many circuit paths and dependent input patterns; it is hard to measure delay times accurately, especially when debugging small delay defects. We propose a Built-In Delay Measurement (BIDM) circuit that is modified from Vernier Delay Lines. All digitally designed BIDMs with small area overhead can be easily embedded within testing circuits. BIDMs can be used to record the data propagation delay times within circuit path segments, for delay testing, diagnosis, and calibration requirements internal to the chip. Our BIDM was implemented in a 32bit error correction circuit by a chip using TSMC 0.18u technology. The instruments measured results showing that the BIDM chip correctly reported the CUT segment path delay times. The chip measurement results were a 95.83% match to the postlayout SPICE simulation values. This BIDM makes it possible to debug small delay defects in chips.
Relational-style XML query
Authors: Taro L. Saito, Shinichi Morishita
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as XPath and XQuery, demand explicit path expressions, and thus it is quite difficult for users to produce correct XML queries in the presence of structural variations. To solve this problem, we introduce a novel query method that automatically discovers various XML structures derived from relational data. A challenge in implementing our method is to reduce the cost of enumerating all possible tree structures that match the query. We show that the notion of functional dependencies has an important role in generating efficient query schedules that avoid irrelevant tree structures. Our proposed method, the relational-style XML query, has several advantages over traditional XML data management. These include removing the burden of designing strict tree-pattern schemas, enhancing the descriptions of relational data with XML's rich semantics, and taking advantage of schema evolution capability of XML. In addition, the independence of query statements from the underlying XML structure is advantageous for integrating XML data from several sources. We present extensive experimental results that confirm the scalability and tolerance of our query method for various sizes of XML data containing structural variations.
Collision Avoidance in Hierarchical Peer-to-Peer Systems
Authors: Yong Meng Teo, Marian Mihailescu
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In a two-level Chord-based hierarchical peer-to-peer system, nodes from the first-level overlay network, called supernodes, act as gateways to peers organized in the second-level overlay. Collision occurs when peer-to-peer operations create more than one supernode with the same node identifier in the first-level overlay. Collisions are reported to enlarge first-level overlay by more than 12 times the ideal size and thus increase the lookup path length. Other consequences of collisions include lookup failures even though the lookup resources exist in the network and reduced scalability of the system. In contrast to collision detection and correction techniques, this paper proposes: (i) a collision-free approach for the join and leave operations, and (ii) a new stabilization scheme to recover from second-level overlay node failures. However, avoiding collision due to supernode failures is complex and remains a challenge. Simulation results show that collisions can be avoided and our algorithms improve the overall system performance.