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: This paper shows that connected operators work implicitly on a structured representation of the image made of flat zones, and proposes the max-tree as a suitable and efficient structure to deal with the processing steps involved in antiextensive connected operators.
Abstract: This paper deals with a class of morphological operators called connected operators. These operators filter the signal by merging its flat zones. As a result, they do not create any new contours and are very attractive for filtering tasks where the contour information has to be preserved. This paper shows that connected operators work implicitly on a structured representation of the image made of flat zones. The max-tree is proposed as a suitable and efficient structure to deal with the processing steps involved in antiextensive connected operators. A formal definition of the various processing steps involved in the operator is proposed and, as a result, several lines of generalization are developed. First, the notion of connectivity and its definition are analyzed. Several modifications of the traditional approach are presented. They lead to connected operators that are able to deal with texture. They also allow the definition of connected operators with less leakage than the classical ones. Second, a set of simplification criteria are proposed and discussed. They lead to simplicity-, entropy-, and motion-oriented operators. The problem of using a nonincreasing criterion is analyzed. Its solution is formulated as an optimization problem that can be very efficiently solved by a Viterbi (1979) algorithm. Finally, several implementation issues are discussed showing that these operators can be very efficiently implemented.
656 citations
••
TL;DR: A multicriteria decision-making method is established in which the evaluation values of alternatives with respective to criteria are represented by the form of SNSs, and the ranking order of alternatives is performed through the cosine similarity measure between an alternative and the idealAlternative and the best ones can be determined.
Abstract: The paper introduces the concept of simplified neutrosophic sets SNSs, which are a subclass of neutrosophic sets, and defines the operational laws of SNSs. Then, we propose some aggregation operators, including a simplified neutrosophic weighted arithmetic average operator and a simplified neutrosophic weighted geometric average operator. Based on the two aggregation operators and cosine similarity measure for SNSs, a multicriteria decision-making method is established in which the evaluation values of alternatives with respective to criteria are represented by the form of SNSs. The ranking order of alternatives is performed through the cosine similarity measure between an alternative and the ideal alternative and the best ones can be determined as well. Finally, a numerical example shows the application of the proposed method.
649 citations
••
TL;DR: In this paper, a perturbative asymptotic Bethe ansatz was used to derive the three-loop S-matrix of the closed fermionic (1|1) sector of the = 4 gauge theory.
Abstract: We argue that the recently discovered integrability in the large-N CFT/AdS system is equivalent to diffractionless scattering of the corresponding hidden elementary excitations. This suggests that, perhaps, the key tool for finding the spectrum of this system is neither the gauge theory's dilatation operator nor the string sigma model's quantum hamiltonian, but instead the respective factorized S-matrix. To illustrate the idea, we focus on the closed fermionic (1|1) sector of the = 4 gauge theory. We introduce a new technique, the perturbative asymptotic Bethe ansatz, and use it to extract this sector's three-loop S-matrix from Beisert's involved algebraic work on the three-loop (2|3) sector. We then show that the current knowledge about semiclassical and near-plane-wave quantum strings in the (2), (1|1) and (2) sectors of AdS5 × S5 is fully consistent with the existence of a factorized S-matrix. Analyzing the available information, we find an intriguing relation between the three associated S-matrices. Assuming that the relation also holds in gauge theory, we derive the three-loop S-matrix of the (2) sector even though this sector's dilatation operator is not yet known beyond one loop. The resulting Bethe ansatz reproduces the three-loop anomalous dimensions of twist-two operators recently conjectured by Kotikov, Lipatov, Onishchenko and Velizhanin, whose work is based on a highly complex QCD computation of Moch, Vermaseren and Vogt.
638 citations
••
TL;DR: In this article, the psu(2,2|4) dilatation operator of N = 4 Super YangMills theory is presented, which generates the matrix of one-loop anomalous dimensions for all local operators in the theory.
634 citations
•
01 Jun 1989
TL;DR: This dissertation describes an empirical investigation into whether it can be convincingly argued that these probabilities should vary over the course of a genetic algorithm run so as to account for changes in the ability of the operators to produce children of increased strength.
Abstract: In the vast majority of genetic algorithm implementations, the operator probabilities are xed throughout a given run. However, it can be convincingly argued that these probabilities should vary over the course of a genetic algorithm run | so as to account for changes in the ability of the operators to produce children of increased tness. This dissertation describes an empirical investigation into this question. The e ect upon genetic algorithm performance of adaptation methods upon both well-studied theoretical problems, and a hard problem from Operations Research | the owshop sequencing problem, is examined. Acknowledgements I would rst of all like to thank my supervisor, Dr Peter Ross, for his valuable guidance of the research reported here. Thanks also to Dave Corne and the members of the DAI EC group for their occasional advice. Thanks to the other MScs who have provided a very enjoyable working atmosphere. Special thanks to Michael L, Emma C, Mike F, Richard W and Larry F (for proving that heartless Canadians are the exception rather than the rule!). Mention and gratitude must also go to Pete, Daren, Jon, Evonne and Rob for their entertaining and supportive email. I also have to thank Dave and Elaine for providing the same support over more mundane communication methods! I am grateful to Keith and Frankie Tuson for their encouragement and nancial support during my academic career. Extra special thanks must go to Dr Hugh Cartwright of the Physical and Theoretical Chemistry Laboratory at Oxford University. His supervision of my chemistry Part II research project proved to be a turning point for me, and inspired my interest in AI no amount of malt whisky can express my gratitude enough. Finally, I thank the EPSRC who provided nancial support during my year of study via studentship no: 94415692. Dedication I would like to dedicate this dissertation to my family: Laurence, Margaret and Karen Tuson who have supported and encouraged me throughout my academic career. i Table of
632 citations