The new generation of 5G networks, compared to 4G networks, is a very important example of change in achieving very high frequencies in the carrier with huge bandwidth, high densities with a huge number of antennas an...
详细信息
This paper focuses on the effects of applying quantization during training to Recurrent Neural Networks (RNNs) used in Simplified Molecular-Input Line-Entry System (SMILES) generation, a form of line notation for mole...
详细信息
This paper focuses on the effects of applying quantization during training to Recurrent Neural Networks (RNNs) used in Simplified Molecular-Input Line-Entry System (SMILES) generation, a form of line notation for molecular information used in the development of pharmaceutical drugs, from the PubChem database. It offers the flexibility to choose the precision used by the model, by defining the number of bits at each layer. The RNNs are the focus of the current study, by comparing the performance of three of the most used algorithms, Simple RNN, Long Short-Term Memory (LSTM), and Gated Recurrent Unit (GRU). The models were trained on a selection of SMILES. By exploiting the QK-eras library, quantization performance was compared to their floating-point equivalent for several combinations of parameters. The goal of the testing program developed is to generate a large number of novel SMILES, facilitating the process of Drug Discovery which is traditionally long, and thus very expensive and difficult. By understanding how the behavior of quantized networks deviates from the regular model, in relation to the parameters used, we are able to control the process of choosing whether to quantize a model and to which degree it becomes more or less efficient. In this study, we observed good performance even for 4-bit models making use of LSTM and GRU layers, the same way we concluded that Simple RNN quantization does not compensate the effort.
This paper presents an algorithm for detecting collisions in flight traffic management for drones. The algorithm is simple to implement and can be used to effectively manage the flow of drones in a safe and efficient ...
This paper presents an algorithm for detecting collisions in flight traffic management for drones. The algorithm is simple to implement and can be used to effectively manage the flow of drones in a safe and efficient manner. The algorithm has been tested in simulation and has been shown to be effective in detecting collisions between drones. The algorithm is also simple to implement and can be used with existing drone traffic management systems. As the number of drones in the sky continues to grow, this algorithm will become increasingly important for ensuring the safety of drone operations.
Parallel to the evolution of recent trends in the cybersecurity industry and the increase of cyberattacks in the last few years, there is renovated interest on the application of software-defined techniques to enforce...
详细信息
One major goal of digital twin technology applied in the Architecture, engineering, and Construction (AEC) Industry is the mapping of roads and road environments with their associated information. Such digital twins c...
详细信息
The maritime sector is an industry that faces significant and various challenges related to cyber security and data management, such as fraud and user authentication. Therefore, there is a need for a secure solution t...
The maritime sector is an industry that faces significant and various challenges related to cyber security and data management, such as fraud and user authentication. Therefore, there is a need for a secure solution that can effectively manage data transactions while resolving digital identity. A biometric signature application in blockchain for fighting fraud and fake identities may provide a solution in the maritime sector. This research proposes a biometric signature and an IPFS network-blockchain framework to address these challenges. This paper also discusses the proposed framework's cyber security challenges that threaten behavioral biometric security.
The objective of this work was the investigation of multiscale Amplitude Modulation - Frequency Modulation (AM-FM) analysis based on Difference of Gaussians (DoG) filterbanks representations in order to predict the ri...
The objective of this work was the investigation of multiscale Amplitude Modulation - Frequency Modulation (AM-FM) analysis based on Difference of Gaussians (DoG) filterbanks representations in order to predict the risk of stroke by analysing carotid plaques ultrasound images of individuals with asymptomatic carotid stenosis. We computed the instantaneous amplitude, instantaneous phase and the magnitude of instantaneous frequency to extract histogram features on each plaque region. The Support Vectors Machine classifier was implemented to classify asymptomatic versus symptomatic plaques. A dataset of 100 carotid plaque images (50 asymptomatic and 50 symptomatic) were tested, and showed that the AM-FM features based on DoG filterbanks and simple histograms performed better than the traditional AM-FM features. Best results were obtained when an eight scale filterbank with a combination of scales was used reaching the accuracy of 75%.
Digital twin technology becomes an appropriate respond to the new challenge of rapid development in science and industry. Chemical data include the information about structure and properties of materials and compounds...
详细信息
The edit distance is a fundamental measure of sequence similarity, defined as the minimum number of character insertions, deletions, and substitutions needed to transform one string into the other. Given two strings o...
The edit distance is a fundamental measure of sequence similarity, defined as the minimum number of character insertions, deletions, and substitutions needed to transform one string into the other. Given two strings of length at most n, a simple dynamic programming computes their edit distance exactly in $\mathcal{O}\left(n^{2}\right)$ time, which is also the best possible (up to subpolynomial factors) assuming the Strong Exponential Time Hypothesis (SETH). The last few decades have seen tremendous progress in edit distance approximation, where the runtime has been brought down to subquadratic, to near-linear, and even to sublinear at the cost of approximation. In this paper, we study the dynamic edit distance problem where the strings change dynamically as the characters are substituted, inserted, or deleted over time. Each change may happen at any location of either of the two strings. The goal is to maintain the (exact or approximate) edit distance of such dynamic strings while minimizing the update time. The exact edit distance can be maintained in $\mathcal{O}\left(n \log ^{2} n\right)$ time per update (Charalampopoulos, Kociumaka, Mozes; 2020), which is again tight assuming SETH. Unfortunately, even with the unprecedented progress in edit distance approximation in the static setting, strikingly little is known regarding dynamic edit distance approximation. Utilizing the best near-linear-time (Andoni, Nosatzki; 2020) and sublinear-time (Goldenberg, Kociumaka, Krauthgamer, Saha; 2022) approximation algorithm, an old exact algorithm (Landau and Vishkin; 1988), and a generic dynamic strings implementation (Mehlhorn, Sundar, Uhrig; 1996), it is possible to achieve an $\mathcal{O}\left(n^{c}\right)$-approximation in $n^{0.5-c+o(1)}$ update time for any constant $c \in\left[0, \frac{1}{6}\right]$. Improving upon this trade-off, characterized by the approximation-ratio and update-time product $n^{0.5+o(1)}$, remains wide open. The contribution of this work is a dynami
Cervical cancer is one of the deadliest diseases in women. One of the cervical cancer screening methods is pap smear method. However, using a pap smear method to detect cervical cancer takes a long time for a patholog...
详细信息
暂无评论