• Title/Summary/Keyword: k-shortest path

Search Result 328, Processing Time 0.024 seconds

Node Architecture and Cell Routing Strategies for ATM Applications in WDM Multihop Networks (WDM 다중홉 망에서 ATM 응용을 위한 노드 구조 및 셀 라우팅 기법)

  • Lee, Ho-Suk;Lee, Cheong-Hun;So, Won-Ho;Kwon Hyeok-Jung;Kim, Yeong-Cheon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.44-52
    • /
    • 1998
  • In this paper, we proposed a node architecture and cell routing strategies for ATM applications in WDM multihop networks. The proposed node architecture employs the optical delay loop for storing the cell which is failed in out-link contention. This optical delay loop allows the delay of one cell without the electro-optic conversion. Therefore, we can get the advantages of S&F(Store-and-Forward) routing in Deflection-based all-optical networks. To support the ATM applications efficiently. we considered the transmission priority of ATM cell so that high priority cell can be transmitted with lower loss and shorter delay than low priority one. Two kinds of routing strategies are designed for this architecture: Scheme-Ⅰand Scheme-Ⅱ. Scheme-Ⅰapplies S&F routing to high cell and Deflection routing to low cell, i.e., high cells are routed along the shortest path based on S&F routing, but low cells are deflected or lost. Schem-Ⅱ is similar to Scheme-Ⅰexcept that low cells can occupy the optical loop if it is available. This Scheme-Ⅱ increases the utilization of network resources without decreasing the throughput of high cell by reducing the low cell loss rate when traffic load is low. Simulation results show that our routing strategies have better performance than conventional ones under non-uniform traffic as well as uniform traffic.

  • PDF

Recommendation of Best Empirical Route Based on Classification of Large Trajectory Data (대용량 경로데이터 분류에 기반한 경험적 최선 경로 추천)

  • Lee, Kye Hyung;Jo, Yung Hoon;Lee, Tea Ho;Park, Heemin
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.2
    • /
    • pp.101-108
    • /
    • 2015
  • This paper presents the implementation of a system that recommends empirical best routes based on classification of large trajectory data. As many location-based services are used, we expect the amount of location and trajectory data to become big data. Then, we believe we can extract the best empirical routes from the large trajectory repositories. Large trajectory data is clustered into similar route groups using Hadoop MapReduce framework. Clustered route groups are stored and managed by a DBMS, and thus it supports rapid response to the end-users' request. We aim to find the best routes based on collected real data, not the ideal shortest path on maps. We have implemented 1) an Android application that collects trajectories from users, 2) Apache Hadoop MapReduce program that can cluster large trajectory data, 3) a service application to query start-destination from a web server and to display the recommended routes on mobile phones. We validated our approach using real data we collected for five days and have compared the results with commercial navigation systems. Experimental results show that the empirical best route is better than routes recommended by commercial navigation systems.

Development of a Vehicle Relocation Algorithm for the Promotion of One-way Car Sharing Service (공유차량의 효율적 단방향 서비스를 위한 차량 재배치 알고리즘)

  • Kim, Seung Hyun;Jung, Hee Jin;Bea, Sang Hoon
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.3
    • /
    • pp.239-247
    • /
    • 2014
  • In modern society, the transportation sector is having difficulties with mobility, safety, energy and environment issues so that solutions should be prepared progressively. Recently developed countries are paying greater attention to car-sharing systems as alternatives for relieving problems caused by increasing number of vehicles. Car-sharing systems are believed to keep the number of personal vehicles down and traffic congestion due to the fact that this system induces efficiency of vehicle operation. In this study, authors focused on solving the imbalance problem of car-sharing systems dynamically, to specifically improve one-way car sharing service. Therefore vehicle relocation algorithm was designed for maximizing profit of car sharing operators. For the application of the vehicle relocation algorithm among rental offices, we selected Haeundae-gu, Busan as the area of study. Rental offices have been designated to the zone centroid and we calculated the shortest path between rental offices by using TransCAD. In the study, we adapted MATLAB for the application of vehicle relocation algorithm. As the results, the total vehicle relocation time was estimated as 59.9 minutes. In addition, vehicle relocation algorithm was verified successfully by using Decision Tree method.

A Study on the Improvement of a Fleet Management System for Construction Equipment (건설장비 플릿관리 시스템 개선에 관한 연구)

  • Kim, Sung-Keun;Lim, So-Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.37 no.6
    • /
    • pp.1063-1076
    • /
    • 2017
  • To improve the productivity of the earthwork, a fleet management system for construction equipment was suggested in previous studies. But there were some gaps between theory and practice. To overcome this problem, some opinions are gathered form experts and field engineers and four improvements have been proposed and reflected in the system. First, the previous system consists of one hardware module, so it is hard to install it at a control office and construction equipment at the same time. The server module for the office and the mobile module for construction equipment are separately developed. Second, the transportation algorithm that is used in the previous system can generate shortest paths for the earthwork distribution, but embankment areas are not gathered. This situation leads to a decrease in compaction productivity. A modified algorithm for earthwork distribution is suggested. Third, the automated coordinate transformation is performed to show the position of construction equipment on the 3D terrain in real-time. Fourth, construction equipment groups should be formed in the initial stage of earthwork and the number of equipment of each groups should be changed by operation status and site environment. But this functions did not work properly in the previous system. This problem is corrected in the proposed system. The improvements can make the proposed system much more realistic one and can leads to an increase in the productivity of earthwork operations.

Voronoi-Based Search Scheme for Road Network Databases (도로 망 데이터베이스를 위한 보로노이 기반의 탐색 방안)

  • Kim, Dae-Hoon;Hwang, Een-Jun
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.348-357
    • /
    • 2007
  • Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

  • PDF

Automatic Detection of Off-topic Documents using ConceptNet and Essay Prompt in Automated English Essay Scoring (영어 작문 자동채점에서 ConceptNet과 작문 프롬프트를 이용한 주제-이탈 문서의 자동 검출)

  • Lee, Kong Joo;Lee, Gyoung Ho
    • Journal of KIISE
    • /
    • v.42 no.12
    • /
    • pp.1522-1534
    • /
    • 2015
  • This work presents a new method that can predict, without the use of training data, whether an input essay is written on a given topic. ConceptNet is a common-sense knowledge base that is generated automatically from sentences that are extracted from a variety of document types. An essay prompt is the topic that an essay should be written about. The method that is proposed in this paper uses ConceptNet and an essay prompt to decide whether or not an input essay is off-topic. We introduce a way to find the shortest path between two nodes on ConceptNet, as well as a way to calculate the semantic similarity between two nodes. Not only an essay prompt but also a student's essay can be represented by concept nodes in ConceptNet. The semantic similarity between the concepts that represent an essay prompt and the other concepts that represent a student's essay can be used for a calculation to rank "on-topicness" ; if a low ranking is derived, an essay is regarded as off-topic. We used eight different essay prompts and a student-essay collection for the performance evaluation, whereby our proposed method shows a performance that is better than those of the previous studies. As ConceptNet enables the conduction of a simple text inference, our new method looks very promising with respect to the design of an essay prompt for which a simple inference is required.

Extension Method of Association Rules Using Social Network Analysis (사회연결망 분석을 활용한 연관규칙 확장기법)

  • Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.4
    • /
    • pp.111-126
    • /
    • 2017
  • Recommender systems based on association rule mining significantly contribute to seller's sales by reducing consumers' time to search for products that they want. Recommendations based on the frequency of transactions such as orders can effectively screen out the products that are statistically marketable among multiple products. A product with a high possibility of sales, however, can be omitted from the recommendation if it records insufficient number of transactions at the beginning of the sale. Products missing from the associated recommendations may lose the chance of exposure to consumers, which leads to a decline in the number of transactions. In turn, diminished transactions may create a vicious circle of lost opportunity to be recommended. Thus, initial sales are likely to remain stagnant for a certain period of time. Products that are susceptible to fashion or seasonality, such as clothing, may be greatly affected. This study was aimed at expanding association rules to include into the list of recommendations those products whose initial trading frequency of transactions is low despite the possibility of high sales. The particular purpose is to predict the strength of the direct connection of two unconnected items through the properties of the paths located between them. An association between two items revealed in transactions can be interpreted as the interaction between them, which can be expressed as a link in a social network whose nodes are items. The first step calculates the centralities of the nodes in the middle of the paths that indirectly connect the two nodes without direct connection. The next step identifies the number of the paths and the shortest among them. These extracts are used as independent variables in the regression analysis to predict future connection strength between the nodes. The strength of the connection between the two nodes of the model, which is defined by the number of nodes between the two nodes, is measured after a certain period of time. The regression analysis results confirm that the number of paths between the two products, the distance of the shortest path, and the number of neighboring items connected to the products are significantly related to their potential strength. This study used actual order transaction data collected for three months from February to April in 2016 from an online commerce company. To reduce the complexity of analytics as the scale of the network grows, the analysis was performed only on miscellaneous goods. Two consecutively purchased items were chosen from each customer's transactions to obtain a pair of antecedent and consequent, which secures a link needed for constituting a social network. The direction of the link was determined in the order in which the goods were purchased. Except for the last ten days of the data collection period, the social network of associated items was built for the extraction of independent variables. The model predicts the number of links to be connected in the next ten days from the explanatory variables. Of the 5,711 previously unconnected links, 611 were newly connected for the last ten days. Through experiments, the proposed model demonstrated excellent predictions. Of the 571 links that the proposed model predicts, 269 were confirmed to have been connected. This is 4.4 times more than the average of 61, which can be found without any prediction model. This study is expected to be useful regarding industries whose new products launch quickly with short life cycles, since their exposure time is critical. Also, it can be used to detect diseases that are rarely found in the early stages of medical treatment because of the low incidence of outbreaks. Since the complexity of the social networking analysis is sensitive to the number of nodes and links that make up the network, this study was conducted in a particular category of miscellaneous goods. Future research should consider that this condition may limit the opportunity to detect unexpected associations between products belonging to different categories of classification.

The Design of Smart-phone Application Design for Intelligent Personalized Service in Exhibition Space (전시 공간에서 지능형 개인화 서비스를 위한 스마트 폰 어플리케이션 설계)

  • Cho, Young-Hee;Choi, Ae-Kwon
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.2
    • /
    • pp.109-117
    • /
    • 2011
  • The exhibition industry, as technology-intensive, eco-friendly industry, contributes to regional and national development and enhancement of its image as well, if it joins cultural and tourist industry. Therefore, We need to revitalize the exhibition industry, as actively holding an exhibition event. However, to attract a number of exhibition audience, the work of enhancing audience satisfaction and awareness of value for participation should be prioritized after improving quality of service within exhibition hall. As one way to enhance the quality of service, it is thought that the way providing personalized service geared toward each audience is needed. that is, if audience avoids the complexity in exhibition space and it affords them service to enable effective time and space management, it will improve the satisfaction. All such personalized service affordable lets the audience's preference on the basis of each audience profile registered in advance online grasp. and Based on this information, it is provided with exhibition-related information suited their purpose that is the booth for the interesting audience, the shortest path to go to the booth and event via audience's smart phone. and it collects audience's reaction information, such as visiting the booth, participating the event through offered the information in this way and location information for the flow of movement, the present position so that it makes revision of existing each audience profile. After correcting the information, it extracts the individual's preference. hereunder, it provides recommend booth and event information. in other words, it provides optimal information for individual by amendment based on reaction information about recommending information built on basic profile. It provides personalized service dynamic and interactive with audience. This paper will be able to provide the most suitable information for each audience through circular and interactive structure and designed smart-phone application supportable for updating dynamic and interactive personalized service that is able to afford surrounding information in real time, as locating movement position through sensing. The proposed application collects user‘s context information and carrys information gathering function collecting the reaction about searched or provided information via sensing. and it also carrys information gathering function providing needed data for user in exhibition hall. In other words, it offers information about recommend booth of position foundation for user, location-based services of recommend booth and involves service providing detailed information for inside exhibition by using service of augmented reality, the map of whole exhibition as well. and it is also provided with SNS service that is able to keep information exchange besides intimacy. To provide this service, application is consisted of several module. first of all, it includes UNS identity module for sensing, and contain sensor information gathering module handling and collecting the perceived information through this module. Sensor information gathered like this transmits the information gathering server. and there is exhibition information interfacing with user and this module transmits to interesting information collection module through user's reaction besides interface. Interesting information collection module transmits collected information and If valid information out of the information gathering server that brings together sensing information and interesting information is sent to recommend server, the recommend server makes recommend information through inference with gathered valid information. If this server transmit by exhibition information process, exhibition information process module is provided with user by interface. Through this system it raises the dynamic, intelligent personalized service for user.