Topic
Operator (computer programming)
About: Operator (computer programming) is a research topic. Over the lifetime, 40896 publications have been published within this topic receiving 671452 citations. The topic is also known as: operator symbol & operator name.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is shown that the properties of the sequence of representation functions are essentially not changed by replacing the widely used exponential kernel with other kernels, which makes it possible to overcome in a way the constraint imposed by the original theorem in the case of a single window.
144 citations
Patent•
07 Jan 2008
TL;DR: In this article, a planter monitor system and a method that provides an operator with near real-time data concerning yield robbing events and the economic cost associated with such yield-robbing events so as to motivate the operator to take prompt corrective action.
Abstract: A planter monitor system and method that provides an operator with near real-time data concerning yield robbing events and the economic cost associated with such yield robbing events so as to motivate the operator to take prompt corrective action.
144 citations
26 Jun 2000
TL;DR: A general completeness theorem for iteration operators is proved, relying on a new, purely syntactic characterisation of the free iteration theory, and it is shown how iteration operators arise in axiomatic domain theory.
Abstract: We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One result derives them from the existence of sufficiently many bifree algebras (exploiting the universal property Freyd introduced in his notion of algebraic compactness). Another result shows that, in the presence of a parameterized natural numbers object and an equational lifting monad, any uniform fixed-point operator is necessarily an iteration operator.
144 citations
01 Jan 1992
TL;DR: A general purpose Mathematica™ package for computing Operator Product Expansions of composite operators in meromorphic conformal field theory is described, presenting two explicit examples: the conformal anomaly for superstrings and a free field realization for the Kac-Moody-algebra.
Abstract: A general purpose Mathematica™ package for computing Operator Product Expansions of composite operators in meromorphic conformal field theory is described. Given the OPEs for a set of “basic” fields, OPEs of arbitrarily complicated composites can be computed automatically. Normal ordered products are always reduced to a standard form. Two explicit examples are presented: the conformal anomaly for superstrings and a free field realization for the $\widehat{B_2}$ Kac-Moody-algebra.
144 citations
TL;DR: An ordered weighted distance measure is developed, which is the generalization of some widely used distance measures, and can relieve the influence of unduly large or unduly small deviations on the aggregation results by assigning them low (or high) weights.
Abstract: The aim of this paper is to develop an ordered weighted distance (OWD) measure, which is the generalization of some widely used distance measures, including the normalized Hamming distance, the normalized Euclidean distance, the normalized geometric distance, the max distance, the median distance and the min distance, etc. Moreover, the ordered weighted averaging operator, the generalized ordered weighted aggregation operator, the ordered weighted geometric operator, the averaging operator, the geometric mean operator, the ordered weighted square root operator, the square root operator, the max operator, the median operator and the min operator are also the special cases of the OWD measure. Some methods depending on the input arguments are given to determine the weights associated with the OWD measure. The prominent characteristic of the OWD measure is that it can relieve (or intensify) the influence of unduly large or unduly small deviations on the aggregation results by assigning them low (or high) weights. This desirable characteristic makes the OWD measure very suitable to be used in many actual fields, including group decision making, medical diagnosis, data mining, and pattern recognition, etc. Finally, based on the OWD measure, we develop a group decision making approach, and illustrate it with a numerical example.
144 citations