Change search
Link to record
Permanent link

Direct link
BETA
Wu, Felix
Publications (10 of 15) Show all publications
Zhao, H., Kallander, W., Johnson, H. & Wu, F. (2013). SmartWiki: A reliable and conflict-refrained Wiki model based on reader differentiation and social context analysis. Knowledge-Based Systems, 47, 53-64
Open this publication in new window or tab >>SmartWiki: A reliable and conflict-refrained Wiki model based on reader differentiation and social context analysis
2013 (English)In: Knowledge-Based Systems, ISSN 0950-7051, E-ISSN 1872-7409, Vol. 47, p. 53-64Article in journal (Refereed) Published
Abstract [en]

Wiki systems, such as Wikipedia, provide a multitude of opportunities for large-scale online knowledge collaboration. Despite Wikipedia's successes with the open editing model, dissenting voices give rise to unreliable content due to conflicts amongst contributors. Frequently modified controversial articles by dissent editors hardly present reliable knowledge. Some overheated controversial articles may be locked by Wikipedia administrators who might leave their own bias in the topic. It could undermine both the neutrality and freedom policies of Wikipedia. As Richard Rorty suggested "Take Care of Freedom and Truth Will Take Care of Itself"[1], we present a new open Wiki model in this paper, called TrustWiki, which bridge readers closer to the reliable information while allowing editors to freely contribute. From our perspective, the conflict issue results from presenting the same knowledge to all readers, without regard for the difference of readers and the revealing of the underlying social context, which both causes the bias of contributors and affects the knowledge perception of readers. TrustWiki differentiates two types of readers, "value adherents" who prefer compatible viewpoints and "truth diggers" who crave for the truth. It provides two different knowledge representation models to cater for both types of readers. Social context, including social background and relationship information, is embedded in both knowledge representations to present readers with personalized and credible knowledge. To our knowledge, this is the first paper on knowledge representation combining both psychological acceptance and truth reveal to meet the needs of different readers. Although this new Wiki model focuses on reducing conflicts and reinforcing the neutrality policy of Wikipedia, it also casts light on the other content reliability problems in Wiki systems, such as vandalism and minority opinion suppression.

Place, publisher, year, edition, pages
Elsevier, 2013
Keywords
Community discovery, Confirmation bias, Knowledge representation, Natural language generation, Online social network, Trust, Wikipedia
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-6895 (URN)10.1016/j.knosys.2013.03.014 (DOI)000320351100005 ()oai:bth.se:forskinfo19B82E778AB31FCDC1257B780025AB8F (Local ID)oai:bth.se:forskinfo19B82E778AB31FCDC1257B780025AB8F (Archive number)oai:bth.se:forskinfo19B82E778AB31FCDC1257B780025AB8F (OAI)
Available from: 2013-09-10 Created: 2013-05-27 Last updated: 2018-01-11Bibliographically approved
Oliveira, D., Murthy, D., Johnson, H., Wu, F., Nia, R. & Rowe, J. (2011). A socially-aware operating system for trustworthy computing. Paper presented at IEEE International Conference on Semantic Computing, ICSC. Paper presented at IEEE International Conference on Semantic Computing, ICSC. Palo Alto: IEEE
Open this publication in new window or tab >>A socially-aware operating system for trustworthy computing
Show others...
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

Traditional security models based on distinguishing trusted from untrusted pieces of data and program behavior continue to face difficulties keeping up with attackers levels of sophistication and ingenuity. In this position paper, we present a novel computing paradigm for trustworthy computing whose application, operating system (OS) and architecture can leverage social trust to enhance the robustness and diversity of security mechanisms of any Internet-based computing environment. Our model would allow online social network (OSN) users to assign trust values to her friends in a privacy-preserving fashion and maintain a trust repository with trust values for objects like URLs, Email addresses, IP addresses and other pieces of data that can be consumed by a socially-aware OS, allowing for finegrained trust decisions that take into account user context and add diversity to host behavior. Our model also automatically infer trust values for people a user is not directly connected. In this paper we sketch the design of a socially-aware operating system kernel and identify several research challenges for this new paradigm.

Place, publisher, year, edition, pages
Palo Alto: IEEE, 2011
Keywords
Internet protocols, Network security, Semantics
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-7276 (URN)10.1109/ICSC.2011.45 (DOI)oai:bth.se:forskinfo647EE9D5BCA8C03DC1257A2200320466 (Local ID)978-076954492-2 (ISBN)oai:bth.se:forskinfo647EE9D5BCA8C03DC1257A2200320466 (Archive number)oai:bth.se:forskinfo647EE9D5BCA8C03DC1257A2200320466 (OAI)
Conference
IEEE International Conference on Semantic Computing, ICSC
Available from: 2012-09-18 Created: 2012-06-19 Last updated: 2018-01-11Bibliographically approved
Lang, J. & Wu, F. (2011). Anti-preferential attachment: If I follow you, will you follow me?. Paper presented at IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom. Paper presented at IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom. Boston: IEEE
Open this publication in new window or tab >>Anti-preferential attachment: If I follow you, will you follow me?
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

A common question in social networking research is how edges form to produce social graphs with the common characteristics, including a power-law degree distribution and a small diameter. One common model for edge formation in synthetic networks is preferential attachment. We examine the edge formation process of one Online Social Network (OSN), Buzznet, and look for evidence for preferential attachment. To our surprise, we find that a form of "anti-preferential attachment" is common, in which high-degree nodes add edges to lowdegree nodes, perhaps as a means of self-promotion. We also find that nodes are most likely to reciprocate edges from low-degree nodes, limiting the extent to which anti-preferential attachment can succeed in boosting a high-degree node's in-degree.

Place, publisher, year, edition, pages
Boston: IEEE, 2011
Keywords
Common models, Edge formation, High-degree nodes, In-Degree, Online social networks, Power-law degree distribution, Preferential attachments, Self-promotions, Social graphs, Synthetic networks, Social sciences computing
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-7296 (URN)10.1109/PASSAT/SocialCom.2011.59 (DOI)oai:bth.se:forskinfoDDACF91A6AE653C3C12579FB00437369 (Local ID)978-076954578-3 (ISBN)oai:bth.se:forskinfoDDACF91A6AE653C3C12579FB00437369 (Archive number)oai:bth.se:forskinfoDDACF91A6AE653C3C12579FB00437369 (OAI)
Conference
IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom
Available from: 2012-09-18 Created: 2012-05-11 Last updated: 2018-01-11Bibliographically approved
Zhao, H., Kallander, W., Gbedema, T., Johnson, H. & Wu, F. (2011). Read what you trust: An open wiki model enhanced by social context. Paper presented at IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom. Paper presented at IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom. Boston: IEEE
Open this publication in new window or tab >>Read what you trust: An open wiki model enhanced by social context
Show others...
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

Wiki systems, such as Wikipedia, provide a multitude of opportunities for large-scale online knowledge collaboration. Despite Wikipedia's successes with the open editing model, dissenting voices give rise to unreliable content due to conflicts amongst contributors. From our perspective, the conflict issue results from presenting the same knowledge to all readers, without regard for the importance of the underlying social context, which both reveals the bias of contributors and influences the knowledge perception of readers. Motivated by the insufficiency of the existing knowledge presentation model for Wiki systems, this paper presents TrustWiki, a new Wiki model which leverages social context, including social background and relationship information, to present readers with personalized and credible knowledge. Our experiment shows, with reliable social context information, TrustWiki can efficiently assign readers to their compatible editor community and present credible knowledge derived from that community. Although this new Wiki model focuses on reinforcing the neutrality policy of Wikipedia, it also casts light on the other content reliability problems in Wiki systems, such as vandalism and minority opinion suppression.

Place, publisher, year, edition, pages
Boston: IEEE, 2011
Keywords
Knowledge collaboration, Knowledge presentation, Reliability problems, Social context, Wikipedia
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-7290 (URN)oai:bth.se:forskinfo7B2BA9A4DEA8E740C12579FB004AF351 (Local ID)978-076954578-3 (ISBN)oai:bth.se:forskinfo7B2BA9A4DEA8E740C12579FB004AF351 (Archive number)oai:bth.se:forskinfo7B2BA9A4DEA8E740C12579FB004AF351 (OAI)
Conference
IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom
Available from: 2012-09-18 Created: 2012-05-11 Last updated: 2018-01-11Bibliographically approved
Doroud, M., Bhattacharyya, P., Wu, F. & Felmlee, D. (2011). The evolution of ego-centric triads: A microscopic approach toward predicting macroscopic network properties. Paper presented at IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom. Paper presented at IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom. Boston: IEEE
Open this publication in new window or tab >>The evolution of ego-centric triads: A microscopic approach toward predicting macroscopic network properties
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

Scalability issues make it time-consuming to estimate even simple characteristics of large scale, online networks, and the constantly evolving qualities of these networks make it challenging to capture a representative picture of a particular networks properties. Here we focus on the evolution of all triads (ties between three nodes) in a graph, as a method of studying change over time in large scale, online social networks. For three month snapshots, we examine, and predict, transitions among all sixteen triad types (i.e., triad census) in a sample of three years of Facebook wall-post interactions. We introduce a new sampling approach for examining triads in online graphs, based on ego-centric networks of random seeds. We examine tendencies in the data toward properties related to balance theory, including structural balance, clusterability, ranked clusters, transitivity, hierarchical clusters, and the presence of "forbidden" triads. In a time series analysis, we successfully predict the evolution over time in the wall post network dataset, with relatively low levels of error. The findings demonstrate the utility of our ego- centric, two-step, random seed sampling approach for studying large scale networks and predicting macroscopic graph properties, as well as the advantages of examining transitions in the complete triad census for an online network.

Place, publisher, year, edition, pages
Boston: IEEE, 2011
Keywords
Data sets, Facebook, Graph properties, Hierarchical clusters, Large-scale network, Low level, Network properties, On-line network, Online social networks, Random seeds, Scalability issue, Structural balance
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-7289 (URN)10.1109/PASSAT/SocialCom.2011.101 (DOI)oai:bth.se:forskinfoFE5E46915AF18104C12579FB004BC9C1 (Local ID)978-076954578-3 (ISBN)oai:bth.se:forskinfoFE5E46915AF18104C12579FB004BC9C1 (Archive number)oai:bth.se:forskinfoFE5E46915AF18104C12579FB004BC9C1 (OAI)
Conference
IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom
Available from: 2012-09-18 Created: 2012-05-11 Last updated: 2018-01-11Bibliographically approved
Johnson, H., Lavesson, N., Oliveira, D. A. S. & Wu, F. (2011). Trustworthy opportunistic sensing: A Social Computing Paradigm. Paper presented at IEEE International Conference on Information Reuse and Integration. Paper presented at IEEE International Conference on Information Reuse and Integration. Las Vegas: IEEE Press
Open this publication in new window or tab >>Trustworthy opportunistic sensing: A Social Computing Paradigm
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

In recent years, technological advances have lead to a society with communication platforms like iPhone and Kinect Xbox that are able to inject sensing presence into online social networks (OSNs). Thus, it is possible to create large-scale opportunistic networks by integrating sensors, applications and social networks and this development could also promote innovative collaborative cyber security models. In this position paper, we discuss how social informatics will play a crucial role in trustworthy pervasive computing. With regard to security, our primary computing paradigm is still about processing information content only in order to make decisions. Given the availability of both digitized social informatics and sensor content, we now have the option to examine these sources simultaneously. We refer to this new era as the Social Computing Paradigm, and we argue that it could be particularly useful in conjunction with opportunistic sensing.

Place, publisher, year, edition, pages
Las Vegas: IEEE Press, 2011
Keywords
opportunistic sensing, social computing
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-7437 (URN)10.1109/IRI.2011.6009608 (DOI)000298749600098 ()oai:bth.se:forskinfo3B581D86F21B443CC1257943007D44A8 (Local ID)978-1-4577-0964-7 (ISBN)oai:bth.se:forskinfo3B581D86F21B443CC1257943007D44A8 (Archive number)oai:bth.se:forskinfo3B581D86F21B443CC1257943007D44A8 (OAI)
Conference
IEEE International Conference on Information Reuse and Integration
Available from: 2012-09-18 Created: 2011-11-09 Last updated: 2018-01-11Bibliographically approved
Bhattacharyya, P., Rowe, J., Wu, F., Haigh, K., Lavesson, N. & Johnson, H. (2011). Your Best might not be Good enough: Ranking in Collaborative Social Search Engines. Paper presented at Seventh International Conference on Collaborative Computing: Networking, Applications and Worksharing. Paper presented at Seventh International Conference on Collaborative Computing: Networking, Applications and Worksharing. Orlando: IEEE Press
Open this publication in new window or tab >>Your Best might not be Good enough: Ranking in Collaborative Social Search Engines
Show others...
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

A relevant feature of online social networks like Facebook is the scope for users to share external information from the web with their friends by sharing an URL. The phenomenon of sharing has bridged the web graph with the social network graph and the shared knowledge in ego networks has become a source for relevant information for an individual user, leading to the emergence of social search as a powerful tool for information retrieval. Consideration of the social context has become an essential factor in the process of ranking results in response to queries in social search engines. In this work, we present InfoSearch, a social search engine built over the Facebook platform, which lets users search for information based on what their friends have shared. We identify and implement three distinct ranking factors based on the number of mutual friends, social group membership, and time stamp of shared documents to rank results for user searches. We perform user studies based on the Facebook feeds of two authors to understand the impact of each ranking factor on the result for two queries.

Place, publisher, year, edition, pages
Orlando: IEEE Press, 2011
Keywords
social search, search engine, rank
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-7436 (URN)oai:bth.se:forskinfoCD54177F6F427A96C1257943007DD56F (Local ID)oai:bth.se:forskinfoCD54177F6F427A96C1257943007DD56F (Archive number)oai:bth.se:forskinfoCD54177F6F427A96C1257943007DD56F (OAI)
Conference
Seventh International Conference on Collaborative Computing: Networking, Applications and Worksharing
Available from: 2012-09-18 Created: 2011-11-09 Last updated: 2018-01-11Bibliographically approved
Johnson, H., Isaksson, L., Fiedler, M. & Wu, F. (2006). A Decision System for Adequate Authentication. Paper presented at International Conference on Systems. Paper presented at International Conference on Systems. IEEE
Open this publication in new window or tab >>A Decision System for Adequate Authentication
2006 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

A practical decision system is developed for finding the adequate authentication level based on desirable security criteria and alternatives. Even though the notion of lightweight security is acknowledged, the process of determining when to use it instead of strong security is not well understood. The process of making such a decision can be very complex. By defining an overall security goal and a set of criteria with corresponding alternatives, the Analytic Hierarchy Process (AHP) is used to select the most suitable, preferred (and thus, adequate) authentication level, which is demonstrated by a realistic case study.

Place, publisher, year, edition, pages
IEEE, 2006
National Category
Telecommunications
Identifiers
urn:nbn:se:bth-9794 (URN)oai:bth.se:forskinfo8E7B7171E22A19EDC12571AE003B41F3 (Local ID)0-7675-2552-0 (ISBN)oai:bth.se:forskinfo8E7B7171E22A19EDC12571AE003B41F3 (Archive number)oai:bth.se:forskinfo8E7B7171E22A19EDC12571AE003B41F3 (OAI)
Conference
International Conference on Systems
Available from: 2012-09-18 Created: 2006-07-17 Last updated: 2015-06-30Bibliographically approved
Johnson, H., Qaisrani, B., Fiedler, M., Wu, F. & Nilsson, A. A. (2006). Hierarchical Defense Structure for Mitigating DoS Attacks. Paper presented at 5th International Conference on Networking. Paper presented at 5th International Conference on Networking. IEEE
Open this publication in new window or tab >>Hierarchical Defense Structure for Mitigating DoS Attacks
Show others...
2006 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

This paper provides the contribution of mitigating a Denial-of-Service (DoS) attack via a developed hierarchical defense structure with proactive functionality. An important aspect is the tradeoff between performance and security. This novel hierarchical architecture is presented with lightweight authentication protocols acting as a classifier to deny access to harmful traffic. An empirical test of the proposed structure has been performed and results are reported which display the capability of the structure to filter and separate the attack traffic before reaching the target of an IPSec gateway. Thus, the filtering of traffic is performed without being the target itself for new resource exhaustion attacks. The considered IPSec environment is based on IPSec gateways for the low-end market, i.e., for small businesses or private networks.

Place, publisher, year, edition, pages
IEEE, 2006
National Category
Telecommunications
Identifiers
urn:nbn:se:bth-9865 (URN)oai:bth.se:forskinfo7D1EB97425A514B4C12571AE003BF0BC (Local ID)0-7695-2552-0 (ISBN)oai:bth.se:forskinfo7D1EB97425A514B4C12571AE003BF0BC (Archive number)oai:bth.se:forskinfo7D1EB97425A514B4C12571AE003BF0BC (OAI)
Conference
5th International Conference on Networking
Available from: 2012-09-18 Created: 2006-07-17 Last updated: 2015-06-30Bibliographically approved
Johnson, H., Qaisrani, B., Fiedler, M., Wu, F. & Nilsson, A. A. (2005). Analysis of IPSec Performance. Paper presented at Promote IT 2005. Paper presented at Promote IT 2005. Lund: Studentlitteratur
Open this publication in new window or tab >>Analysis of IPSec Performance
Show others...
2005 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

In this paper we present the results of an experimental analysis of IPSec performance. IPSec serves as a security service to protect a communication session over unreliable networks using several cryptographic functions. The different IPSec features used to obtain confidentiality, authentication, replay protection, and integrity introduce performance costs brought about by the increased processing overhead. The performance parameters of interest are delay and throughput. However, there is a tradeoff between performance and security. The results of the performance tests indicate the vulnerability of a Denial-of-Service attack against a gateway running IPSec due to resource exhaustion.

Place, publisher, year, edition, pages
Lund: Studentlitteratur, 2005
National Category
Telecommunications
Identifiers
urn:nbn:se:bth-10246 (URN)oai:bth.se:forskinfo18896173F7D4CFA6C125700D0032751A (Local ID)91-44-03875-5 (ISBN)oai:bth.se:forskinfo18896173F7D4CFA6C125700D0032751A (Archive number)oai:bth.se:forskinfo18896173F7D4CFA6C125700D0032751A (OAI)
Conference
Promote IT 2005
Available from: 2012-09-18 Created: 2005-05-26 Last updated: 2015-06-30Bibliographically approved
Organisations

Search in DiVA

Show all publications