• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4349-4371
• /
• 2019

Moldable parallel tasks are widely used in different areas, such as weather forecast, biocomputing, mechanical calculation, and so on. Considering the deadline and the speedup, scheduling moldable parallel tasks becomes a difficulty. Past work majorly focuses on the LA (List Algorithms) or OMA (Optimizing the Middle Algorithms). Different from prior work, our work normalizes execution time and makes all tasks have the same scope in normalized execution time: [0,1], and then according to the normalized execution time, a method is used to search for the reference execution time without considering the deadline of tasks. According to the reference execution time, we get an initial scheduling result based on AFCFS (Adaptive First Comes First Served) policy. Finally, a heuristic approach is used to improve the performance of the initial scheduling result. We call our method HSRET (a Heuristic Scheduling method based on Reference Execution Time). Comparisons to other methods show that HSRET has good performance in AWT (Average Waiting Time), AET (Average Execution Time), and PUT (Percentages of Unfinished Tasks).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.511-514
• /
• 1998

This paper proposes efficient methods that integrate and execute local plan rules of task agents in a multi-agent environment. In these methods, each agent's plan rules are represented in a network structure, and these networks are then collected by a single task agent to build a integrated domain network, which is exploited to achieve the goal. Agent problem solving by using the domain network enables a concurrent execution of plan rules that are sequential in nature.

• 한국신뢰성학회:학술대회논문집
• /
• 한국신뢰성학회 2001년도 정기학술대회
• /
• pp.463-469
• /
• 2001

An algorithm is presenter for generating the most probable states in decreasing order of probability of each unit. The proposed new algorithm in this note is compared with the existing methods regarding memory requirement and execution time. Our method is simpler and, judging from the computing experiment, it requires less memory size than the previously known methods and takes comparable execution time to previous methods for an acceptable level of criterion.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권1호
• /
• pp.36-43
• /
• 2016

The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2021년도 추계학술발표대회
• /
• pp.267-269
• /
• 2021

Trusted Execution Environment(TEE) is an execution environment provided by CPU hardware to gain guarantee that the execution context is as expected by the execution requester. Remote attestation of the execution context naturally arises from the concept of TEEs. Many implementations of TEEs use cryptographic remote attestation methods. Though the implementation of attestation may be simple, the implementation of verification may be very complex and heavy. By using a server delegating the verification process of attestation information, one may produce lightweight binaries that may verify peers and establish a secure channel with verified peers.

• 대한영양사협회학술지
• /
• 제6권2호
• /
• pp.71-78
• /
• 2000

Environmental pollution induced by food wastes is considered as one of very serious problems in the world, and it is the most important to reduce the production of food wastes. In this study, environmental campaign for reducing food waste was conducted by applying various campaign methods using such as a bulletin board, intra-network, slogans & posters and news letters, as well as some systems such as penalty and prize in a business & industry foodservice. We investigated customers' recognition and execution degree before and after environmental campaign for the purpose of analyzing the changes of customers' attitude by the campaign. The subjects of this study had generally high level of recognition of environmental problem(3.09 point) compared to the execution degree(1.88 point)(Max. 5 points), implying necessity for the induction of actual execution of food wastes reduction by continuous environmental campaign. After environmental campaign, the recognition of environmental problem related to food wastes was significantly increased from 3.09 point to 3.29 point (p<0.001), and the execution degree for food wastes reduction was also greatly increased from 1.88 to 2.70 point (p<0.001). These changes indicated that campaign for food wastes reduction has raised customers' recognition and execution for environmental protection.

• 인터넷정보학회논문지
• /
• 제17권4호
• /
• pp.51-60
• /
• 2016

내장 소프트웨어는 실시간성 및 실행 환경으로부터의 독립성을 요구사항으로 갖는다. 실시간성 요구사항은 탑재된 태스크의 최악 실행 시간으로부터 영향을 받는다. 따라서 실시간성을 보장하기 위해서는 정적 분석 기반의 최악 실행 시간 분석 방법을 사용하여 프로그램의 최악 실행 시간을 파악하여야 한다. 그러나 기존의 최악 실행 시간 분석은 실행 환경으로부터 독립성을 고려하지 않는다. 이에 우리는 실행 환경으로부터 독립성을 제공하기 위해 소스코드로부터 실행 시간을 측정하는 방법을 제시한다. 이를 위해 실행 코드가 아닌 소스코드로부터 생성된 제어 흐름 그래프를 통해 실행 시간을 측정한다. 또한 소스코드로부터 생성된 제어 흐름 그래프에는 실행 시간 정보가 존재하지 않기 때문에, 이를 제공하기 위해 소스코드의 문장과 실행코드의 명령어와의 관계를 분석한다. 결과적으로 실행 시간 측정이 가능한 제어 흐름 그래프를 생성할 수 있다. 이를 통해 프로세서로부터 종속적인 부분을 매개변수화할 수 있기 때문에, 최악 실행 시간 분석 도구의 유연성을 향상시킬 수 있다.

• The Journal of Korean Physical Therapy
• /
• 제29권1호
• /
• pp.27-32
• /
• 2017

Purpose: Recent electrophysiological studies have shown that the sensorymotor cortex is activated during both actual action excuted by themselves and observation of action performed by other persons. Observation of action based on mirror neuron system can be used as a cognitive intervention to promote motor learning. The purpose of this study was to investigate the brain activity changes during action observation and action execution using EEG. Methods: Thirty healthy volunteers participated and were requested to perform hand action and to observe the video of hand action performed by another person. The EEG activity was evaluated by a method which segregated the time-locked for each condition. To compare the differences between action observation and execution, the Mu suppression and the relative band power were analysed. Results: The results showed significant mu suppression during the action observation and execution, but the differences between the two conditions were not observed. The relative band power showed a significant difference during the action observation and execution, but there were no differences between the two conditions. Conclusion: These results indicate that action execution and observation involve overlapping neural networks in the sensorymotor cortical areas, proposing positive changes on neurophysiology. We are expected to provide information related to the intervention of cognitive rehabilitation.

• 디지털콘텐츠학회 논문지
• /
• 제14권2호
• /
• pp.171-178
• /
• 2013

데스크톱 그리드 컴퓨팅은 이질성과 휘발성을 갖는 데스크톱 자원을 활용하여 대용량의 컴퓨팅 작업을 수행한다. 그러나 이러한 컴퓨팅 환경에서는 서로 다른 성능을 갖는 데스크톱 자원의 연산 참여와 이탈이 자유롭기 때문에 연산 수행의 안정성과 신뢰성을 보장하지 못한다. 따라서 본 논문에서는 데스크톱 그리드 컴퓨팅에 연산 수행의 안정성과 신뢰성을 제공하기 위한 방안으로 k-means 클러스터링 알고리즘을 이용한 자원 그룹핑 기법을 설계한다. 아울러, 실제 데스크톱 그리드 시스템의 연산 수행 로그 데이터에 기반하여 자원 그룹핑을 수행하고, 데스크톱 자원 그룹에 대한 결함포용으로의 적용 방안을 제시한다.

• 한국항해항만학회지
• /
• 제32권4호
• /
• pp.279-285
• /
• 2008

We have proposed modeling methods of mariners' standard behavior for collision avoidance by analyzing mariners' recognition process in a previous study. As a subsequent study, the aim of this study is to build a model of mariners' execution process which is one of six processes in the condition of collision avoidance. In this study, thus, the structure of mariners' information processing on the process of taking avoiding actions is described and the relation between mariners' behavior and necessary factors in the process is analyzed. And then we have built a model of mariners' standard behavior for execution process based on the characteristics of mariners in ship-handling, which are obtained from the international collaborative research on human factors. It is tried to define the contents of execution process based on the standard behavior of mariners for collision avoidance and to formulate information processing of mariners.