12 results on '"Wierzbicki, Adam"'
Search Results
2. Look Who’s Talking: Modeling Decision Making Based on Source Credibility
- Author
-
Kawiak, Andrzej, Wójcik, Grzegorz M., Kwasniewicz, Lukasz, Schneider, Piotr, and Wierzbicki, Adam
- Subjects
Article - Abstract
Understanding how humans evaluate credibility is an important scientific question in the era of fake news. Source credibility is among the most important aspects of credibility evaluations. One of the most direct ways to understand source credibility is to use measurements of brain activity of humans who make credibility evaluations. Nevertheless, source credibility has never been investigated using such a method before. This article reports the results of an experiment during which we have measured brain activity during source credibility evaluation using EEG. The experiment allowed for identification of brain areas that were active when a participant made positive or negative source credibility evaluations. Based on experimental data, we modelled and predicted human source credibility evaluations using EEG brain activity measurements with F1 score exceeding 0.7 (using 10-fold cross-validation).
- Published
- 2020
3. Bioługowanie z wykorzystaniem ACIDIThIoBACIllUS ThIooxIDAnS : rozwiązanie dla odzyskiwania pierwiastków z wysokoalkalicznych popiołów ze spalani odpadów?
- Author
-
Kasina, Monika, Jarosz, Kinga, Salamon, Klaudiusz, Wierzbicki, Adam, Mikoda, Bartosz, and Michalik, Marek
- Subjects
Acidithiobacillus thiooxidans ,municipal-waste incineration ash ,sewage-sludge incineration ash ,surowce odpadowe ,bioleaching ,bioługowanie ,popiół ze spalania osadów ściekowych ,popiół ze spalania odpadów komunalnych ,waste resources - Published
- 2022
4. Computing controversy: Formal model and algorithms for detecting controversy on Wikipedia and in search queries
- Author
-
Zielinski, Kazimierz, Jatowt, Adam-wladyslaw, Nielek, Radoslaw, Wierzbicki, Adam, and Jatowt, Adam
- Subjects
Controversy ,Web search ,ComputingMilieux_LEGALASPECTSOFCOMPUTING ,Wikipedia - Abstract
Controversy is a complex concept that has been attracting attention of scholars from diverse fields. In the era of Internet and social media, detecting controversy and controversial concepts by the means of automatic methods is especially important. Web searchers could be alerted when the contents they consume are controversial or when they attempt to acquire information on disputed topics. Presenting users with the indications and explanations of the controversy should offer them chance to see the “wider picture” rather than letting them obtain one-sided views. In this work we first introduce a formal model of controversy as the basis of computational approaches to detecting controversial concepts. Then we propose a classification based method for automatic detection of controversial articles and categories in Wikipedia. Next, we demonstrate how to use the obtained results for the estimation of the controversy level of search queries. The proposed method can be incorporated into search engines as a component responsible for detection of queries related to controversial topics. The method is independent of the search engine’s retrieval and search results recommendation algorithms, and is therefore unaffected by a possible filter bubble. Our approach can be also applied in Wikipedia or other knowledge bases for supporting the detection of controversy and content maintenance. Finally, we believe that our results could be useful for social science researchers for understanding the complex nature of controversy and in fostering their studies.
- Published
- 2018
5. Web Content Credibility
- Author
-
Wierzbicki, Adam
- Subjects
Collaborative and social computing systems and tools ,HCI design and evaluation methods ,Web searching and information discovery ,Web applications ,Collaborative and social computing design and evaluation ,Experimentation - Abstract
This book introduces readers to Web content credibility evaluation and evaluation support. It highlights empirical research and establishes a solid foundation for future research by presenting methods of supporting credibility evaluation of online content, together with publicly available datasets for reproducible experimentation, such as the Web Content Credibility Corpus. The book is divided into six chapters. After a general introduction in Chapter 1, including a brief survey of credibility evaluation in the social sciences, Chapter 2 presents definitions of credibility and related concepts of truth and trust. Next, Chapter 3 details methods, algorithms and user interfaces for systems supporting Web content credibility evaluation. In turn, Chapter 4 takes a closer look at the credibility of social media, exemplified in sections on Twitter, Q&A systems, and Wikipedia, as well as fake news detection. In closing, Chapter 5 presents mathematical and simulation models of credibility evaluation, before a final round-up of the book is provided in Chapter 6. Overall, the book reviews and synthesizes the current state of the art in Web content credibility evaluation support and fake news detection. It provides researchers in academia and industry with both an incentive and a basis for future research and development of Web content credibility evaluation support services. Misinformation on the Internet, deliberate or merely out of ignorance, is a serious problem and it puts users in the position of needing strong critical thinking skills to sort wheat from chaff. This book will help. It's an impressive exploration of ideas in the area of Web content credibility evaluation support. – Vint Cerf, Vice President and Chief Internet Evangelist at Google
- Published
- 2018
- Full Text
- View/download PDF
6. Precious Time: Understanding Social Stratification in the Knowledge Society Through Time Allocation
- Author
-
Kakol, Michal, Nielek, Radoslaw, and Wierzbicki, Adam
- Subjects
FOS: Computer and information sciences ,Computer Science - Multiagent Systems ,Multiagent Systems (cs.MA) - Abstract
The efficient use of available resources is a key factor in achieving success on both personal and organizational levels. One of the crucial resources in knowledge economy is time. The ability to force others to adapt to our schedule even if it harms their efficiency can be seen as an outcome of social stratification. The principal objective of this paper is to use time allocation to model and study the global efficiency of social stratification, and to reveal whether hierarchy is an emergent property. A multi-agent model with an evolving social network is used to verify our hypotheses. The network's evolution is driven by the intensity of inter-agent communications, and the communications as such depend on the preferences and time resources of the communicating agents. The entire system is to be perceived as a metaphor of a social network of people regularly filling out agenda for their meetings for a period of time. The overall efficiency of the network of those scheduling agents is measured by the average utilization of the agent's preferences to speak on specific subjects. The simulation results shed light on the effects of different scheduling methods, resource availabilities, and network evolution mechanisms on communication system efficiency. The non-stratified systems show better long-term efficiency. Moreover, in the long term hierarchy disappears in overwhelming majority of cases. Some exceptions are observed for cases where privileges are granted on the basis of node degree weighted by relationship intensities but only in the short term.
- Published
- 2017
- Full Text
- View/download PDF
7. A new authentication protocol for revocable anonymity in ad-hoc networks
- Author
-
Wierzbicki, Adam, Zwierko, Aneta, and Kotulski, Zbigniew
- Subjects
Computer Science - Networking and Internet Architecture ,Networking and Internet Architecture (cs.NI) ,FOS: Computer and information sciences ,Computer Science - Cryptography and Security ,Computer Science - Distributed, Parallel, and Cluster Computing ,C.2.0 ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,C.2.4 ,Distributed, Parallel, and Cluster Computing (cs.DC) ,Cryptography and Security (cs.CR) - Abstract
This paper describes a new protocol for authentication in ad-hoc networks. The protocol has been designed to meet specialized requirements of ad-hoc networks, such as lack of direct communication between nodes or requirements for revocable anonymity. At the same time, a ad-hoc authentication protocol must be resistant to spoofing, eavesdropping and playback, and man-in-the-middle attacks. The article analyzes existing authentication methods based on the Public Key Infrastructure, and finds that they have several drawbacks in ad-hoc networks. Therefore, a new authentication protocol, basing on established cryptographic primitives (Merkle's puzzles and zero-knowledge proofs) is proposed. The protocol is studied for a model ad-hoc chat application that provides private conversations., Comment: 8 pages, 8 figures, this an extended version of paper accepted for IASTED conference CNIS'2005
- Published
- 2005
- Full Text
- View/download PDF
8. Preface
- Author
-
Cooper, Eric W., Rutkowski, Tomasz M., Wierzbicki, Adam, Kobzev, Gennady A., and Kryssanov, Victor V.
- Subjects
General Earth and Planetary Sciences ,General Environmental Science - Published
- 2014
- Full Text
- View/download PDF
9. Turned 70?
- Author
-
Nielek, Radoslaw, Lutostańska, Marta, Kopeć, Wiesław, and Wierzbicki, Adam
- Full Text
- View/download PDF
10. LivingLab PJAIT
- Author
-
Kopeć, Wiesław, Skorupska, Kinga, Jaskulska, Anna, Abramczuk, Katarzyna, Nielek, Radoslaw, and Wierzbicki, Adam
- Full Text
- View/download PDF
11. Fairness Emergence in Reputation Systems
- Author
-
Wierzbicki, Adam and Radosław Nielek
- Subjects
Trust, Simulation, Fairness, Equity, Emergence, Reputation System ,Computer Science (miscellaneous) ,General Social Sciences - Abstract
Reputation systems have been used to support users in making decisions under uncertainty or risk that is due to the autonomous behavior of others. Research results support the conclusion that reputation systems can protect against exploitation by unfair users, and that they have an impact on the prices and income of users. This observation leads to another question: can reputation systems be used to assure or increase the fairness of resource distribution? This question has a high relevance in social situations where, due to the absence of established authorities or institutions, agents need to rely on mutual trust relations in order to increase fairness of distribution. This question can be formulated as a hypothesis: in reputation (or trust management) systems, fairness should be an emergent property. The notion of fairness can be precisely defined and investigated based on the theory of equity. In this paper, we investigate the Fairness Emergence hypothesis in reputation systems and prove that , under certain conditions, the hypothesis is valid for open and closed systems, even in unstable system states and in the presence of adversaries. Moreover, we investigate the sensitivity of Fairness Emergence and show that an improvement of the reputation system strengthens the emergence of fairness. Our results are confirmed using a trace-driven simulation from a large Internet auction site.
12. Embracing n-ary Relations in Network Science
- Author
-
Johnson, Jeffrey H., Wierzbicki, Adam, Brandes, Ulrik, Schweitzer, Frank, and Pedreschi, Dino
- Subjects
Discrete mathematics ,Simplicial complex ,Hypergraph ,Abstract simplicial complex ,0103 physical sciences ,Complex system ,Network science ,Mathematical structure ,010306 general physics ,01 natural sciences ,Graph ,010305 fluids & plasmas ,Mathematics - Abstract
Most network scientists restrict their attention to relations between pairs of things, even though most complex systems have structures and dynamics determined by n-ary relation where n is greater than two. Various examples are given to illustrate this. The basic mathematical structures allowing more than two vertices have existed for more than half a century, including hypergraphs and simplicial complexes. To these can be added hypernetworks which, like multiplex networks, allow many relations to be defined on the vertices. Furthermore, hypersimplices provide an essential formalism for representing multilevel part-whole and taxonomic structures for integrating the dynamics of systems between levels. Graphs, hypergraphs, networks, simplicial complex, multiplex network and hypernetworks form a coherent whole from which, for any particular application, the scientist can select the most suitable.
- Published
- 2016
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.