{"title":"The Capture and Evaluation System of Student Actions in Physical Education Classroom Based on Deep Learning","authors":"G. Liu, R. G. Crespo, Adhiyaman Manickam","doi":"10.1142/s0219265921470290","DOIUrl":"https://doi.org/10.1142/s0219265921470290","url":null,"abstract":"Nowadays, it is essential to capture and evaluate student action in the physical education classroom to assess their behavior. Every student’s performance is unique in physical activity. Every time, the staff or trainer cannot watch and evaluate the students individually. At the university level, the use of classroom capture systems is becoming more widespread. However, due to technology’s recent growth and application, the research on classroom capture systems’ efficacy in university classrooms has been minimal. This paper is proposed for the student action capture and evaluation system. Image preprocessing is the process of preparing pictures for use in model training and inference. This covers resizing, orienting, and color adjustments, among other things. As a result, a change that can be an augmentation in certain cases can be better served as a pretreatment step in others. The DL-IF uses cloud technology for data storage and evaluation. DL-IF uses the imaging technology to monitor students’ actions and responses in the classroom. The image data are evaluated based on the trained set of data provided in DL-IF’s Artificial Neural Network (ANN). The evaluation of unique individuality in every student’s performance is reported to the respective trainer. The simulation analysis of the proposed method DL-IF proves that it can monitor, capture and evaluate every student’s action in all physical activity classrooms. Hence, it proved that this framework could work with high accuracy and minimized mean square error rate.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"458 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123644084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The 3-Vertex-Rainbow Index of 2-(Edge) Connected Graphs","authors":"Yingbin Ma, Wenhan Zhu","doi":"10.1142/s0219265921500341","DOIUrl":"https://doi.org/10.1142/s0219265921500341","url":null,"abstract":"Let [Formula: see text] be a vertex-colored graph. For a vertex set [Formula: see text] of at least two vertices, a tree [Formula: see text] that connects [Formula: see text] in [Formula: see text] is vertex-rainbow if no two vertices of [Formula: see text] have the same color, such a tree is called a vertex-rainbow [Formula: see text]-tree or a vertex-rainbow tree connecting [Formula: see text]. Let [Formula: see text] be a fixed integer with [Formula: see text], [Formula: see text] is said to be vertex-rainbow [Formula: see text]-tree connected if every [Formula: see text]-subset [Formula: see text] of [Formula: see text] has a vertex-rainbow [Formula: see text]-tree. The [Formula: see text]-vertex-rainbow index [Formula: see text] of a graph [Formula: see text] is the minimum number of colors are needed in order to make [Formula: see text] vertex-rainbow [Formula: see text]-tree connected. In this paper, we focus on [Formula: see text]. When [Formula: see text] is [Formula: see text]-connected or [Formula: see text]-edge-connected, we provide a sharp upper bound for [Formula: see text], respectively, and determine the graphs [Formula: see text], where [Formula: see text] reaches the upper bound.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115964289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid Meta-Heuristic Algorithms Based Optimal Antenna Selection for Large Scale MIMO in LTE Network","authors":"R. A. Patil, P. Kavipriya, B. Patil","doi":"10.1142/s0219265921500262","DOIUrl":"https://doi.org/10.1142/s0219265921500262","url":null,"abstract":"MIMO is a type of antenna technology which utilizes multiple antennas to separate signals traveling in various paths as a result of reflections, etc., to be separated and their ability utilized to enhance the throughput of data and the signal to noise ratio which in return enhances the performance of the system. For providing enhanced signal performance and enhanced data rates, MIMO is utilized within LTE. When the quantities of antennas are increased, there is increase in the probability that deep fading is experienced by at least some antennas, which affects the overall efficiency of the MIMO system. To handle these issues, a reliable technique has been presented that involves selection of antenna subset. The proposed technique incorporates combination of SBO and PSO for antenna selection. Antenna selection’s main concept is to utilize a bounded quantity of analog chains that are adaptively switched to subset of the available antennas capable of preserving the selection diversity gains and also can minimize the quantity of radio frequency chains needed. The maximum channel capacity of the channel has been considered as the objective function for selecting optimal antennas. The comparison of the proposed approach’s performance and the existing approaches’ performance is done. From the simulation result, it has been shown that the presented approach’s performance has been better than the performance of the existing approaches in terms of BER, energy efficiency, spectral efficiency and optimal transmit power.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131043894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic Noisy Measurement Aware Localization Model for Wireless Sensor Networks","authors":"N. R. Thejaswini, G. Muthupandi","doi":"10.1142/s0219265921500328","DOIUrl":"https://doi.org/10.1142/s0219265921500328","url":null,"abstract":"Localization through received signal strength (RSS) has attained a lot of interest across industries and research organization due to ease of use, high efficiency and low computation complexity; thus, it is widely used in Wireless Sensor Networks (WSNs)-based applications. Existing localization model has been predominantly designed with known transmit power. Recently, few localization approaches have been modeled considering unknown transmit power employing non-convex least squared relative error (LSRE) measurement model. The LSRE optimization problem is solved through semidefinite programming (SDP) using semidefinite relaxation (SDR). However, LSRE-SDP suffers immensely under highly dynamic and noisy environment and induces high computation overhead in meeting convergence. In addressing the aforementioned problem, this paper presents Dynamic Noisy Measurement Aware Localization (DNMAL) model for WSNs using improved least square bounding model. The objective DNMAL is to measure target position by neglecting the collected through noisy (faulty) sensor device. The DNMAL aids in achieving optimal solution using improved least square bounding model through iterative process. The DNMAL is efficient in bounding unknown distribution because of presence of noisy sensor and significantly reduces localization error even with presence of extreme noise.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115788988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and Implementation of Earthquake Information Publishing System Based on Mobile Computing and Machine Learning Technology in GIS","authors":"Huixia Zhai, Yi Wang","doi":"10.1142/s0219265921450183","DOIUrl":"https://doi.org/10.1142/s0219265921450183","url":null,"abstract":"This paper proposes a semi-automatic method of geographic information linking based on spatial relationships, entity names, entity categories and other features, combined with semantic and machine learning methods. First, we extracted geographic information from three geographic information sources: Open Street Map, Wikimapia, and Google places. The extracted geographic information is mainly for urban buildings in different regions. Secondly, we analyzed and extracted the characteristics of geographic information data to construct a geographic information ontology, and realized the integration of geographic data through the mapping of geographic information source data and geographic information ontology. Finally, the linking method of fusion classification algorithm support vector machine and K-nearest neighbor method are discussed separately. At the same time, it is compared with the linking method proposed by Samal et al. to comprehensively verify the accuracy of the method proposed in this paper from multiple angles, laying a good foundation for seismic information integration.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123232900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enterprise Financial Risk Early Warning Using BP Neural Network Under Internet of Things and Rough Set Theory","authors":"Huan Zhang, Yonghui Luo","doi":"10.1142/s0219265921450195","DOIUrl":"https://doi.org/10.1142/s0219265921450195","url":null,"abstract":"In this paper, an enterprise financial risk indicator system is established to warn about the financial risk of enterprises. First, the related knowledge of financial risk and its measurement is introduced. Next, the financial risk indicator system of small- and medium-sized enterprises (SMEs) is established based on back propagation neural network (BPNN). The rough set theory is adopted to simplify the indicator. Finally, the BPNN model is used to predict the financial situation of SMEs. The results show that in the 490th iteration, the performance of the BPNN-based financial risk early warning system for SMEs can reach the optimal and meet the accuracy requirements of initialization. The error of the enterprise financial risk early warning model converges to the target error, so the calculation result is credible. The actual output after training is close to the expected output. By judging the actual output value, it can be known that the financial risk status of SMEs in 2016, 2017 and 2018 is of low alarm. This exploration has a certain preventive effect on the financial risk of enterprises and provides a basis for the rapid development of enterprises.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122629500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Energy Aware Multi Slot Scheduling with Two-Layer Hexagonal Based Integrated Aggregation Approach for Underwater Wireless Sensor Networks (UWSN)","authors":"T. R. Chenthil, P. Jayarin","doi":"10.1142/s0219265921500274","DOIUrl":"https://doi.org/10.1142/s0219265921500274","url":null,"abstract":"In the present era, Underwater Wireless Sensor Network (UWSN) is an emerging technology that involves a huge amount of sensor nodes to collect and monitor information from the underwater environment. However, the data transmission process is constrained due to the collision and energy consumption which can adversely affect the performance. Hence, there is an essential need to develop a suitable mechanism that addresses these challenges using a data aggregation-based routing mechanism in UWSN. In this paper, a Multi-Slot Scheduling with a Two-Layer Hexagonal based Integrated Aggregation model (MSS-TLHIA) is proposed that offers a prolonged lifetime with less energy consumption and collision avoidance. In this model, data aggregation is performed using the aggregator node selection process. Initially, the entire network is partitioned into several hexagonal grids using the golden ratio. This partitioning offers an improved coverage area for every node which are participating in the network. Once the network is partitioned into coverage areas called clusters, a Cluster Head (CH) is selected using the ranking-based fuzzy mechanism. Then, an aggregator node is selected in common for both the layers of the hexagonal grids. In order to prevent the energy drain of the aggregator node completely and to prolong their lifetime, the aggregator node is re-selected for every time slot. Furthermore, the occurrence of collision is avoided by the multi-slot scheduling process. Experimental results demonstrate that the performance of the proposed model is compared with other existing protocols and achieves better results in terms of network lifetime, energy consumption, collision rate, packet dropped rate, packet delivery, and data forwarding measures.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128318863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs","authors":"Wenyan Jia, Shuai Kou, Weihua Yang, Chengfu Qin","doi":"10.1142/s0219265921500304","DOIUrl":"https://doi.org/10.1142/s0219265921500304","url":null,"abstract":"Let [Formula: see text] and [Formula: see text] be the planar and non-planar graphs, respectively, obtained from the Octahedron by 3-splitting a vertex. For [Formula: see text], we prove that if a 4-connected graph is [Formula: see text]-minor-free, then it is [Formula: see text], [Formula: see text] [Formula: see text] or it is obtained from [Formula: see text] by repeatedly 4-splitting vertices. We also show that a planar graph is [Formula: see text]-minor-free if and only if it is constructed by repeatedly taking 0-, 1-, 2-sums starting from [Formula: see text], where [Formula: see text] is the set of graphs obtained by repeatedly taking the special 3-sums of [Formula: see text] and [Formula: see text] is the graph obtained from two 5-cycles [Formula: see text], [Formula: see text] by adding the five edges [Formula: see text] for all [Formula: see text]. For [Formula: see text], we prove that if a 4-connected graph is [Formula: see text]-minor-free, then it is planar, [Formula: see text] [Formula: see text], the line graph of [Formula: see text] or it is obtained from [Formula: see text] by repeatedly 4-splitting vertices.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Objective Controller Failure Aware Capacitated Controller Placement in Software-Defined Networks","authors":"P. Aravind, G. Varma, P. Reddy","doi":"10.1142/s0219265921500316","DOIUrl":"https://doi.org/10.1142/s0219265921500316","url":null,"abstract":"Software-Defined Networking disassociates the control plane from data plane. The problem of deciding upon the number and locations of controllers and assigning switches to them has attracted the attention of researchers. Foreseeing the possibility of failure of a controller, a backup controller has to be maintained for each switch so that the switches assigned to the failed controller can immediately be connected to their backup controllers. Hence, the switches cannot experience disconnections in case of failure of their controller. In this paper, two mathematical models are proposed. The first model focuses on minimizing the average of latencies from all switches to their backup controllers while considering the failure of the controllers. The second model aims at minimizing both the average and worst-case of latencies from all switches to the corresponding backup controllers. Both of our models are evaluated on three networks and are compared (in terms of two metrics, viz., average and worst-case latencies) with an existing model that focuses on minimizing only worst-case latency. The first model gives better average latency compared to the reference model. The second model also gives better average latency and almost equal worst-case latency compared to the reference model.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"119 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120886538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reliability of DQcube Networks Under the Condition of r-Component","authors":"Wenjun Liu","doi":"10.1142/s021926592150033x","DOIUrl":"https://doi.org/10.1142/s021926592150033x","url":null,"abstract":"Connectivity is an important measure parameter to evaluate the fault tolerance of networks. With the continuous expansion of networks scale, it is inevitable that the processor fails. Once the processor fails, the information processed by the failed processor will be unreliable, which may cause fatal consequences. Therefore, it is of great significance to study the connectivity and diagnosability of networks. In this paper, we establish that the [Formula: see text]-component connectivity of DQcube is [Formula: see text], where [Formula: see text] and [Formula: see text]. Furthermore, we determine that the [Formula: see text]-component diagnosability of DQcube is [Formula: see text] under the PMC model and the MM* model, where [Formula: see text] and [Formula: see text].","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"86 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127988871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}