Artykuły w czasopismach: „Lexicographical ordering”

1

Tung, Cheng-Tan. "Note on lexicographical ordering". International journal of Emerging Trends in Science and Technology 04, nr 05 (12.05.2017): 5165–70. http://dx.doi.org/10.18535/ijetst/v4i5.06.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Eghbali, Sepehr, i Ladan Tahvildari. "Test Case Prioritization Using Lexicographical Ordering". IEEE Transactions on Software Engineering 42, nr 12 (1.12.2016): 1178–95. http://dx.doi.org/10.1109/tse.2016.2550441.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Aptoula, E., i S. Lefèvre. "On lexicographical ordering in multivariate mathematical morphology". Pattern Recognition Letters 29, nr 2 (styczeń 2008): 109–18. http://dx.doi.org/10.1016/j.patrec.2007.09.011.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Lescanne, Pierre. "On the recursive decomposition ordering with lexicographical status and other related orderings". Journal of Automated Reasoning 6, nr 1 (marzec 1990): 39–49. http://dx.doi.org/10.1007/bf00302640.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Er, M. C. "Lexicographical Ordering of k-Subsets of a Set". Journal of Information and Optimization Sciences 7, nr 2 (maj 1986): 113–16. http://dx.doi.org/10.1080/02522667.1986.10698845.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Cox, James L., Stephen Lucci i Tayfun Pay. "Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem". Inteligencia Artificial 22, nr 63 (10.01.2019): 1–15. http://dx.doi.org/10.4114/intartif.vol22iss63pp1-15.

Pełny tekst źródła

Streszczenie:

We carry out a detailed analysis of the effects of different dynamic variable and value ordering heuristics on the search space of Sudoku when the encoding method and the filtering algorithm are fixed. Our study starts by examining lexicographical variable and value ordering and evaluates different combinations of dynamic variable and value ordering heuristics. We eventually build up to a dynamic variable ordering heuristic that has two rounds of tie-breakers, where the second tie-breaker is a dynamic value ordering heuristic. We show that our method that uses this interlinked heuristic outperforms the previously studied ones with the same experimental setup. Overall, we conclude that constructing insightful dynamic variable ordering heuristics that also utilize a dynamic value ordering heuristic in their decision making process could drastically improve the search effort for some constraint satisfaction problems.

Style APA, Harvard, Vancouver, ISO itp.

7

MOU, Chen-qi. "Design of termination criterion of BMS algorithm for lexicographical ordering". Journal of Computer Applications 32, nr 11 (26.05.2013): 2977–80. http://dx.doi.org/10.3724/sp.j.1087.2012.02977.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Wu, Yaping, i Huiqing Liu. "Lexicographical ordering by spectral moments of trees with a prescribed diameter". Linear Algebra and its Applications 433, nr 11-12 (grudzień 2010): 1707–13. http://dx.doi.org/10.1016/j.laa.2010.06.022.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Fuertes-Olivera, Pedro A. "Specialised Lexicography for Learners: Specific Proposals for the Construction of Pedagogically-oriented Printed Business Dictionaries". HERMES - Journal of Language and Communication in Business 22, nr 42 (30.08.2017): 167. http://dx.doi.org/10.7146/hjlcb.v22i42.96851.

Pełny tekst źródła

Streszczenie:

The function theory of lexicography argues that specialised lexicographical products must help learners to transform their information needs into aspects of knowledge of the discipline, and of its discursive properties. Lexicographers, then, must combine information and data access with the user’s need for information and knowledge. To achieve this aim they need to devise theories providing solutions to different lexicographical problems. One such theory has recently been proposed by Tarp (2008), who claims that there are four categories which are central to a general theory of learner’s lexicography: users, user situation, user needs, and dictionary assistance. This paper focuses on dictionary assistance and addresses several lexicographical issues connected with polysemy: the selection of the lemmata of some printed English-Spanish/Spanish-English business dictionaries, their entry structures, sense differentiation, and sense ordering. The analysis leads the author to discuss some proposals with the aim of making business dictionaries more pedagogically oriented, and to include a set of principles pedagogically-oriented business dictionaries must have. They are illustrated in a model entry which has been compiled by rearranging one of the entries studied according to the proposals and principles previously discussed.

Style APA, Harvard, Vancouver, ISO itp.

10

Farhadinia, B. "Hesitant fuzzy set lexicographical ordering and its application to multi-attribute decision making". Information Sciences 327 (styczeń 2016): 233–45. http://dx.doi.org/10.1016/j.ins.2015.07.057.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Vazquez Noguera, Jose Luis, Christian E. Schaerer, Jacques Facon i Horacio Legal Ayala. "Adaptive RGB Color Lexicographical Ordering Framework Using Statistical Parameters From the Color Component Histogram". IEEE Access 7 (2019): 141738–53. http://dx.doi.org/10.1109/access.2019.2943840.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Cheng, Bo, i Bolian Liu. "Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions". Applied Mathematics Letters 25, nr 5 (maj 2012): 858–61. http://dx.doi.org/10.1016/j.aml.2011.10.032.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Daciuk, Jan, Stoyan Mihov, Bruce W. Watson i Richard E. Watson. "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics 26, nr 1 (marzec 2000): 3–16. http://dx.doi.org/10.1162/089120100561601.

Pełny tekst źródła

Streszczenie:

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings. Our method is fast and significantly lowers memory requirements in comparison to other methods.

Style APA, Harvard, Vancouver, ISO itp.

14

Fatichah, Chastine, Martin Leonard Tangel, Muhammad Rahmat Widyanto, Fangyan Dong i Kaoru Hirota. "Interest-Based Ordering for Fuzzy Morphology on White Blood Cell Image Segmentation". Journal of Advanced Computational Intelligence and Intelligent Informatics 16, nr 1 (20.01.2012): 76–86. http://dx.doi.org/10.20965/jaciii.2012.p0076.

Pełny tekst źródła

Streszczenie:

An Interest-based Ordering Scheme (IOS) for fuzzy morphology on White-Blood-Cell (WBC) image segmentation is proposed to improve accuracy of segmentation. The proposed method shows a high accuracy in segmenting both high- and low-density nuclei. Further, its running time is low, so it can be used for real applications. To evaluate the performance of the proposed method, 100 WBC images and 10 leukemia images are used, and the experimental results show that the proposed IOS segments a nucleus in WBC images 3.99% more accurately on average than the Lexicographical Ordering Scheme (LOS) does and 5.29% more accurately on average than the combined Fuzzy Clustering and Binary Morphology (FCBM) method does. The proposal method segments a cytoplasm 20.72% more accurately on average than the FCBM method. The WBC image segmentation is a part of WBC classification in an automatic cancer-diagnosis application that is being developed. In addition, the proposed method can be used to segment any images that focus on the important color of an object of interest.

Style APA, Harvard, Vancouver, ISO itp.

15

Mentynska, Iryna. "STAGES OF ESTABLISHMENT OF COMPUTER TERMINOLOGY AGAINST THE BACKGROUND OF THE DEVELOPMENT OF INFORMATION TECHNOLOGIES IN UKRAINE". Theory and Practice of Teaching Ukrainian as a Foreign Language, nr 17 (25.06.2023): 181–90. http://dx.doi.org/10.30970/ufl.2023.17.3927.

Pełny tekst źródła

Streszczenie:

The article traces the formation of computer terminology against the background of the development of information technologies in Ukraine. Important stages of establishment of this field of knowledge are highlighted. Special attention is paid to the main lexicographical works, which became basic in the formation of the term system. The relevance of scientific research is determined by the need for a scientific description of the history of the development of Ukrainian computer terminology, as well as the need to determine the periodization of the formation of Ukrainian computer terminology. To realize the goal, the following tasks were completed1) describe the development of IT technologies in Ukraine; 2) the main stages of the adoption of computer terms against the background of the development of the computer industry are revealed; 3) lexicographical works that became basic in the formation of the computer sphere were carefully considered; 4) the peculiarities of the functioning of computer terms at each stage of development are established. The study of the history of the formation and development of industry terminology against the background of the development of information technologies in Ukraine makes it possible to determine the main regularities of the formation of the term system, to forecast the trends of its development using logical and linguistic ordering and a well-founded lexicographic description. The development and systematization of computer terminology are complex and ambiguous. We single out five important stages of the establishment of the computer industry against the background of the development of IT technologies in Ukraine: the 1st stage (beginning of the 20th century); 2nd (1941–1959); 3rd (1960-1989); 4th (1990–2000); 5th (early 2000 – until today). We trace that the emergence of information technologies in Ukraine dates back to 1914, however, due to intralingual and extra lingual factors, Ukrainian computer terminology developed sluggishly during the first and second periods. However, the fourth and fifth periods are characterized by rapid development and consistent systematization of the branch terminology. The main lexicographic works, which can be called basic in the formation of computer terminology, were the dictionaries of the 20 and 30 years of the 20th century. An important basis for establishing and codifying computer term units is the “Cybernetics Encyclopedia”, and at the current stage of development, online dictionaries of they IT. In the future, it would be worth investigating the stages of development of thermographic processing in the computer industry in Ukraine and abroad. Key words: terminology, term, computer terminology, computer technologies, lexicographic works.

Style APA, Harvard, Vancouver, ISO itp.

16

Sezan, Ibrahim. "Image Recovery Using Set-Theoretic Methods". Proceedings, annual meeting, Electron Microscopy Society of America 48, nr 1 (12.08.1990): 446–47. http://dx.doi.org/10.1017/s0424820100180987.

Pełny tekst źródła

Streszczenie:

Recently, there is some interest in the application of set-theoretic methods to the solution of the image recovery problem in electron microscopy. Several current studies have reported promising results.The purpose of this paper is to introduce set-theoretic methods to the electron microscopy community.In electron microscopy, the image recovery problem refers to obtaining an estimate of the ideal three-dimensional (3-D) image distribution from its incomplete and possibly noisy Fourier transform data.In the spatial domain, the recovery problem is stated on the basis of the observation equation:where vectors g, f and n ∈ RN denote the lexicographical ordering of the (N-voxel) measured (degraded) image distribution, the ideal image distribution and the noise processes, respectively. The operator D : RN → RN denotes the degradation operator that effectively limits the data to the “data cone” in the frequency domain. The degradation operator can be adequately modeled by a space-invariant (convolutional) operator, and therefore D has a block-Toeplitz structure.

Style APA, Harvard, Vancouver, ISO itp.

17

Ristic, Stana, Ivana Lazic-Konjik i Nenad Ivanovic. "The metalanguage of a lexicographic definition in the descriptive dictionary (based on the dictionaries of the Serbian language)". Juznoslovenski filolog 74, nr 1 (2018): 81–96. http://dx.doi.org/10.2298/jfi1801081r.

Pełny tekst źródła

Streszczenie:

In this paper we present the continuous hierarchical ordering of the first part of the definition of lexemes from the thematic group ?buildings? by analyzing the vertical organization of superordination of concepts in the lexicographical definition. We demonstrate that the vertical sequence mounts from a higher level of conceptual categorization, ?localizer,? in the form of complex and simple primitives (PLACE > SPACE [WHERE], SPACE > EXPANSE [SOMETHING THAT IS (BOUNDLESSLY) SPREADING IN EVERY DIRECTION]) and descends toward a lower hyperonimic level of ?buildings?. The suggested model links meanings systematically, on a micro-level of meaning within the polysemic structure, and on a macrolevel of meanings of lexemes belonging to a thematic group/class, which is significant for the descriptive lexicography and for the modeling of semantic description in the electronic dictionary of the contemporary Serbian language. Such description could facilitate the cross-referencing of lexemes and advanced search, which is essential both for linguists and dictionary users.

Style APA, Harvard, Vancouver, ISO itp.

18

König, Jason. "RE-READING POLLUX: ENCYCLOPAEDIC STRUCTURE AND ATHLETIC CULTURE IN ONOMASTICON BOOK 3". Classical Quarterly 66, nr 1 (maj 2016): 298–315. http://dx.doi.org/10.1017/s0009838816000331.

Pełny tekst źródła

Streszczenie:

Ioulios Polydeukes, more commonly known as Pollux, was a Greek sophist and lexicographer active in the closing decades of the second century a.d. His Onomasticon is one of the most important lexicographical texts of the Imperial period. It is essentially a set of word lists dedicated to collecting clusters of related words on topics from a vast range of different areas of intellectual activity and everyday life. The text survives only in epitomized form, and shows signs of interpolation as well as abridgement. Nevertheless, the consensus is that the bulk of what survives is Pollux’ own work, and that reading it in Eric Bethe's Teubner edition gives an accurate cumulative impression of Pollux’ standard procedures and preoccupations, even if we cannot be entirely confident that any particular cluster of words had exactly the same form within the text's original design. It is divided into ten books, each with its own dedicatory preface addressed to the Emperor Commodus. Each book has its own distinctive focus on certain key themes, although the ordering principles are much clearer in some than in others.

Style APA, Harvard, Vancouver, ISO itp.

19

Melançon, Guy, i Christophe Reutenauer. "Lyndon Words, Free Algebras and Shuffles". Canadian Journal of Mathematics 41, nr 4 (1.08.1989): 577–91. http://dx.doi.org/10.4153/cjm-1989-025-2.

Pełny tekst źródła

Streszczenie:

A Lyndon word is a primitive word which is minimum in its conjugation class, for the lexicographical ordering. These words have been introduced by Lyndon in order to find bases of the quotients of the lower central series of a free group or, equivalently, bases of the free Lie algebra [2], [7]. They have also many combinatorial properties, with applications to semigroups, pi-rings and pattern-matching, see [1], [10].We study here the Poincaré-Birkhoff-Witt basis constructed on the Lyndon basis (PBWL basis). We give an algorithm to write each word in this basis: it reads the word from right to left, and the first encountered inversion is either bracketted, or straightened, and this process is iterated: the point is to show that each bracketting is a standard one: this we show by introducing a loop invariant (property (S)) of the algorithm. This algorithm has some analogy with the collecting process of P. Hall [5], but was never described for the Lyndon basis, as far we know.

Style APA, Harvard, Vancouver, ISO itp.

20

BLOOM, S. L., i Z. ÉSIK. "ALGEBRAIC LINEAR ORDERINGS". International Journal of Foundations of Computer Science 22, nr 02 (luty 2011): 491–515. http://dx.doi.org/10.1142/s0129054111008155.

Pełny tekst źródła

Streszczenie:

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than ωω. It follows that the algebraic ordinals are exactly those less than ωωω.

Style APA, Harvard, Vancouver, ISO itp.

21

Martin, Ursula, i Elizabeth Scott. "The order types of termination orderings on monadic terms, strings and multisets". Journal of Symbolic Logic 62, nr 2 (czerwiec 1997): 624–35. http://dx.doi.org/10.2307/2275551.

Pełny tekst źródła

Streszczenie:

AbstractWe consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order typeω,ω2orωω. We show that a familiar construction gives rise to continuum many such orderings of order typeω. We construct a new family of such orderings of order typeω2, and show that there are continuum many of these. We show that there are only four such orderings of order typeωω, the two familiar recursive path orderings and two closely related orderings. We consider also total well-founded orderings onNnwhich are preserved under vector addition. We show that any such ordering must have order typeωkfor some 1 ≤k≤n. We show that ifk<nthere are continuum many such orderings, and ifk=nthere are onlyn!, then! lexicographic orderings.

Style APA, Harvard, Vancouver, ISO itp.

22

Semenova, Natalia V., Maria M. Lomaga i Viktor V. Semenov. "LEXICOGRAPHIC PROBLEMS OF CONVEX OPTIMIZATION: SOLVABILITY AND OPTIMALITY CONDITIONS, CUTTING PLANE METHOD". Journal of Automation and Information sciences 1 (1.01.2021): 30–40. http://dx.doi.org/10.34229/0572-2691-2021-1-3.

Pełny tekst źródła

Streszczenie:

The lexicographic approach for solving multicriteria problems consists in the strict ordering of criteria concerning relative importance and allows to obtain optimization of more important criterion due to any losses of all another, to the criteria of less importance. Hence, a lot of problems including the ones of complex system optimization, of stochastic programming under risk, of dynamic character, etc. may be presented in the form of lexicographic problems of optimization. We have revealed conditions of existence and optimality of solutions of multicriteria problems of lexicographic optimization with an unbounded convex set of feasible solutions on the basis of applying properties of a recession cone of a convex feasible set, the cone which puts in order lexicographically a feasible set with respect to optimization criteria and local tent built at the boundary points of the feasible set. The properties of lexicographic optimal solutions are described. Received conditions and properties may be successfully used while developing algorithms for finding optimal solutions of mentioned problems of lexicographic optimization. A method of finding lexicographic of optimal solutions of convex lexicographic problems is built and grounded on the basis of ideas of method of linearization and Kelley cutting-plane method.

Style APA, Harvard, Vancouver, ISO itp.

23

Semenova, N. V., M. M. Lomaha i V. V. Semenov. "Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions". Reports of the National Academy of Sciences of Ukraine, nr 12 (grudzień 2020): 19–27. http://dx.doi.org/10.15407/dopovidi2020.12.019.

Pełny tekst źródła

Streszczenie:

Among vector problems, the lexicographic ones constitute a broad significant class of problems of optimization. Lexicographic ordering is applied to establish rules of subordination and priority. Hence, a lot of problems including the ones of complex system optimization, of stochastic programming under a risk, of the dynamic character, etc. may be presented in the form of lexicographic problems of optimization. We have revealed the conditions of existence of solutions of multicriteria of lexicographic optimization problems with an unbounded set of feasible solutions on the basis of applying the properties of a recession cone of a con vex feasible set, the cone which puts it in order lexicographically with respect to optimization criteria. The obtained conditions may be successfully used while developing algorithms for finding the optimal solutions of the mentioned problems of lexicographic optimization. A method of finding the optimal solutions of convex lexico graphic problems with the linear functions of criteria is built and grounded on the basis of ideas of the method of linearization and the Kelley cutting plane method.

Style APA, Harvard, Vancouver, ISO itp.

24

COMON, HUBERT. "SOLVING SYMBOLIC ORDERING CONSTRAINTS". International Journal of Foundations of Computer Science 01, nr 04 (grudzień 1990): 387–411. http://dx.doi.org/10.1142/s0129054190000278.

Pełny tekst źródła

Streszczenie:

We show how to solve boolean combinations of inequations s>t in the Herbrand Universe, assuming that ≥ is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable.

Style APA, Harvard, Vancouver, ISO itp.

25

Kazymyrova, Iryna. "ARCHITECTONICS OF THE REGISTER OF THE HISTORICAL DICTIONARY OF LINGUISTIC TERMS". Terminological Bulletin, nr 6 (2021): 172–79. http://dx.doi.org/10.37919/2221-8807-2021-6-16.

Pełny tekst źródła

Streszczenie:

The article is devoted to compiling a historical dictionary of linguistic terms, particularly the rules of the register’s organization. The importance of theoretical development of the principles of such a dictionary is emphasized, as the ordering of terminological systems should begin with the elucidation of the main tendencies of its historical evolution. One of the dictionary’s crucial components, which ensures access to the reader to the information contained in it, is its register. The article outlines the requirements for this fragment of the terminological dictionary. The scientific expediency of compiling a list of the historical dictionary of linguistic terms is caused by the fact that it will be carried out with its maximum fullness the complete registration of terminological units to denote the concepts of linguistics. An essential result of this work has become a register of the linguistic terms of the outlined period and establishing the theoretical principles of register representation of linguistic terms. In particular, the lexical material’s complexity would enable the organizing of the filling of the register, to reflect the terms variability, transfer in the register its system connections. Comprehensive fixation of the standard variants in the future will allow the compilation of word indexes to the individual linguistic sights. The corpus is based on the register part of the encyclopaedia Ukrainian Language. These are normative from the point of view of modern linguistics terms that represent the subject-logical and categorical-conceptual architecture of the linguistic terminological continuum, such as exclusive linguistic subcategories, crucial universal-linguistic concepts, basic general linguistic categories, unique linguistic super concepts, interdisciplinary linguistic concepts, and highly specialized linguistic concepts. Besides the main linguistic criteria, cultural, historical, literary, and ethnographic criteria for word selection and description are essential. Therefore, the register involves the representative word of modern linguistic terms and all its standard variants, selected from scientific, educational, and lexicographical sources. Filling the dictionary registry should consider that the pattern of variation in the Ukrainian language is very complex and ambiguous, due to the tracing and borrowing of linguistic terms, and instability of spelling rules.

Style APA, Harvard, Vancouver, ISO itp.

26

Law, Yat, Jimmy Lee, May Hiu Woo i Toby Walsh. "A Comparison of Lex Bounds for Multiset Variables in Constraint Programming". Proceedings of the AAAI Conference on Artificial Intelligence 25, nr 1 (4.08.2011): 61–67. http://dx.doi.org/10.1609/aaai.v25i1.7830.

Pełny tekst źródła

Streszczenie:

Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful information about a set such as its cardinality. For set variables, the length-lex (LL) representation successfully provides information about the length (cardinality) and position in the lexicographic ordering. For multiset variables, where elements can be repeated, we consider richer representations that take into account additional information. We study eight different representations in which we maintain bounds according to one of the eight different orderings: length-(co)lex (LL/LC), variety-(co)lex (VL/VC), length-variety-(co)lex (LVL/LVC), and variety-length-(co)lex (VLL/VLC) orderings. These representations integrate together information about the cardinality, variety (number of distinct elements in the multiset), and position in some total ordering. Theoretical and empirical comparisons of expressiveness and compactness of the eight representations suggest that length-variety-(co)lex (LVL/LVC) and variety-length-(co)lex (VLL/VLC) usually give tighter bounds after constraint propagation. We implement the eight representations and evaluate them against the subset bounds representation with cardinality and variety reasoning. Results demonstrate that they offer significantly better pruning and runtime.

Style APA, Harvard, Vancouver, ISO itp.

27

Frisch, Alan M., Brahim Hnich, Zeynep Kiziltan, Ian Miguel i Toby Walsh. "Propagation algorithms for lexicographic ordering constraints". Artificial Intelligence 170, nr 10 (lipiec 2006): 803–34. http://dx.doi.org/10.1016/j.artint.2006.03.002.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Stork, P., i J. M. Viaene. "Policy optimization by lexicographic preference ordering". Journal of Policy Modeling 14, nr 5 (październik 1992): 655–73. http://dx.doi.org/10.1016/0161-8938(92)90035-b.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Sadler, D. Royce. "Lexicographic Decision Rules and Selection for Higher Education". Australian Journal of Education 33, nr 2 (sierpień 1989): 114–26. http://dx.doi.org/10.1177/168781408903300202.

Pełny tekst źródła

Streszczenie:

Currently in Australia, there is a strong demand for places in higher education. At the same time, a variety of methods of measuring and scaling secondary school achievements are used in the different states for making selection decisions, and these methods come under both professional and public scrutiny. A sequential screening procedure has recently been proposed in Queensland. It is based on what is known in decision theory as a ‘lexicographic ordering’. In this article, the concept of a lexicographic ordering is explained, and some of the associated assumptions, implications and shortcomings are examined. It is concluded that a lexicographic decision rule is unsuitable in its classical formulation as a procedure for selecting higher education entrants.

Style APA, Harvard, Vancouver, ISO itp.

30

Er, M. C. "Lexicographic ordering, ranking and unranking of combinations". International Journal of Computer Mathematics 17, nr 3-4 (styczeń 1985): 277–83. http://dx.doi.org/10.1080/00207168508803468.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Jee, Kyung-Wook, Daniel L. McShan i Benedick A. Fraass. "Lexicographic ordering: intuitive multicriteria optimization for IMRT". Physics in Medicine and Biology 52, nr 7 (7.03.2007): 1845–61. http://dx.doi.org/10.1088/0031-9155/52/7/006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Rizza, Davide. "Nonstandard utilities for lexicographically decomposable orderings". Journal of Mathematical Economics 60 (październik 2015): 105–9. http://dx.doi.org/10.1016/j.jmateco.2015.06.012.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Adams, Warren, Pietro Belotti i Ruobing Shen. "Convex hull characterizations of lexicographic orderings". Journal of Global Optimization 66, nr 2 (25.04.2016): 311–29. http://dx.doi.org/10.1007/s10898-016-0435-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

P, Phani Bushan Rao, i Ravi Shankar Nowpada. "Fuzzy Critical Path Method Based on Lexicographic Ordering". Pakistan Journal of Statistics and Operation Research 8, nr 1 (3.01.2012): 139. http://dx.doi.org/10.18187/pjsor.v8i1.178.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

ÉSIK, ZOLTÁN. "ORDINAL AUTOMATA AND CANTOR NORMAL FORM". International Journal of Foundations of Computer Science 23, nr 01 (styczeń 2012): 87–98. http://dx.doi.org/10.1142/s0129054112400060.

Pełny tekst źródła

Streszczenie:

It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than ωω. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to the lexicographic ordering, given by a deterministic finite automaton, the Cantor Normal Form of its order type. It follows that there is a polynomial time algorithm to decide whether two deterministic finite automata accepting well-ordered regular languages accept isomorphic languages. We also give estimates on the state complexity of the smallest "ordinal automaton" representing an ordinal less than ωω, together with an algorithm that translates each such ordinal to an automaton.

Style APA, Harvard, Vancouver, ISO itp.

36

Krishnamurthy, E. V., i B. P. Vickers. "Compact numeral representation with combinators". Journal of Symbolic Logic 52, nr 2 (czerwiec 1987): 519–25. http://dx.doi.org/10.2307/2274398.

Pełny tekst źródła

Streszczenie:

AbstractThis paper is concerned with the combinator representation of numeral systems with logarithmic space complexity of symbols. The principle used is based on the lexicographic ordering of words over a finite alphabet.

Style APA, Harvard, Vancouver, ISO itp.

37

Conversano, Claudio, i Roberta Siciliano. "Incremental Tree-Based Missing Data Imputation with Lexicographic Ordering". Journal of Classification 26, nr 3 (grudzień 2009): 361–79. http://dx.doi.org/10.1007/s00357-009-9038-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Sergeyev, Yaroslav D. "The Olympic Medals Ranks, Lexicographic Ordering, and Numerical Infinities". Mathematical Intelligencer 37, nr 2 (1.01.2015): 4–8. http://dx.doi.org/10.1007/s00283-014-9511-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Saliba, Sleman. "Heuristics for the lexicographic max-ordering vehicle routing problem". Central European Journal of Operations Research 14, nr 3 (12.08.2006): 313–36. http://dx.doi.org/10.1007/s10100-006-0007-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Gupte, Akshay. "Convex hulls of superincreasing knapsacks and lexicographic orderings". Discrete Applied Mathematics 201 (marzec 2016): 150–63. http://dx.doi.org/10.1016/j.dam.2015.08.010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Zobnin, A. I. "One-element differential standard bases with respect to inverse lexicographical orderings". Journal of Mathematical Sciences 163, nr 5 (12.11.2009): 523–33. http://dx.doi.org/10.1007/s10958-009-9690-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Doğan, Battal, i Kemal Yildiz. "Choice with Affirmative Action". Management Science 69, nr 4 (kwiecień 2023): 2284–96. http://dx.doi.org/10.1287/mnsc.2022.4447.

Pełny tekst źródła

Streszczenie:

A choice rule with affirmative action decides on the recipients of a limited number of identical objects by reconciling two objectives: respecting a priority ordering over the applicants and supporting a minority group. We extend the standard formulation of a choice problem by incorporating a type function and a priority ordering and introduce monotonicity axioms on how a choice rule should respond to variations in these parameters. We show that monotonic and substitutable affirmative action rules are the ones that admit a bounded reserve representation. As a prominent class of choice rules that satisfy the monotonicity axioms, we characterize lexicographic affirmative action rules that are prevalent both in the literature and in practice. Our axiomatic approach provides a novel way to think about reserve systems and uncovers choice rules that go beyond lexicographic affirmative action rules. This paper was accepted by Yan Chen, behavioral economics and decision analysis. Funding: B. Doğan gratefully acknowledges financial support from the British Academy/Leverhulme Trust [Grant SRG1819\190133].

Style APA, Harvard, Vancouver, ISO itp.

43

Spoletini, E. "Generation of Permutations in Direct Lexicographic Ordering by Arithmetic Methods". Computer Journal 28, nr 4 (1.04.1985): 444–45. http://dx.doi.org/10.1093/comjnl/28.4.444.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Long, T., M. Matuszak, M. Feng, B. A. Fraass, R. K. Ten Haken i H. E. Romeijn. "Sensitivity analysis for lexicographic ordering in radiation therapy treatment planning". Medical Physics 39, nr 6Part1 (25.05.2012): 3445–55. http://dx.doi.org/10.1118/1.4720218.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Pak, D., M. Feng, E. Ben-Josef, R. Ten Haken, B. Fraass i M. Matuszak. "Weighted Sum Cost Function Versus Lexicographic Ordering for IMRT Treatment Planning". International Journal of Radiation Oncology*Biology*Physics 84, nr 3 (listopad 2012): S795—S796. http://dx.doi.org/10.1016/j.ijrobp.2012.07.2128.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Ziabicki, Andrzej. "The theory of ordering lexicographic entries: Principles, algorithms and computer implementation". Computers and the Humanities 26, nr 2 (kwiecień 1992): 119–37. http://dx.doi.org/10.1007/bf00116348.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Genitrini, Antoine, i Martin Pépin. "Lexicographic Unranking of Combinations Revisited". Algorithms 14, nr 3 (19.03.2021): 97. http://dx.doi.org/10.3390/a14030097.

Pełny tekst źródła

Streszczenie:

In the context of combinatorial sampling, the so-called “unranking method” can be seen as a link between a total order over the objects and an effective way to construct an object of given rank. The most classical order used in this context is the lexicographic order, which corresponds to the familiar word ordering in the dictionary. In this article, we propose a comparative study of four algorithms dedicated to the lexicographic unranking of combinations, including three algorithms that were introduced decades ago. We start the paper with the introduction of our new algorithm using a new strategy of computations based on the classical factorial numeral system (or factoradics). Then, we present, in a high level, the three other algorithms. For each case, we analyze its time complexity on average, within a uniform framework, and describe its strengths and weaknesses. For about 20 years, such algorithms have been implemented using big integer arithmetic rather than bounded integer arithmetic which makes the cost of computing some coefficients higher than previously stated. We propose improvements for all implementations, which take this fact into account, and we give a detailed complexity analysis, which is validated by an experimental analysis. Finally, we show that, even if the algorithms are based on different strategies, all are doing very similar computations. Lastly, we extend our approach to the unranking of other classical combinatorial objects such as families counted by multinomial coefficients and k-permutations.

Style APA, Harvard, Vancouver, ISO itp.

48

Louveau, Alain, i Jean Saint-Raymond. "On the quasi-ordering of Borel linear orders under embeddability". Journal of Symbolic Logic 55, nr 2 (czerwiec 1990): 537–60. http://dx.doi.org/10.2307/2274645.

Pełny tekst źródła

Streszczenie:

AbstractWe provide partial answers to the following problem: Is the class of Borel linear orders well-quasi-ordered under embeddability? We show that it is indeed the case for those Borel orders which are embeddable in Rω, with the lexicographic ordering. For Borel orders embeddable in R2, our proof works in ZFC, but it uses projective determinacy for Borel orders embeddable in some Rn, n < ω, and hyperprojective determinacy for the general case.

Style APA, Harvard, Vancouver, ISO itp.

49

Kubat, Łukasz, i Jan Okniński. "Gröbner-Shirshov Bases for Plactic Algebras". Algebra Colloquium 21, nr 04 (6.10.2014): 591–96. http://dx.doi.org/10.1142/s1005386714000534.

Pełny tekst źródła

Streszczenie:

A finite Gröbner-Shirshov basis is constructed for the plactic algebra of rank 3 over a field K. It is also shown that plactic algebras of rank exceeding 3 do not have finite Gröbner-Shirshov bases associated to the natural degree-lexicographic ordering on the corresponding free algebra. The latter is in contrast with the case of a strongly related class of algebras, called Chinese algebras.

Style APA, Harvard, Vancouver, ISO itp.

50

Comon, Hubert, i Ralf Treinen. "The first-order theory of lexicographic path orderings is undecidable". Theoretical Computer Science 176, nr 1-2 (kwiecień 1997): 67–87. http://dx.doi.org/10.1016/s0304-3975(96)00049-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Lexicographical ordering”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych