This research implements hybrid deep learning network models for weather image classification. The study proposes to apply a combined model, namely VGG16-LightGBM. In its architecture model, a pre-train convolutional ...
This research implements hybrid deep learning network models for weather image classification. The study proposes to apply a combined model, namely VGG16-LightGBM. In its architecture model, a pre-train convolutional neural network (CNN) name as VGG16 is employed for feature extraction of images and the LightGBM algorithm is used to make classification. The results on accuracy of proposed models were compared with four other models, namely Xception, Inception V3,Vgg19, Vgg16 which are all implemented by transfer learning mechanism on the same dataset. The experimental results proved that the VGG16-LightGBM gives the best performance with the highest accuracy of 81,28%, outperforms the transfer learning technique of other 4 pre-train models in the problem of weather image classification.
The objective of this study was to implement an explainable artificial intelligence (AI) model with embedded rules to assess Multiple Sclerosis (MS) disease evolution based on brain Magnetic Resonance Imaging (MRI) mu...
The objective of this study was to implement an explainable artificial intelligence (AI) model with embedded rules to assess Multiple Sclerosis (MS) disease evolution based on brain Magnetic Resonance Imaging (MRI) multi-scale lesion evaluation. Amplitude Modulation-Frequency Modulation (AM-FM) features were extracted from manually segmented brain MS lesions obtained using MRI and were labeled with the Expanded Disability Status Scale (EDSS). Machine learning models were used to classify the MS subjects with a benign course of the disease and subjects with advanced accumulating disability. Rules were extracted from the selected model with high accuracy and then were modified to perform argumentation-based reasoning. It is demonstrated that the proposed explainable AI modeling can distinguish MS subjects and give meaningful information to track the progression of the disease. Future research will examine more subjects and add new feature sets and models.
Broadcasting stands as a vital function within wireless sensor networks (WSNs), where nodes disseminate messages throughout the entire network, radiating in all possible directions. Our focus lies on the issue of thre...
详细信息
ISBN:
(数字)9798331536756
ISBN:
(纸本)9798331536763
Broadcasting stands as a vital function within wireless sensor networks (WSNs), where nodes disseminate messages throughout the entire network, radiating in all possible directions. Our focus lies on the issue of three-dimensional broadcasting, involving n sensors/robots positioned uniformly across a three-dimensional space. We propose an exponentially fast hybrid collaborative broadcasting algorithm in three-dimensional space "growing ball" through successive propagation steps. We study the effect of various parameters such as the density of the growing ball (ρ), distance (d), the energy emitted by node (E emit ), and ϵ used by the collaborative broadcast. Our approach is based on the idea of dividing the 3D space into two halves that reduce mathematical intricacy. The number of nodes N k in the k th step of the growing ball is the factor of (1+ϵ) k implies the exponential fast broadcast.
A devastating earthquake is one of the Earth's most destructive natural disasters. Real-time seismic monitoring facilities can evolve into Earthquake Early Warning (EEW) systems with the help of modern technology,...
详细信息
This paper introduces an Improved RC6(IRC6)cipher for data encryption based on data-dependent *** proposed scheme is designed with the potential of meeting the needs of the Advanced Encryption Standard(AES).Four param...
详细信息
This paper introduces an Improved RC6(IRC6)cipher for data encryption based on data-dependent *** proposed scheme is designed with the potential of meeting the needs of the Advanced Encryption Standard(AES).Four parameters are used to characterize the proposed *** parameters are the size of the word(w)in bits,the number of rounds(r),the length of the secret key(b)in bytes,and the size of the block(L)in *** main feature of IRC6 is the variable number of working registers instead of just four registers as in RC6,resulting in a variable block size for plaintext and *** IRC6 cipher is designed to improve the robustness against attacks by increasing the diffusion for each round and providing greater security with fewer *** effectiveness of the proposed IRC6 scheme is verified against theoretical *** proposed IRC6 scheme depends on full diffusion and confusion mechanisms regardless of the utilized block *** proposed IRC6 scheme saves 70%of the encryption time and 64%of the decryption time of *** simulation results prove that the IRC6 achieves a better encryption/decryption time compared to the ***,the proposed IRC6 is anticipated to fulfill the market needs and system security requirements.
We fabricated integrated silicon coupled-ring resonators and measured photonic band structures for synthetic frequency lattices with different configurations. A phase difference between two modulation signals introduc...
详细信息
With the advent of the Internet of Things, a world was born in which everything could be uniquely identified and monitored, tracked, and managed by computer programs. Items can self-configure using a predefined commun...
详细信息
Recommendation systems are pivotal in industries like entertainment, where competitiveness is intense. This study enhances movie recommendations by utilizing rich datasets from IMDB and Rotten Tomatoes, incorporating ...
详细信息
The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to...
详细信息
The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to find an ordering of the vertices that will force the greedy algorithm to use as many colors as possible. In the Partial Grundy Coloring, the task is also to color the graph using as many colors as possible. This time, however, we may select both the ordering in which the vertices are considered and which color to assign the vertex. The only constraint is that the color assigned to a vertex v is a color previously used for another vertex if such a color is available. Partial Grundy coloring of a graph corresponds to the vertex coloring produced by the greedy coloring heuristics called last-fit coloring, which assigns the last available color to each vertex in the given order. Whether Grundy Coloring and Partial Grundy Coloring admit fixed-parameter tractable (FPT) algorithms, algorithms with running time f(k)nO(1), where k is the number of colors, was posed as an open problem by Zaker and by Effantin et al., respectively. Recently, Aboulker et al. (STACS 2020 and Algorithmica 2022) resolved the question for Grundy Coloring in the negative by showing that the problem is W[1]-hard. For Partial Grundy Coloring, they obtain an FPT algorithm on graphs that do not contain Ki,j as a subgraph (a.k.a. Ki,j-free graphs). Aboulker et al. re-iterate the question of whether there exists an FPT algorithm for Partial Grundy Coloring on general graphs and also asks whether Grundy Coloring admits an FPT algorithm on Ki,j-free graphs. We give FPT algorithms for Partial Grundy Coloring on general graphs and for Grundy Coloring on Ki,j-free graphs, resolving both the questions in the affirmative. We believe that our new structural theorems for partial Grundy coloring and "representative-family" like sets for Ki,j-free graphs that we use in obtaining our results may have wi
暂无评论