Search

Simple Summary: Musculoskeletal disorder is affecting a large population globally and is becoming one of the foremost health concerns. The treatment is often expensive and may cause a severe problem in the case of misdiagnosis. Therefore, a reliable, fast, and inexpensive automatic recognition system is required that can detect and diagnose abnormalities from radiographs to support effective and efficient decision making for further treatment. In this work, the finger study type from the MURA dataset is taken into consideration owing to the fact the existing models were not able to give the desired performance and accuracy in detecting abnormalities in finger radiographs. Herein, a novel deep learning model is proposed, wherein after the preprocessing and augmentation of the finger images, they are fed into a model that learns the discriminative features through multiple hidden layers of dense neural networks and classifies them as normal or abnormal radiographs. The achieved result outperforms all existing state-of-the-art models, making it suitable for clinical settings. This will help society in the early detection of the disorder, which reduces the burden on radiologists and reduces its long-term impact on a large population. The practice of Deep Convolution neural networks in the field of medicine has congregated immense success and significance in present situations. Previously, researchers have developed numerous models for detecting abnormalities in musculoskeletal radiographs of upper extremities, but did not succeed in achieving respectable accuracy in the case of finger radiographs. A novel deep neural network-based hybrid architecture named ComDNet-512 is proposed in this paper to efficiently detect the bone abnormalities in the musculoskeletal radiograph of a patient. ComDNet-512 comprises a three-phase pipeline structure: compression, training of the dense neural network, and progressive resizing. The ComDNet-512 hybrid model is trained with finger radiographs samples to make a binary prediction, i.e., normal or abnormal bones. The proposed model showed phenomenon outcomes when cross-validated on the testing samples of arthritis patients and gives many superior results when compared with state-of-the-art practices. The model is able to achieve an area under the ROC curve (AUC) equal to 0.894 (sensitivity = 0.941 and specificity = 0.847). The Precision, Recall, F1 Score, and Kappa values, recorded as 0.86, 0.94, 0.89, and 0.78, respectively, are better than any of the previous models'. With an increasing appearance of enormous cases of musculoskeletal conditions in people, deep learning-based computational solutions can play a big role in performing automated detections in the future. [ABSTRACT FROM AUTHOR]

Blockchain transactions are decentralized, secure, and transparent, and they have altered industries. However, the emergence of quantum computing presents a severe security risk to the traditional encryption algorithms used in blockchain. Post-quantum signatures are required to preserve integrity and reliability. Furthermore, combining the InterPlanetary File System (IPFS) with blockchain provides a long-term strategy for data storage and sharing. This study investigates the integration of post-quantum signatures with the IPFS in a blockchain system, which can considerably enhance blockchain system efficiency. We increase security and efficiency by recording hash values of signatures and public keys within the blockchain and storing their actual content using the IPFS. The study compares NIST-recommended post-quantum signatures with the ECDSA in a Bitcoin exchange scheme to show how effective the system is in countering quantum threats while maintaining optimal performance. This research makes an important addition to the long-term viability and dependability of blockchain technology in the face of the growing landscape of quantum computing breakthroughs. [ABSTRACT FROM AUTHOR]

In recent times, we have encountered new situations that have imposed restrictions on our ability to visit public places. These changes have affected various aspects of our lives, including limited access to supermarkets, vegetable shops, and other essential establishments. As a response to these circumstances, we have developed a continuous review retrial queueing–inventory system featuring a single server and controlled customer arrivals. In our system, customers arriving to procure a single item follow a Markovian Arrival Process, while the service time for each customer is modeled by an exponential distribution. Inventories are replenished according to the (s , Q) reordering policy with exponentially distributed lead times. The system controls arrival in the waiting space with setup time. The customers who arrive at a not allowed situation decide to enter an orbit of infinite size with predefined probability. Orbiting customers make retrials to claim a place in the waiting space, and their inter-retrial times are exponentially distributed. The server may experience essential interruption (emergency situation) which arrives according to Poisson process. Then, the server goes for an emergency vacation of a random time which is exponentially distributed. In the steady-state case, the joint probability of the number of customers in orbit and the inventory level has been found, and the Matrix Geometric Method has been used to find the steady-state probability vector. In numerical calculations, the convexity of the system and the impact of F-policy and emergency vacation in the system are discussed. [ABSTRACT FROM AUTHOR]

The real-time vehicular traffic system is an integral part of the urban vehicular traffic system, which provides effective traffic signal control for a large multifaceted traffic network and is a highly challenging distributed control problem. Coordinating vehicular traffic enables the network model to deliver an efficient service flow. Consider that there are four lanes of vehicular traffic in this situation, allowing parallel vehicle movements to occur without causing an accident. In this instance, the vehicular system's control parameters are time and vehicle volume. In this work, vehicular traffic flow is examined, and an algorithm to estimate vehicle waiting time in each direction is estimated. The effectiveness of the proposed vehicle traffic signal distribution control system by comparing the experimental results with a real-time vehicular traffic system is verified. This is also illustrated numerically. [ABSTRACT FROM AUTHOR]

Twisted light beams such as optical angular momentum (OAM) with numerous possible orthogonal states have drawn the prodigious contemplation of researchers. OAM multiplexing is a futuristic multi-access technique that has not been scrutinized for optical satellite communication (OSC) systems thus far, and it opens up a new window for ultra-high-capacity systems. This paper presents the 4.8 Tbps (5 wavelengths × 3 OAM beams × 320 Gbps) ultra-high capacity OSC system by incorporating polarization division multiplexed (PDM) 256-Quadrature amplitude modulation (256-QAM) and OAM beams. To realize OAM multiplexing, Laguerre Gaussian (LG) transverse mode profiles such as LG00, LG140, and LG400 were used in the proposed study. The effects of the receiver's digital signal processing (DSP) module were also investigated, and performance improvement was observed using DSP for its potential to compensate for the effects of dispersion, phase errors, and nonlinear effects using the blind phase search (BPS), Viterbi phase estimation (VPE), and the constant modulus algorithm (CMA). The results revealed that the proposed OAM-OSC system successfully covered the 22,000 km OSC link distance and, out of three OAM beams, fundamental mode LG00 offered excellent performance. Further, a detailed comparison of the proposed system and reported state-of-the-art schemes was performed. [ABSTRACT FROM AUTHOR]

Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs. Many problems and results in graph theory can be formulated in terms of graph equations. In this paper, we solved some graph equations of detour two-distance graphs, detour three-distance graphs, detour antipodal graphs involving with the line graphs. [ABSTRACT FROM AUTHOR]

The purpose of this article is to examine the server activation policy (SAP) in a multi-server queuing-inventory system (MQIS). The queue has a total of c number of multi-threshold stages as well as c-homogeneous servers. The activation of each server begins one by one if there is an adequate queue length and inventory in the system; otherwise, they remain idle. The server deactivation process continues until the queue length exceeds the manageable level (predetermined stages) or there is insufficient stock. In addition, when we assume the length of the two successive threshold levels is one, the server activation policy model becomes a regular multi-server model. The Neuts matrix geometric approach is used to discuss the stability condition, stationary probability vector. The Laplace–Stieltjes transform (LST) is used to analyse the waiting time distributions of the queue and orbital customers. Additionally, significant system performance metrics and sensitivity analysis are used to investigate the effects of various parameters and cost values. In the comparative result between the server activation model (SAM) and without the server activation model (WSAM) on the expected total cost, we obtain the minimised cost in the SAM. Moreover, the results are obtained by assuming that the length of the intervals between the two successive threshold levels is to be taken into account as the non-uniform length. The expected inventory level, reorder rate, and waiting time of a customer in the waiting hall and orbit were explored numerically by the parameter analysis. [ABSTRACT FROM AUTHOR]

Optimization of the energy efficiency, fairness, and rates of the system is a vital part of communication systems. Multiple access techniques have a huge potential to enhance such performance parameters. This paper studies the performance of NOMA and OMA systems in a singular cell environment, where the cellular users are distributed randomly, and cooperative relays are considered for better system reliability. The relay nodes forward the signals to the cell-edge users. This paper considers a practical scenario where all the relay equipment is distributed with non-uniform battery power levels. The performance of OMA and NOMA schemes is compared based on the key performance indicators: sum rate, fairness, and energy efficiency. The fairness factor determines fairness in the allocation of resources to all the system's users. The performance of the two schemes is assessed in three deployment scenarios: urban, suburban, and rural scenarios. Through numerical results, it is proved that the performance of the NOMA dominates the OMA scheme. [ABSTRACT FROM AUTHOR]

This paper deals with an integrated and interconnected stochastic queuing-inventory system with a fresh item, a returned item, and a refurbished item. This system provides a multi-type service facility to an arriving multi-class customer through a dedicated channel. It sells fresh and refurbished items, buys used items from customers, refurbishes the used items for resale, and provides a repair service for defective items. The assumption of purchasing a used item from the customer and allowing them to buy a fresh item is a new idea in stochastic queuing-inventory modeling. To do so, this system has four parallel queues to receive four classes of customers and five dedicated servers to provide a multi-type service facility. Customers are classified according to the type of service they require. Each class of arrival follows an independent Poisson process. The service time of each dedicated server is assumed to be exponentially distributed and independent. This system assumes an instantaneous ordering policy for the replenishment of a fresh item. In the long run of this considered system, the joint probability distribution of the seven-dimensional stochastic process, significant system performance measures, and the optimum total cost are to be derived using the Neuts matrix geometric technique. The main objective of the system was to increase the occurrence of all kinds of customers by providing a multi-type service facility in one place. Buying a used item is unavoidable in an emerging society because it helps form a green society. Furthermore, the numerical result shows that the assumption of a system that allows a customer to sell their used item and purchase a new item will increase the number of customers approaching the system. [ABSTRACT FROM AUTHOR]

As a standard digital signature may be verified by anybody, it is unsuitable for personal or economically sensitive applications. The chameleon signature system was presented by Krawczyk and Rabin as a solution to this problem. It is based on a hash then sign model. The chameleon hash function enables the trapdoor information holder to compute a message digest collision. The holder of a chameleon signature is the recipient of a chameleon signature. He could compute collision on the hash value using the trapdoor information. This keeps the recipient from disclosing his conviction to a third party and ensures the privacy of the signature. The majority of the extant chameleon signature methods are built on the computationally infeasible number theory problems, like integer factorization and discrete log. Unfortunately, the construction of quantum computers would be rendered insecure to those schemes. This creates a solid requirement for construct chameleon signatures for the quantum world. Hence, this paper proposes a novel quantum secure chameleon signature scheme based on hash functions. As a hash-based cryptosystem is an essential candidate of a post-quantum cryptosystem, the proposed hash-based chameleon signature scheme would be a promising alternative to the number of theoretic-based methods. Furthermore, the proposed method is key exposure-free and satisfies the security requirements such as semantic security, non-transferability, and unforgeability. [ABSTRACT FROM AUTHOR]

Consider the Diophantine equation y n = x + x (x + 1) + ⋯ + x (x + 1) ⋯ (x + k) , where x, y, n, and k are integers. In 2016, a research article, entitled – 'power values of sums of products of consecutive integers', primarily proved the inequality n = 19,736 to obtain all solutions (x , y , n) of the equation for the fixed positive integers k ≤ 10 . In this paper, we improve the bound as n ≤ 10,000 for the same case k ≤ 10 , and for any fixed general positive integer k, we give an upper bound depending only on k for n. [ABSTRACT FROM AUTHOR]