• Title/Summary/Keyword: Address system

Search Result 2,417, Processing Time 0.037 seconds

Data Mining and Construction of Database Concerning Effects of Vitis Genus (산머루 관련 정보수집 및 데이터베이스의 구축)

  • Kim, Min-A;Jo, Yun-Ju;Shin, Jee-Young;Shin, Min-Kyu;Bae, Hyun-Su;Hong, Moo-Chang;Kim, Yang-Seok
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.26 no.4
    • /
    • pp.551-556
    • /
    • 2012
  • The database for the oriental medicine had been existed in documentation in past times and it has been developed to the database type for random accesses in the information society. However, the aspects of the database are not so diversified and the database for the bio herbal material exists in widened type dictionary style. It is a situation that the database which handles the in-depth raw herbal medicines is not sufficient in its quantity and quality. Korean wild grape is a deciduous plant categorized into the Vitaceae and it was found experimentally that it has various medical effects. It is one of the medical materials with higher potentiality of academic study and commercialization recently because it has a bigger possibility to be applied into diverse industrial fields including the medical product for health, food and beauty. We constituted the cooperative system among the Muju cluster business group for Korean mountain wild grapes, Physiology Laboratory in Kyung Hee University Oriental Medicine and Medical Classics Laboratory in Kyung Hee University Oriental Medicine with a view to focusing on such potentiality and a database for Korean wild grapes was made a touchstone for establishing the in-depth database for the single bio medical materials. First of all, the literatures based on the North East Asia in ancient times had been categorized into the classical literature (Korean literature published by government organization, Korean classical literature, Chinese classical literature and classical literature fro Korean and Chinese oriental medicine) and modern literature (Modern literature for oriental medicine, modern literature for domestic and foreign herbal medicine) to cover the eastern and western research records and writings related to Korean wild grapes and the text-mining work has been performed through the cooperation system with the Medical Classics Laboratory in Kyung Hee University Oriental Medicine. First of all, the data for the experiment and theory for Korean wild grape were collected for the Medline database controlled by the Parliament Library of USA to arrange the domestic and foreign theses with topic for Korean wild grapes and the network hyperlink function and down load function were mounted for self-thesis searching function and active view based on the collected data. The thesis searching function provides various auxiliary functions and the searching is available according to the diverse searching/queries such as the name of sub species of Korean wild grape, the logical intersection index for the active ingredients, efficacy and elements. It was constituted for the researchers who design the Korean wild grape study to design of easier experiment. In addition, the data related to the patents for Korean wild grape which were collected from European Patent Office in response to the commercialization possibility and the system available for searching and view was established in the same viewpoint. Perl was used for the query programming and MS-SQL for database establishment and management in the designing of this database. Currently, the data is available for free use and the address is as follows. http://163.180.41.43:8011/index.html

Location Service Modeling of Distributed GIS for Replication Geospatial Information Object Management (중복 지리정보 객체 관리를 위한 분산 지리정보 시스템의 위치 서비스 모델링)

  • Jeong, Chang-Won;Lee, Won-Jung;Lee, Jae-Wan;Joo, Su-Chong
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.985-996
    • /
    • 2006
  • As the internet technologies develop, the geographic information system environment is changing to the web-based service. Since geospatial information of the existing Web-GIS services were developed independently, there is no interoperability to support diverse map formats. In spite of the same geospatial information object it can be used for various proposes that is duplicated in GIS separately. It needs intelligent strategies for optimal replica selection, which is identification of replication geospatial information objects. And for management of replication objects, OMG, GLOBE and GRID computing suggested related frameworks. But these researches are not thorough going enough in case of geospatial information object. This paper presents a model of location service, which is supported for optimal selection among replication and management of replication objects. It is consist of tree main services. The first is binding service which can save names and properties of object defined by users according to service offers and enable clients to search them on the service of offers. The second is location service which can manage location information with contact records. And obtains performance information by the Load Sharing Facility on system independently with contact address. The third is intelligent selection service which can obtain basic/performance information from the binding service/location service and provide both faster access and better performance characteristics by rules as intelligent model based on rough sets. For the validity of location service model, this research presents the processes of location service execution with Graphic User Interface.

Design and Fabrication for the Development of Auto Pattern Maker (자동취형기 개발을 위한 설계 및 제작)

  • Lee, Young-Il;Kim, Jung-Hee;Park, Jee-Hyun
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.18 no.3
    • /
    • pp.231-239
    • /
    • 2013
  • Purpose: To design and fabricate the auto pattern maker for the development. Methods: we got the necessary data, needed in design, by using CAD. Based on the these data, we fabricated the trial product for the development of the auto pattern maker. Results: The auto pattern maker were composed with combinations of many elements; pattern making assembly, control panel, frame attachment and prober unit. The pattern making assembly was comprised of the cutter, the pattern holder, pattern remover and silence cover which could minimize the sound during the cutting process. The control panel was designed to be connected and operated with the main printed circuit board. The prober could get the eye shape data by scanning of 1.8 degrees around the groove of the frame through the encoding data according to the address. After starting, scanning was carried out in two passes, i.e. one right-handed and one left-handed. Communication connector could send the eye shape data from auto pattern maker to outer system with the RS232C transmission system. By using the one-way analysis of variance, we got the error rate of cut pattern size for ${\Phi}22mm$, ${\Phi}55mm$ and ${\Phi}62mm$. Because F-value was 0.510 and p-value was 0.601, no statistically significant differences were found. Also, the mean cutting error of the auto pattern maker was 0.0274 mm. Conclusions: we could succeed in making the trial product by applying it to the development of the auto pattern maker. The role of this auto pattern maker is to find a exact required size of lens to fit the frame by measuring the frame. The acquired data are transferred to outer system for grinding and finishing with patternless process. Also, the trial product can produce pattern to fit the frame. Therefore, it was confidently expected that the optometrists could handily produce pattern to fit the frame with this trial product and dispense the ophthalmic lens because of its efficiency and convenience compared to the past.

Impact of Net-Based Customer Service on Firm Profits and Consumer Welfare (기업의 온라인 고객 서비스가 기업의 수익 및 고객의 후생에 미치는 영향에 관한 연구)

  • Kim, Eun-Jin;Lee, Byung-Tae
    • Asia pacific journal of information systems
    • /
    • v.17 no.2
    • /
    • pp.123-137
    • /
    • 2007
  • The advent of the Internet and related Web technologies has created an easily accessible link between a firm and its customers, and has provided opportunities to a firm to use information technology to support supplementary after-sale services associated with a product or service. It has been widely recognized that supplementary services are an important source of customer value and of competitive advantage as the characteristics of the product itself. Many of these supplementary services are information-based and need not be co-located with the product, so more and more companies are delivering these services electronically. Net-based customer service, which is defined as an Internet-based computerized information system that delivers services to a customer, therefore, is the core infrastructure for supplementary service provision. The importance of net-based customer service in delivering supplementary after-sale services associated with product has been well documented. The strategic advantages of well-implemented net-based customer service are enhanced customer loyalty and higher lock-in of customers, and a resulting reduction in competition and the consequent increase in profits. However, not all customers utilize such net-based customer service. The digital divide is the phenomenon in our society that captures the observation that not all customers have equal access to computers. Socioeconomic factors such as race, gender, and education level are strongly related to Internet accessibility and ability to use. This is due to the differences in the ability to bear the cost of a computer, and the differences in self-efficacy in the use of a technology, among other reasons. This concept, applied to e-commerce, has been called the "e-commerce divide." High Internet penetration is not eradicating the digital divide and e-commerce divide as one would hope. Besides, to accommodate personalized support, a customer must often provide personal information to the firm. This personal information includes not only name and address, but also preferences information and perhaps valuation information. However, many recent studies show that consumers may not be willing to share information about themselves due to concerns about privacy online. Due to the e-commerce divide, and due to privacy and security concerns of the customer for sharing personal information with firms, limited numbers of customers adopt net-based customer service. The limited level of customer adoption of net-based customer service affects the firm profits and the customers' welfare. We use a game-theoretic model in which we model the net-based customer service system as a mechanism to enhance customers' loyalty. We model a market entry scenario where a firm (the incumbent) uses the net-based customer service system in inducing loyalty in its customer base. The firm sells one product through the traditional retailing channels and at a price set for these channels. Another firm (the entrant) enters the market, and having observed the price of the incumbent firm (and after deducing the loyalty levels in the customer base), chooses its price. The profits of the firms and the surplus of the two customers segments (the segment that utilizes net-based customer service and the segment that does not) are analyzed in the Stackelberg leader-follower model of competition between the firms. We find that an increase in adoption of net-based customer service by the customer base is not always desirable for firms. With low effectiveness in enhancing customer loyalty, firms prefer a high level of customer adoption of net-based customer service, because an increase in adoption rate decreases competition and increases profits. A firm in an industry where net-based customer service is highly effective loyalty mechanism, on the other hand, prefers a low level of adoption by customers.

Predicting link of R&D network to stimulate collaboration among education, industry, and research (산학연 협업 활성화를 위한 R&D 네트워크 연결 예측 연구)

  • Park, Mi-yeon;Lee, Sangheon;Jin, Guocheng;Shen, Hongme;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.3
    • /
    • pp.37-52
    • /
    • 2015
  • The recent global trends display expansion and growing solidity in both cooperative collaboration between industry, education, and research and R&D network systems. A greater support for the network and cooperative research sector would open greater possibilities for the evolution of new scholar and industrial fields and the development of new theories evoked from synergized educational research. Similarly, the national need for a strategy that can most efficiently and effectively support R&D network that are established through the government's R&D project research is on the rise. Despite the growing urgency, due to the habitual dependency on simple individual personal information data regarding R&D industry participants and generalized statistical data references, the policies concerning network system are disappointing and inadequate. Accordingly, analyses of the relationships involved for each subject who is participating in the R&D industry was conducted and on the foundation of an educational-industrial-research network system, possible changes within and of the network that may arise were predicted. To predict the R&D network transitions, Common Neighbor and Jaccard's Coefficient models were designated as the basic foundational models, upon which a new prediction model was proposed to address the limitations of the two aforementioned former models and to increase the accuracy of Link Prediction, with which a comparative analysis was made between the two models. Through the effective predictions regarding R&D network changes and transitions, such study result serves as a stepping-stone for an establishment of a prospective strategy that supports a desirable educational-industrial-research network and proposes a measure to promote the national policy to one that can effectively and efficiently sponsor integrated R&D industries. Though both weighted applications of Common Neighbor and Jaccard's Coefficient models provided positive outcomes, improved accuracy was comparatively more prevalent in the weighted Common Neighbor. An un-weighted Common Neighbor model predicted 650 out of 4,136 whereas a weighted Common Neighbor model predicted 50 more results at a total of 700 predictions. While the Jaccard's model demonstrated slight performance improvements in numeric terms, the differences were found to be insignificant.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

Simultaneous Detection of Seven Phosphoproteins in a Single Lysate Sample during Oocyte Maturation Process (난자성숙 과정의 단일 시료에서 일곱 가지 인산화 단백질의 동시 분석 방법)

  • Yoon, Se-Jin;Kim, Yun-Sun;Kim, Kyeoung-Hwa;Yoon, Tae-Ki;Lee, Woo-Sik;Lee, Kyung-Ah
    • Clinical and Experimental Reproductive Medicine
    • /
    • v.36 no.3
    • /
    • pp.187-197
    • /
    • 2009
  • Objective: Phosphorylation and dephosphorylation of proteins are important in regulating cellular signaling pathways. Bead-based multiplex phosphorylation assay was conducted to detect the phosphorylation of seven proteins to maximize the information obtained from a single lysate of stage-specific mouse oocytes at a time. Methods: Cumulus-oocyte complexes (COCs) were cultured for 2 h, 8 h, and 16 h, respectively to address phosphorylation status of seven target proteins during oocyte maturation process. We analyzed the changes in phosphorylation at germinal vesicle (GV, 0 h), germinal vesicle breakdown (GVBD, 2 h), metaphase I (MI, 8 h), and metaphase II (MII, 16 h in vitro or in vivo) mouse oocytes by using Bio-Plex phosphoprotein assay system. We chose seven target proteins, namely, three mitogen-activated protein kinases (MAPKs), ERK1/2, JNK, and p38 MAPK, and other 4 well known signaling molecules, Akt, GSK-$3{\alpha}/{\beta}$, $I{\kappa}B{\alpha}$, and STAT3 to measure their phosphorylation status. Western blot analysis and kinase inhibitor treatment for ERK1/2, JNK, and Akt during in vitro maturation of oocytes were conducted for the confirmation. Results: Phosphorylation of ERK1/2, JNK, p38 MAPK and STAT3 was increased over 3 folds up to 20 folds, while phosphorylation of the other three signal molecules, Akt, GSK-$3{\alpha}/{\beta}$, and $I{\kapa}B{\alpha}$ was less than 3 folds. All of these results except for Akt were statistically significant (p<0.05). Conclusion: This is the first report on the new and valuable method measuring many phosphoproteins simultaneously in one minute sample such as oocyte lysates. All of the three MAPKs, ERK1/2, JNK, and p38 MAPK are involved in the process of mouse oocyte maturation. In addition, STAT3 might be important regulator of oocyte maturation, while Akt phosphorylation at Serine 473 may not be involved in the regulation of oocyte maturation.

A Machine Learning-based Total Production Time Prediction Method for Customized-Manufacturing Companies (주문생산 기업을 위한 기계학습 기반 총생산시간 예측 기법)

  • Park, Do-Myung;Choi, HyungRim;Park, Byung-Kwon
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.177-190
    • /
    • 2021
  • Due to the development of the fourth industrial revolution technology, efforts are being made to improve areas that humans cannot handle by utilizing artificial intelligence techniques such as machine learning. Although on-demand production companies also want to reduce corporate risks such as delays in delivery by predicting total production time for orders, they are having difficulty predicting this because the total production time is all different for each order. The Theory of Constraints (TOC) theory was developed to find the least efficient areas to increase order throughput and reduce order total cost, but failed to provide a forecast of total production time. Order production varies from order to order due to various customer needs, so the total production time of individual orders can be measured postmortem, but it is difficult to predict in advance. The total measured production time of existing orders is also different, which has limitations that cannot be used as standard time. As a result, experienced managers rely on persimmons rather than on the use of the system, while inexperienced managers use simple management indicators (e.g., 60 days total production time for raw materials, 90 days total production time for steel plates, etc.). Too fast work instructions based on imperfections or indicators cause congestion, which leads to productivity degradation, and too late leads to increased production costs or failure to meet delivery dates due to emergency processing. Failure to meet the deadline will result in compensation for delayed compensation or adversely affect business and collection sectors. In this study, to address these problems, an entity that operates an order production system seeks to find a machine learning model that estimates the total production time of new orders. It uses orders, production, and process performance for materials used for machine learning. We compared and analyzed OLS, GLM Gamma, Extra Trees, and Random Forest algorithms as the best algorithms for estimating total production time and present the results.

A Generalized Adaptive Deep Latent Factor Recommendation Model (일반화 적응 심층 잠재요인 추천모형)

  • Kim, Jeongha;Lee, Jipyeong;Jang, Seonghyun;Cho, Yoonho
    • Journal of Intelligence and Information Systems
    • /
    • v.29 no.1
    • /
    • pp.249-263
    • /
    • 2023
  • Collaborative Filtering, a representative recommendation system methodology, consists of two approaches: neighbor methods and latent factor models. Among these, the latent factor model using matrix factorization decomposes the user-item interaction matrix into two lower-dimensional rectangular matrices, predicting the item's rating through the product of these matrices. Due to the factor vectors inferred from rating patterns capturing user and item characteristics, this method is superior in scalability, accuracy, and flexibility compared to neighbor-based methods. However, it has a fundamental drawback: the need to reflect the diversity of preferences of different individuals for items with no ratings. This limitation leads to repetitive and inaccurate recommendations. The Adaptive Deep Latent Factor Model (ADLFM) was developed to address this issue. This model adaptively learns the preferences for each item by using the item description, which provides a detailed summary and explanation of the item. ADLFM takes in item description as input, calculates latent vectors of the user and item, and presents a method that can reflect personal diversity using an attention score. However, due to the requirement of a dataset that includes item descriptions, the domain that can apply ADLFM is limited, resulting in generalization limitations. This study proposes a Generalized Adaptive Deep Latent Factor Recommendation Model, G-ADLFRM, to improve the limitations of ADLFM. Firstly, we use item ID, commonly used in recommendation systems, as input instead of the item description. Additionally, we apply improved deep learning model structures such as Self-Attention, Multi-head Attention, and Multi-Conv1D. We conducted experiments on various datasets with input and model structure changes. The results showed that when only the input was changed, MAE increased slightly compared to ADLFM due to accompanying information loss, resulting in decreased recommendation performance. However, the average learning speed per epoch significantly improved as the amount of information to be processed decreased. When both the input and the model structure were changed, the best-performing Multi-Conv1d structure showed similar performance to ADLFM, sufficiently counteracting the information loss caused by the input change. We conclude that G-ADLFRM is a new, lightweight, and generalizable model that maintains the performance of the existing ADLFM while enabling fast learning and inference.

The Process of Changes and Challenges of Regional Science & Technology Policy in Korea (한국 지역과학기술정책의 변화와 발전 방향)

  • Ho Kim;Dongbok Kim;Yoonsik Chae
    • Journal of Technology Innovation
    • /
    • v.31 no.1
    • /
    • pp.29-63
    • /
    • 2023
  • The purpose of this study is to analyze the process of changes in regional science and technology policies in Korea and to seek future development directions. In Korea, regional science and technology policies have been implemented since the introduction of the local autonomy system. Since then, it has been implemented in earnest with the establishment of a central government-level plan. The regional science and technology policies have been developed to this day by interacting with national science and technology policies and regional development policies. Nevertheless, due to the path dependence and lock-in effect in the accumulated process, the regional science and technology policies are still subordinate to central government policies. Thus, the establishment of an independent ecosystem for local science and technology is still insufficient. Furthermore, the gap between regions is deepening, such as the growing of aging population, population decline due to low birth rates, job losses due to the recession of local key industry, and the concentration of the youth population in the metropolitan area. The transformation path such as digital transformation and carbon neutrality paradigm is expected to further widen regional disparities. In order to address a comprehensive problem, the implementing system of regional science and technology policies need to be newly established. A framework for reinvention of regional science and technology policy needed in the era of grand societal challenges have to be developed.