• Title/Summary/Keyword: Cluster-based Search

Search Result 141, Processing Time 0.023 seconds

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.

Heuristic Backtrack Search Algorithm for Energy-efficient Clustering in Wireless Sensor Networks (무선 센서 네트웍에서 에너지 효율적인 집단화를 위한 경험적 백트랙 탐색 알고리즘)

  • Sohn, Surg-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.219-227
    • /
    • 2008
  • As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest Preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a Priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of Power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

  • PDF

Efficient restriction of route search area in cluster based wireless ad hoc networks (클러스터 기반 무선 애드 혹 네트워크에서의 효율적인 경로 탐색 지역 제어)

  • Lee, Jangsu;Kim, Sungchun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.792-795
    • /
    • 2012
  • 애드 혹 네트워크(MANET: Mobile Ad hoc NETworks)는 기본적인 내부구조(infrastructure) 없이 노드들만으로 네트워크 망을 구성한다. 경로 탐색 정책으로 리액티브(reactive) 방식과 프로액티브(proactive) 방식이 있는데, 전통적으로 리액티브 방식의 성능이 더 좋은 것으로 평가된다. 그리고 두가지 방식의 장점을 취합한 하이브리드(hybrid) 방식의 클러스터 토폴로지(cluster topology) 도입에 관한 연구가 이루어지고 있다. 그 중, HCR(Hybrid Cluster Routing)이 제안되었는데, 이는 프로액티브 방식에 보다 중심을 둔 기법이다. HCR 은 리액티브 방식 경로 탐색 방법인 플라딩(flooding)의 탐색 지역을 한정된 범위로 제한할 수 있으나, 프로액티브 방식의 전체 네트워크 구성 정보 유지에 따른 막대한 오버헤드를 발생한다. 본 논문에서는 이러한 오버헤드를 줄이기 위해, 클러스터 내부 경로 탐색 기법인 MICF(Maginot path based Intra Cluster Flooding)를 제안한다. MICF 는 HCR 을 개선한 FSRS(First Search and Reverse Setting) 기반의 기법으로서, 클러스터 내부의 마지노 패스(maginot path)를 기준으로 경로 탐색 지역을 제한한다. MICF 는 게이트웨이(gateway) 간 최단 거리가 항상 클러스터 헤드(cluster head)를 중점으로 원의 내각 지역에 존재함을 바탕으로 하며, 최단 경로의 보장과 플라딩 지역 제한을 동시에 만족한다. 실험 결과, MICF 는 FSRS 기반의 기존 클러스터 내부 플라딩 방식보다 총 에너지의 7.79%만큼 더 에너지를 보존하였다. 결론적으로, MICF 역시 기존의 방식보다 에너지를 더 효율적으로 사용할 수 있으며, 마지노패스 설정과 이를 기반으로 한 제어 과정에 추가적인 오버헤드가 발생하지 않는다. 그리고 플라딩 면적이 작을수록 오버헤드가 줄어들게 됨을 알 수 있다.

Distribution System Reconfiguration Using the PC Cluster based Parallel Adaptive Evolutionary Algorithm

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho;Hwang Gi-Hyun;Yoon Yoo-Soo
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.269-279
    • /
    • 2005
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

A Bio-inspired Hybrid Cross-Layer Routing Protocol for Energy Preservation in WSN-Assisted IoT

  • Tandon, Aditya;Kumar, Pramod;Rishiwal, Vinay;Yadav, Mano;Yadav, Preeti
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1317-1341
    • /
    • 2021
  • Nowadays, the Internet of Things (IoT) is adopted to enable effective and smooth communication among different networks. In some specific application, the Wireless Sensor Networks (WSN) are used in IoT to gather peculiar data without the interaction of human. The WSNs are self-organizing in nature, so it mostly prefer multi-hop data forwarding. Thus to achieve better communication, a cross-layer routing strategy is preferred. In the cross-layer routing strategy, the routing processed through three layers such as transport, data link, and physical layer. Even though effective communication achieved via a cross-layer routing strategy, energy is another constraint in WSN assisted IoT. Cluster-based communication is one of the most used strategies for effectively preserving energy in WSN routing. This paper proposes a Bio-inspired cross-layer routing (BiHCLR) protocol to achieve effective and energy preserving routing in WSN assisted IoT. Initially, the deployed sensor nodes are arranged in the form of a grid as per the grid-based routing strategy. Then to enable energy preservation in BiHCLR, the fuzzy logic approach is executed to select the Cluster Head (CH) for every cell of the grid. Then a hybrid bio-inspired algorithm is used to select the routing path. The hybrid algorithm combines moth search and Salp Swarm optimization techniques. The performance of the proposed BiHCLR is evaluated based on the Quality of Service (QoS) analysis in terms of Packet loss, error bit rate, transmission delay, lifetime of network, buffer occupancy and throughput. Then these performances are validated based on comparison with conventional routing strategies like Fuzzy-rule-based Energy Efficient Clustering and Immune-Inspired Routing (FEEC-IIR), Neuro-Fuzzy- Emperor Penguin Optimization (NF-EPO), Fuzzy Reinforcement Learning-based Data Gathering (FRLDG) and Hierarchical Energy Efficient Data gathering (HEED). Ultimately the performance of the proposed BiHCLR outperforms all other conventional techniques.

Optimal Cluster Head Selection Method for Sectorized Wireless Powered Sensor Networks (섹터기반 무선전력 센서 네트워크를 위한 최적 클러스터 헤드 선택 방법)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.1
    • /
    • pp.176-179
    • /
    • 2022
  • In this paper, we consider a sectorized wireless powered sensor network (WPSN), wherein sensor nodes are clustered based on sectors and transmit data to the cluster head (CH) using energy harvested from a hybrid access point. We construct a system model for this sectorized WPSN and find optimal coordinates of CH that maximize the achievable transmission rate of sensing data. To obtain the optimal CH with low overhead, we perform an asymptotic geometric analysis (GA). Simulation results show that the proposed GA-based CH selection method is close to the optimal performance exhibited by exhaustive search with a low feedback overhead.

Study on MPI-based parallel sequence similarity search in the LINUX cluster (클러스터 환경에서의 MPI 기반 병렬 서열 유사성 검색에 관한 연구)

  • Hong, Chang-Bum;Cha, Jeoung-Ho;Lee, Sung-Hoon;Shin, Seung-Woo;Park, Keun-Joon;Park, Keun-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.69-78
    • /
    • 2006
  • In the field of the bioinformatics, it plays an important role in predicting functional information or structure information to search similar sequence in biological DB. Biolrgical sequences have been increased dramatically since Human Genome Project. At this point, because the searching speed for the similar sequence is highly regarded as the important factor for predicting function or structure, the SMP(Sysmmetric Multi-Processors) computer or cluster is being used in order to improve the performance of searching time. As the method to improve the searching time of BLAST(Basic Local Alighment Search Tool) being used for the similarity sequence search, We suggest the nBLAST algorithm performing on the cluster environment in this paper. As the nBLAST uses the MPI(Message Passing Interface), the parallel library without modifying the existing BLAST source code, to distribute the query to each node and make it performed in parallel, it is possible to easily make BLAST parallel without complicated procedures such as the configuration. In addition, with the experiment performing the nBLAST in the 28 nodes of LINUX cluster, the enhanced performance according to the increase in the number of the nodes has been confirmed.

  • PDF

Implementation of Integrated Analysis System for Bioinformatics Analysis

  • Koo Bong-Oh;Shin Yong-Won
    • Biomedical Science Letters
    • /
    • v.10 no.4
    • /
    • pp.523-528
    • /
    • 2004
  • The core factor of the study is integrated environment based PC-Cluster system and high speed access rate up to 155 Mbps, continuous collection system for bioinformatics information at home and abroad. The results of the study are establishment and stabilization of information and communication infrastructure, establishment and stabilization of high performance computer network up to 155 Mbps, development of PC-Cluster system with 32 nodes, a parallelized BLAST on Cluster system, which can provides scalable speedup in terms of response time, and development of collection and search system for bioinformatics information.

  • PDF

Exploratory Study on the Success Factors of Rehabilitation Medical Device Cluster

  • Kim, Sung-Jin;Kim, Gyu-Bae
    • The Journal of Economics, Marketing and Management
    • /
    • v.6 no.4
    • /
    • pp.17-27
    • /
    • 2018
  • Purpose - As Korea is reaching a post-aged society, the number of chronic illness is increasing, and the demand for rehabilitation medical device is growing. Although there is high potential for the growth in rehabilitation industry, because most of the related companies in Korea are relatively small, lacking capital or R&D resource, it is difficult for them to create an innovative product, and currently most of the high-tech equipments are imported. Therefore a medical device cluster, where business, research, medical institutes and universities may work cooperatively to enhance research development and solve issues is necessary for future development. Research design, data, methodology - In this method we have done a literature review of the rehabilitation industry and industrial cluster. Based on the studies, we have conducted an exploratory factor analysis by studying examples of foreign and domestic medical clusters and drawing success factors in forming a medical cluster. Next based on the studies we have conducted a survey to domestic medical device companies to find their difficulties and needs to form a successful medical device cluster. Results - This paper provides both theoretic review on success factors of forming a medical device cluster and practical analysis using case study and survey. Conclusion - The significance of this paper is that based on the literature review, we have compared actual examples of domestic/foreign medical clusters and drawn difference and coincidence between literature and actual cluster success factor. We were also able to conduct a survey on actual medical device companies and through the results we were able to search difficulties and necessities of medical device companies.

A Study on the Optimal Search Keyword Extraction and Retrieval Technique Generation Using Word Embedding (워드 임베딩(Word Embedding)을 활용한 최적의 키워드 추출 및 검색 방법 연구)

  • Jeong-In Lee;Jin-Hee Ahn;Kyung-Taek Koh;YoungSeok Kim
    • Journal of the Korean Geosynthetics Society
    • /
    • v.22 no.2
    • /
    • pp.47-54
    • /
    • 2023
  • In this paper, we propose the technique of optimal search keyword extraction and retrieval for news article classification. The proposed technique was verified as an example of identifying trends related to North Korean construction. A representative Korean media platform, BigKinds, was used to select sample articles and extract keywords. The extracted keywords were vectorized using word embedding and based on this, the similarity between the extracted keywords was examined through cosine similarity. In addition, words with a similarity of 0.5 or higher were clustered based on the top 10 frequencies. Each cluster was formed as 'OR' between keywords inside the cluster and 'AND' between clusters according to the search form of the BigKinds. As a result of the in-depth analysis, it was confirmed that meaningful articles appropriate for the original purpose were extracted. This paper is significant in that it is possible to classify news articles suitable for the user's specific purpose without modifying the existing classification system and search form.