检索结果-内蒙古大学图书馆

Route Optimization Application using Server-Client Architecture and Google APIs.

学校读者我要写书评

暂无评论

Route Optimization Application using Server-Client Architect...

International Conference on Computing for Sustainable Global Development (INDIACom)

作者： Ishita Malhotra Projit Chandra Souptik Kumar Majumdar Department of Computer Science and Engineering SRM Institute of Science and Technology Chennai INDIA Department of Software Engineering SRM Institute of Science and Technology Chennai INDIA Department of Computer Science St. Xaviers’ College Kolkata INDIA

Timely delivery and pickup of products which are in bulk, is still an issue in many places, where there are no planned routes to reach the destination. This results in a delay or even failure to provide that service in that particular time frame. So, to solve this very problem, this paper presents a fully developed android application which can be used for optimizing time, distance and cost of travelling of multiple travelling salesman based problems. This application uses Google APIs to gather required information and is built on server-client based architecture to communicate with all other applications for accepting clusters of location and to provide optimized routes for the individual commuter.

关键词：

A new unified method for detecting text from marathon runners and sports players in video

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Nag, Sauradip Shivakumara, Palaiahnakote Pal, Umapada Lu, Tong Blumenstein, Michael Kalyani Government Engineering College Kalyani Kolkata India Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India National Key Lab for Novel Software Technology Nanjing University Nanjing China Sydney Australia

Detecting text located on the torsos of marathon runners and sports players in video is a challenging issue due to poor quality and adverse effects caused by flexible/colorful clothing, and different structures of human bodies or actions. This paper presents a new unified method for tackling the above challenges. The proposed method fuses gradient magnitude and direction coherence of text pixels in a new way for detecting candidate regions. Candidate regions are used for determining the number of temporal frame clusters obtained by K-means clustering on frame differences. This process in turn detects key frames. The proposed method explores Bayesian probability for skin portions using color values at both pixel and component levels of temporal frames, which provides fused images with skin components. Based on skin information, the proposed method then detects faces and torsos by finding structural and spatial coherences between them. We further propose adaptive pixels linking a deep learning model for text detection from torso regions. The proposed method is tested on our own dataset collected from marathon/sports video and three standard datasets, namely, RBNR, MMM and R-ID of marathon images, to evaluate the performance. In addition, the proposed method is also tested on the standard natural scene datasets, namely, CTW1500 and MS-COCO text datasets, to show the objectiveness of the proposed method. A comparative study with the state-of-the-art methods on bib number/text detection of different datasets shows that the proposed method outperforms the existing methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Pixels

Latent factor model based zero-shot learning

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1914卷

作者： Y X Q Zhang Y D Peng J D Li C X Zhang D R Yu R T Xia D B Liu B Yang College of Software Engineering Jilin University Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China School of Artificial Intelligence Jilin University Changchun 130012 China

The key of zero-shot learning is to design an appropriate approach to capture the potential relevance between the image visual features and category-level semantic knowledge. There is a lot of data with matrix form in zero-shot recognition problem, such as image label matrix, visual feature matrix and semantic information matrix. Inspired by the latent factor model which tackles recommendation problems well avoid being influenced by sparse matrix, we regard an image as a user and analogize each dimension of the visual feature as an item. The key to our approach is that we model the image recognition as a special recommendation problem by aid of latent factor model. We evaluate our algorithm on three classic benchmark data sets for both conventional and generalized zero-shot setting, the classification results outperform significantly the state-of-art approaches with low calculation cost.

关键词：

Trust-based security routing mechanism in mobile social networks 14

学校读者我要写书评

暂无评论

Trust-based security routing mechanism in mobile social netw...

14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2018

作者： Yang, Shuang Wang, Xingwei Zhang, Shuang Huang, Min College of Computer Science and Engineering Northeastern University Shenyang China College of Software Northeastern University Shenyang China College of Information Science and Engineering Northeastern University Shenyang China

ISBN: (纸本)9781538680971

Malicious and selfish behaviors represent a serious security threat against routing in Mobile Social Network (MSN). Due to the unique network characteristics, it is a challenge to design a misbehavior detection scheme in MSN. In this paper, a trust-based security routing mechanism is presented, i.e. a malicious behavior detection mechanism with identity verification scheme. The main idea is to introduce the behavior trust and identity trust to guide the routing. Firstly, we judge the node's behavior based on both comprehensive trust and social relationship strength. And then, we forward messages according to the different measurement within and outside of the friend groups. Besides, we also propose a distributed key management scheme to further improve the efficiency of the proposed mechanism via verifying the identity trust of the node. The simulation results indicate that the proposed routing mechanism can lower the impact of malicious behavior of nodes effectively and it has greater security performance than some classical routing algorithms. © 2018 IEEE.

关键词： Network security

An improved simulation model for pedestrian crowd evacuation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Muhammed, Danial A. Rashid, Tarik A. Alsadoon, Abeer Bacanin, Nebojsa Fattah, Polla Mohammadi, Mokhtar Banerjee, Indradip Computer Department College of Science University of Sulaimani SulaymaniyahKRG46001 Iraq Computer Science and Engineering Department University of Kurdistan Hewler ErbilKRG44001 Iraq Department of Information Technology School of Computing and Mathematics Charles Sturt University Sydney BathurstNSW2795 Australia Faculty of Informatics and Computing Vice-dean Singidunum University Belgrade11000 Serbia Software and Informatics Engineering Dept Engineering College Salahaddin University-Erbil ErbilKRG44001 Iraq Department of Information Technology Lebanese French University ErbilKRG44001 Iraq Department of Computer Science and Engineering University Institute of Technology The University of Burdwan BurdwanWest Bengal713101 India

This paper works on one of the most recent pedestrian crowd evacuation models, i.e., "a simulation model for pedestrian crowd evacuation based on various AI techniques", developed in late 2019. This study adds a new feature to the developed model by proposing a new method and integrating it with the model. This method enables the developed model to find a more appropriate evacuation area design, among others regarding safety due to selecting the best exit door location among many suggested locations. This method is completely dependent on the selected model's output, i.e., the evacuation time for each individual within the evacuation process. The new method finds an average of the evacuees’ evacuation times of each exit door location;then, based on the average evacuation time, it decides which exit door location would be the best exit door to be used for evacuation by the evacuees. To validate the method, various designs for the evacuation area with various written scenarios were used. The results showed that the model with this new method could predict a proper exit door location among many suggested locations. Lastly, from the results of this research using the integration of this newly proposed method, a new capability for the selected model in terms of safety allowed the right decision in selecting the finest design for the evacuation area among other designs. © 2020, CC BY.

关键词： Location

Exploring communities in large profiled graphs

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Chen, Yankai Fang, Yixiang Cheng, Reynold Li, Yun Chen, Xiaojun Zhang, Jie Department of Computer Science University of Hong Kong Hong Kong Department of Computer Science and Technology Nanjing University China College of Computer Science and Software Shenzhen University China School of Computer Science and Engineering Nanyang Technological University Singapore

Given a graph G and a vertex q ∈ G, the community search (CS) problem aims to efficiently find a subgraph of G whose vertices are closely related to q. Communities are prevalent in social and biological networks, and can be used in product advertisement and social event recommendation. In this paper, we study profiled community search (PCS), where CS is performed on a profiled graph. This is a graph in which each vertex has labels arranged in a hierarchical manner. Extensive experiments show that PCS can identify communities with themes that are common to their vertices, and is more effective than existing CS approaches. As a naive solution for PCS is highly expensive, we have also developed a tree index, which facilitate efficient and online solutions for PCS. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

An improved simulation model for pedestrian crowd evacuation

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2020年

作者： Muhammed, Danial A. Rashid, Tarik A. Alsadoon, Abeer Bacanin, Nebojsa Fattah, Polla Mohammadi, Mokhtar Banerjee, Indradip Computer Department College of Science University of Sulaimani KRG Sulaymaniyah46001 Iraq Computer Science and Engineering Department University of Kurdistan Hewler KRG Erbil44001 Iraq Department of Information Technology School of Computing and Mathematics Charles Sturt University Bathurst SydneyNSW2795 Australia Faculty of Informatics and Computing Vice-dean Singidunum University Belgrade11000 Serbia Software and Informatics Engineering Dept Engineering College Salahaddin University-Erbil KRG Erbil44001 Iraq Department of Information Technology Lebanese French University KRG Erbil44001 Iraq Department of Computer Science and Engineering University Institute of Technology The University of Burdwan West Bengal Burdwan713101 India

关键词： Location

BLOCKS OF THE CATEGORY Op IN TYPE E

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Jieren, Hu Xiao, Wei Zhang, Ailin College of Computer Science and Software Engineering Shenzhen University ShenzhenGuangdong518060 China College of Mathematics and statistics Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen Guangdong518060 China College of Mathematics and statistics Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen Guangdong518060 China

关键词：

An improved bacteria foraging optimization algorithm for high dimensional multi-objective optimization problems 9th

学校读者我要写书评

暂无评论

An improved bacteria foraging optimization algorithm for hig...

9th International Conference on Swarm Intelligence, ICSI 2018

作者： Lu, Yueliang Ni, Qingjian College of Software Engineering Southeast University Suzhou China School of Computer Science and Engineering Southeast University Nanjing China

ISBN: (纸本)9783319938141

In this paper, an improved bacterial foraging optimization algorithm (BFO), which is inspired by the foraging and chemotactic phenomenon of bacteria, named high dimensional multi-objective bacterial foraging optimization (HMBFO) is introduced for solving high dimensional multi-objective optimization (MO) problems. The high-dimension update strategy is presented in this paper to solve the problem that the global Pareto solutions can be hardly obtained by traditional MBFO in high-dimension MO problems. According to this strategy, the position of bacteria not only can be rapidly updated to the optimal solution, but also can enhance the searching precision and reduce chemotaxis dependency remarkably. Moreover, the penalty mechanism is considered for solving the inequality constraints MO problems, and three different performance metrics (Hypervolume, Convergence metric, Spacing metric) are introduced to evaluate the performances of algorithms. Compared with the other four evolutionary MO algorithms (MBFO, MOCLPSO, MOPSO, PESA2), the simulation result shows that in most cases, the proposed algorithm carries out better than the other existing algorithms, it has high efficiency, rapid speed of convergence and strong search capability of global Pareto solutions. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Bacteria