• Title/Summary/Keyword: Demand Clustering

Search Result 129, Processing Time 0.03 seconds

Position-Based Multicast Routing in Mobile Ad hoc Networks: An Analytical Study

  • Qabajeh, Mohammad M.;Adballa, Aisha H.;Khalifa, Othman O.;Qabajeh, Liana K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1586-1605
    • /
    • 2012
  • With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

Optimization of Long-term Generator Maintenance Scheduling considering Network Congestion and Equivalent Operating Hours (송전제약과 등가운전시간을 고려한 장기 예방정비계획 최적화에 관한 연구)

  • Shin, Hansol;Kim, Hyoungtae;Lee, Sungwoo;Kim, Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.2
    • /
    • pp.305-314
    • /
    • 2017
  • Most of the existing researches on systemwide optimization of generator maintenance scheduling do not consider the equivalent operating hours(EOHs) mainly due to the difficulties of calculating the EOHs of the CCGTs in the large scale system. In order to estimate the EOHs not only the operating hours but also the number of start-up/shutdown during the planning period should be estimated, which requires the mathematical model to incorporate the economic dispatch model and unit commitment model. The model is inherently modelled as a large scale mixed-integer nonlinear programming problem and the computation time increases exponentially and intractable as the system size grows. To make the problem tractable, this paper proposes an EOH calculation based on demand grouping by K-means clustering algorithm. Network congestion is also considered in order to improve the accuracy of EOH calculation. This proposed method is applied to the actual Korean electricity market and compared to other existing methods.

An Optimized e-Lecture Video Search and Indexing framework

  • Medida, Lakshmi Haritha;Ramani, Kasarapu
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.8
    • /
    • pp.87-96
    • /
    • 2021
  • The demand for e-learning through video lectures is rapidly increasing due to its diverse advantages over the traditional learning methods. This led to massive volumes of web-based lecture videos. Indexing and retrieval of a lecture video or a lecture video topic has thus proved to be an exceptionally challenging problem. Many techniques listed by literature were either visual or audio based, but not both. Since the effects of both the visual and audio components are equally important for the content-based indexing and retrieval, the current work is focused on both these components. A framework for automatic topic-based indexing and search depending on the innate content of the lecture videos is presented. The text from the slides is extracted using the proposed Merged Bounding Box (MBB) text detector. The audio component text extraction is done using Google Speech Recognition (GSR) technology. This hybrid approach generates the indexing keywords from the merged transcripts of both the video and audio component extractors. The search within the indexed documents is optimized based on the Naïve Bayes (NB) Classification and K-Means Clustering models. This optimized search retrieves results by searching only the relevant document cluster in the predefined categories and not the whole lecture video corpus. The work is carried out on the dataset generated by assigning categories to the lecture video transcripts gathered from e-learning portals. The performance of search is assessed based on the accuracy and time taken. Further the improved accuracy of the proposed indexing technique is compared with the accepted chain indexing technique.

Collective Interaction Filtering Approach for Detection of Group in Diverse Crowded Scenes

  • Wong, Pei Voon;Mustapha, Norwati;Affendey, Lilly Suriani;Khalid, Fatimah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.912-928
    • /
    • 2019
  • Crowd behavior analysis research has revealed a central role in helping people to find safety hazards or crime optimistic forecast. Thus, it is significant in the future video surveillance systems. Recently, the growing demand for safety monitoring has changed the awareness of video surveillance studies from analysis of individuals behavior to group behavior. Group detection is the process before crowd behavior analysis, which separates scene of individuals in a crowd into respective groups by understanding their complex relations. Most existing studies on group detection are scene-specific. Crowds with various densities, structures, and occlusion of each other are the challenges for group detection in diverse crowded scenes. Therefore, we propose a group detection approach called Collective Interaction Filtering to discover people motion interaction from trajectories. This approach is able to deduce people interaction with the Expectation-Maximization algorithm. The Collective Interaction Filtering approach accurately identifies groups by clustering trajectories in crowds with various densities, structures and occlusion of each other. It also tackles grouping consistency between frames. Experiments on the CUHK Crowd Dataset demonstrate that approach used in this study achieves better than previous methods which leads to latest results.

Palette-based Color Attribute Compression for Point Cloud Data

  • Cui, Li;Jang, Euee S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3108-3120
    • /
    • 2019
  • Point cloud is widely used in 3D applications due to the recent advancement of 3D data acquisition technology. Polygonal mesh-based compression has been dominant since it can replace many points sharing a surface with a set of vertices with mesh structure. Recent point cloud-based applications demand more point-based interactivity, which makes point cloud compression (PCC) becomes more attractive than 3D mesh compression. Interestingly, an exploration activity has been started to explore the feasibility of PCC standard in MPEG. In this paper, a new color attribute compression method is presented for point cloud data. The proposed method utilizes the spatial redundancy among color attribute data to construct a color palette. The color palette is constructed by using K-means clustering method and each color data in point cloud is represented by the index of its similar color in palette. To further improve the compression efficiency, the spatial redundancy between the indices of neighboring colors is also removed by marking them using a flag bit. Experimental results show that the proposed method achieves a better improvement of RD performance compared with that of the MPEG PCC reference software.

Water Distribution Network Partitioning Based on Community Detection Algorithm and Multiple-Criteria Decision Analysis

  • Bui, Xuan-Khoa;Kang, Doosun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2020.06a
    • /
    • pp.115-115
    • /
    • 2020
  • Water network partitioning (WNP) is an initiative technique to divide the original water distribution network (WDN) into several sub-networks with only sparse connections between them called, District Metered Areas (DMAs). Operating and managing (O&M) WDN through DMAs is bringing many advantages, such as quantification and detection of water leakage, uniform pressure management, isolation from chemical contamination. The research of WNP recently has been highlighted by applying different methods for dividing a network into a specified number of DMAs. However, it is an open question on how to determine the optimal number of DMAs for a given network. In this study, we present a method to divide an original WDN into DMAs (called Clustering) based on community structure algorithm for auto-creation of suitable DMAs. To that aim, many hydraulic properties are taken into consideration to form the appropriate DMAs, in which each DMA is controlled as uniform as possible in terms of pressure, elevation, and water demand. In a second phase, called Sectorization, the flow meters and control valves are optimally placed to divide the DMAs, while minimizing the pressure reduction. To comprehensively evaluate the WNP performance and determine optimal number of DMAs for given WDN, we apply the framework of multiple-criteria decision analysis. The proposed method is demonstrated using a real-life benchmark network and obtained permissible results. The approach is a decision-support scheme for water utilities to make optimal decisions when designing the DMAs of their WDNs.

  • PDF

Indoor Environment Drone Detection through DBSCAN and Deep Learning

  • Ha Tran Thi;Hien Pham The;Yun-Seok Mun;Ic-Pyo Hong
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.439-449
    • /
    • 2023
  • In an era marked by the increasing use of drones and the growing demand for indoor surveillance, the development of a robust application for detecting and tracking both drones and humans within indoor spaces becomes imperative. This study presents an innovative application that uses FMCW radar to detect human and drone motions from the cloud point. At the outset, the DBSCAN (Density-based Spatial Clustering of Applications with Noise) algorithm is utilized to categorize cloud points into distinct groups, each representing the objects present in the tracking area. Notably, this algorithm demonstrates remarkable efficiency, particularly in clustering drone point clouds, achieving an impressive accuracy of up to 92.8%. Subsequently, the clusters are discerned and classified into either humans or drones by employing a deep learning model. A trio of models, including Deep Neural Network (DNN), Residual Network (ResNet), and Long Short-Term Memory (LSTM), are applied, and the outcomes reveal that the ResNet model achieves the highest accuracy. It attains an impressive 98.62% accuracy for identifying drone clusters and a noteworthy 96.75% accuracy for human clusters.

A Study for Solving Multi-Depot Dial-a-Ride Problem Considering Soft Time Window (다수차고지와 예약시간 위반을 고려한 교통약자 차량 서비스에 대한 연구)

  • Kim, Taehyeong;Park, Bum-Jin;Kang, Weon-Eui
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.5
    • /
    • pp.70-77
    • /
    • 2012
  • Dial-a-ride is the most widely available transit service for disabled persons or seniors in the United States and Europe. This paper studies a static dial-a-ride problem considering multiple depots, heterogeneous vehicles, and soft time windows. In this paper, we apply a heuristic based on clustering first-routing second(HCR) to a real-world large dial-a-ride problem from Maryland Transit Administration(MTA). MTA's real operation is compared with the results of developed heuristic for 24 cases. The objective function of the proposed model is to minimize the total cost composed of the service provider's cost and the customers' inconvenience cost. For the comparison, the objective function values of HCR do not include waiting cost, delay cost, and excess ride cost. The objective function values from HCR are better than those from MTA's operation for all cases. This result shows that our heuristic method can make the real operation better and more efficient.

Influences of Volume Volatilities on Price Volatilities in the Fishery Market (수산물 거래량의 변동성이 가격변동성에 미치는 영향분석)

  • Ko, Bong-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.10
    • /
    • pp.6084-6091
    • /
    • 2014
  • This paper presents the GJR GARCH model (Glosten et. al, 1993) to analyze the influences of volume volatilities on price volatilities in the fishery market. For the analysis, this study used the monthly price and volume data of aquacultural flatfish in Jeju. As a result, empirical analysis suggested volatility clustering. The persistency parameter(${\lambda}$) was estimated to be approximately 1 in aquacultural flatfish. The results showed that there is a significant negative relationship between the conditional variance of supply and that of price for aquacultural flatfish. This means that the general law of supply is valid. Finally, the empirical analysis was that an asymmetric coefficient (${\gamma}$) of GJR GARCH model was negative (-). This means that the higher volatility of volume leads to lower price volatility. That is, it is useful to make government policies that can adjust the volume (stockpiling, stabilizing supply and demand).

A Study on the Analysis of Spatial Characteristics with Respect to Regional Mobility Using Clustering Technique Based on Origin-Destination Mobility Data (기종점 모빌리티 데이터 기반 클러스터링 기법을 활용한 지역 모빌리티의 공간적 특성 분석 연구)

  • Donghoun Lee;Yongjun Ahn
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.22 no.1
    • /
    • pp.219-232
    • /
    • 2023
  • Mobility services need to change according to the regional characteristics of the target service area. Accordingly, analysis of mobility patterns and characteristics based on Origin-Destination (OD) data that reflect travel behaviors in the target service area is required. However, since conventional methods construct the OD data obtained from the administrative district-based zone system, it is hard to ensure spatial homogeneity. Hence, there are limitations in analyzing the inherent travel patterns of each mobility service, particularly for new mobility service like Demand Responsive Transit (DRT). Unlike the conventional approach, this study applies a data-driven clustering technique to conduct spatial analyses on OD travel patterns of regional mobility services based on reconstructed OD data derived from re-aggregation for original OD distributions. Based on the reconstructed OD data that contains information on the inherent feature vectors of the original OD data, the proposed method enables analysis of the spatial characteristics of regional mobility services, including public transit bus, taxi and DRT.