On Lexicographical Translation in Bilingual Dictionaries and its Multi-disciplinary Theoretical Basis

Traditionally, in the field of bilingual lexicography, the main task for lexicographers is to provide lexical equivalents in bilingual dictionaries by all possible means. And accordingly, how to provide appropriate or satisfying translation equivalents in bilingual dictionaries is always the centre of attention in bilingual metalexicography. However, the history of bilingual lexicography shows that it has never been an easy task, because of linguistic and cultural anisomorphism. The usual compromise made by most lexicographers is to introduce partial or explanatory equivalents. This recourse means that most bilingual lexicographers, unfortunately, more than often, fail to meet the needs of foreign language learners. Certain misconceptions about the translation equivalents emerge among the language learners, which explains the awkward situation that besets bilingual exicographers. The present contribution aims at perceiving lexicographical translation as a dynamic process by which an adequate semantic system in the target language would be set up to serve as a functionally equivalent defining system. By doing this, bilingual lexicographers should establish a powerful target language semantic network, in which lexicographical sections like verbal illustrations, usage notes and etymologies, etc. would be considered together with the translation equivalents as an integrated whole. This is an attempt to describe the essential features of lexicographical translation and its multi-disciplinary theoretical basis, in the hope that future practice in bilingual lexicography might be improved.

Primal Dual Algorithms for the Lexicographically Optimal Base of a Submodular Polyhedron and Its Relation to a Poset Greedoid

We show that for a submodular polyhedron and its dual supermodular polyhedron the exists a unique lexicographically optimal base with respect to a weight vector and they coincide.We also present a dual algorithm to get the lexicograpllically optima base of a submodular polyhedron which works on its dula superlnodular polyhedron.This dual algorithm completely agrees to the algorithm of Morton,G.and von Tandow,R.and Ringwald,K.[1985],where their underlying distributive lattice is a chaill poset greedoid.Finally we show that finding the lesicographically optimal base of a submodular system is essentially equivalent to finding the lexicographically optimal base of a simple submodular system,where its underlying distributive lattice is a poset greedoid.This fact.indicates the importance of greedoids in a further development of submodular system theory.

The Path-Positive Property on the Products of Graphs

The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product of graphs and the strong direct product of graphs. It is proved that:① If the graphs G 1 and G 2 are the connected graphs, then the Cartesian product, the lexicographic product and the strong direct product in the products of graphs, are the path positive graphs. ② If the tensor product is a path positive graph if and only if the graph G 1 and G 2 are the connected graphs, and the graph G 1 or G 2 has an odd cycle and max{ λ 1μ 1,λ nμ m}≥2 in which λ 1 and λ n [ or μ 1 and μ m] are maximum and minimum characteristic values of graph G 1 [ or G 2 ], respectively.

Prime Box Parallel Search Algorithm: Searching Dynamic Dictionary in O(lg m) Time

Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size.

The SA Method on Large Scale Goal Programming with Independent Subsystems

ＴｈｅＳＡＭｅｔｈｏｄｏｎＬａｒｇｅＳｃａｌｅＧｏａｌＰｒｏｇｒａｍｍｉｎｇｗｉｔｈＩｎｄｅｐｅｎｄｅｎｔＳｕｂｓｙｓｔｅｍｓＺＨＡＮＧＪｉｅ；ＦＥＮＧＹｉｎｇｊｕｎ张杰，冯英浚（Ｄｅｐｔ．ｏｆＭａｔｈｅｍａｔｉｃｓ，ＨａｒｂｉｎＩｎｓｔｉｔｕｔｅｏ...

谈谈术语工作中的几个问题

谈谈术语工作中的几个问题全国术语标准化技术委员会第一分委员会全如瑊ＴｅｒｍｉｎｏｌｏｇｙＷｏｒｋｉｎＣｈｉｎａｉｎｔｈｅＰａｓｔＤｅｃａｄｅ￥ＱｕａｎＲｕｘｉａｎ（Ｔｈｅ１ｓｔＳｕｂｃｏｍｍｉｔｔｅｅ，ＣＮＴＣＴＳ）Ａｂｓｔｒａｃｔ：Ａｂｒｉｅｆｒｅ...

Lexicographic Image Hash Based on Space and Frequency Features

A lexicographic image hash method based on space and frequency features was proposed. At first, the image database was constructed, and then color and texture features were extracted from the image blocks including information for every image in the database, which formed feature vectors. The feature vectors were clustered to form dictionary. In hash generation, the image was preproc^ssed and divided into blocks firstly. Then color and texture features vectors were extracted from the blocks. These feature vectors were used to search the dictionary, and the nearest word in dictionary for each block was used to form the space features. At the same time. frequency feature was extracted from each block. The space and frequency features were connected to form the intermediate hash. Lastly, the final hash sequence was obtained by pseudo-randomly permuting the intermediate hash. Experiments show that the method has a very low probability of collision and a good perception of robustness. Compared with other methods, this method has a low collision rate.

Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements

In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w 【n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.

Scheduling Jobs with a Common Due Date via Cooperative Game Theory

Efficient values from Game Theory are used, in order to find out a fair allocation for a scheduling game associated with the problem of scheduling jobs with a common due date. A four person game illustrates the basic ideas and the computational difficulties.

Modeling of Catfish Farm Using Lexicographic Linear Goal Programming

In this paper, a fish farm was modeled using the Lexicographic linear goal programming approach due to incommensurability in objectives. The study considered the fish farming plan with two sizes of catfish from stocking to harvesting at four-month intervals. The multi-objective goals developed are required raw materials feed, water, light (resource utilization), sales revenue, profit realized, labor utilization, production costs, and pond utilization. The developed model was tested using related data collected from the farm records with the use of TORA 2007 software. The compromised solution from the results showed that the developed model is an efficient tool for decision-making process in the fish farm business organization.

Multi-objective process parameter optimization for energy saving in injection molding process

This paper deals with a multi-objective parameter optimization framework for energy saving in injection molding process.It combines an experimental design by Taguchi's method,a process analysis by analysis of variance(ANOVA),a process modeling algorithm by artificial neural network(ANN),and a multi-objective parameter optimization algorithm by genetic algorithm(GA)-based lexicographic method.Local and global Pareto analyses show the trade-off between product quality and energy consumption.The implementation of the proposed framework can reduce the energy consumption significantly in laboratory scale tests,and at the same time,the product quality can meet the pre-determined requirements.

Linear algorithm for lexicographic enumeration of CFG parse trees

We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is established. Then grammar-based algorithms for counting and enumerating CFG parse trees in this order are presented. To generate a parse tree of height n, the time complexity is O（n）. If τ is a lowest parse tree for its yield, then O（n） =O（｜｜τ｜｜ ＋ 1）, where ｜｜τ｜｜ is the length of the sentence （yield） generated by τ. The sentence can be obtained as a by-product of the parse tree. To compute sentence from its parse tree （needn＇t be lowest one）, the time complexity is O（node）＋O（｜｜τ｜｜ ＋ 1）, where node is the number of non-leaf nodes of parse tree τ. To generate both a complete lowest parse tree and its yield at the same time, the time complexity is O（｜｜τ｜｜ ＋ 1）.

On the Well-posedness of the PWM Control System

One of the basic issues in the study of hybrid systems is the well-posedness(existence and uniqueness of solutions)problem of discontinuous dynamical systems.This paper addresses this problem for a class of piecewise affine discontinuous systems with affine inequalities such as systems with pulse-width modulator under the definition of Carathéodory solutions in terms of an analysis based on lexicographic inequalities and the smooth continuation property of solutions.Furthermore,it is clear that when carrier signal h(t)=0,closed-loop pulse-width modulation(PWM)DC–DC converters are not well posed,and when some condition is satisfied,the closed-loop PWM DC–DC converters with a P controller are well posed.

Language and society as seen by Xu Shen, an ancient Chinese lexicographer

In this study,I propose to discuss XuShen’s views on language and society asdisplayed in his Shuo Wen Jie Zi （121 C.E.）1, which remained for 18 centuries arevered work in Chinese classical studiesbut whose sociolinguistic insights seem tohave been left quite unstudied and perhapseven unrecognized.It will be my aim toshow that Xu Shen views language in thecontext of society and that a rich body ofcommunal beliefs might be gathered frommany of the major groupings in this dic-tionary.

Some Minimax Problems in Lexicographic Order

In this paper, minimax theorems and saddle points for a class of vector-valued mappings f（x, y） = u（x） ＋ β（x）v（y） are first investigated in the sense of lexicographic order, where u, v are two general vector-valued mappings and β is a non-negative real-valued function. Then, by applying the existence theorem of lexicographic saddle point, we investigate a lexicographic equilibrium problem and establish an equivalent relationship between the lexicographic saddle point theorem and existence theorem of a lexicographic equilibrium problem for vector-valued mappings.

Algebraic Properties of Universal Squarefree Lexsegment Ideals

Let K be a field and let A = K[X1,...,Xn] be the polynomial ring in X1, ..., Xn with coefficients in K. In this paper we study the universal squarefree lexsegment ideals, and put our attention on their combinatorics computing some invariants. Moreover, we study the link between such a special class of squarefree lexsegment ideals and the so-called s-sequences.

Antimagicness of Lexicographic Product Graph G[Pn]

Hartsfield and Ringel conjectured that every connected graph other than K2 is antimagic.Since then,many classes of graphs have been proved to be antimagic.But few is known about the antimagicness of lexicographic product graphs.In this paper,via the construction of a directed Eulerian circuit,the Siamese method,and some modification on graph labeling,the antimagicness of lexicographic product graph G[Pn]is obtained.

On Finite Noncommutative Grobner Bases

It is well known that in the noncommutative polynomial ring in serveral variables Buchberger's algorithm does not always terminate.Thus,it is important to characterize noncommutative ideals that admit a finite Grobner basis.In this context,Eisenbud,Peeva and Sturmfels defined a mapγfrom the noncommutative polynomial ring k〈X_(1),...,X_(n)〉to the commutative one k[x_(1),...,x_(n)]and proved that any ideal J of k〈X_(1),...,X_(n)〉,written as J=γ^(-1)(L)for some ideal L of k[x_(1),...,x_(n)],amits a finite Grobner basis with respect to a special monomial ordering on k〈X_(1),...,X_(n)〉.In this work,we approach the opposite problem.We prove that under some conditions,any ideal J of k〈X_(1),...,X_(n)〉admitting a finite Grobner basis can be written as J=γ^(-1)(L)for some ideal L of k[x_(1),...,x_(n)].

Residuated Completely Simple Semigroups

We consider particular compatible orders on a given completely simple semi- group Sx= M（（x）; I, A; P） where （x） is an ordered cyclic group with x 〉 1 and p11= x-1. Of these, only the lexicographic and bootlace orders yield residuated semigroups. With the lexicographic order, Sx is orthodox and has a biggest idempotent. With the bootlace order, the maximal idempotents of Sx are identified by specific locations in the sandwich matrix. In the orthodox case there is also a biggest idempotent and, for sandwich matrices of a given size, uniqueness up to ordered semigroup isomorphism is established.

Pareto lexicographic a-robust approach and its application in robust multi objective assembly line balancing problem

Robustness in most of the literature is associated with rain-max or min-max regret criteria. However, these criteria of robustness are conservative and therefore recently new criteria called, lexicographic a- robust method has been introduced in literature which defines the robust solution as a set of solutions whose quality orjth largest cost is not worse than the best possible jth largest cost in all scenarios. These criteria might be significant for robust optimization of single objective optimization problems. However, in real optimization problems, two or more than two conflicting objectives are desired to optimize concurrently and solution of multi objective optimization problems exists in the form of a set of solutions called Pareto solutions and from these solutions it might be difficult to decide which Pareto solution can satisfy rain-max, min-max regret or lexico- graphic a-robust criteria by considering multiple objectives simultaneously. Therefore, lexicographic a-robust method which is a recently introduced method in literature is extended in the current research for Pareto solutions. The proposed method called Pareto lexicographic a-robust approach can define Pareto lexicographic a-robust solu- tions from different scenarios by considering multiple objectives simultaneously. A simple example and an application of the proposed method on a simple problem of multi objective optimization of simple assembly line balancing problem with task time uncertainty is presented to get their robust solutions. The presented method can be significant to implement on different multi objective robust optimization problems containing uncertainty.