• Title/Summary/Keyword: Task search

Search Result 394, Processing Time 0.033 seconds

Comparisons of Middle-, Old-, and Stroked Old-Age Drivers' Reaction Time and Accuracy Based on Multiple Reaction Time Tasks (중다 반응시간 과제에 기반한 중년, 고령 및 뇌졸중 고령 운전자의 반응시간과 반응정확성에서의 차이 비교)

  • Lee, Jaesik;Joo, Mijung;Kim, Jung-Ho;Kim, Young-Keun;Lee, Won-Young;Ryu, Jun-Beom;Oh, Ju-Seok
    • Science of Emotion and Sensibility
    • /
    • v.20 no.1
    • /
    • pp.115-132
    • /
    • 2017
  • Differences in reaction time and accuracy were compared among driver groups of middle-, old-, and stroke old-age drivers using various reaction time tasks including simple reaction task, 2-choice task, 4-choice task with different stimuli eccentricity, search task, and moving target detection task. The results can be summarized as followings. First, although overall reaction time tended to be slowed with age and stroke, stroke old drivers showed significantly slower reaction time than the other driver groups when the stimuli were presented in a large eccentricity. Second, differences in reaction time for 2-choice task and moving target detection task seemed to be determined mainly by participants' simple reaction time. Third, the search task which required temporary retention of previously presented stimuli was found to be more sensitive in discriminating difference in reaction time between middle-age drivers and old-age drivers (including stroke old drivers). Fourth, reaction accuracy of old (and stroke old) drivers decreased when more stimuli alternatives were presented and temporary retention for stimuli was required. Altogether, memory demand in reaction time task can be sensitive to evaluate performance for different age groups, whereas size of useful field of view for brain stroke.

Knowledge Based Search System In the ebXML Environment (ebXML 환경에서의 지식기반 검색 시스템)

  • 최형림;김현수;최현덕
    • The Journal of Society for e-Business Studies
    • /
    • v.7 no.3
    • /
    • pp.75-91
    • /
    • 2002
  • As B2B (Business to business) develops swiftly, at home as well as in other advanced countries, plans for activating Electronic business are made and proceeded in a national viewpoint. However, it is essential task for the construction, advancement and activation of B2B framework to make an efficient search for differently built -up data from B2C and thus to look for optimal business partner suitable for his/her own business. For this, in the last Aug. of 2001, government has also referred to ebXML, the exchange model for electronic business data based on XML, as a suggestion for B2B framework. The purpose of this study is to develop search system for efficient choice of business partner and this will play an important role for data processing and competitiveness strengthening of small and medium enterprises. Meanwhile, this system is built up by using systemic characteristics registered in ebXML Registry/Repository and ‘question-expanding’ searching ways based on the particulars of business profiles for both objectiveness and maximum efficiency of search result.

  • PDF

High Order Template Scheme for Rapid Acquisition in the UWB Communication System (고차 모델을 사용한 광대역 통신 시스템의 새로운 고속 동기화 기법)

  • Baasantseren, Gansuren;Lin, Xiaoju;Lee, Hae-Kee;Kim, Sung-Soo
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.59 no.1
    • /
    • pp.47-52
    • /
    • 2010
  • The low power of ultra-wideband (UWB) signal makes the acquisition of UWB signal be a more challenging task. In this paper, we propose the method of high order template signal technique that reduces the synchronization time. Experimental results are presented to show the improvements of performance in the mean acquisition time (MAT) and the probability of detection. The performance compared with the serial search, the truly random search and the random permutation search. It is shown that over typical UWB multipath channels, a random permutation search scheme may yield lower MAT than serial search.

An Efficient Submesh Allocation Scheme for Mesh-Connected Multicomputer Systems (메쉬 구조 다중컴퓨터 시스템을 위한 효율적인 서브메쉬 할당방법)

  • 이원주;전창호
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.6
    • /
    • pp.9-21
    • /
    • 2003
  • In this paper, we propose a new submesh allocation scheme which improves the performance of multicomputer systems. The key idea of this allocation scheme is to reduce waiting time of task by minimizing the submesh search time and the submesh a]location delay caused by external fragmentation. This scheme reduces the submesh search time by classifying independent free submeshes according to their types (square, horizontal rectangle, vertical rectangle) and searching a best-fit submesh from the classified free submesh list. If a submesh allocation delay occurs due to external fragmentation, the proposed scheme relocates tasks, executing In allocated submeshes, to another free submeshes and compacts processor fragmentation. This results in reducing the submesh allocation delay. Through simulation, we show that it is more effective to reduce the submesh allocation delay due to external fragmentation than reducing the submesh search time with respect to the waiting time of task. We also show that the proposed strategy improves the performance compared to previous strategies.

Energy-Efficient Resource Allocation for Application Including Dependent Tasks in Mobile Edge Computing

  • Li, Yang;Xu, Gaochao;Ge, Jiaqi;Liu, Peng;Fu, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2422-2443
    • /
    • 2020
  • This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

Patent Search System Using IPC Clustering (국제특허분류 클러스터링을 이용한 특허 검색 시스템)

  • Kim, Han-Gi;Lee, Seok-Hyoung;Yoon, Hwa-Mook
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.103-106
    • /
    • 2007
  • The importance of intellectual property right becomes larger and the number of the person who uses a patent search is increasing. When considering the search pattern of the general user who uses only one or two search terms, it is not easy task to find desirable search result in the massive patent documents. So we present patent search system based on IPC Clustering which helps users confine the search result by using international patent classification (IPC) which provided from all patent documents. By using this system, the general users can find patent search result more effectively.

  • PDF

Behavior Learning and Evolution of Swarm Robot based on Harmony Search Algorithm (Harmony Search 알고리즘 기반 군집로봇의 행동학습 및 진화)

  • Kim, Min-Kyung;Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.3
    • /
    • pp.441-446
    • /
    • 2010
  • Each robot decides and behaviors themselves surrounding circumstances in the swarm robot system. Robots have to conduct tasks allowed through cooperation with other robots. Therefore each robot should have the ability to learn and evolve in order to adapt to a changing environment. In this paper, we proposed learning based on Q-learning algorithm and evolutionary using Harmony Search algorithm and are trying to improve the accuracy using Harmony Search Algorithm, not the Genetic Algorithm. We verify that swarm robot has improved the ability to perform the task.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

The Effects of Motor-cognitive Dual Task on Cognitive Function of Elderly with Cognitive Disorders: Systematic Review of Randomized Controlled Trials (운동-인지 이중과제가 인지장애를 가진 노인의 인지기능에 미치는 영향: 무작위 실험연구에 대한 체계적 고찰)

  • Shin, Su-Jung;Park, Kyoung-Young
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.12
    • /
    • pp.216-225
    • /
    • 2020
  • This study was conducted to qualitatively analyze the selected research through a systematic review to find out application method, outcome measures, and intervention effects of dual task. We searched for published studies from January 2010 to December 2019. Electrical database were PubMed and ProQuest. Search terms were 'dual task' OR 'multi modal' AND 'mild cognitive impairment' OR 'dementia' OR 'Alzheimer's disease'AND 'intervention' OR 'rehabilitation. There were 8 studies selected finally. The dual task was applied not as a single intervention but as a combined intervention with other exercises. The contents of dual task were consisted of motor and cognitive tasks to be independent each other. The outcome measures included general cognitive function such as MMSE and CERAD, executive function, and memory. Additionally the dual task cost was also used to identify the direct improvement of the dual task. This study could provide informations of dual task application on elderly with cognitive impairment.

Visual Search Model based on Saliency and Scene-Context in Real-World Images (실제 이미지에서 현저성과 맥락 정보의 영향을 고려한 시각 탐색 모델)

  • Choi, Yoonhyung;Oh, Hyungseok;Myung, Rohae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.4
    • /
    • pp.389-395
    • /
    • 2015
  • According to much research on cognitive science, the impact of the scene-context on human visual search in real-world images could be as important as the saliency. Therefore, this study proposed a method of Adaptive Control of Thought-Rational (ACT-R) modeling of visual search in real-world images, based on saliency and scene-context. The modeling method was developed by using the utility system of ACT-R to describe influences of saliency and scene-context in real-world images. Then, the validation of the model was performed, by comparing the data of the model and eye-tracking data from experiments in simple task in which subjects search some targets in indoor bedroom images. Results show that model data was quite well fit with eye-tracking data. In conclusion, the method of modeling human visual search proposed in this study should be used, in order to provide an accurate model of human performance in visual search tasks in real-world images.