Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Oxford University Press (OUP)  (16)
  • Computer Science  (16)
  • 1
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal ( 2023-04-03)
    In: The Computer Journal, Oxford University Press (OUP), ( 2023-04-03)
    Abstract: Named Data Networking (NDN) has gained importance in today’s era due to a paradigm shift in the Internet usage pattern which revolves around the content rather than the respective host addresses. Three important data structures in NDN are Content Store (CS), Pending Interest Table (PIT) and Forwarding Information Base (FIB). The search time of PIT is quite high since its size grows with the addition of new content names, and the Interest packets which are not served by CS are searched in millions of existing entries in the PIT. Hence, lookup time can be improved if, instead of checking all the available entries, initial scanning is done to determine whether the required content name exists in the PIT or not. In this paper, we propose a Stable Bloom Filter (SBF) based PIT called S-PIT, to minimize the PIT search time by identifying the existence of query content through SBF. The various experiments performed show that S-PIT outperforms existing data structures in terms of memory consumption, content insertion time, average search time and false positive rate.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2020
    In:  The Computer Journal Vol. 63, No. 10 ( 2020-10-19), p. 1500-1512
    In: The Computer Journal, Oxford University Press (OUP), Vol. 63, No. 10 ( 2020-10-19), p. 1500-1512
    Abstract: Flying ad hoc networks (FANETs) are a collection of unmanned aerial vehicles that communicate without any predefined infrastructure. FANET, being one of the most researched topics nowadays, finds its scope in many complex applications like drones used for military applications, border surveillance systems and other systems like civil applications in traffic monitoring and disaster management. Quality of service (QoS) performance parameters for routing e.g. delay, packet delivery ratio, jitter and throughput in FANETs are quite difficult to improve. Mobility models play an important role in evaluating the performance of the routing protocols. In this paper, the integration of two selected mobility models, i.e. random waypoint and Gauss–Markov model, is implemented. As a result, the random Gauss integrated model is proposed for evaluating the performance of AODV (ad hoc on-demand distance vector), DSR (dynamic source routing) and DSDV (destination-Sequenced distance vector) routing protocols. The simulation is done with an NS2 simulator for various scenarios by varying the number of nodes and taking low- and high-node speeds of 50 and 500, respectively. The experimental results show that the proposed model improves the QoS performance parameters of AODV, DSR and DSDV protocol.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2020
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 4 ( 2022-04-19), p. 926-939
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 4 ( 2022-04-19), p. 926-939
    Abstract: Keyword extraction is one of the most important aspects of text mining. Keywords help in identifying the document context. Many researchers have contributed their work to keyword extraction. They proposed approaches based on the frequency of occurrence, the position of words or the similarity between two terms. However, these approaches have shown shortcomings. In this paper, we propose a method that tries to overcome some of these shortcomings and present a new algorithm whose efficiency has been evaluated against widely used benchmarks. It is found from the analysis of standard datasets that the position of word in the document plays an important role in the identification of keywords. In this paper, a fuzzy logic-based automatic keyword extraction (FLAKE) method is proposed. FLAKE assigns weights to the keywords by considering the relative position of each word in the entire document as well as in the sentence coupled with the total occurrences of that word in the document. Based on the above data, candidate keywords are selected. Using WordNet, a fuzzy graph is constructed whose nodes represent candidate keywords. At this point, the most important nodes (based on fuzzy graph centrality measures) are identified. Those important nodes are selected as final keywords. The experiments conducted on various datasets show that proposed approach outperforms other keyword extraction methodologies by enhancing precision and recall.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 4 ( 2022-04-19), p. 843-857
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 4 ( 2022-04-19), p. 843-857
    Abstract: The extensive usage of social media polarity analysis claims the need for real-time analytics and runtime outcomes on dashboards. In data analytics, only 30% of the time is consumed in modeling and evaluation stages and 70% is consumed in data engineering tasks. There are lots of machine learning algorithms to achieve a desirable outcome in prediction points of view, but they lack in handling data and their transformation so-called data engineering tasks, and reducing its time remained still challenging. The contribution of this research paper is to encounter the mentioned challenges by presenting a parallelly, scalable, effective, responsive and fault-tolerant framework to perform end-to-end data analytics tasks in real-time and batch-processing manner. An experimental analysis on Twitter posts supported the claims and signifies the benefits of parallelism of data processing units. This research has highlighted the importance of processing mentioned URLs and embedded images along with post content to boost the prediction efficiency. Furthermore, this research additionally provided a comparison of naive Bayes, support vector machines, extreme gradient boosting and long short-term memory (LSTM) machine learning techniques for sentiment analysis on Twitter posts and concluded LSTM as the most effective technique in this regard.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal Vol. 66, No. 6 ( 2023-06-19), p. 1525-1540
    In: The Computer Journal, Oxford University Press (OUP), Vol. 66, No. 6 ( 2023-06-19), p. 1525-1540
    Abstract: Phonocardiogram (PCG) signals highlight the relevant characteristics for the prediction of heart diseases or heart-related disorders. However, it is challenging to classify heart abnormality relying on an unbalanced PCG dataset due to low classification performance. Recently, several studies have attempted to predict heart abnormality based on segmented and unsegmented features extracted using PCG signals. This study aims to develop an automated PCG classification model eliminating any segmentation of the heart sound signal for predicting heart abnormality. So, we have proposed a new approach based on wavelet scattering transform to predict two classes of PCG signals, namely, normal and abnormal. Based on the wavelet scattering transform, five scattering time window features were extracted from each PCG signal. The PhysioNet 2016 PCG database has been used here to evaluate and compare the classification performance based on the k Nearest Neighbors (KNN) classifier. The proposed architecture used a KNN classifier with different distance functions (Euclidean, Cityblock, Chebyshev, Minkowsky, Correlation, Spearman and Cosine) and has been compared with other traditional classifiers (classification tree, linear discriminant analysis, support vector machine and ensemble). The proposed framework using nonlinear wavelet scattering features with a KNN classifier based Cityblock distance function achieved classification performance over the total datasets with accuracy, sensitivity and specificity values of 97.82%, 95.04% and 98.72%, respectively.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 9 ( 2022-09-16), p. 2421-2429
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 9 ( 2022-09-16), p. 2421-2429
    Abstract: With the help of a multi-signature scheme, we can reduce the cost of storage and bandwidth in case of many signers signing the same message. Therefore, multi-signature schemes can be used in bitcoin to reduce the size of a blockchain. In this paper, we propose a lattice-based multi-signature scheme with the following highlighted features. Our lattice-based multi-signature scheme supports signature compression and public key aggregation. The only existing lattice-based multi-signature scheme by Kansal and Dutta (Africacrypt, 2020) that supports both signature compression and public key aggregation has communication and storage cost $\widetilde{\mathcal{O}}(n^2)$, whereas our communication and storage cost is $\mathcal{O}(n)$. Our multi-signature scheme is in the plain public key model where the special registration of the public key is not necessary and it is secure under the rogue key attack. Our multi-signature scheme is secure under the hardness of ring short integer solution problem in the random oracle model.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal ( 2023-08-02)
    In: The Computer Journal, Oxford University Press (OUP), ( 2023-08-02)
    Abstract: Secure exchange of data among the various stake holders of healthcare systems is of prime importance. As the size of the healthcare networks grew, several variants of Public Key Infrastructures (PKIs) were proposed as a means to achieve reliable authentication, confidentiality, non-repudiation, etc. The most prevalent approach to PKI has been the use of Certificate Authorities (CAs). But, events like the breach of the CA DigiNotar, and the ensuing fake certificates for Google, among other noteworthy high-profile domains, has cast doubts on the reliability of a CA, and therefore on PKIs modelled as CAs too. In this paper, we propose a new approach to a healthcare PKI modelled on a blockchain, incorporating Elliptic Curve Cryptographic methods for secure key generations.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2024
    In:  The Computer Journal ( 2024-03-03)
    In: The Computer Journal, Oxford University Press (OUP), ( 2024-03-03)
    Abstract: Static machine and deep learning algorithms are commonly used in intrusion detection systems (IDSs). However, their effectiveness is constrained by the evolving data distribution and the obsolescence of the static data sources used for model training. Consequently, static classifiers lose efficacy, necessitating expensive model retraining with time. The aim is to develop a dynamic and adaptable IDS that mitigates the limitations of static models, ensuring real-time threat detection and reducing the need for frequent, resource-intensive model retraining. This research proposes an approach that amalgamates the adaptive random forest (ARF) classifier with Hoeffding’s bounds and a moving average test for the early and accurate detection of network intrusions. The ARF can adapt in real time to shifting network conditions and evolving attack patterns, constantly refining its intrusion detection capabilities. Furthermore, the inclusion of Hoeffding’s bounds and the moving average test adds a dimension of statistical rigor to the system, facilitating the timely recognition of concept drift and distinguishing benign network variations from potential intrusions. The synergy of these techniques results in reduced false positives and false negatives, thereby enhancing the overall detection rate. The proposed method delivers outstanding results, with 99.95% accuracy and an impressive 99.96% recall rate on the latest CIC-IDS 2018 dataset, outperforming the results of existing approaches.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2024
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2018
    In:  The Computer Journal Vol. 61, No. 6 ( 2018-06-01), p. 847-855
    In: The Computer Journal, Oxford University Press (OUP), Vol. 61, No. 6 ( 2018-06-01), p. 847-855
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2018
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 4 ( 2022-04-19), p. 805-817
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 4 ( 2022-04-19), p. 805-817
    Abstract: Imaging techniques such as X-ray, computerized tomography scan and magnetic resonance imaging are useful in the correct diagnosis of a disease or deformity in the organ. Two-dimensional imaging techniques such as X-ray give a clear picture of simple bone deformity but fail in visualizing multiple fractures in a bone. Moreover, these lack in providing a multi-angle view of a bone. Three-dimensional techniques such as computerized tomography scan and magnetic resonance imaging present a correct orientation of fracture geometry. Computerized tomography scan is a collection of multiple slices of an image. These slices provide a fair idea about a fracture but fail in the measurement of correct dimensions of a fractured fragment and to observe its geometry. It also exposes a patient with carcinogenic radiations. Magnetic resonance imaging induces a strong magnetic field. So, it becomes ineffective for organs containing metallic implants. The high cost of three-dimensional imaging techniques makes them inaccessible for economic weaker section of society. The limitations of two- and three-dimensional imaging techniques motivate researchers to propose an innovative machine learning model ‘CT slices to $3$-D convertor’ that accepts multiple slices of an image and yields a multi-dimensional view at all possible angles from 0 degree to 360 degree for an input image.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages