Transparent Computing (TC) is becoming a promising paradigm in network computing era. Although many researchers believe that TC model has a high requirement for the communication bandwidth, there is ...no research on the communication bandwidth boundary or resource allocation, which impedes the development of TC. This paper focuses on studying an efficient transparent computing resource allocation model in an economic view. First, under the quality of experiments (QoE) ensured, the utility function of clients and transparent computing providers (TCPs) is constructed. After that, the demand boundary of communication bandwidth is analyzed under the ideal transparent computing model. Based on the above analyses, a resource allocation scheme based on double-sided combinational auctions (DCA) is proposed so that the resource can be shared by both the service side and the client side with the welfare of the whole society being maximized. Afterward, the results scheduled in different experimental scenarios are given, which verifies the effectiveness of the proposed strategy. Overall, this work provides an effective resource allocation model for optimizing the performance of TC.
Given a
social network
with
diffusion probabilities
as edge weights and a positive integer
k
, which
k
nodes should be chosen for initial injection of information to maximize the influence in the ...network? This problem is popularly known as the
Social Influence Maximization Problem
(
SIM Problem
). This is an active area of research in
computational social network analysis
domain, since one and half decades or so. Due to its practical importance in various domains, such as
viral marketing
,
target advertisement
and
personalized recommendation
, the problem has been studied in different variants, and different solution methodologies have been proposed over the years. This paper presents a survey on the progress in and around
SIM Problem
. At last, it discusses current research trends and future research directions as well.
In the last 16 years, more than 200 research articles were published about
research-paper recommender systems
. We reviewed these articles and present some descriptive statistics in this paper, as ...well as a discussion about the major advancements and shortcomings and an overview of the most common recommendation concepts and approaches. We found that more than half of the recommendation approaches applied content-based filtering (55 %). Collaborative filtering was applied by only 18 % of the reviewed approaches, and graph-based recommendations by 16 %. Other recommendation concepts included stereotyping, item-centric recommendations, and hybrid recommendations. The content-based filtering approaches mainly utilized papers that the users had authored, tagged, browsed, or downloaded. TF-IDF was the most frequently applied weighting scheme. In addition to simple terms, n-grams, topics, and citations were utilized to model users’ information needs. Our review revealed some shortcomings of the current research. First, it remains unclear which recommendation concepts and approaches are the most promising. For instance, researchers reported different results on the performance of content-based and collaborative filtering. Sometimes content-based filtering performed better than collaborative filtering and sometimes it performed worse. We identified three potential reasons for the ambiguity of the results. (A) Several evaluations had limitations. They were based on strongly pruned datasets, few participants in user studies, or did not use appropriate baselines. (B) Some authors provided little information about their algorithms, which makes it difficult to re-implement the approaches. Consequently, researchers use different implementations of the same recommendations approaches, which might lead to variations in the results. (C) We speculated that minor variations in datasets, algorithms, or user populations inevitably lead to strong variations in the performance of the approaches. Hence, finding the most promising approaches is a challenge. As a second limitation, we noted that many authors neglected to take into account factors other than accuracy, for example overall user satisfaction. In addition, most approaches (81 %) neglected the user-modeling process and did not infer information automatically but let users provide keywords, text snippets, or a single paper as input. Information on runtime was provided for 10 % of the approaches. Finally, few research papers had an impact on research-paper recommender systems in practice. We also identified a lack of authority and long-term research interest in the field: 73 % of the authors published no more than one paper on research-paper recommender systems, and there was little cooperation among different co-author groups. We concluded that several actions could improve the research landscape: developing a common evaluation framework, agreement on the information to include in research papers, a stronger focus on non-accuracy aspects and user modeling, a platform for researchers to exchange information, and an open-source framework that bundles the available recommendation approaches.
As the number of messages and social relationships embedded in social networking sites (SNS) increases, the amount of social information demanding a reaction from individuals increases as well. We ...observe that, as a consequence, SNS users feel they are giving too much social support to other SNS users. Drawing on social support theory (SST), we call this negative association with SNS usage 'social overload' and develop a latent variable to measure it. We then identify the theoretical antecedents and consequences of social overload and evaluate the social overload model empirically using interviews with 12 and a survey of 571 Facebook users. The results show that extent of usage, number of friends, subjective social support norms, and type of relationship (online-only vs offline friends) are factors that directly contribute to social overload while age has only an indirect effect. The psychological and behavioral consequences of social overload include feelings of SNS exhaustion by users, low levels of user satisfaction, and a high intention to reduce or even stop using SNS. The resulting theoretical implications for SST and SNS acceptance research are discussed and practical implications for organizations, SNS providers, and SNS users are drawn.
In recent years, the rapid development of blockchain technology and cryptocurrencies has influenced the financial industry by creating a new crypto-economy. Then, next-generation decentralized ...applications without involving a trusted third-party have emerged thanks to the appearance of smart contracts, which are computer protocols designed to facilitate, verify, and enforce automatically the negotiation and agreement among multiple untrustworthy parties. Despite the bright side of smart contracts, several concerns continue to undermine their adoption, such as security threats, vulnerabilities, and legal issues. In this paper, we present a comprehensive survey of blockchain-enabled smart contracts from both technical and usage points of view. To do so, we present a taxonomy of existing blockchain-enabled smart contract solutions, categorize the included research papers, and discuss the existing smart contract-based studies. Based on the findings from the survey, we identify a set of challenges and open issues that need to be addressed in future studies. Finally, we identify future trends.
In this paper, we address simultaneous control of a flexible spacecraft’s attitude and vibrations in a three-dimensional space under input disturbances and unknown actuator failures. Using Hamilton’s ...principle, the system dynamics is modeled as an infinite dimensional system captured using partial differential equations. Moreover, a novel adaptive fault tolerant control strategy is developed to suppress the vibrations of the flexible panel in the course of the attitude stabilization. To determine whether the system energies, angular velocities and transverse deflections, remain bounded and asymptotically decay to zero in the case wherein the number of actuator failures is infinite, a Lyapunov-based stability analysis is conducted. Finally, extensive numerical simulations are performed to demonstrate the performance of the proposed adaptive control strategy.
Machine Learning (ML) has been enjoying an unprecedented surge in applications that solve problems and enable automation in diverse domains. Primarily, this is due to the explosion in the ...availability of data, significant improvements in ML techniques, and advancement in computing capabilities. Undoubtedly, ML has been applied to various mundane and complex problems arising in network operation and management. There are various surveys on ML for specific areas in networking or for specific network technologies. This survey is original, since it jointly presents the application of diverse ML techniques in various key areas of networking across different network technologies. In this way, readers will benefit from a comprehensive discussion on the different learning paradigms and ML techniques applied to fundamental problems in networking, including traffic prediction, routing and classification, congestion control, resource and fault management, QoS and QoE management, and network security. Furthermore, this survey delineates the limitations, give insights, research challenges and future opportunities to advance ML in networking. Therefore, this is a timely contribution of the implications of ML for networking, that is pushing the barriers of autonomic network operation and management.
In recent years, data and computing resources are typically distributed in the devices of end users, various regions or organizations. Because of laws or regulations, the distributed data and ...computing resources cannot be aggregated or directly shared among different regions or organizations for machine learning tasks. Federated learning emerges as an efficient approach to exploit distributed data and computing resources, so as to collaboratively train machine learning models. At the same time, federated learning obeys the laws and regulations and ensures data security and data privacy. In this paper, we provide a comprehensive survey of existing works for federated learning. First, we propose a functional architecture of federated learning systems and a taxonomy of related techniques. Second, we explain the federated learning systems from four aspects: diverse types of parallelism, aggregation algorithms, data communication, and the security of federated learning systems. Third, we present four widely used federated systems based on the functional architecture. Finally, we summarize the limitations and propose future research directions.
Feature selection is one of the key problems for machine learning and data mining. In this review paper, a brief historical background of the field is given, followed by a selection of challenges ...which are of particular current interests, such as feature selection for high-dimensional small sample size data, large-scale data, and secure feature selection. Along with these challenges, some hot topics for feature selection have emerged, e.g., stable feature selection, multi-view feature selection, distributed feature selection, multi-label feature selection, online feature selection, and adversarial feature selection. Then, the recent advances of these topics are surveyed in this paper. For each topic, the existing problems are analyzed, and then, current solutions to these problems are presented and discussed. Besides the topics, some representative applications of feature selection are also introduced, such as applications in bioinformatics, social media, and multimedia retrieval.
Purpose
Social networks have been developed as a great point for its users to communicate with their interested friends and share their opinions, photos, and videos reflecting their moods, feelings ...and sentiments. This creates an opportunity to analyze social network data for user’s feelings and sentiments to investigate their moods and attitudes when they are communicating via these online tools.
Methods
Although diagnosis of depression using social networks data has picked an established position globally, there are several dimensions that are yet to be detected. In this study, we aim to perform depression analysis on Facebook data collected from an online public source. To investigate the effect of depression detection, we propose machine learning technique as an efficient and scalable method.
Results
We report an implementation of the proposed method. We have evaluated the efficiency of our proposed method using a set of various psycholinguistic features. We show that our proposed method can significantly improve the accuracy and classification error rate. In addition, the result shows that in different experiments Decision Tree (DT) gives the highest accuracy than other ML approaches to find the depression.
Conclusions
Machine learning techniques identify high quality solutions of mental health problems among Facebook users.