AGENTS FOR QUERYING DISTRIBUTED STATISTICAL DATABASES OVER THE INTERNET

2002 ◽  
Vol 11 (01) ◽  
pp. 63-94 ◽  
Author(s):  
SALLY McCLEAN ◽  
ISAMBO KARALI ◽  
BRYAN SCOTNEY ◽  
KIERAN GREER ◽  
GEORGIOS-DIMITRIOS KAPOS ◽  
...  
Keyword(s):  
Statistical Data ◽  
Distributed Processing ◽  
Data Access ◽  
Distributed Database ◽  
The Internet ◽  
Data Harmonization ◽  
Data Matching ◽  
Distributed Approach ◽  
User Query ◽  
Multi Agent

Distributed database techniques and the Internet provide producers of statistics with a means to publish their data and metadata widely and make them available to a variety of users. Data matching to a user query and data access as well as data harmonization are some of the problems that should be solved. Intelligence is required in various stages of query answering and data matching. Moreover, the breadth and distributed nature of the Internet urge for a distributed approach. Agents seem to be the means by which both intelligence and distributed processing can be achieved. This paper presents a distributed approach for answering queries on statistical data that exist over the Internet using a multi-agent framework.

scholarly journals An Industrial IoT-Based Blockchain-Enabled Secure Searchable Encryption Approach for Healthcare Systems Using Neural Network

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 572
Author(s):  
Aitizaz Ali ◽  
Mohammed Amin Almaiah ◽  
Fahima Hajjej ◽  
Muhammad Fermi Pasha ◽  
Ong Huey Fang ◽  
...  
Keyword(s):  
Neural Network ◽  
Data Storage ◽  
Homomorphic Encryption ◽  
Data Access ◽  
Distributed Database ◽  
Healthcare Systems ◽  
The Internet ◽  
Neural Network Approach ◽  
Healthcare Data ◽  
Industrial Iot

The IoT refers to the interconnection of things to the physical network that is embedded with software, sensors, and other devices to exchange information from one device to the other. The interconnection of devices means there is the possibility of challenges such as security, trustworthiness, reliability, confidentiality, and so on. To address these issues, we have proposed a novel group theory (GT)-based binary spring search (BSS) algorithm which consists of a hybrid deep neural network approach. The proposed approach effectively detects the intrusion within the IoT network. Initially, the privacy-preserving technology was implemented using a blockchain-based methodology. Security of patient health records (PHR) is the most critical aspect of cryptography over the Internet due to its value and importance, preferably in the Internet of Medical Things (IoMT). Search keywords access mechanism is one of the typical approaches used to access PHR from a database, but it is susceptible to various security vulnerabilities. Although blockchain-enabled healthcare systems provide security, it may lead to some loopholes in the existing state of the art. In literature, blockchain-enabled frameworks have been presented to resolve those issues. However, these methods have primarily focused on data storage and blockchain is used as a database. In this paper, blockchain as a distributed database is proposed with a homomorphic encryption technique to ensure a secure search and keywords-based access to the database. Additionally, the proposed approach provides a secure key revocation mechanism and updates various policies accordingly. As a result, a secure patient healthcare data access scheme is devised, which integrates blockchain and trust chain to fulfill the efficiency and security issues in the current schemes for sharing both types of digital healthcare data. Hence, our proposed approach provides more security, efficiency, and transparency with cost-effectiveness. We performed our simulations based on the blockchain-based tool Hyperledger Fabric and OrigionLab for analysis and evaluation. We compared our proposed results with the benchmark models, respectively. Our comparative analysis justifies that our proposed framework provides better security and searchable mechanism for the healthcare system.

Designing a Chat-Bot for College Information using Information Retrieval and Automatic Text Summarization Techniques

2020 ◽  
Vol 01 ◽  
Author(s):  
Radha Guha
Keyword(s):  
Information Retrieval ◽  
Language Processing ◽  
Latent Dirichlet Allocation ◽  
Semantic Analysis ◽  
Text Summarization ◽  
The Internet ◽  
Specific Domain ◽  
User Query ◽  
College Information ◽  
Chat Bot

Background:: In the era of information overload it is very difficult for a human reader to make sense of the vast information available in the internet quickly. Even for a specific domain like college or university website it may be difficult for a user to browse through all the links to get the relevant answers quickly. Objective:: In this scenario, design of a chat-bot which can answer questions related to college information and compare between colleges will be very useful and novel. Methods:: In this paper a novel conversational interface chat-bot application with information retrieval and text summariza-tion skill is designed and implemented. Firstly this chat-bot has a simple dialog skill when it can understand the user query intent, it responds from the stored collection of answers. Secondly for unknown queries, this chat-bot can search the internet and then perform text summarization using advanced techniques of natural language processing (NLP) and text mining (TM). Results:: The advancement of NLP capability of information retrieval and text summarization using machine learning tech-niques of Latent Semantic Analysis(LSI), Latent Dirichlet Allocation (LDA), Word2Vec, Global Vector (GloVe) and Tex-tRank are reviewed and compared in this paper first before implementing them for the chat-bot design. This chat-bot im-proves user experience tremendously by getting answers to specific queries concisely which takes less time than to read the entire document. Students, parents and faculty can get the answers for variety of information like admission criteria, fees, course offerings, notice board, attendance, grades, placements, faculty profile, research papers and patents etc. more effi-ciently. Conclusion:: The purpose of this paper was to follow the advancement in NLP technologies and implement them in a novel application.

scholarly journals Boltzmann Distributed Replicator Dynamics: Population Games in a Microgrid Context

Games ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 8
Author(s):  
Gustavo Chica-Pedraza ◽  
Eduardo Mojica-Nava ◽  
Ernesto Cadena-Muñoz
Keyword(s):  
Control Method ◽  
Optimization Problems ◽  
Replicator Dynamics ◽  
Boltzmann Distribution ◽  
Full Information ◽  
Multi Agent Systems ◽  
Q Learning ◽  
Population Games ◽  
Distributed Approach ◽  
Multi Agent

Multi-Agent Systems (MAS) have been used to solve several optimization problems in control systems. MAS allow understanding the interactions between agents and the complexity of the system, thus generating functional models that are closer to reality. However, these approaches assume that information between agents is always available, which means the employment of a full-information model. Some tendencies have been growing in importance to tackle scenarios where information constraints are relevant issues. In this sense, game theory approaches appear as a useful technique that use a strategy concept to analyze the interactions of the agents and achieve the maximization of agent outcomes. In this paper, we propose a distributed control method of learning that allows analyzing the effect of the exploration concept in MAS. The dynamics obtained use Q-learning from reinforcement learning as a way to include the concept of exploration into the classic exploration-less Replicator Dynamics equation. Then, the Boltzmann distribution is used to introduce the Boltzmann-Based Distributed Replicator Dynamics as a tool for controlling agents behaviors. This distributed approach can be used in several engineering applications, where communications constraints between agents are considered. The behavior of the proposed method is analyzed using a smart grid application for validation purposes. Results show that despite the lack of full information of the system, by controlling some parameters of the method, it has similar behavior to the traditional centralized approaches.

scholarly journals Computational storage: an efficient and scalable platform for big data and HPC applications

2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Mahdi Torabzadehkashi ◽  
Siavash Rezaei ◽  
Ali HeydariGorji ◽  
Hosein Bobarshad ◽  
Vladimir Alves ◽  
...  
Keyword(s):  
Big Data ◽  
High Performance ◽  
Distributed Processing ◽  
Data Access ◽  
Distributed Applications ◽  
Process Data ◽  
Storage Devices ◽  
Hadoop Mapreduce ◽  
Big Data Applications ◽  
Application Processor

AbstractIn the era of big data applications, the demand for more sophisticated data centers and high-performance data processing mechanisms is increasing drastically. Data are originally stored in storage systems. To process data, application servers need to fetch them from storage devices, which imposes the cost of moving data to the system. This cost has a direct relation with the distance of processing engines from the data. This is the key motivation for the emergence of distributed processing platforms such as Hadoop, which move process closer to data. Computational storage devices (CSDs) push the “move process to data” paradigm to its ultimate boundaries by deploying embedded processing engines inside storage devices to process data. In this paper, we introduce Catalina, an efficient and flexible computational storage platform, that provides a seamless environment to process data in-place. Catalina is the first CSD equipped with a dedicated application processor running a full-fledged operating system that provides filesystem-level data access for the applications. Thus, a vast spectrum of applications can be ported for running on Catalina CSDs. Due to these unique features, to the best of our knowledge, Catalina CSD is the only in-storage processing platform that can be seamlessly deployed in clusters to run distributed applications such as Hadoop MapReduce and HPC applications in-place without any modifications on the underlying distributed processing framework. For the proof of concept, we build a fully functional Catalina prototype and a CSD-equipped platform using 16 Catalina CSDs to run Intel HiBench Hadoop and HPC benchmarks to investigate the benefits of deploying Catalina CSDs in the distributed processing environments. The experimental results show up to 2.2× improvement in performance and 4.3× reduction in energy consumption, respectively, for running Hadoop MapReduce benchmarks. Additionally, thanks to the Neon SIMD engines, the performance and energy efficiency of DFT algorithms are improved up to 5.4× and 8.9×, respectively.

Secure Real-time Data Access Using Two-Factor Authentication Scheme for the Internet of Drones

2021 ◽  
Author(s):  
Haqi Khalid ◽  
Shaiful Jahari Hashim ◽  
Sharifah Mumtazah Syed Ahamed ◽  
Fazirulhisyam Hashim ◽  
Muhammad Akmal Chaudhary
Keyword(s):  
Real Time ◽  
Data Access ◽  
Authentication Scheme ◽  
The Internet ◽  
Time Data ◽  
Real Time Data

scholarly journals P2P Payment using Blockchain Technology

2021 ◽  
pp. 12-16
Author(s):  
Savinay Mengi ◽  
Astha Gupta
Keyword(s):  
Distributed Control ◽  
Distributed Database ◽  
Economic Incentives ◽  
P2p Network ◽  
The Internet ◽  
P2p Networks ◽  
Transaction Data ◽  
Blockchain Technology ◽  
Single User ◽  
Human Problem

A Blockchain protocol operates on top of the Internet, on a P2P network of computers that all run the protocol and hold an identical copy of the ledger of transactions, enabling P2P value transactions without a middleman though machine consensus. The concept of Blockchain first came to fame in October 2008, as part of a proposal for Bitcoin, with the aim to create P2P money without banks. Bitcoin introduced a novel solution to the age-old human problem of trust. The underlying blockchain technology allows us to trust the outputs of the system without trusting any actor within it. People and institutions who do not know or trust each other, reside in different countries, are subject to different jurisdictions, and who have no legally binding agreements with each other, can now interact over the Internet without the need for trusted third parties like banks, Internet platforms, or other types of clearing institutions. Ideas around cryptographically secured P2P networks have been discussed in the academic environment in different evolutionary stages, mostly in theoretical papers, since the 1980s. “Proof-of-Work” is the consensus mechanism that enables distributed control over the ledger. It is based on a combination of economic incentives and cryptography. Blockchain is a shared, trusted, public ledger of transactions, that everyone can inspect but which no single user controls. It is a distributed database that maintains a continuously growing list of transaction data records, cryptographically secured from tampering and revision.

scholarly journals Corruption as Presented in the Lithuanian Internet Media

2017 ◽  
Vol 25 ◽  
pp. 43 ◽  
Author(s):  
Aleksandras Dobryninas ◽  
Mindaugas Gilaitis
Keyword(s):  
Content Analysis ◽  
Criminal Justice ◽  
Semantic Analysis ◽  
Statistical Data ◽  
The Internet ◽  
Internet Media ◽  
Internet Portals

The article focuses on content analysis of corruption-related publications released by Lithuanian Internet media. The authors present findings from structural and semantic analysis of the online publications on corruption issues that appeared during 2015 via two influential Internet portals: DELFI.lt and Lrytas.lt. These findings are interpreted in the context of official statistical data surrounding anti-corruption activity in the country and in light of results from corruption‑related diagnostic surveys. The analysis reveals a tendency toward ‘virtual criminalisation’ of corruption in the Internet-media publications examined and, a result of such a criminal-justice framing, an absence of focus on preventive and education‑oriented anti-corruption measures.

scholarly journals Measuring Efficiency of Websites of Agrotouristic Farms from Poland and Slovakia

2017 ◽  
Vol 10 (2) ◽  
pp. 50-59 ◽  
Author(s):  
Karol Król ◽  
Jozef Halva
Keyword(s):  
Statistical Data ◽  
The Internet ◽  
Measuring Efficiency ◽  
Mean Time

AbstractSubject and purpose of work: The aim of the paper was to study traditional measures of efficiency of websites of agrotouristic farms from Poland and Slovakia. Materials and methods: It was assumed that basic measures of efficiency of a website of an agrotouristic farm are: a number of displays, mean time spent by a user in a website and also a mean number of pages which were browsed. 200 websites were analysed and their addresses were gained from online catalogues. The amounts of established measures were gained by means of SimilarWeb application. Results: In case of websites of agrotouristic farms from Poland, statistical data were available for 54 websites whereas for Slovak websites - there were 52 of them. There was by about 15.5% less number of views on the websites of Polish farms in contrast to Slovak ones, however there were Polish websites where users spent more time. In holiday months, tested websites had the highest viewer rating. Conclusions: Performed surveys brought a series of methodical questions. Gained statistics of websites’ usage do not tell much about differences in the Internet using rate in promotion of agrotouristic farms in Poland and Slovakia.

scholarly journals Multistage Dynamic Packet Access Mechanism of Internet of Things

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Yi Meng ◽  
Chen QingKui ◽  
Zhang Gang
Keyword(s):  
Internet Of Things ◽  
Resource Competition ◽  
Data Access ◽  
The Internet ◽  
Network Access ◽  
Feature Maps ◽  
Control Command ◽  
Packet Access ◽  
Low Efficiency ◽  
The Internet Of Things

In the scenario of mass control commands requesting for network access, confined by the best-effort network service mode, it is easy to bring about resource competition and thus a phenomenon of access failure on major and urgent service request at the data access center for the Internet of Things. In this event, the dynamic diversification of control command is unable to access the necessary resources on a comparatively fair basis, causing low efficiency in heterogeneous resource utilization at the access center. This paper defines the problem of group request dynamic resource allocation and further converts it into the problem of 0-1 integer and linear programming and proposes a multistage dynamic packet access strategy. This strategy works first on dynamic group division on the users’ mass control requests using the high ability of self-organizing feature maps and then searches for the optimized matching resources based on the frog-leaping algorithm which has a better capacity for global searching for the best resources. This paper analyzes the feasibility of this strategy and its astringency. The experimental results demonstrate that the strategy can effectively improve the success rate of access to the data center for the Internet of Things and reduce network blockage and response delay.

Sign in / Sign up

Export Citation Format

Share Document