• 제목/요약/키워드: Software Agents

검색결과 223건 처리시간 0.027초

에이전트의 시대가 오고 있다 (Advance of Agent Age)

  • 이근상
    • 정보관리연구
    • /
    • 제31권4호
    • /
    • pp.71-87
    • /
    • 2000
  • 최근 네트워크로 연결된 이기종의 유용성을 높이고 기존의 분산객체 컴퓨팅의 문제해결을 위해 이동 에이전트(Mobile agent)의 연구가 활발히 이루어지고 있다. 이런 연구를 통해 기존의 분산시스템뿐만 아니라 전자상거래, 네트워크관리, 정보검색 등 많은 분야에 이동 에이전트를 적용시키는 연구가 진행되고 있으며, 많은 시스템이 개발되고 있다. 본고에서는 에이전트의 연구에 있어 관련된 사항을 알아보고 에이전트간 통신기능향상을 위해 연구한 내용을 바탕으로 전반적인 내용을 다루고자 하며, 마지막으로 에이전트의 미래와 적용분야에 대해 다루고자 한다.

  • PDF

Adenosine Kinase Inhibitor Design Based on Pharmacophore Modeling

  • Lee, Yun-O;Bharatham, Nagakumar;Bharatham, Kavitha;Lee, Keun-Woo
    • Bulletin of the Korean Chemical Society
    • /
    • 제28권4호
    • /
    • pp.561-566
    • /
    • 2007
  • Adenosine kinase (AK) is a ubiquitous intracellular enzyme, which catalyzes the phosphorylation of adenosine (ADO) to adenosine monophosphate (AMP). AK inhibitors have therapeutic potential as analgesic and antiinflammatory agents. A chemical feature based pharmacophore model has been generated from known AK inhibitors (26 training set compounds) by HypoGen module implemented in CATALYST software. The top ranked hypothesis (Hypo1) contained four features of two hydrogen-bond acceptors (HBA) and two hydrophobic aromatics (Z). Hypo1 was validated by 124 test set molecules with a correlation coefficient of 0.905 between experimental and estimated activity. It was also validated by CatScramble method. Thus, the Hypo1 was exploited for searching new lead compounds over 238,819 chemical compounds in NCI database and then the selected compounds were screened based on restriction estimated activity and Lipinski's rules to evaluate their drug-like properties. Finally we could obtain 72 new lead candidates and the two best compound structures from them were posted.

대규모 태깅 데이터를 이용한 태깅 온톨로지 학습 (Learning Tagging Ontology from Large Tagging Data)

  • 강신재
    • 한국지능시스템학회논문지
    • /
    • 제18권2호
    • /
    • pp.157-162
    • /
    • 2008
  • 본 논문은 대중에 의해 자유롭게 생성된 분류 체계인 폭소노미, 즉 대규모의 태깅 데이터로부터 태깅 온톨로지를 학습하는 방법을 제시하고 있다. 기존 소셜웹 시스템간에는 태깅의 의미에 대해 공통의 합의가 이루어지지 않았기 때문에, 시스템마다 태깅 정보를 표현하기 위해 내부적으로 다른 방법을 쓰고 있으며, 따라서 소프트웨어 에이전트를 이용하여 시스템간의 정보처리를 자동으로 할 수가 없다. 이를 해결하는 방법으로 폭소노미를 위한 태깅 온톨로지가 필요하다. 태깅의 본질적인 속성을 분석하여 태깅 온톨로지를 정의하고, 태깅 데이터의 기계 학습을 통하여 유사 태그와 사용자 그룹 정보를 획득한 후, 태깅 온톨로지를 학습한다. 이의 활용 방안으로 학습된 태깅 온톨로지를 이용하여 모델링한 추천 시스템도 제안한다.

응급실 내원 암환자의 항암화학요법 부작용에 대한 후향적 조사연구 (Study on Cancer Patients Who Visited an Emergency Department with the Side Effects of Chemotherapy)

  • 임수정;이명선
    • 임상간호연구
    • /
    • 제20권1호
    • /
    • pp.75-89
    • /
    • 2014
  • Purpose: This study was done to identify conditions of cancer patients who visited an emergency department (ED) with the side effects of chemotherapy. Methods: Data were collected retrospectively from medical records of 294 cancer patients who visited a tertiary hospital in 2009 for treatment of side effects of chemotherapy. Records were reviewed for characteristics of participants and side effects of chemotherapy. Data were analyzed using SPSS software. Results: ED Triage grade 3 was 81.6%. The hospitalization ratio was 72.8%, and 6.5% died during the admission. Most frequent side effects were thrombocytopenia (80.6%), anemia (74.5%), pain (52.0%), neutropenia (50.7%), and leucopenia (46.3%). The hospitalization group showed more severe leucopenia than the discharge group (p=.020). Patients in the group who died had higher scores for dyspnea compared to patients discharged or hospitalized (p<.05). Conclusion: Results of the study suggest that there is a special need to develop a system to manage side effects of chemotherapy. Also it is necessary to provide appropriate care and treatment with prompt initial evaluation when cancer patients with side effects of chemotherapy present in the ED. More effective educational discharge programs should also be developed to help these patients cope with various side effects of chemotherapy.

멀티에이전트 기반 가치넷 설계 (Multi-agent based value net design)

  • Kim, Taewoon
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2002년도 춘계학술대회 논문집
    • /
    • pp.222-229
    • /
    • 2002
  • 기존의 공급망이 디지털화되고 고객과 공급자간의 파트너쉽과 정보흐름에 있어서 고성능의 네트웍을 형성하는 새로운 개념의 네트 퀀을 가치넷 (value net)으로 정의한다. 이러한 가치넷은 고객이 그 중심에 위치하며 연관되는 제조 사이트와 공급자에 이르는 정보의 배분을 원활하게 해 준다. 본 연구의 목적은 복잡한 공급사슬의 흐름과정에서 발생하는 의사결정과정을 자동화하고 효율화하기 위해서 멀티에이전트를 이용한 프레임 을 설계하고 구매업무와 관련된 영역에 대하여 본 시스템을 구현해 보고자 하는 것이다. 에이전트의 지능적 판단을 위해서는 BDI (Belief, Desire, Intension) 모델을 이용하였다. 본 연구의 결과는 B2B 및 e-Business에서 에이전트를 이용한 조달 및 획득과 관련된 업무에 적용이 될 수 있다.무에 적용이 될 수 있다.

  • PDF

원거리 화학영상탐지시스템의 시야각에 대한 연구 (A Study on the Field of View of the Remote FTIR Chemical Imaging Detection System)

  • 이종민;강영일;김주현
    • 한국군사과학기술학회지
    • /
    • 제17권1호
    • /
    • pp.122-128
    • /
    • 2014
  • Remote fourier transform infrared(FTIR) chemical imaging detection system allows detection and identification of gases in the atmosphere from long distances. In this paper, the appropriate field of view(FOV) of the FTIR imaging system was examined and the main performance of the system for the interferometer was described. For the determination of the FOV, simulations of gas dispersion range were performed with the NBC reporting and modeling software(NBC-RAMS) developed by ADD. As a result, minimum 192 mrad of FOV was required for the remote FTIR imaging system to visualize chemical warfare agents dispersed in several hundred meters. At the same time, 0.75 mrad of instantaneous field of view(IFOV) for a linear interferometer proper to take a FOV for the chemical agent imaging.

Numerical Formula and Verification of Web Robot for Collection Speedup of Web Documents

  • 김원;김영기;진용욕
    • 인터넷정보학회논문지
    • /
    • 제5권6호
    • /
    • pp.1-10
    • /
    • 2004
  • A web robot is a software that has abilities of tracking and collecting web documents on the Internet(l), The performance scalability of recent web robots reached the limit CIS the number of web documents on the internet has increased sharply as the rapid growth of the Internet continues, Accordingly, it is strongly demanded to study on the performance scalability in searching and collecting documents on the web. 'Design of web robot based on Multi-Agent to speed up documents collection ' rather than 'Sequentially executing Web Robot based on the existing Fork-Join method' and the results of analysis on its performance scalability is presented in the thesis, For collection speedup, a Multi-Agent based web robot performs the independent process for inactive URL ('Dead-links' URL), which is caused by overloaded web documents, temporary network or web-server disturbance, after dividing them into each agent. The agents consist of four component; Loader, Extractor, Active URL Scanner and inactive URL Scanner. The thesis models a Multi-Agent based web robot based on 'Amdahl's Law' to speed up documents collection, introduces a numerical formula for collection speedup, and verifies its performance improvement by comparing data from the formula with data from experiments based on the formula. Moreover, 'Dynamic URL Partition algorithm' is introduced and realized to minimize the workload of the web server by maximizing a interval of the web server which can be a collection target.

  • PDF

영상 감시 시스템을 위한 에이전트 기반의 자동화된 카메라 배치 (Agent-based Automatic Camera Placement for Video Surveillance Systems)

  • 변유인;남윤영;조위덕
    • 인터넷정보학회논문지
    • /
    • 제11권1호
    • /
    • pp.103-116
    • /
    • 2010
  • 본 논문은 에이전트 기반의 시뮬레이션을 이용하여 최적의 카메라 배치 방법을 제안한다. 공간 중요도를 분석하고 공간을 효율적으로 커버하기 위해, 공간분류와 이동하는 사람의 패턴 분석기반으로 에이전트 기반의 시뮬레이션을 수행하였다. 에이전트 기반의 카메라 배치 기법은 카메라 성능뿐만 아니라 경로탐색 알고리즘으로부터 추출한 공간 중요도를 고려하여 개발하였다. 이 기법은 설치비용을 고려하여 최적의 카메라 수를 결정할 뿐만 아니라 카메라의 위치와 방향을 조정한다는 것을 보인다. 제안한 방법을 검증하기 위해 시뮬레이션 결과를 실제 영상과 비교하였으며, 특정 공간에서 시뮬레이션한 실험 결과를 보인다.

Hierarchical Location Caching Scheme for Mobile Object Tracking in the Internet of Things

  • Han, Youn-Hee;Lim, Hyun-Kyo;Gil, Joon-Min
    • Journal of Information Processing Systems
    • /
    • 제13권5호
    • /
    • pp.1410-1429
    • /
    • 2017
  • Mobility arises naturally in the Internet of Things networks, since the location of mobile objects, e.g., mobile agents, mobile software, mobile things, or users with wireless hardware, changes as they move. Tracking their current location is essential to mobile computing. To overcome the scalability problem, hierarchical architectures of location databases have been proposed. When location updates and lookups for mobile objects are localized, these architectures become effective. However, the network signaling costs and the execution number of database operations increase particularly when the scale of the architectures and the numbers of databases becomes large to accommodate a great number of objects. This disadvantage can be alleviated by a location caching scheme which exploits the spatial and temporal locality in location lookup. In this paper, we propose a hierarchical location caching scheme, which acclimates the existing location caching scheme to a hierarchical architecture of location databases. The performance analysis indicates that the adjustment of such thresholds has an impact on cost reduction in the proposed scheme.

Software Defined Networking and Network Function Virtualization for improved data privacy using the emergent blockchain in banking systems

  • ALRUWAILI, Anfal;Hendaoui, Saloua
    • International Journal of Computer Science & Network Security
    • /
    • 제21권8호
    • /
    • pp.111-118
    • /
    • 2021
  • Banking systems are sensitive to data privacy since users' data, if not well protected, may be used to perform fake transactions. Blockchains, public and private, are frequently used in such systems thanks to their efficiency and high security. Public blockchains fail to fully protect users' data, despite their power in the accuracy of the transactions. The private blockchain is better used to protect the privacy of the sensitive data. They are not open and they apply authorization to login into the blockchain. However, they have a lower security compared to public blockchain. We propose in this paper a hybrid public-private architecture that profits from network virtualization. The main novelty of this proposal is the use of network virtualization that helps to reduce the complexity and efficiency of the computations. Simulations have been conducted to evaluate the performance of the proposed solution. Findings prove the efficiency of the scheme in reducing complexity and enhancing data privacy by guarantee high security. The contribution conducted by this proposal is that the results are verified by the centralized controller that ensures a correct validation of the resulted blockchains. In addition, computation complexity is to be reduced by profiting from the cooperation performed by the virtual agents.