• Bulletin of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.45-49
• /
• 1983

If R is ring and M is a right (or left) R-module, then M is called a faithful R-module if, for some a in R, x.a=0 for all x.mem.M then a=0. In [4], R.E. Johnson defines that M is a prime module if every non-zero submodule of M is faithful. Let us define that M is of prime type provided that M is faithful if and only if every non-zero submodule is faithful. We call a right (left) ideal I of R is of prime type if R/I is of prime type as a R-module. This is equivalent to the condition that if xRy.subeq.I then either x.mem.I ro y.mem.I (see [5:3:1]). It is easy to see that in case R is a commutative ring then a right or left ideal of a prime type is just a prime ideal. We have defined in [5], that a chain of right ideals of prime type in a ring R is a finite strictly increasing sequence I$_{0}$.contnd.I$_{1}$.contnd....contnd.I$_{n}$; the length of the chain is n. By the right dimension of a ring R, which is denoted by dim, R, we mean the supremum of the length of all chains of right ideals of prime type in R. It is an integer .geq.0 or .inf.. The left dimension of R, which is denoted by dim$_{l}$ R is similarly defined. It was shown in [5], that dim$_{r}$R=0 if and only if dim$_{l}$ R=0 if and only if R modulo the prime radical is a strongly regular ring. By "a strongly regular ring", we mean that for every a in R there is x in R such that axa=a=a$^{2}$x. It was also shown that R is a simple ring if and only if every right ideal is of prime type if and only if every left ideal is of prime type. In case, R is a (right or left) primitive ring then dim$_{r}$R=n if and only if dim$_{l}$ R=n if and only if R.iden.D$_{n+1}$ , n+1 by n+1 matrix ring on a division ring D. in this paper, we establish the following results: (1) If R is prime ring and dim$_{r}$R=n then either R is a righe Ore domain such that every non-zero right ideal of a prime type contains a non-zero minimal prime ideal or the classical ring of ritght quotients is isomorphic to m*m matrix ring over a division ring where m.leq.n+1. (b) If R is prime ring and dim$_{r}$R=n then dim$_{l}$ R=n if dim$_{l}$ R=n if dim$_{l}$ R<.inf. (c) Let R be a principal right and left ideal domain. If dim$_{r}$R=1 then R is an unique factorization domain.TEX>R=1 then R is an unique factorization domain.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.2
• /
• pp.183-192
• /
• 2001

In a development environment for embedded system with a connection between host and target system, the linker of host system links the cross-compiled object file and modules of target system and downloads the linked object file to the target system. In this research, we separate this linker into the module dependent on object file format and the module independent on object file format. The dependent module gets the linking information independent on file format from the object file, and the independent module actually does the linking process with this linking information_ This separation can improve the portability of development environment for a target system_ Also, our linker does the incremental remote linking that applies relocation not only to the obj ect file to be loaded but also to target's modules to have been loaded_ This incremental remote linking can reduce a linking time than linking by the united modules because of linking by module. The result of measuring linking time for SPEC95 integer benchmarks shows an average of reduction rates of 64.90%. Also, incremental remote linking can improve the comfortability of users who develop programs because users do not consider a downloading order of linking object files. Currently, we developed this linker in the embedded application development environment ESTO [1] to be prepared for a commercial product.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 1999.05a
• /
• pp.539-563
• /
• 1999

이 논문은 정보통신정책 목표와의 연관성 속에서 정보통신연구개발사업의 우선순위를 설정함과 아울러 비용효과성에 바탕을 둔 적정 자원배분 도출하는데 주안점을 두고 있다. 복합적인 목표를 가진 연구개발사업에 대해 사업부문별 그리고 기술분야별로 객관적이면서도 설득력있는 자원배분지침을 마련하기 위하여 본 연구는 다기준의사결정(MCDA: Multi-criteria Decision Analysis) 방법을 채택하고 있다. 이 방법론에서는 사업의 목표와 우선순위 판단기준 및 사업대안이 계층적으로 연계된 분석구조를 설계하여 사업대안의 우선순위를 먼저 설정하고, 여기에 정수계획법(Integer Programming)을 결합하여 사업의 목표와 연계된 비용-편익 관계(Cost-benefit relationship)를 최적화하는 바탕 위에서 사업대안별 자원배분 시나리오를 제시하게 된다. 이러한 절차로 사업부문별 및 기술분야별로 각각 도출된 8개의 자원배분 시나리오는 자원배분 경향치의 안정성(Stability) 분석과 자금지원의 과부족에 대한 현실적 적합성(Relevance) 분석을 거쳐 최종적으로 하나의 적정 자원배분방안으로 수렴되도록 하였다. 우선순위 설정에 기초가 되는 사업대안의 편익에 대한 자료는 전문가의 정성적 판단을 통해 수집되었는데, 이를 위해 정보통신기술 부문에서 활동 중인 중견 이상의 총 58명의 산학연 전문가를 대상으로 한 조사를 실시하였다. 먼저, 기초기반ㆍ전략기술개발사업, 연구ㆍ기술인력양성사업, 산업응용기술개발사업, 기술기반조성사업 등 4대 사업부문에 대해서는 (ⅰ) 정보통신 기술능력의 축적, (ⅱ) 정보통신산업의 경쟁력 강화, (ⅲ) 정보통신기반의 기술고도화, (ⅳ) 정보화를 위한 기술역량의 제고 등 주요 사업의 편익을 나타내는 4개 기준으로 우선 순위를 판단하였고, 정보통신망기술, 전파 및 RF 기술, 정보처리기술, 반도체 소자/설계 기술 등 13개 기술분야에 대해서는 (ⅰ) 공공정책적 임무에 대한 기여, (ⅱ) 기술자립기반의 확충, (ⅲ) 기술발전성과 기술적 파급효과, (ⅳ) 기술적 산물의 시장잠재력 등 기술분야 연구개발을 통한 편익을 나타내는 4개 기준으로 우선순위를 판단하였다. 우선순위는 사업대안에 대한 가중치로 표시되었고, 적정 자원배분방안은 추정된 총예산 규모에 따라 지원수준에 대한 일정한 제약조건 하에서 비용-편익 관계에 따른 자원의 최적 할당량으로 제시되었다. 본 연구는 총예산 규모의 가변성, 사업 및 기술분야 대안의 분류체계에 대한 공감대 부족, 사업목표의 상호연관성과 우선순위 판단기준의 부분적 중첩성 등 여러 제약요인이 있어 도출된 구체적인 수치보다는 방향성에 더 큰 의미를 부여하는 것이 바람직하다. 그러나, 이러한 연구의 한계에도 불구하고 도출된 우선순위와 적정 자원배분방안은 문제해결의 실행타당성을 감안하여 비교적 객관적이고 균형있는 결과로 판단된다.

• Korean Chemical Engineering Research
• /
• v.58 no.3
• /
• pp.346-355
• /
• 2020

This study proposed a new optimization-based decision model for an enterprise resource planning and production scheduling of a pharmaceutical intermediates manufacturing plant. To do this work, we first define the inflow and outflow information as well as the model structure, and develop an optimization model to minimize the production time (i.e., makespan) using a mixed integer linear programing (MILP). The unique feature of the proposed model is that the optimal process scheduling is established based on real-time resource logistics information using a radio frequency identification (RFID) technology, thereby theoretically requiring no material inventories. essential information for process operation, such as the required amount of raw materials and estimated arrival timing to manufacturing plant, is used as logistics constraints in the optimization model to yield the optimal manufacturing scheduling to satisfy final production demands. We illustrated the capability of the proposed decision model by applying the optimization model to two scheduling problems in a real pharmaceutical intermediates manufacturing process. As a result, the optimal production schedule and raw materials order timing were identified to minimize the makespan while satisfying all the product demands.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.46-54
• /
• 2011

In this paper, we propose a low-complexity loop filtering method depending on transform-block regions. Block adaptive loop filter (BALF) was developed to improve about 10% in compression performance for the next generation video coding. The BALF employs the Wiener filter that makes reconstructed frames close to the original ones and transmits filter-related information. However, the BALF requires high computational complexity, while it can achieve high compression performance because the block adaptive loop filter is applied to all the pixels in blocks. The proposed method is a new loop filter that classifies pixels in a block into inner and boundary regions based on the characteristics of the integer transform and derives optimum filters for each region. Then, it applies the selected filters for the inner and/or boundary regions. The decoder complexity can be adjusted by selecting region-dependent filter to be used in the decoder side. We found that the proposed algorithm can reduce 35.5% of computational complexity with 2.56% of compression loss, in case that only boundary filter is used.

• Management & Information Systems Review
• /
• v.33 no.5
• /
• pp.85-95
• /
• 2014

This paper suggested an efficient mathematical model for strategic alliance of liner shipping companies. Even though a few previous research papers proposed the mathematical models for container slot chartering and allocation under liner shipping, those models were nonlinear and very difficult to solve. So their models had limits to apply them to real world problems. On the other hand, the model suggested in this paper is easy to solve and apply to real world problems because it is a integer linear programming model. This paper tried to apply the model to the same example problem as used in existing research paper. Excel add-in program, Premium Solver Platform was used to solve the problem and the optimal allocation and slot chartering for containers were able to be found easily. The result also showed that the total container shipping cost for applying the strategic alliance model was reduced compared to non-strategic alliance model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.221-228
• /
• 2013

It is impossible directly to find a prime number p,q of a large semiprime n = pq using Trial Division method. So the most of the factorization algorithms use the indirection method which finds a prime number of p = GCD(a-b, n), q=GCD(a+b, n); get with a congruence of squares of $a^2{\equiv}b^2$ (mod n). It is just known the fact which the area that selects p and q about n=pq is between $10{\cdots}00$ < p < $\sqrt{n}$ and $\sqrt{n}$ < q < $99{\cdots}9$ based on $\sqrt{n}$ in the range, [$10{\cdots}01$, $99{\cdots}9$] of $l(p)=l(q)=l(\sqrt{n})=0.5l(n)$. This paper proposes the method that reduces the range of p using information obtained from n. The proposed method uses the method that sets to $p_{min}=n_{LR}$, $q_{min}=n_{RL}$; divide into $n=n_{LR}+n_{RL}$, $l(n_{LR})=l(n_{RL})=l(\sqrt{n})$. The proposed method is more effective from minimum 17.79% to maxmimum 90.17% than the method that reduces using $\sqrt{n}$ information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.247-254
• /
• 2008

H.264 provides a good coding efficiency compared with existing video coding standards, H.263, MPEG-4, based on the use of multiple reference frame for variable block size motion estimation, quarter-pixel motion estimation and compensation, $4{\times}4$ integer DCT, rate-distortion optimization, and etc. However, many modules used to increase its performance also require H.264 to have increased complexity so that fast algorithms are to be implemented as practical approach. In this paper, among many approaches, fast mode decision algorithm by skipping variable block size motion estimation and spatial-predictive coding, which occupies most encoder complexity, is proposed. This approach takes advantages of temporal and spatial properties of fast mode selection techniques. Experimental results demonstrate that the proposed approach can save encoding time up to 65% compared with the H.264 standard while maintaining the visual perspectives.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.73-85
• /
• 2000

The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.153-164
• /
• 2010

A program consumes energy by executing its instructions. The amount of cosumed power is mainly proportional to algorithm complexity and it can be calculated by using complexity information. Generally, the complexity of a S/W is estimated by the microprocessor simulator. But, the simulation takes long time why the simulator is a software modeled the hardware and it only provides the information about computational complexity quantitatively. In this paper, we propose a complexity estimation method of analysis of S/W on source code level and produce the complexity metric mathematically. The function-wise complexity metrics give the detailed information about the calculation-concentrated location in function. The performance of the proposed method is compared with the result of the gate-level microprocessor simulator 'SimpleScalar'. The used softwares for performance test are $4{\times}4$ integer transform, intra-prediction and motion estimation in the latest video codec, H.264/AVC. The number of executed instructions are used to estimate quantitatively and it appears about 11.6%, 9.6% and 3.5% of error respectively in contradistinction to the result of SimpleScalar.