The present article studies the specific cultural features contained in phraseological units. The problem is approached through three different levels:
- The modern linguistic meaning.
- Lexical components of phraseological units.
- The first variables of linguistic units.
The paper emphasizes the gradual process of the cultural charge in the semantic structure of phraseological units.
Наша Статья посвящена вопросам анализа национ-ально - культурной специфики ФЕ . Это проблема рассмат-ривается на трех уровнях:
1) в совркупном фразеологич-еском значении,2) в значении отдельных лексических компонентов ФЕ,3) в значении переменного прототипа ФЕ.Мы здесь подчеркиваем , что градуальный характер проявления национально – специфичной информации, закодированной в значени Фразеологизмов.
The main purpose of this work is to introduce some types of fuzzy convergence sequences of operators defined on a standard fuzzy normed space (SFN-spaces) and investigate some properties and relationships between these concepts. Firstly, the definition of weak fuzzy convergence sequence in terms of fuzzy bounded linear functional is given. Then the notions of weakly and strongly fuzzy convergence sequences of operators are introduced and essential theorems related to these concepts are proved. In particular, if ( ) is a strongly fuzzy convergent sequence with a limit where linear operator from complete standard fuzzy normed space into a standard fuzzy normed space then belongs to the set of all fuzzy bounded linear operators
Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through tha
... Show MoreIn this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreIn this study, we propose a suitable solution for a non-linear system of ordinary differential equations (ODE) of the first order with the initial value problems (IVP) that contains multi variables and multi-parameters with missing real data. To solve the mentioned system, a new modified numerical simulation method is created for the first time which is called Mean Latin Hypercube Runge-Kutta (MLHRK). This method can be obtained by combining the Runge-Kutta (RK) method with the statistical simulation procedure which is the Latin Hypercube Sampling (LHS) method. The present work is applied to the influenza epidemic model in Australia in 1919 for a previous study. The comparison between the numerical and numerical simulation res
... Show MoreWe introduce in this paper the concept of approximaitly semi-prime submodules of unitary left -module over a commutative ring with identity as a generalization of a prime submodules and semi-prime submodules, also generalization of quasi-prime submodules and approximaitly prime submodules. Various basic properties of an approximaitly semi-prime submodules are discussed, where a proper submodule of an -module is called an approximaitly semi-prime submodule of , if whenever , where , and , implies that . Furthermore the behaviors of approximaitly semi-prime submodule in some classes of modules are studied. On the other hand several characterizations of this concept are
... Show MoreLet R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if
the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are introduced and given some properties .
In this paper, an attempt was made to measure and interpret the impact of several variables on global maritime transport, including: OECD industrial productions, high growth rates of some developing countries, and growth in world GDP. These variables contribute to higher rates of maritime transport revenues of 800 billion dollars annually; in the form of numerical sequences. The dry canal in Iraq was assumed to transfer 99 million tons of goods annually. This was made sure through the economic feasibility of the difference between maritime and land transport through railways. The effect of geographical and anthropological nature of Iraq on this project was studied too. Our findings indicated that the project will not drive growth
... Show MoreLet G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric