• 한국경영과학회지
• /
• 제20권1호
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

• East Asian mathematical journal
• /
• 제27권1호
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• 대한수학회보
• /
• 제48권5호
• /
• pp.1033-1039
• /
• 2011

Let R be a ring with identity 1, I(R) be the set of all idempotents in R and G be the group of all units of R. In this paper, we show that for any semiperfect ring R in which 2 = 1+1 is a unit, I(R) is closed under multiplication if and only if R is a direct sum of local rings if and only if the set of all minimal idempotents in R is closed under multiplication and eGe is contained in the group of units of eRe. In particular, for a left Artinian ring in which 2 is a unit, R is a direct sum of local rings if and only if the set of all minimal idempotents in R is closed under multiplication.

• 호남수학학술지
• /
• 제23권1호
• /
• pp.1-4
• /
• 2001

In [2, 7.3.2], the set of attached prime ideals of local cohomology module $H_m^n(M)$ were calculated, where (A, m) be Noetherian local ring, M finite A-module and $dim_A(M)=n$, and also in the special case in which furthermore A is a homomorphic image of a Gornestien local ring (A', m') (see [2, 11.3.6]). In this paper, we shall obtain this set, by another way in this special case.

• Journal of Information Technology Applications and Management
• /
• 제12권3호
• /
• pp.27-39
• /
• 2005

The Semantic Web has increased the interest in ontologies recently Ontology is an essential component of the semantic web and continues to change and evolve. We consider versions management schemes in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. Our change specification is represented by a set of changes. A set of changes consists of instance data change, structural change, and identifier change. In order to support a query in ontology versions, we consider temporal dimension includes valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the ontology versions management schemes that are 1) storing all the change sets, 2) storing the aggregation of change sets periodically, and 3) storing the aggregation of change sets using an adaptive criterion. We conduct a set of experiments to compare the performance of each versions management schemes. We present the experimental results for evaluating the performance of the three version management schemes from scheme 1 to scheme 3. Scheme 1 has the least storage usage. The average response time in Scheme 1 is extremely large, those of Scheme 3 is smaller than Scheme 2. Scheme 3 shows a good performance relatively.

• 경영과학
• /
• 제15권1호
• /
• pp.77-85
• /
• 1998

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.

• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.157-165
• /
• 2002

The fuzzification of convex sets in median algebras is considered, and some of their properties are investigated. A characterization of finite valued fuzzy convex set is given.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제28권1호
• /
• pp.41-45
• /
• 1989

Subdifferentiability of a vector-valued set function is defined first. Then in terms of zero-like functions, a perperly efficient solution of a convex programming problem with set functions will be characterized.

• 대한수학회보
• /
• 제28권2호
• /
• pp.243-254
• /
• 1991

For a given function f.mem.F and a set of functions J.subeq.F, the problem of isotonic optimization is to determine an element in the set nearest to f in some sense. Specifically, let X be a partially ordered finite set with a partial order << and, let F"=F(X) be the linear space of all bounded real valued functions on X. A function g.mem.F is said to be an isotonic function if g(x).leq.g(y) whenever x,y.mem.X and x << y.<< y.

• 비파괴검사학회지
• /
• 제5권1호
• /
• pp.3-8
• /
• 1985

A three dimensional vision is obtained by stereoscopic view using a modified commercial TV set and matching color filter glasses. Two video signals from two CCTV cameras are connected to the RGB (red, green, blue) inputs of picture tube selecting two different colors for two video signals. A synchronizing signal drives a CCTV camera and the color TV set. On the other hand, a delayed synchronizing signal drives the other CCTV camera shifting its image on display. This shift is used in correcting image distortion.