• Title/Summary/Keyword: 메타데이터 구축

Search Result 504, Processing Time 0.022 seconds

Allocation Problem in Door to Door Delivery Service Network (택배 운송 네트워크 설계를 위한 할당 문제)

  • 정기호;고창성
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.987-993
    • /
    • 2002
  • 최근 들어 전자상거래의 급속한 발달로 전 세계적으로 수송 물동량이 급격히 증대되고 있고, 이로 인해 택배사업이 대단히 활성화되고 있다. 출발지와 목적지가 서로 상이한 무수히 만은 수송 요구가 들어오면 수송 요구화물의 신속한 집배송을 위한 배차계획 및 수송계획을 세우는 것이 택배회사의 주요 업무이다. 이러한 배차 계획 및 수송 계획을 어떻게 수립하느냐에 따라 전체 수송비용뿐만 아니라 고객들의 서비스 수준에 상당한 영향을 미치게 된다. 그러나 이러한 운영적 차원에서의 의사결정 이전에 훨씬 중요하게 고려해야 할 내용이 택배네트워크의 설계 문제이다. 이러한 택배네트워크의 설계에는 터미널 개수 및 위치를 결정하는 전략적 문제와 영업소들을 터미널에 할당하는 전술적 문제로 구분될 수 있다. 현재 우리 국내에는 크고 작은 수많은 택배사업자들이 있으나, 그 중에서 비교적 규모가 큰 주요 택배회사들은 대부분 전국에 걸쳐 다수의 터미널을 설치하여 두고 수송화물의 집배송을 위한 물류거점으로 운영하고 있다. 이와 같은 터미널 위치 및 개수가 정해진 상태에서 전국에 걸쳐 분포되어 있는 영업소들을 어떤 터미널에 할당하여 처리되도록 하느냐의 여부는 수송비용 측면에서뿐만 아니라 고객들에 대한 서비스 측면에서 대단히 중요한 의사결정 중의 하나이다. 본 연구에서는 비용과 시간을 고려하여 전국에 걸쳐 분포되어 있는 영업소들을 어떤 터미널에 할당해야 하는지를 결정하기 위한 수리적 모형을 제시하고, 이에 대한 탐색적 해법을 제시하며, 국내의 택배회사 사례를 대상으로 모형을 적용해 보고자 한다.무가 많이 발생하는 유통 분야의 프랜차이즈 산업을 대상으로 기업정보시스템 구현 및 경쟁력 강화를 뒷받침하기 위해서, 기업간 프로세스 협업(collaboration) 부분의 데이터 및 서식, 이를 취급하는 기능과 프로세스에 대란 분석을 통해 업무 프로세스 모델링 방법론과 관련한 모델링 지침 및 메타모델을 이용한 표준 업무 프로세스 모델을 개발하여 기업간 업무 프로세스 표준화에 대한 체계적인 관리에 대한 방안을 연구하고자 한다.의Bullwhip effect를 감소시킬 수 있는 장점이 있다. 동시에 이것은 향후 e-Business 시스템 구축을 위한 기본 인프라 역할을 수행할 수 있게 된다. 많았고 년도에 따른 변화는 보이지 않았다. 스키손상의 발생빈도는 초기에 비하여 점차 감소하는 경향을 보였으며, 손상의 특성도 부위별, 연령별로 다양한 변화를 나타내었다.해가능성을 가진 균이 상당수 검출되므로 원료의 수송, 김치의 제조 및 유통과정에서 병원균에 대한 오염방지에 유의하여야 할 것이다. 확인할 수 있었다. 이상의 결과에 의하면 고농도의 유기물이 함유된 음식물쓰레기는 Hybrid Anaerobic Reactor (HAR)를 이용하여 HRT 30일 정도에서 충분히 직접 혐기성처리가 가능하며, 이때 발생된 $CH_{4}$를 회수하여 이용하면 대체에너지원으로 활용 가치가 높은 것으로 판단된다./207), $99.2\%$(238/240), $98.5\%$(133/135) 및 $100\%$ (313)였다. 각

  • PDF

Product Community Analysis Using Opinion Mining and Network Analysis: Movie Performance Prediction Case (오피니언 마이닝과 네트워크 분석을 활용한 상품 커뮤니티 분석: 영화 흥행성과 예측 사례)

  • Jin, Yu;Kim, Jungsoo;Kim, Jongwoo
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.1
    • /
    • pp.49-65
    • /
    • 2014
  • Word of Mouth (WOM) is a behavior used by consumers to transfer or communicate their product or service experience to other consumers. Due to the popularity of social media such as Facebook, Twitter, blogs, and online communities, electronic WOM (e-WOM) has become important to the success of products or services. As a result, most enterprises pay close attention to e-WOM for their products or services. This is especially important for movies, as these are experiential products. This paper aims to identify the network factors of an online movie community that impact box office revenue using social network analysis. In addition to traditional WOM factors (volume and valence of WOM), network centrality measures of the online community are included as influential factors in box office revenue. Based on previous research results, we develop five hypotheses on the relationships between potential influential factors (WOM volume, WOM valence, degree centrality, betweenness centrality, closeness centrality) and box office revenue. The first hypothesis is that the accumulated volume of WOM in online product communities is positively related to the total revenue of movies. The second hypothesis is that the accumulated valence of WOM in online product communities is positively related to the total revenue of movies. The third hypothesis is that the average of degree centralities of reviewers in online product communities is positively related to the total revenue of movies. The fourth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. The fifth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. To verify our research model, we collect movie review data from the Internet Movie Database (IMDb), which is a representative online movie community, and movie revenue data from the Box-Office-Mojo website. The movies in this analysis include weekly top-10 movies from September 1, 2012, to September 1, 2013, with in total. We collect movie metadata such as screening periods and user ratings; and community data in IMDb including reviewer identification, review content, review times, responder identification, reply content, reply times, and reply relationships. For the same period, the revenue data from Box-Office-Mojo is collected on a weekly basis. Movie community networks are constructed based on reply relationships between reviewers. Using a social network analysis tool, NodeXL, we calculate the averages of three centralities including degree, betweenness, and closeness centrality for each movie. Correlation analysis of focal variables and the dependent variable (final revenue) shows that three centrality measures are highly correlated, prompting us to perform multiple regressions separately with each centrality measure. Consistent with previous research results, our regression analysis results show that the volume and valence of WOM are positively related to the final box office revenue of movies. Moreover, the averages of betweenness centralities from initial community networks impact the final movie revenues. However, both of the averages of degree centralities and closeness centralities do not influence final movie performance. Based on the regression results, three hypotheses, 1, 2, and 4, are accepted, and two hypotheses, 3 and 5, are rejected. This study tries to link the network structure of e-WOM on online product communities with the product's performance. Based on the analysis of a real online movie community, the results show that online community network structures can work as a predictor of movie performance. The results show that the betweenness centralities of the reviewer community are critical for the prediction of movie performance. However, degree centralities and closeness centralities do not influence movie performance. As future research topics, similar analyses are required for other product categories such as electronic goods and online content to generalize the study results.

Evaluation of Road and Traffic Information Use Efficiency on Changes in LDM-based Electronic Horizon through Microscopic Simulation Model (미시적 교통 시뮬레이션을 활용한 LDM 기반 도로·교통정보 활성화 구간 변화에 따른 정보 이용 효율성 평가)

  • Kim, Hoe Kyoung;Chung, Younshik;Park, Jaehyung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.43 no.2
    • /
    • pp.231-238
    • /
    • 2023
  • Since there is a limit to the physically visible horizon that sensors for autonomous driving can perceive, complementary utilization of digital map data such as a Local Dynamic Map (LDM) along the probable route of an Autonomous Vehicle (AV) is proposed for safe and efficient driving. Although the amount of digital map data may be insignificant compared to the amount of information collected from the sensors of an AV, efficient management of map data is inevitable for the efficient information processing of AVs. The objective of this study is to analyze the efficiency of information use and information processing time of AV according to the expansion of the active section of LDM-based static road and traffic information. To carry out this objective, a microscopic simulator model, VISSIM and VISSIM COM, was employed, and an area of about 9 km × 13 km was selected in the Busan Metropolitan Area, which includes heterogeneous traffic flows (i.e., uninterrupted and interrupted flows) as well as various road geometries. In addition, the LDM information used in AVs refers to the real high-definition map (HDM) built on the basis of ISO 22726-1. As a result of the analysis, as the electronic horizon area increases, while short links are intensively recognized on interrupted urban roads and the sum of link lengths increases as well, the number of recognized links is relatively small on uninterrupted traffic road but the sum of link lengths is large due to a small number of long links. Therefore, this study showed that an efficient range of electronic horizon for HDM data collection, processing, and management are set as 600 m on interrupted urban roads considering the 12 links corresponding to three downstream intersections and 700 m on uninterrupted traffic road associated with the 10 km sum of link lengths, respectively.

Dynamic Virtual Ontology using Tags with Semantic Relationship on Social-web to Support Effective Search (효율적 자원 탐색을 위한 소셜 웹 태그들을 이용한 동적 가상 온톨로지 생성 연구)

  • Lee, Hyun Jung;Sohn, Mye
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.19-33
    • /
    • 2013
  • In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.