• 한국경영과학회지
• /
• 제11권1호
• /
• pp.51-58
• /
• 1986

The propose of this study is to presnet a generalized linear/goal programming software, which has been developed to run on mickrocomputers with at least 512 K bytes of memory. The main characteristics of our algorithm for solving LP/GP problems are outlined as follows ; First, it uses the revised simplex algorithm, which is the most efficient computational procedure for computers. Second, it employs the sparse matrix technique to overcome the limited memory of microcomputers. Last, it uses the modified product form of invers (MPFI) to reduce round-off errors. The test runs with our code written in FORTRAN show that it can be used as an effective tool for solving linear/goal programming problems of considerable size.

• Transactions on Electrical and Electronic Materials
• /
• 제16권5호
• /
• pp.290-292
• /
• 2015

We have reported about bipolar resistive switching effect on Poly[2-methoxy-5-(2-ethylhexyloxy)-1,4-phenylenevinylene]:Graphene oxide composite films, which are sandwiched between aluminum and indium tin oxide electrodes. In this case, I-V sweep curve showed a hysteretic behavior, which varied according to the polarity of the applied voltage bias. The device exhibited excellent switching characteristics, with the ON/OFF ratio being approximately two orders in magnitude. The device had good endurance (10⁵ cycles without degradation) and long retention time (5 × 10³ s) at room temperature. The bistable switching behavior varied according to the trapping and de-trapping of charges on GO sites; the carrier transport was described using the space-charge-limited current (SCLC) model.

• 전기전자학회논문지
• /
• 제17권3호
• /
• pp.229-233
• /
• 2013

We investigated electrical conduction and resistance switching behavior of the Ag/ZnO/Ti structures for random access memory devices. These films were prepared on glass substrate by dc sputtering technique at room temperature. The resistance switching follows unipolar switching mode with small switching voltages (0.4 V - 0.6 V). Two electrical conduction mechanisms dominating the LRS and HRS are Ohmic and trap-controlled space charge limited current, respectively. These both conductions are consistent with the filamentary model. Based on the filamentary model, the switching mechanism was also interpreted.

• 대한임베디드공학회논문지
• /
• 제11권4호
• /
• pp.209-218
• /
• 2016

This paper proposes a new lifetime aware buffer mapping method of a synchronous dataflow (SDF) graph on a hybrid memory system with DRAM and PRAM. Since the number of write operations on PRAM is limited, the number of written samples on PRAM is minimized to maximize the lifetime of PRAM. We improve the utilization of DRAM by mapping more buffers on DRAM through buffer sharing. The problem is formulated formally and solved by an optimal approach of an answer set programming. In experiment, the buffer mapping method with buffer sharing improves the PRAM lifetime by 63%.

• 대한수학교육학회지:학교수학
• /
• 제2권2호
• /
• pp.489-508
• /
• 2000

With the increased use of computational technology, many educators question about spending large amount of class time for dealing with computational algorithms in elementary school math classroom at the expense of more holistic aspects of mathematics such as number sense, spatial sense, problem solving and data management. This paper introduce the new method for learning addition and subtraction so called ‘Mrs. Weill’s Hill’, which is believed as a suitable remedial method for children with mathematical learning disabilities, with perceptual problems, or with limited working memory capacities. This method provides children with external memory strategies by allowing them to solve the addition and subtraction problems in a stage by stage fashion with as many steps as they require. It also gives the child greater flexibility in the solution process and thus helps reduce anxiety.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4098-4116
• /
• 2020

Mobile devices such as smartphones are very attractive targets for augmented reality (AR) services, but their limited resources make it difficult to increase the number of objects to be recognized. When the recognition process is scaled to a large number of objects, it typically requires significant computation time and memory. Therefore, most large-scale mobile AR systems rely on a server to outsource recognition process to a high-performance PC, but this limits the scenarios available in the AR services. As a part of realizing large-scale standalone mobile AR, this paper presents a solution to the problem of accuracy, memory, and speed for large-scale object recognition. To this end, we design our own basic feature and realize spatial locality, selective feature extraction, rough pose estimation, and selective feature matching. Experiments are performed to verify the appropriateness of the proposed method for realizing large-scale standalone mobile AR in terms of efficiency and accuracy.

• 한국컴퓨터정보학회논문지
• /
• 제1권1호
• /
• pp.95-104
• /
• 1996

하프변환은 영상에서 직선을 검출하는데 유용하고 강력한 기법이다 그러나. 전통적인 하프변환의 확장은 원과 타원을 복구하는데 늦은 속포라 과도한 메모리로 인해 제한되어 왔다. 본 논문은 최소자승법을 이용하여 영상에서 하원을 검출하는 방법을 제안한다. 이 방법은 계산비용과 메모리 요구를 감소시킨다. 타원을 검출할 때 타원의 매개변수를 결정하기 위해서 하프변환의 누적을 이용하지 않고 타원의 기하학적 특징을 포함하는 특별한 점을 선택했다. 타원의 매개변수는 그 특별한 점을 사용한 최소자승법으로 계산된다.

• 전자공학회논문지C
• /
• 제34C권2호
• /
• pp.50-60
• /
• 1997

Reconfiguration of a memory array using spare rows and columns has been known to be a useful technique to improve the yield. When the numbers of spare rows and scolumns are limited, respectively, the repair problem is known to be NP-complete. In this paper, we propose the reconfiguration algorithm for an array of memory cells using faulty cel clustering, which removes rows and columns algrithm is the simplest reconfiguration method with the time complexity of $O(n^2)$, where n is the number of faulty cells, however the repair rate is very low. Whereas the exhaustive search algorithm has a high repair rate, but the time complexity is $O(2^n)$. The proposed algorithm provides the same repair rate as the exhaustive search algorithm for almost all cases and runs as fast as the greedy method. It has the time complexity of $O(n^3)$ in the worst case. We show that the propsed algorithm provides more efficient solutions than other algorithms using simulations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.425-426
• /
• 2006

Overdriving schemes are used to improve the response time of liquid crystal display. Typically they are implemented by using LUTs (look-up table) within an image processor. However, the size of LUT is limited by the physical memory size and system cost. In this paper, we present an improved method for LUT implementation using linear interpolation and piecewise least-square polynomial regression. Using the proposed method, the performance of LUT can be improved and memory size of that can be reduced.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2002년도 춘계 학술대회논문집
• /
• pp.158-163
• /
• 2002

In the present study a 3D data visualization and analysis program with stereoscopic viewing is introduced. The GUI of the program is based on Qt-library, while all the graphic rendering is performed with OpenGL library. The program allocates memory dynamically according to the data size so that the problem size is only limited by the computer's hardware memory. The stereoscopic viewing is realized by carefully-calibrated projection and color-masking of red and blue color for the left and right eye, and the only hardware needed for the stereoscopic visualization of 3D data is a cheap and easily-available red/blue glasses. Further work for addition of more functions and options to the present program will be continued.