Results 1  10
of
16,856
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis
Raptor codes
 IEEE Transactions on Information Theory
, 2006
"... LTCodes are a new class of codes introduced in [1] for the purpose of scalable and faulttolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LTCodes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
, and the original symbols are recovered from the collected ones with O(k log(1/ε)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions
Theory of Elasticity,
, 1951
"... ABSTRACT The knowledge of the insitu stress field in rock masses is in general of crucial importance in various areas of geoengineering, such as mining or civil underground excavations, hydrocarbon extraction, CO2 storage, hydraulic fracture operations, etc. In the context of the Finite Element ..."
Abstract

Cited by 710 (1 self)
 Add to MetaCart
ABSTRACT The knowledge of the insitu stress field in rock masses is in general of crucial importance in various areas of geoengineering, such as mining or civil underground excavations, hydrocarbon extraction, CO2 storage, hydraulic fracture operations, etc. In the context of the Finite Element
An overview of data warehousing and OLAP technology
 SIGMOD Record
, 1997
"... Data warehousing and online analytical processing (OLAP) are essential elements of decision support, which has increasingly become a focus of the database industry. Many commercial products and services are now available, and all of the principal database management system vendors now have offering ..."
Abstract

Cited by 386 (3 self)
 Add to MetaCart
Data warehousing and online analytical processing (OLAP) are essential elements of decision support, which has increasingly become a focus of the database industry. Many commercial products and services are now available, and all of the principal database management system vendors now have
Partitioning of Unstructured Problems for Parallel Processing
, 1991
"... Many large scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address th ..."
Abstract

Cited by 344 (16 self)
 Add to MetaCart
Many large scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address
Solving ShapeAnalysis Problems in Languages with Destructive Updating
 POPL '96
, 1996
"... This paper concerns the static analysis of programs that perform destructive updating on heapallocated storage. We give an algorithm that conservatively solves this problem by using a finite shapegraph to approximate the possible “shapes” that heapallocated structures in a program can take on. In ..."
Abstract

Cited by 306 (20 self)
 Add to MetaCart
This paper concerns the static analysis of programs that perform destructive updating on heapallocated storage. We give an algorithm that conservatively solves this problem by using a finite shapegraph to approximate the possible “shapes” that heapallocated structures in a program can take on
The Partition of Unity Finite Element Method: Basic Theory and Applications
, 1996
"... The paper presents the basic ideas and the mathematical foundation of the partition of unity nite element method (PUFEM). We will show howthe PUFEM can be used to employ the structure of the differential equation under consideration to construct effective and robust methods. Although the method and ..."
Abstract

Cited by 251 (8 self)
 Add to MetaCart
The paper presents the basic ideas and the mathematical foundation of the partition of unity nite element method (PUFEM). We will show howthe PUFEM can be used to employ the structure of the differential equation under consideration to construct effective and robust methods. Although the method
Oligomorphic permutation groups
 LONDON MATHEMATICAL SOCIETY STUDENT TEXTS
, 1999
"... A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of ntuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their grouptheoretic pro ..."
Abstract

Cited by 320 (26 self)
 Add to MetaCart
A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of ntuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their group
Spectral partitioning works: planar graphs and finite element meshes, in:
 Proceedings of the 37th Annual Symposium on Foundations of Computer Science,
, 1996
"... Abstract Spectral partitioning methods use the Fiedler vectorthe eigenvector of the secondsmallest eigenvalue of the Laplacian matrixto find a small separator of a graph. These methods are important components of many scientific numerical algorithms and have been demonstrated by experiment to wo ..."
Abstract

Cited by 201 (10 self)
 Add to MetaCart
to work extremely well. In this paper, we show that spectral partitioning methods work well on boundeddegree planar graphs and finite element meshesthe classes of graphs to which they are usually applied. While naive spectral bisection does not necessarily work, we prove that spectral partitioning
Building Finite Element Analysis Programs in Distributed Services Environment
, 2004
"... Traditional finite element analysis (FEA) programs are typically built as standalone desktop software. This paper describes an Internetenabled framework that facilitates building a FEA program as distributed web services. The framework allows users easy access to the FEA core service and the analys ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Traditional finite element analysis (FEA) programs are typically built as standalone desktop software. This paper describes an Internetenabled framework that facilitates building a FEA program as distributed web services. The framework allows users easy access to the FEA core service
Results 1  10
of
16,856