• Biomolecules & Therapeutics
• /
• 제19권1호
• /
• pp.1-8
• /
• 2011

G-protein coupled receptors (GPCRs) constitute an important class of drug targets and are involved in every aspect of human physiology including sleep regulation, blood pressure, mood, food intake, perception of pain, control of cancer growth, and immune response. Radiometric assays have been the classic method used during the search for potential therapeutics acting at various GPCRs for most GPCR-based drug discovery research programs. An increasing number of diverse small molecules, together with novel GPCR targets identified from genomics efforts, necessitates the use of high-throughput assays with a good sensitivity and specificity. Currently, a wide array of high-throughput tools for research on GPCRs is available and can be used to study receptor-ligand interaction, receptor driven functional response, receptor-receptor interaction,and receptor internalization. Many of the assay technologies are based on luminescence or fluorescence and can be easily applied in cell based models to reduce gaps between in vitro and in vivo studies for drug discovery processes. Especially, cell based models for GPCR can be efficiently employed to deconvolute the integrated information concerning the ligand-receptor-function axis obtained from label-free detection technology. This review covers various platform technologies used for the research of GPCRs, concentrating on the principal, non-radiometric homogeneous assay technologies. As current technology is rapidly advancing, the combination of probe chemistry, optical instruments, and GPCR biology will provide us with many new technologies to apply in the future.

• 한국보육지원학회지
• /
• 제17권3호
• /
• pp.39-64
• /
• 2021

Objective: This study analyzed the compliance situation of class rules for 3-year olds in the Wisdom class at Sarang kindergarten. Methods: Research participants were composed of 17 young children and two teachers in the wisdom class for 3-year-olds and data collection and analysis were conducted by participant observation using the qualitative method. Results: Research results were as follows. The compliance situation of class rules included compliance, violation, and among compliance and violation. First, compliance was divided into compliance with assistance and self compliance. Compliance with assistance is for young children to follow the rules under the guidance, help, and instructions of teachers. Self compliance is for children to understand and follow the rules themselves. Second, Between compliance and violation is conflict of the rules created by different standards of class rules. Third, depending on who found the violation, violation was classified into teacher discovery, peer discovery, and acquiescence. The teacher discovery led to teacher guidance and teacher acquiescence, The peer discovery led to peer notification, peer resistance, peer punishment, and peer acquiescence. Conclusion/Implications: By looking at the compliance situation of class rules for three-year-olds, the educational implications of how to guide class rules were obtained for children.

• International Journal of Contents
• /
• 제2권2호
• /
• pp.29-31
• /
• 2006

Mobile Ad hoc network is a self configuring network of mobile nodes. It allows mobile nodes to configure network spontaneously and share their services. In these networks, service discovery is very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Some service discovery protocols have been proposed in last couple of years but they include significant traffic overhead and for small scale MANETS. In this paper, we present extensible lookup service scheme based on distributed mechanism. In our scheme neighboring nodes of service provider monitor service provider and send notification to lookup server when the service provider terminates its services unexpectedly. Lookup server can find other service provider or other alternative services in advance because of advance notification method and can provide consistent lookup services. In our scheme neighboring nodes also monitor lookup server and send notification to network when lookup server terminates unexpectedly. Simulation results show that our scheme can reduce up to 70% and 30% lookup failure as compare to centralize and simple distributed mechanism respectively.

• 산업경영시스템학회지
• /
• 제23권57호
• /
• pp.11-20
• /
• 2000

In dynamic management environment, CEO must make an efficient decision with information & knowledge management systems based on IT(Information Technology). As a key component to cope with this current, we suggest the business performance analysis system based on KDD(Knowledge Discovery in Databases). We consider the theoretical model that is composited both Value-Added in respect of stakeholder and Economic Value-Added in respect of shareholder. Additionally we use DBMS and data mining method using Genetic Algorithms as physical model. To demonstrate the performance of the business performance analysis system, we analyse a domestic motors industry. The empirical case is based on the financial data of KISFAS(Korea Investors Services Financial Analysis System) database. The samples included in the study consist of H motors/S motors industry over the 16-year from 1981 to 1996.

• 디지털산업정보학회논문지
• /
• 제4권3호
• /
• pp.9-18
• /
• 2008

Mobile devices do not need the fixed network infrastructure in ad-hoc network, these devices communicate each other through the distributed control. Accordingly, mobile devices can discover several services using dynamic searching method and provide safely public ownership of these services. Ad-hoc network needs the distributed control and topology of dynamic network because the limited power for processing and network communication. This paper is devoted to provide the secure protocol that provides efficient services discovery using SDP(Service Discovery Protocol) and considers the security requirements. Proposed protocol provides the distributed control based on PKI without central server, the discovery of trusted service, secure telecommunication, the identification among mobile devices, and service access control by user authority.

• Journal of Information Processing Systems
• /
• 제15권5호
• /
• pp.1055-1067
• /
• 2019

In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1260-1281
• /
• 2015

As the number of services available on the Web increases, it is vital to be able to identify which services can be trusted. Since there can be an extremely large number of potential services that offer similar functionality, it is challenging to select the right ones. Service requestors have to decide which services closelysatisfy their needs, and theymust worry about the reliability of the service provider. Although an individual service can be trusted, a composed service is not guaranteed to be trustworthy. In this paper, we present a trust model that supports service discovery and composition based on trustworthiness. We define a method to evaluate trust in order to discover trustworthy services. We also provide a method to perform trust estimation for dynamic service composition, and we present results of two experiments. The proposed model allows for service requestors to obtain the most trustworthy services possible. Our mechanism uses direct and indirect user experience to discover the trustworthiness of the services and service providers. Moreover, composing services based on quantitative trust measurements will allow for consumers to acquire a highly reliable service that meet their quality and functional requirements.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.454-457
• /
• 2005

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.1-14
• /
• 2023

As markets and industries continue to evolve rapidly, technology opportunity discovery (TOD) has become critical to a firm's survival. From a common consensus that TOD based on a firm's capabilities is a valuable method for small and medium-sized enterprises (SMEs) and reduces the risk of failure in technology development, studies for TOD based on a firm's capabilities have been actively conducted. However, previous studies mainly focused on a firm's technological capabilities and rarely on business capabilities. Since discovered technologies can create market value when utilized in a firm's business, a firm's current business capabilities should be considered in discovering technology opportunities. In this context, this study proposes a TOD method that considers both a firm's business and technological capabilities. To this end, this study uses patent data, which represents the firm's technological capabilities, and trademark data, which represents the firm's business capabilities. The proposed method comprises four steps: 1) Constructing firm technology and business capability matrices using patent classification codes and trademark similarity group codes; 2) Transforming the capability matrices to preference matrices using the fuzzy function; 3) Identifying a target firm's candidate technology opportunities using the collaborative filtering algorithm; 4) Recommending technology opportunities using a portfolio map constructed based on technology similarity and applicability indices. A case study is conducted on a security firm to determine the validity of the proposed method. The proposed method can assist SMEs that face resource constraints in identifying technology opportunities. Further, it can be used by firms that do not possess patents since the proposed method uncovers technology opportunities based on business capabilities.

• 한국마린엔지니어링학회:학술대회논문집
• /
• 한국마린엔지니어링학회 2002년도 춘계학술대회논문집
• /
• pp.225-231
• /
• 2002

A specialized web search engine is an internet tool for detecting information in finite cyber world. It helps to retrieve necessary information in internet sites quickly In this paper, we design and implement a prototype search engine using method of mining for the association rule discovery. It consists of a search engine part and a search robot part. The search engine uses keyword method and is considered as various user oriented interface. The search robot fetches information related to ship parts n world wide web. The experiments show that our search engine(AISE) is superior to other search engines in collecting necessary informations.