Results 1  10
of
14,498
Stefania R. Jha Abstract NEOPOLANYIAN EPISTEMOLOGY AND ETHICS –
"... Recently there has been a revival of interest in Polanyi’s epistemology. In the following I will sketch a brief proposal for a NeoPolanyian ethics based on a schematized form of his tacit knowledge epistemology. I premise the sketch on the assumption that Polanyi’s theory of tacit knowing is not a ..."
Abstract
 Add to MetaCart
Recently there has been a revival of interest in Polanyi’s epistemology. In the following I will sketch a brief proposal for a NeoPolanyian ethics based on a schematized form of his tacit knowledge epistemology. I premise the sketch on the assumption that Polanyi’s theory of tacit knowing is not a full system of philosophy but is a set of interlocking analogical descriptions of functions of human ways of understanding the world and morality. The proposed neoPolanyian ethics has the potential to overcome the limitations of Polanyi’s specialized model for an ethical community, the scientific community. We need a model which is more heterogeneous in terms of cognitive and historical factors mirroring the society at large, and which is a democracy of voluntarily association. Part 1. The Epistemology of tacit knowing, its schematized structure and function with respect to ethics A. Structure Polanyi’s epistemology of tacit knowing can be schematized as a continuum with two poles in which attention is directed from the features or clues of the situation or thing, to the whole, 1 in shorthand form ‘fromto knowing. ’ 2 We may be unable to specify the clues, these internal processes on which we rely, but these clues support our recognition of the whole, the situation or thing. The ‘whole ’ is the meaning of the act of recognition — we attend to the whole the subject of which can be specified. To better ground my proposal, I am introducing here Polanyi’s 1937 notion of ‘judicial attitude. ’ He did not analyze this notion. ‘Judicial Attitude ’ 3 is used with 1
Parametric Shape Analysis via 3Valued Logic
, 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract

Cited by 660 (79 self)
 Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...
On Projection Algorithms for Solving Convex Feasibility Problems
, 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract

Cited by 330 (44 self)
 Add to MetaCart
of these algorithms, a very broad and flexible framework is investigated . Several crucial new concepts which allow a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence are brought out. Numerous examples are given. 1991 M.R. Subject Classification. Primary 47H
Learning String Edit Distance
, 1997
"... In many applications, it is necessary to determine the similarity of two strings. A widelyused notion of string similarity is the edit distance: the minimum number of insertions, deletions, and substitutions required to transform one string into the other. In this report, we provide a stochastic mo ..."
Abstract

Cited by 248 (2 self)
 Add to MetaCart
In many applications, it is necessary to determine the similarity of two strings. A widelyused notion of string similarity is the edit distance: the minimum number of insertions, deletions, and substitutions required to transform one string into the other. In this report, we provide a stochastic model for string edit distance. Our stochastic model allows us to learn a string edit distance function from a corpus of examples. We illustrate the utility of our approach by applying it to the difficult problem of learning the pronunciation of words in conversational speech. In this application, we learn a string edit distance with nearly one fifth the error rate of the untrained Levenshtein distance. Our approach is applicable to any string classification problem that may be solved using a similarity function against a database of labeled prototypes.
Construction and Commissioning of the CALICE Analog Hadron Calorimeter Prototype The CALICE Collaboration
, 2010
"... J.Ha ..."
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 244 (21 self)
 Add to MetaCart
this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first order language of graphs (respectively groups, binary strings, etc.) together with a least fixed point operator. As another example, a property is in logspace if and only if it is expressible in first order logic together with a deterministic transitive closure operator. The roots of our approach to complexity theory go back to 1974 when Fagin showed that the NP properties are exactly those expressible in second order existential sentences. It follows that second order logic expresses exactly those properties which are in the polynomial time hierarchy. We show that adding suitable transitive closure operators to second order logic results in languages capturing polynomial space and exponential time, respectively. The existence of such natural languages for each important complexity class sheds a new light on complexity theory. These languages reaffirm the importance of the complexity classes as much more than machine dependent issues. Furthermore a whole new approach is suggested. Upper bounds (algorithms) can be produced by expressing the property of interest in one of our languages. Lower bounds may be demonstrated by showing that such expression is impossible.
Wavelet and Multiscale Methods for Operator Equations
 Acta Numerica
, 1997
"... this paper is to highlight some of the underlying driving analytical mechanisms. The price of a powerful tool is the effort to construct and understand it. Its successful application hinges on the realization of a number of requirements. Some space has to be reserved for a clear identification of th ..."
Abstract

Cited by 225 (39 self)
 Add to MetaCart
this paper is to highlight some of the underlying driving analytical mechanisms. The price of a powerful tool is the effort to construct and understand it. Its successful application hinges on the realization of a number of requirements. Some space has to be reserved for a clear identification of these requirements as well as for their realization. This is also particularly important for understanding the severe obstructions, that keep us at present from readily materializing all the principally promising perspectives.
Results 1  10
of
14,498