Results 1  10
of
1,667,253
Relations and their basic properties
 Journal of Formalized Mathematics
, 1989
"... Summary. We define here: mode Relation as a set of pairs, the domain, the codomain, and the field of relation; the empty and the identity relations, the composition of relations, the image and the inverse image of a set under a relation. Two predicates, = and ⊆, and three functions, ∪, ∩ and \ are ..."
Abstract

Cited by 1060 (6 self)
 Add to MetaCart
Summary. We define here: mode Relation as a set of pairs, the domain, the codomain, and the field of relation; the empty and the identity relations, the composition of relations, the image and the inverse image of a set under a relation. Two predicates, = and ⊆, and three functions
Basic concepts and taxonomy of dependable and secure computing
 IEEE TDSC
, 2004
"... This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic defin ..."
Abstract

Cited by 779 (6 self)
 Add to MetaCart
This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic
Airborne Laser Scanning: Basic Relations and Formulas
 ISPRS Journal of Photogrammetry & Remote Sensing
, 1999
"... An overview of basic relations and formulas concerning airborne laser scanning is given. They are divided into two main parts, the first treating lasers and laser ranging, and the second one referring to airborne laser scanning. A separate discussion is devoted to the accuracy of 3D positioning and ..."
Abstract

Cited by 152 (3 self)
 Add to MetaCart
An overview of basic relations and formulas concerning airborne laser scanning is given. They are divided into two main parts, the first treating lasers and laser ranging, and the second one referring to airborne laser scanning. A separate discussion is devoted to the accuracy of 3D positioning
The Simple Economics of Basic Scientific Research
 Journal of Political Economy
, 1959
"... I begin this essay by reflecting on my early paper (Nelson, 1859), and Ken’s (Arrow, 1962), as period pieces. These papers certainly have been influential in shaping the discussion of science and technology policy over the last forty years, at least among economists, but at the time they were writte ..."
Abstract

Cited by 438 (5 self)
 Add to MetaCart
of this conference: issues relating to intellectual property. Both to link the discussion to my old paper, and because my own recent research has been focused there, I shall focus particularly on the patenting of “science”. Finally, I will consider the institutional division of labor in research and development
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 546 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear
Relative absorptive capacity and interorganizational learning
 STRATEGIC MANAGEMENT JOURNAL
, 1998
"... Much of the prior research on interorganizational learning has focused on the role of absorptive capacity, a firm’s ability to value, assimilate, and utilize new external knowledge. However, this definition of the construct suggests that a firm has an equal capacity to learn from all other organizat ..."
Abstract

Cited by 463 (2 self)
 Add to MetaCart
organizations. We reconceptualize the firmlevel construct absorptive capacity as a learning dyadlevel construct, relative absorptive capacity. One firm’s ability to learn from another firm is argued to depend on the similarity of both firms ’ (1) knowledge bases, (2) organizational structures and compensation
Reinforcement Learning I: Introduction
, 1998
"... In which we try to give a basic intuitive sense of what reinforcement learning is and how it differs and relates to other fields, e.g., supervised learning and neural networks, genetic algorithms and artificial life, control theory. Intuitively, RL is trial and error (variation and selection, search ..."
Abstract

Cited by 5614 (118 self)
 Add to MetaCart
In which we try to give a basic intuitive sense of what reinforcement learning is and how it differs and relates to other fields, e.g., supervised learning and neural networks, genetic algorithms and artificial life, control theory. Intuitively, RL is trial and error (variation and selection
Compressed sensing
, 2004
"... We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal numbe ..."
Abstract

Cited by 3625 (22 self)
 Add to MetaCart
We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal
Highly Dynamic DestinationSequenced DistanceVector Routing (DSDV) for Mobile Computers
, 1994
"... An adhoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such adhoc networks. The basic idea of the design is to operate each Mobile Host as a ..."
Abstract

Cited by 2076 (8 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such adhoc networks. The basic idea of the design is to operate each Mobile Host
Results 1  10
of
1,667,253