• 경영과학
• /
• 제26권1호
• /
• pp.171-182
• /
• 2009

We consider the inventory replenishment problem and the vehicle routing problem simultaneously in the vending machine operation. This problem is known as the inventory routing problem. We design a memory cell in the clonal selection algorithm. The memory cell store the best solution of previous solved problem and use an initial solution for next problem. In general, the other clonal selection algorithm used memory cell for reserving the best solution in current problem. Experiments are performed for testing efficiency of the memory cell in demand uncertainty. Experiment result shows that the solution quality of our algorithm is similar to general clonal selection algorithm and the calculations time is reduced by 20% when the demand uncertainty is less than 30%.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제13권3호
• /
• pp.181-195
• /
• 2009

Students' approaches to mathematical problem solving vary greatly with each other. The main objective of the current study was to compare students' performance with different thinking styles (divergent vs. convergent) and working memory capacity upon mathematical problem solving. A sample of 150 high school girls, ages 15 to 16, was studied based on Hudson's test and Digit Span Backwards test as well as a math exam. The results indicated that the effect of thinking styles and working memory on students' performance in problem solving was significant. Moreover, students with divergent thinking style and high working memory capacity showed higher performance than ones with convergent thinking style. The implications of these results on math teaching and problem solving emphasizes that cognitive predictor variable (Convergent/Divergent) and working memory, in particular could be challenging and a rather distinctive factor for students.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5234-5251
• /
• 2018

It is well-known that virtualization technology can bring many benefits not only to users but also to service providers. From the view of system security and resource utility, higher resource sharing degree and higher system reliability can be obtained by the introduction of virtualization technology in distributed cloud. The small size time-sharing multiplexing technology which is based on virtual machine in distributed cloud platform can enhance the resource utilization effectively by server consolidation. In this paper, the concept of memory block and user satisfaction is redefined combined with user requirements. According to the unbalanced memory resource states and user preference requirements in multi-virtual machine environments, a model of proper memory resource allocation is proposed combined with memory block and user satisfaction, and at the same time a memory optimization allocation algorithm is proposed which is based on virtual memory block, makespan and user satisfaction under the premise of an orderly physical nodes states also. In the algorithm, a memory optimal problem can be transformed into a resource workload balance problem. All the virtual machine tasks are simulated in Cloudsim platform. And the experimental results show that the problem of virtual machine memory resource allocation can be solved flexibly and efficiently.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
• /
• pp.1335-1338
• /
• 2003

Fixed-size memory allocation is one of the most promising way to avoid external fragmentation in dynamic memory allocation problem. This paper presents an experimental result of applying the fixed- size memory allocation strategy to Java virtual machine for embedded system. The result says that although this strategy induces another memory utilization problem caused by internal fragmentation, the effect is not very considerable and this strategy is well-suited for embedded Java system. The experiment has been performed in a real embedded Java system called the simpleRTJ.

• 대한수학회지
• /
• 제42권1호
• /
• pp.37-52
• /
• 2005

We consider the existence of solutions of viscoelastic degenerate problem of Kirchhoff type with nonlinear boundary damping and memory term. Moreover, we consider the uniform decay of the energy for the problem.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.236-246
• /
• 2008

We consider the Inventory Routing problem(IRP) for the vending machine operating system. An artificial immune system(AIS) is introduced to solve the IRP. The IPR is an rolling wave planning. The previous solution of IRP is one of good initial solution of current IRP. We introduce an Artificial Immune system with memory cell (AISM) which store previous solution in memory cell and use an initial solution for current problem. Experiment results shows that AISM reduced calculations time in relatively less demand uncertainty.

• International Journal of Computer Science & Network Security
• /
• 제24권4호
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• 디지털산업정보학회논문지
• /
• 제5권3호
• /
• pp.59-67
• /
• 2009

This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제7권8호
• /
• pp.307-324
• /
• 2018

최근 순환 신경 망(Recurrent Neural Networks)은 시간에 대한 의존성을 고려한 구조를 통해 순차 데이터(Sequential data)의 예측 문제 해결에서 각광받고 있다. 하지만 순차 데이터의 시간 스텝이 늘어남에 따라 발생하는 그라디언트 소실(Gradients vanishing)이 문제로 대두되었다. 이를 해결하기 위해 장단기 기억 모델(Long Short-Term Memory)이 제안되었지만, 많은 데이터를 저장하고 장기간 보존하는 데에 한계가 있다. 따라서 순환 신경망과 메모리 요소(Memory component)를 활용한 학습 모델인 메모리-증대 신경망(Memory-Augmented Neural Networks)에 대한 연구가 최근 활발히 진행되고 있다. 본 논문에서는 딥 러닝(Deep Learning) 분야의 화두로 떠오른 메모리-증대 신경망 주요 모델들의 구조와 특징을 열거하고, 이를 활용한 최신 기법들과 향후 연구 방향을 제시한다.

• 한국복합재료학회:학술대회논문집
• /
• 한국복합재료학회 2005년도 춘계학술발표대회 논문집
• /
• pp.226-230
• /
• 2005

본 논문에서는 MWCNT 분산도가 증가된 새로운 전도성 형상 기억 폴리우레탄을 연구하였고 전기적 특성을 검출하기 위한 실험과 작동 성능을 측정하기 위한 실험들을 수행하였다. 전이온도 이하 범위에서의 온도변화에 따른 저항변화는 거의 없었으며, 시편이 100% 신장됨에 따라 저항값도 100% 증가하였다 (비저항 300% 증가). 작동변위는 페이로드가 증가함에 따라 선형적으로 줄어들었다. 그리고, CSMPU 작동기의 보다 세부적인 특성 및 성능을 알기 위해서는 더 많은 연구와 실험이 필요하다.