2,182 research outputs found
Data-driven Computational Social Science: A Survey
Social science concerns issues on individuals, relationships, and the whole
society. The complexity of research topics in social science makes it the
amalgamation of multiple disciplines, such as economics, political science, and
sociology, etc. For centuries, scientists have conducted many studies to
understand the mechanisms of the society. However, due to the limitations of
traditional research methods, there exist many critical social issues to be
explored. To solve those issues, computational social science emerges due to
the rapid advancements of computation technologies and the profound studies on
social science. With the aids of the advanced research techniques, various
kinds of data from diverse areas can be acquired nowadays, and they can help us
look into social problems with a new eye. As a result, utilizing various data
to reveal issues derived from computational social science area has attracted
more and more attentions. In this paper, to the best of our knowledge, we
present a survey on data-driven computational social science for the first time
which primarily focuses on reviewing application domains involving human
dynamics. The state-of-the-art research on human dynamics is reviewed from
three aspects: individuals, relationships, and collectives. Specifically, the
research methodologies used to address research challenges in aforementioned
application domains are summarized. In addition, some important open challenges
with respect to both emerging research topics and research methods are
discussed.Comment: 28 pages, 8 figure
Consensus Algorithms of Distributed Ledger Technology -- A Comprehensive Analysis
The most essential component of every Distributed Ledger Technology (DLT) is
the Consensus Algorithm (CA), which enables users to reach a consensus in a
decentralized and distributed manner. Numerous CA exist, but their viability
for particular applications varies, making their trade-offs a crucial factor to
consider when implementing DLT in a specific field. This article provided a
comprehensive analysis of the various consensus algorithms used in distributed
ledger technologies (DLT) and blockchain networks. We cover an extensive array
of thirty consensus algorithms. Eleven attributes including hardware
requirements, pre-trust level, tolerance level, and more, were used to generate
a series of comparison tables evaluating these consensus algorithms. In
addition, we discuss DLT classifications, the categories of certain consensus
algorithms, and provide examples of authentication-focused and
data-storage-focused DLTs. In addition, we analyze the pros and cons of
particular consensus algorithms, such as Nominated Proof of Stake (NPoS),
Bonded Proof of Stake (BPoS), and Avalanche. In conclusion, we discuss the
applicability of these consensus algorithms to various Cyber Physical System
(CPS) use cases, including supply chain management, intelligent transportation
systems, and smart healthcare.Comment: 50 pages, 20 figure
REPUTATION COMPUTATION IN SOCIAL NETWORKS AND ITS APPLICATIONS
This thesis focuses on a quantification of reputation and presents models which compute reputation within networked environments. Reputation manifests past behaviors of users and helps others to predict behaviors of users and therefore reduce risks in future interactions. There are two approaches in computing reputation on networks- namely, the macro-level approach and the micro-level approach. A macro-level assumes that there exists a computing entity outside of a given network who can observe the entire network including degree distributions and relationships among nodes. In a micro-level approach, the entity is one of the nodes in a network and therefore can only observe the information local to itself, such as its own neighbors behaviors. In particular, we study reputation computation algorithms in online distributed environments such as social networks and develop reputation computation algorithms to address limitations of existing models. We analyze and discuss some properties of reputation values of a large number of agents including power-law distribution and their diffusion property. Computing reputation of another within a network requires knowledge of degrees of its neighbors. We develop an algorithm for estimating degrees of each neighbor. The algorithm considers observations associated with neighbors as a Bernoulli trial and repeatedly estimate degrees of neighbors as a new observation occurs. We experimentally show that the algorithm can compute the degrees of neighbors more accurately than a simple counting of observations. Finally, we design a bayesian reputation game where reputation is used as payoffs. The game theoretic view of reputation computation reflects another level of reality in which all agents are rational in sharing reputation information of others. An interesting behavior of agents within such a game theoretic environment is that cooperation- i.e., sharing true reputation information- emerges without an explicit punishment mechanism nor a direct reward mechanisms
Computational Methods for Medical and Cyber Security
Over the past decade, computational methods, including machine learning (ML) and deep learning (DL), have been exponentially growing in their development of solutions in various domains, especially medicine, cybersecurity, finance, and education. While these applications of machine learning algorithms have been proven beneficial in various fields, many shortcomings have also been highlighted, such as the lack of benchmark datasets, the inability to learn from small datasets, the cost of architecture, adversarial attacks, and imbalanced datasets. On the other hand, new and emerging algorithms, such as deep learning, one-shot learning, continuous learning, and generative adversarial networks, have successfully solved various tasks in these fields. Therefore, applying these new methods to life-critical missions is crucial, as is measuring these less-traditional algorithms' success when used in these fields
- …