• Journal of Elementary Mathematics Education in Korea
• /
• v.21 no.3
• /
• pp.531-546
• /
• 2017

This study explores the basis for determining priority among the four arithmetical operations in order to provide useful pedagogical content knowledge for teaching the order of operations. The study also discusses the perspective for viewing the order of operations. It presents the following five suggestions based on the results of the discussion. First, teachers should be made to realize that the same result can be obtained on calculation even when subtraction and division are performed first in mixed operations of addition and subtraction and mixed operations of multiplication and division. Second, teachers should understand why the rule of calculating sequentially from the left side of an equation has become customary. Third, teachers should be offered an explanation for the driver of the rule setting that multiplication takes precedence over addition in mixed operations of multiplication and addition. Fourth, the significance of the quantity within parenthesis must be emphasized to teachers. Fifth, teachers must gain an in-depth understanding about the order of operations by getting a description of all the customary and conceptual perspectives on the order of operations when describing the same in the teacher's guide.

• CDE review
• /
• v.13 no.1
• /
• pp.14-19
• /
• 2007

PLM과 ERP의 정보 및 프로세스 통합은 개개의 기여도 함보다는 훨씬 큰 종합적인 이익을 가져오기 위하여 조직 전반에 걸쳐서 사용자들의 생산성을 제고한다. 그러나 이러한 이익을 얻기 위하여 정보는 조직을 통하여 자유로운 흐름이 있어야 한다. 이러한 통합의 범위를 결정하는 것은 복잡한 작업이 될 수 있다. 반드시 고려되어야 할 인자로는 다음과 같다. - 데이터 및 포로세스 소유권 - 정보의 마스터 출처 정의 - 필요한 통합 수준 - 제품 설계 및 생산의 두 영역에 걸쳐있는 프로세스를 어떻게 관리할 것인가? - 공통된 용어를 사용 각 회사에서 PLM과 ERP를 통합하는 최상의 방법을 결정할 때, 필요로 하는 것에 우선권을 두어야 한다. 즉, 희망하는 것 보다는 비즈니스상 요구되는 사항에 대한 것이다. 개발, 초기적용, 진행중인 유지보수를 포함하여 소유총비용(total cost of ownership)을 계산한다. PLM-ERP 통합은 데이터 통합 그 이상의 작업임을 명심하여야 한다. 이익을 최대화하기 위하여 제품과 관련된 정보, 프로세스. 조직 및 구성원의 광범위한 범위를 포함하여야 한다. 기업의 진취적인 노력에도 불구하구, 경영진의 지원은 성공에 결정적이다. 고심하고 있는 경영진이나 문제들을 인정하고 있는 사람들은 제품개발 프로세스 내에서 PLM과 ERP 통합의 필요성, 솔루션 및 이익에 대하여 필요한 교육을 제공받는 것을 필요로 하고 있다. 더욱이 그들은 성공을 보장하는 통합, 지침제공, 후원 및 자원의 사전 행동하는 지지자가 되기를 희망한다.

• Information Systems Review
• /
• v.22 no.1
• /
• pp.17-31
• /
• 2020

With the start of the fourth industrial revolution era, technologies of various fields are merged and new types of technologies and products are being developed. In addition, the importance of the registration of intellectual property rights and patent registration to gain market dominance of them is increasing in oversea as well as in domestic. Accordingly, the number of patents to be processed per examiner is increasing every year, so time and cost for prior art research are increasing. Therefore, a number of researches have been carried out to reduce examination time and cost for patent-pending technology. This paper proposes a method to calculate the degree of similarity among patent documents of the same priority claim when a plurality of patent rights priority claims are filed and to provide them to the examiner and the patent applicant. To this end, we preprocessed the data of the existing irregular patent documents, used Word2vec to obtain similarity between patent documents, and then proposed recommendation model that recommends a similar patent document in descending order of score. This makes it possible to promptly refer to the examination history of patent documents judged to be similar at the time of examination by the examiner, thereby reducing the burden of work and enabling efficient search in the applicant's prior art research. We expect it will contribute greatly.

• Journal of Navigation and Port Research
• /
• v.47 no.6
• /
• pp.401-409
• /
• 2023

This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.7
• /
• pp.22-28
• /
• 2009

As multiprocessors have been widely adopted in embedded systems, task computation energy consumption should be minimized with several low power techniques supported by the multiprocessors. This paper proposes an energy-aware task scheduling algorithm that adopts both dynamic voltage scaling and power shutdown in multiprocessor environments. Considering the timing and energy overhead of power shutdown, the proposed algorithm performs an iterative task assignment and task ordering for multiprocessor systems. In this case, the iterative priority-based task scheduling is adopted to obtain the best solution with the minimized total energy consumption. Total energy consumption is calculated by considering a linear programming model and threshold time of power shutdown. By analyzing experimental results for standard task graphs based on real applications, the resource and timing limitations were analyzed to maximize energy savings. Considering the experimental results, the proposed energy-aware task scheduling provided meaningful performance enhancements over the existing priority-based task scheduling approaches.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.147-153
• /
• 2011

In this paper, we present a new video management technique using forward timeline to efficiently store and delete the videos on a local server. The proposed method is based on capturing the changing preference of the videos according to recentness, frequency, and playback length of the requested videos. For this purpose, we utilize the forward timeline which represents the time area within a number of predefined intervals. The local server periodically measures time popularity and request segment of all videos. Based on the measured data, time popularity and request segment, the local server calculates the mean time popularity and mean request segment of a video using forward timeline. Using mean time popularity and mean request segment of video, we estimate the ranking and allocated storage space of a video. The ranking represents the priority of deletion when the storage area of local server is running out of space and the allocated storage space means the maximum size of storage space to be allocated to a video. In addition, we propose an efficient storage space partitioning technique in order to stably store videos and present a time based free-up storage space technique using the expected variation of video data in order for avoiding the overflow on a local server in advance. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, our video management technique for local server provides the lowest user start-up latency and the highest bandwidth saving significantly.