• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.152-161
• /
• 2021

The paper focuses on Device-to-device (D2D) Architectures evaluation frameworks. D2D communication and discovery can improve spectrum usage efficiency and optimize the tradeoffs between throughput and energy consumption. The target operation modes involve both indirect communication between two nodes via a base station or the direct communication among proximal nodes, enabling use cases that can support communications out of cellular coverage, as well as low end-end delay requirements. The paper will present the architectural evolution of D2D networks within 3GPP standardization and will highlight key network functionalities and signaling protocols. It will also identify key analytical and simulation models that can be used to assess the performance and energy efficiency of resource allocation strategies, and it will present a suitable cross-layer integrated framework.

• 환경생물
• /
• 제41권4호
• /
• pp.550-556
• /
• 2023

Henricia specimens were collected using a dual approach of trimix scuba diving and fishing nets. This inclusive collection encompasses the discovery of two species highlighted in this study and introduces and provides comprehensive descriptions for Henricia kinkasana and Henricia longispina aleutica. The descriptions offered in this study were derived from the thorough examinations of external morphological characteristics. The documentation provides detailed insight into key traits related to the abactinal and actinal skeletons and spines of these newly recorded species in Korea. This comprehensive examination contributes to our understanding of the distinct morphological characteristics defining each species within the genus Henricia.

• 디지털콘텐츠학회 논문지
• /
• 제14권1호
• /
• pp.89-95
• /
• 2013

유비쿼터스 분야에서는 다양한 형태의 P2P 시스템을 분산환경을 위하여 연구하고 있다. 분산해쉬테이블(DHT)기반의 P2P 시스템은 부하조절을 통한 효율적 기법으로 제시되고 있는 반면 이동성과 근거리 기반의 자원 활용을 보장하지는 못하는 문제점을 가지고 있다. 본 연구에서는 이를 극복하기 위하여 이동상황에서의 근거리 기반 P2P 시스템 (MLH-Net)을 제안한다. 이는 이동성에 기반하여 두 개의 계층으로 이루어져 있다. 상위 계층의 경우 super node를 통한 전체적인 관리를 담당하며, 하위 계층의 경우 일반 노드의 망으로 구성되어 있다. 제시하는 방법을 종래의 JXTA 및 Chord 와 비교 실험 한 결과 node의 발견 시 메시지 이동 hop은 JXTA 대비 13% 및 Chord 대비 69% 감소되었으며, 네트워크 거리의 경우도 각각 17% 및 83% 감소되는 효과를 확인 하였다.

• Journal of Ginseng Research
• /
• 제39권2호
• /
• pp.141-147
• /
• 2015

Background: Adipocytes, which are the main cellular component of adipose tissue, are the building blocks of obesity. The nuclear hormone receptor $PPAR{\gamma}$ is a major regulator of adipocyte differentiation and development. Obesity, which is one of the most dangerous yet silent diseases of all time, is fast becoming a critical area of research focus. Methods: In this study, we initially aimed to investigate whether the ginsenoside Rf, a compound that is only present in Panax ginseng Meyer, interacts with $PPAR{\gamma}$ by molecular docking simulations. After we performed the docking simulation the result has been analyzed with several different software programs, including Discovery Studio, Pymol, Chimera, Ligplus, and Pose View. All of the programs identified the same mechanism of interaction between $PPAR{\gamma}$ and Rf, at the same active site. To determine the drug-like and biological activities of Rf, we calculate its absorption, distribution, metabolism, excretion, and toxic (ADMET) and prediction of activity spectra for substances (PASS) properties. Considering the results obtained from the computational investigations, the focus was on the in vitro experiments. Results: Because the docking simulations predicted the formation of structural bonds between Rf and $PPAR{\gamma}$, we also investigated whether any evidence for these bonds could be observed at the cellular level. These experiments revealed that Rf treatment of 3T3-L1 adipocytes downregulated the expression levels of $PPAR{\gamma}$ and perilipin, and also decreased the amount of lipid accumulated at different doses. Conclusion: The ginsenoside Rf appears to be promising compound that could prove useful in antiobesity treatments.

• 정보관리학회지
• /
• 제19권2호
• /
• pp.159-179
• /
• 2002

웹 정보체계에서 여러 가지 다양한 종류의 정보자원을 보다 효과적으로 관리하기 위하여, 인터넷 정보를 기술하고 있는 서로 다른 메타데이터 표준들간의 상호운용성 문제가 점차 중요한 비중을 차지하게 된다. 이러한 문제점을 해결하기 위하여 IFLA의 FRBR, INDECS, ABC 모델 등의 상호연동 모델들을 비교·분석함으로서, 다양한 형태의 메타데이터간의 상호연동을 위한 새로운 방식의 상호운용성 모델을 개발, 제안하였다. 리소스모델의 기본·메타데이터 항목 요소들로부터 중심이 되는 개체(core entity)와 이와 연관된 주요 사건(core event)들을 식별하고. 이를 리소스중심 중간모델과 이벤트중심 중간모델로 변환(swapping)하는 과정을, 구체적인 방법을 제시함으로써, 이들 모델간 전환 방법을 명확하게 제시하였다.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• 정보통신설비학회논문지
• /
• 제10권4호
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• Journal of Plant Biotechnology
• /
• 제45권3호
• /
• pp.228-235
• /
• 2018

In this study, two pepper varieties, PRH1 (powdery mildew resistance line) and Saengryeg (powdery mildew resistance line), were resequenced using next generation sequencing technology in order to develop InDel markers. The genome-wide discovery of InDel variation was performed by comparing the whole-genome resequencing data of two pepper varieties to the Capsicum annuum cv. CM334 reference genome. A total of 334,236 and 318,256 InDels were identified in PRH1 and Saengryeg, respectively. The greatest number of homozygous InDels were discovered on chromosome 1 in PRH1 (24,954) and on chromosome 10 (29,552) in Saengryeg. Among these homozygous InDels, 19,094 and 4,885 InDels were distributed in the genic regions of PRH1 and Saengryeg, respectively, and 198,570 and 183,468 InDels were distributed in the intergenic regions. We have identified 197,821 polymorphic InDels between PRH1 and Saengryeg. A total of 11,697 primers sets were generated, resulting in the discovery of four polymorphic InDel markers. These new markers will be utilized in order to identify disease resistance genotypes in breeding populations. Therefore, our results will make a one-step advancement in whole genome resequencing and add genetic resource datasets in pepper breeding research.

• 인터넷정보학회논문지
• /
• 제20권2호
• /
• pp.101-108
• /
• 2019

Workflow management systems (WfMSs) automate and manage workflows, which are implementations of organizational processes operated in process-centric organizations. In this paper, wepropose an algorithm to discover temporal work transference networks from workflow execution logs. The temporal work transference network is a special type of enterprise social networks that consists of workflow performers, and relationships among them that are formed by work transferences between performers who are responsible in performing precedent and succeeding activities in a workflow process. In terms of analysis, the temporal work transference network is an analytical property that has significant value to be analyzed to discover organizational knowledge for human resource management and related decision-making steps for process-centric organizations. Also, the beginning point of implementinga human-centered workflow intelligence framework dealing with work transference networks is to develop an algorithm for discovering temporal work transference cases on workflow execution logs. To this end, we first formalize a concept of temporal work transference network, and next, we present a discovery algorithm which is for the construction of temporal work transference network from workflow execution logs. Then, as a verification of the proposed algorithm, we apply the algorithm to an XES-formatted log dataset that was released by the process mining research group and finally summarize the discovery result.

• 인터넷정보학회논문지
• /
• 제20권5호
• /
• pp.49-55
• /
• 2019

Organizations design and operate business process models to achieve their goals efficiently and systematically. With the advancement of IT technology, the number of items that computer systems can participate in and the process becomes huge and complicated. This phenomenon created a more complex and subdivide flow of business process.The process instances that contain workcase and events are larger and have more data. This is an essential resource for process mining and is used directly in model discovery, analysis, and improvement of processes. This event log is getting bigger and broader, which leads to problems such as capacity management and I / O load in management of existing row level program or management through a relational database. In this paper, as the event log becomes big data, we have found the problem of management limit based on the existing original file or relational database. Design and apply schemes to archive and analyze large event logs through Hadoop, an open source distributed file system, and HBase, a NoSQL database system.