Search results

This paper aims to look at shifts in internet-related content and services economies, from audience labour economies to Web 2.0 user-generated content, and the emerging model of user computing power utilisation, powered by blockchain technologies. The authors look at and test three models of user computing power utilisation based on distributed computing (Coinhive, Cryptotab and Gridcoin) two of which use cryptocurrency mining through distributed pool mining techniques, while the third is based on distributed computing of calculations for scientific research. The three models promise benefits to their users, which the authors discuss throughout the paper, studying how they interplay with the three levels of the digital divide.

The goal of this article is twofold as follows: first to discuss how using the mining hype may reduce digital inequalities, and secondly to demonstrate how these services offer a new business model based on value rewarding in exchange for computational power, which would allow more online opportunities for people, and thus reduce digital inequalities. Finally, this contribution discusses and proposes a method for a fair revenue model for content and online service providers that uses user device computing resources or computational power, rather than their data and attention. The method is represented by a model that allows for consensual use of user computing resources in exchange for accessing content and using software tools and services, acting essentially as an alternative online business model.

Allowing users to convert their devices’ computational power into value, whether through access to services or content or receiving cryptocurrency and payments in return for providing services or content or direct computational powers, contributes to bridging digital divides, even at fairly small levels. Secondly, the advent of blockchain technologies is shifting power relations between end-users and content developers and service providers and is a necessity for the decentralisation of internet and internet services.

The article studies the effect of services that rely on distributed computing and mining on digital inequalities, by looking at three different case studies – Coinhive, Gridcoin and Cryptotab – that promise to provide value in return for using computing resources. The article discusses how these services may reduce digital inequalities by affecting the three levels of the digital divide, namely, access to information and communication technologies (ICTs) (first level), skills and motivations in using ICTs (second level) and capacities in using ICTs to get concrete benefits (third level).

This monograph defines distributed intelligence and discusses the relationship of distributed intelligence to data base, justifications for using the technique, and the approach to successful implementation of the technique. The approach is then illustrated by reference to a case study of experience in Birds Eye Foods. The planning process by which computing strategy for the company was decided is described, and the planning conclusions reached to date are given. The current state of development in the company is outlined and the very real savings so far achieved are specified. Finally, the main conclusions of the monograph are brought together. In essence these conclusions are that major savings are achievable using distributed intelligence, and that the implementation of a company data processing plan can be made quicker and simpler by its use. However, careful central control must be maintained so as to avoid fragmentation of machine, language skills, and application taking place.

This paper gives a bibliographical review of the finite element and boundary element parallel processing techniques from the theoretical and application points of view. Topics include: theory – domain decomposition/partitioning, load balancing, parallel solvers/algorithms, parallel mesh generation, adaptive methods, and visualization/graphics; applications – structural mechanics problems, dynamic problems, material/geometrical non‐linear problems, contact problems, fracture mechanics, field problems, coupled problems, sensitivity and optimization, and other problems; hardware and software environments – hardware environments, programming techniques, and software development and presentations. The bibliography at the end of this paper contains 850 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1996 and 2002.

This work can be used as a building block in other settings such as GPU, Map-Reduce, Spark or any other. Also, DDPML can be deployed on other distributed systems such as P2P networks, clusters, clouds computing or other technologies.

In the age of Big Data, all companies want to benefit from large amounts of data. These data can help them understand their internal and external environment and anticipate associated phenomena, as the data turn into knowledge that can be used for prediction later. Thus, this knowledge becomes a great asset in companies' hands. This is precisely the objective of data mining. But with the production of a large amount of data and knowledge at a faster pace, the authors are now talking about Big Data mining. For this reason, the authors’ proposed works mainly aim at solving the problem of volume, veracity, validity and velocity when classifying Big Data using distributed and parallel processing techniques. So, the problem that the authors are raising in this work is how the authors can make machine learning algorithms work in a distributed and parallel way at the same time without losing the accuracy of classification results. To solve this problem, the authors propose a system called Dynamic Distributed and Parallel Machine Learning (DDPML) algorithms. To build it, the authors divided their work into two parts. In the first, the authors propose a distributed architecture that is controlled by Map-Reduce algorithm which in turn depends on random sampling technique. So, the distributed architecture that the authors designed is specially directed to handle big data processing that operates in a coherent and efficient manner with the sampling strategy proposed in this work. This architecture also helps the authors to actually verify the classification results obtained using the representative learning base (RLB). In the second part, the authors have extracted the representative learning base by sampling at two levels using the stratified random sampling method. This sampling method is also applied to extract the shared learning base (SLB) and the partial learning base for the first level (PLBL1) and the partial learning base for the second level (PLBL2). The experimental results show the efficiency of our solution that the authors provided without significant loss of the classification results. Thus, in practical terms, the system DDPML is generally dedicated to big data mining processing, and works effectively in distributed systems with a simple structure, such as client-server networks.

The authors got very satisfactory classification results.

DDPML system is specially designed to smoothly handle big data mining classification.

To utilize the idle computational resources in a network to collectively solve middle to large problems, this paper aims to propose an integrated distributed computing platform, Java distributed code generating and computing (JDGC).

The proposed JDGC is fully decentralized in that every participating host is identical in function. It allows standard, single machine‐oriented Java programs to be transparently executed in a distributed system. The code generator reduces the communication overhead between runtime objects based on a detailed analysis of the communication affinities between them.

The experimental results show that JDGC can efficiently reduce the execution time of applications by utilizing the networked computational resources.

JDGC releases the developers from any special programming considerations for distributed environment, and solves the portability problem of using system‐specific programming methods.

Anonymous distributed computing systems consist of potentially millions of heterogeneous processing nodes connected by the global Internet. These nodes can be administered by thousands of organizations and individuals, with no direct knowledge of each other. This work defines anonymous distributed computing systems in general then focuses on the specifics of an applet‐based approach for large‐scale, anonymous, distributed computing on the Internet. A user wishing to participate in a computation connects to a distribution server, which provides information about available computations, and then connects to a computation server with a computation to distribute. A Java class is downloaded, which communicates with the computation server to obtain data, performs the computation, and returns the result. Since any computer on the Internet can participate in these computations, potentially a large number of computers can participate in a single computation.

Ever since Mark Weiser coined the term “ubiquitous computing” (ubicomp) in 1988, there has been a general interest in proposing various solutions that would support his vision. However, attacks targeting devices and services of a ubicomp environment have demonstrated not only different privacy issues, but also a risk of endangering user’s life (e.g. by modifying medical sensor readings). Thus, the aim of this paper is to provide a comprehensive overview of security challenges of ubicomp environments and the corresponding countermeasures proposed over the past decade.

The results of this paper are based on a literature review method originally used in evidence-based medicine called systematic literature review (SLR), which identifies, filters, classifies and summarizes the findings.

Starting from the bibliometric results that clearly show an increasing interest in the topic of ubicomp security worldwide, the findings reveal specific types of attacks and vulnerabilities that have motivated the research over the past decade. This review describes most commonly proposed countermeasures – context-aware access control and authentication mechanisms, cryptographic protocols that account for device’s resource constraints, privacy-preserving mechanisms, and trust mechanisms for wireless ad hoc and sensor networks.

To the best of our knowledge, this is the first SLR on security challenges in ubicomp. The findings should serve as a reference to an extensive list of scientific contributions, as well as a guiding point for the researchers’ novel to the security research in ubicomp.

Big data has posed problems for businesses, the Information Technology (IT) sector and the science community. The problems posed by big data can be effectively addressed using cloud computing and associated distributed computing technology. Cloud computing and big data are two significant past-year problems that allow high-efficiency and competitive computing tools to be delivered as IT services. The paper aims to examine the role of the cloud as a tool for managing big data in various aspects to help businesses.

This paper delivers solutions in the cloud for storing, compressing, analyzing and processing big data. Hence, articles were divided into four categories: articles on big data storage, articles on big data processing, articles on analyzing and finally, articles on data compression in cloud computing. This article is based on a systematic literature review. Also, it is based on a review of 19 published papers on big data.

From the results, it can be inferred that cloud computing technology has features that can be useful for big data management. Challenging issues are raised in each section. For example, in storing big data, privacy and security issues are challenging.

There were limitations to this systematic review. The first limitation is that only English articles were reviewed. Also, articles that matched the keywords were used. Finally, in this review, authoritative articles were reviewed, and slides and tutorials were avoided.

The research presents new insight into the business value of cloud computing in interfirm collaborations.

Previous research has often examined other aspects of big data in the cloud. This article takes a new approach to the subject. It allows big data researchers to comprehend the various aspects of big data management in the cloud. In addition, setting an agenda for future research saves time and effort for readers searching for topics within big data.

Apart from, the smart edge computing (EC) robot (SECR) provides the tools to manage Internet of things (IoT) services in the edge landscape by means of real-world test-bed designed in ECR. Eventually, based on the results from two experiments held in little constrained condition, such as the maximum data size is 2GB, the performance of the proposed techniques demonstrate the effectiveness, scalability and performance efficiency of the proposed IoT model.

Certainly, the proposed SECR is trying primarily to take over other traditional static robots in a centralized or distributed cloud environment. One aspect of representation of the proposed edge computing algorithms is due to challenge to slow down the consumption of time which happened in an artificial intelligence (AI) robot system. Thus, the developed SECR trained by tiny machine learning (TinyML) techniques to develop a decentralized and dynamic software environment.

Specifically, the waste time of SECR has actually slowed down when it is embedded with Edge Computing devices in the demonstration of data transmission within different paths. The TinyML is applied to train with image data sets for generating a framework running in the SECR for the recognition which has also proved with a second complete experiment.

The work presented in this paper is the first research effort, and which is focusing on resource allocation and dynamic path selection for edge computing. The developed platform using a decoupled resource management model that manages the allocation of micro node resources independent of the service provisioning performed at the cloud and manager nodes. Besides, the algorithm of the edge computing management is established with different path and pass large data to cloud and receive it. In this work which considered the SECR framework is able to perform the same function as that supports to the multi-dimensional scaling (MDS).