computer graphics can present data and information in an intuitive and visual way, enabling decision-makers to understand and analyze complex datasets more quickly. By transforming data into visual forms such as chart...
详细信息
Data compression plays a vital role in datamanagement and information theory by reducing ***,it lacks built-in security features such as secret keys or password-based access control,leaving sensitive data vulnerable t...
详细信息
Data compression plays a vital role in datamanagement and information theory by reducing ***,it lacks built-in security features such as secret keys or password-based access control,leaving sensitive data vulnerable to unauthorized access and *** the exponential growth of digital data,robust security measures are *** encryption,a widely used approach,ensures data confidentiality by making it unreadable and unalterable through secret key *** their individual benefits,both require significant computational ***,performing them separately for the same data increases complexity and processing *** the need for integrated approaches that balance compression ratios and security levels,this research proposes an integrated data compression and encryption algorithm,named IDCE,for enhanced security and *** on 128-bit block sizes and a 256-bit secret key *** combines Huffman coding for compression and a Tent map for ***,an iterative Arnold cat map further enhances cryptographic confusion *** analysis validates the effectiveness of the proposed algorithm,showcasing competitive performance in terms of compression ratio,security,and overall efficiency when compared to prior algorithms in the field.
Recent research on Hyperspectral image classification (HSIC) has been much concerned with small sample size due to the challenges of obtaining large labeled data. Coupled with this is the challenge with optimization o...
详细信息
Across various fields, the area of Bengali music, with its rich cultural heritage, is highly unexplored but identifying and classifying singers has become vital for safeguarding intellectual property and encouraging t...
详细信息
Lung cancer detection remains a challenging task due to the complex nature of medical imaging and the shortage of specialized radiologists. This paper addresses the challenges of early detection of lung cancer using a...
详细信息
Long-term care refers to any support, both medical and non-medical, provided to the elderly with a chronic illness or disability due to physical or mental conditions. Since the cost of long-term care insurance is not ...
详细信息
In the past few years,social media and online news platforms have played an essential role in distributing news content *** of the authenticity of news has become a major *** the COVID-19 outbreak,misinformation and f...
详细信息
In the past few years,social media and online news platforms have played an essential role in distributing news content *** of the authenticity of news has become a major *** the COVID-19 outbreak,misinformation and fake news were major sources of confusion and insecurity among the general *** the first quarter of the year 2020,around 800 people died due to fake news relevant to *** major goal of this research was to discover the best learning model for achieving high accuracy and performance.A novel case study of the Fake News Classification using ELECTRA model,which achieved 85.11%accuracy score,is thus reported in this *** addition to that,a new novel dataset called COVAX-Reality containing COVID-19 vaccine-related news has been *** the COVAX-Reality dataset,the performance of FNEC is compared to several traditional learning models i.e.,Support Vector Machine(SVM),Naive Bayes(NB),Passive Aggressive Classifier(PAC),Long Short-Term Memory(LSTM),Bi-directional LSTM(Bi-LSTM)and Bi-directional Encoder Representations from Transformers(BERT).For the evaluation of FNEC,standard metrics(Precision,Recall,Accuracy,and F1-Score)were utilized.
Visual Question Answering (VQA) is an interdis-ciplinary research area that uses image recognition, natural language processing, and cognitive understanding to interpret visual data and answer appropriate queries. Thi...
详细信息
This paper addresses the issue of data transmission bottlenecks in traditional database management systems when handling large-scale data. It proposes a filtering scheme for operators under the near-data processing mo...
详细信息
In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G = (V, E) where the nodes of the graph are unlabeled, and each edge incident to a node v has a uniqu...
详细信息
ISBN:
(纸本)9798400710629
In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G = (V, E) where the nodes of the graph are unlabeled, and each edge incident to a node v has a unique label, called the port number, in {0, 1, ⋯, d - 1}, where d is the degree of the node v. Two identical mobile agents, starting from different nodes in G have to explore the nodes of G in such a way that for every node v in G, at least one mobile agent visits v and no two agents are in the same node in any round and stop. The time of exploration is the minimum round number by which both agents have terminated. The agents know the size of the graph but do not know its topology. If an agent arrives in the one-hop neighborhood of the other agent, both agents can detect the presence of the other agent but have no idea at which neighboring node the other agent resides. The agents may wake up in different rounds, but once awake, they execute a deterministic algorithm in synchronous rounds. An agent, after waking up, has no knowledge about the wake-up time of the other agent. The task of collision-free exploration is impossible to solve even for a line of length 2 where the agents are placed at the end nodes of the line and even if both agents wake up at the same time. We study the problem of collision-free exploration where some pebbles are placed by an Oracle at the nodes of the graph to assist the agents in achieving collision-free exploration. The Oracle knows the graph, the starting positions of the agents, and their wake-up schedule, and it places some pebbles that may be of different colors, at most one at each node. The number of different colors of the pebbles placed by the Oracle is called the color index of the corresponding pebble placement algorithm. The central question we study in this paper is: "What is the minimum number z such that there exists a collision-free exploration of a given graph with pebble placement of color index z?". For genera
暂无评论