Change search
Refine search result
12 1 - 50 of 98
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Basit, K. A.
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    GUMO inspired ontology to support user experience based Citywide Mobile Learning2011In: Proc. - Int. Conf. User Sci. Eng., i-USEr, 2011, p. 195-200Conference paper (Refereed)
    Abstract [en]

    User experience has been extensively discussed in literature, yet the idea of applying it to explain and comprehend the conceptualization of Mobile Learning (ML) is relatively new. Consequently much of the existing works are mainly theoretical and they concentrate to establish and explain the relationship between ML and experience. Little has been done to apply or adopt it into practice. In contrast to the currently existing approaches, this paper presents an ontology to support Citywide Mobile Learning (CML). The ontology presented in this paper addresses three fundamental aspects of CML, namely User Model, User Experience and Places/Spaces which exist in the city. The ontology presented here not only attempts to model and translate the theoretical concepts such as user experience and Place/Spaces for citywide context for Mobile Learning, but also apply them into practice. The discussed ontology is used in our system to support Place/Space based CML.

  • 2.
    Bunea, Ramona
    et al.
    KTH, School of Information and Communication Technology (ICT).
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Dokoohaki, Nima
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Exploiting dynamic privacy in socially regularized recommenders2012In: Data Mining Workshops (ICDMW), 2012 IEEE 12th International Conference on, IEEE , 2012, p. 539-546Conference paper (Refereed)
    Abstract [en]

    In this paper we introduce a privacy-aware collaborative filtering recommender framework which aims to address the privacy concern of profile owners in the context of social trust sparsity. While sparsity in social trust is mitigated by similarity driven trust using a probabilistic matrix factorization technique, the privacy issue is addressed by employing a dynamic privacy inference model. The privacy inference model exploits the underlying inter-entity trust information to obtain a personalized privacy view for each individual in the social network. We evaluate the proposed framework by employing an off-the-shelf collaborative filtering recommender method to make predictions using this personalized view. Experimental results show that our method offers better performance than similar non-privacy aware approaches, while at the same time meeting user privacy concerns.

  • 3. Cena, Federica
    et al.
    Dokoohaki, Nima
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
    Forging Trust and Privacy with User Modeling Frameworks: An Ontological Analysis2011In: The First International Conference on Social Eco-Informatics: (SOTICS 2011) / [ed] Dokoohaki and Hall, IARIA , 2011, p. 43-48Conference paper (Refereed)
    Abstract [en]

    With the ever increasing importance of social net- working sites and services, socially intelligent agents who are responsible for gathering, managing and maintaining knowledge surrounding individual users are of increasing interest to both computing research communities as well as industries. For these agents to be able to fully capture and manage the knowledge about a user’s interaction with these social sites and services, a social user model needs to be introduced. A social user model is defined as a generic user model (model capable of capturing generic information related to a user), plus social dimensions of users (models capturing social aspects of user such as activities and social contexts). While existing models capture a proportion of such information, they fail to model and present ones of the most important dimensions of social connectivity: trust and privacy. To this end, in this paper, we introduce an ontological model of social user, composed by a generic user model component, which imports existing well-known user model structures, a social model, which contains social dimensions, and trust, reputation and privacy become the pivotal concepts gluing the whole ontological knowledge models together.

  • 4. Chang, Carl K.
    et al.
    Gao, YanHurson, AliMatskin, MihhailKTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.McMillin, BruceOkabe, YasuoSeceleanu, CristinaYoshida, Kenichi
    IEEE 38th Annual International Computers, Software and Applications Conference: Västerås, Sweden - July 21-25, 20142014Conference proceedings (editor) (Refereed)
  • 5. Claycomb, W.
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Nakamura, M.
    Message from the Workshop Chairs - Part III2015In: Proceedings - International Computer Software and Applications Conference, IEEE Communications Society, 2015, Vol. 3Conference paper (Refereed)
  • 6.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kaleli, Cihan
    Polat, Huseyin
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Achieving Optimal Privacy in Trust-Aware Social Recommender Systems2010In: SOCIAL INFORMATICS / [ed] Bolc L; Makowski M; Wierzbicki A, 2010, Vol. 6430, p. 62-79Conference paper (Refereed)
    Abstract [en]

    Collaborative filtering (CF) recommenders are subject to numerous shortcomings such as centralized processing, vulnerability to shilling attacks, and most important of all privacy. To overcome these obstacles, researchers proposed for utilization of interpersonal trust between users, to alleviate many of these crucial shortcomings. Till now, attention has been mainly paid to strong points about trust-aware recommenders such as alleviating profile sparsity or calculation cost efficiency, while least attention has been paid on investigating the notion of privacy surrounding the disclosure of individual ratings and most importantly protection of trust computation across social networks forming the backbone of these systems. To contribute to addressing problem of privacy in trust-aware recommenders, within this paper, first we introduce a framework for enabling privacy-preserving trust-aware recommendation generation. While trust mechanism aims at elevating recommenders accuracy, to preserve privacy, accuracy of the system needs to be decreased. Since within this context, privacy and accuracy are conflicting goals we show that a Pareto set can be found as an optimal setting for both privacy-preserving and trust-enabling mechanisms. We show that this Pareto set, when used as the configuration for measuring the accuracy of base collaborative filtering engine, yields an optimized tradeoff between conflicting goals of privacy and accuracy. We prove this concept along with applicability of our framework by experimenting with accuracy and privacy factors, and we show through experiment how such optimal set can be inferred.

  • 7.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    An Adaptive Framework for Discovery andMining of User Profiles from Social Web-based Interest Communities2013In: The Influence of Technology on Social Network Analysis and Mining / [ed] Özyer, T.; Rokne, J.; Wagner, G.; Reuser, A., Wien: Springer, 2013, Vol. 23, p. 497-519Chapter in book (Refereed)
    Abstract [en]

    Abstract Within this paper we introduce an adaptive framework for semi- tofully-automatic discovery, acquisition and mining of topic style interest profilesfrom openly accessible social web communities. To do such, we build an adaptivetaxonomy search tree from target domain (domain towards which we are gatheringand processing profiles for), starting with generic concepts at root moving down tospecific-level instances at leaves, then we utilize one of proposed Quest schemesto read the concept labels from the tree and crawl the source social networkrepositories for profiles containing matching and related topics. Using machinelearning techniques, cached profiles are then mined in two consecutive steps,utilizing a clusterer and a classifier in order to assign and predict correct profilesto their corresponding clustered corpus, which are retrieved later on by an ontology-based recommender to suggest and recommend the community members with theitems of their similar interest. Focusing on increasingly important digital culturalheritage context, using a set of profiles acquired from an openly accessible socialnetwork, we test the accuracy and adaptivity of framework. We will show that a tradeoff between schemes proposed can lead to adaptive discovery of highly relevant profiles.

  • 8.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Effective Design of Trust Ontologies for Improvement in the Structure of Socio-Semantic Trust Networks2008In: International Journal On Advances in Intelligent Systems, ISSN 1942-2679, Vol. 1, no 1, p. 23-42Article in journal (Refereed)
  • 9.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Mining divergent opinion trust networks through latent dirichlet allocation2012In: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, IEEE , 2012, p. 879-886Conference paper (Refereed)
    Abstract [en]

    While the focus of trust research has been mainly on defining and modeling various notions of social trust, less attention has been given to modeling opinion trust. When speaking of social trust mainly homophily (similarity) has been the most successful metric for learning trustworthy links, specially in social web applications such as collaborative filtering recommendation systems. While pure homophily such as Pearson coefficient correlation and its variations, have been favorable to finding taste distances between individuals based on their rated items, they are not necessarily useful in finding opinion distances between individuals discussing a trending topic, e. g. Arab spring. At the same time text mining techniques, such as vector-based techniques, are not capable of capturing important factors such as saliency or polarity which are possible with topical models for detecting, analyzing and suggesting aspects of people mentioning those tags or topics. Thus, in this paper we are proposing to model opinion distances using probabilistic information divergence as a metric for measuring the distances between people's opinion contributing to a discussion in a social network. To acquire feature sets from topics discussed in a discussion we use a very successful topic modeling technique, namely Latent Dirichlet Allocation (LDA). We use the distributions resulting to model topics for generating social networks of group and individual users. Using a Twitter dataset we show that learned graphs exhibit properties of real-world like networks.

  • 10.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Personalizing Human Interaction through Hybrid Ontological Profiling: Cultural Heritage Case Study2008In: 1st Workshop on Semantic Web Applications and Human Aspects, (SWAHA08), 2008, p. 133-140Conference paper (Refereed)
    Abstract [en]

    In this paper we present a novel user profile formalization, which allows describingthe user attributes as well as history of user access for personalized, adaptive and interactiveexperience while we believe that our approach is applicable to different semantic applicationswe illustrate our solution in the context of online and onsite museums and exhibits visit. Weargue that a generic structure will allow incorporation of multiple dimensions of user attributesand characteristics as well as allowing different abstraction levels for profile formalization andpresentations. In order to construct such profile structures we extend and enrich existingmetadata vocabularies for cultural heritage to contain keywords pertaining to usage attributesand user related keywords. By extending metadata vocabularies we allow improvedmatchmaking between extended user profile contents and cultural heritage contents. Thisextension creates the possibility of further personalization of access to cultural heritageavailable through online and onsite digital libraries.

  • 11.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    Norwegian University of Science and Technology.
    Quest: An Adaptive Framework for User Profile Acquisition from Social Communities of Interest2010In: Proceedings - 2010 International Conference on Advances in Social Network Analysis and Mining, ASONAM 2010, 2010, p. 360-364Conference paper (Refereed)
    Abstract [en]

    Within this paper we introduce a framework for semi- to full-automatic discovery and acquisition of bag-of-words style interest profiles from openly accessible Social Web communities. To do such, we construct a semantic taxonomy search tree from target domain (domain towards which we're acquiring profiles for), starting with generic concepts at root down to specific-level instances at leaves, then we utilize one of proposed Quest methods, namely Depth-based, N-Split and Greedy to read the concept labels from the tree and crawl the source Social Network for profiles containing corresponding topics. Cached profiles are then mined in a two-step approach, using a clusterer and a classifier to generate predictive model presenting weighted profiles, which are used later on by a semantic recommender to suggest and recommend the community members with the items of their similar interest.

  • 12.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Reasoning about Weighted Semantic User Profiles through Collective Confidence Analysis: A Fuzzy Evaluation2010In: ADVANCES IN INTELLIGENT WEB MASTERING-2, PROCEEDINGS    / [ed] Snasel V; Szczepaniak PS; Abraham A; Kacprzyk J, 2010, Vol. 67, p. 71-81Conference paper (Refereed)
    Abstract [en]

    User profiles are vastly utilized to alleviate the increasing problem of so called information overload. Many important issues of Semantic Web like trust, privacy, matching and ranking have a certain degree of vagueness and involve truth degrees that one requires to present and reason about. In this ground, profiles tend to be useful and allow incorporation of these uncertain attributes in the form of weights into profiled materials. In order to interpret and reason about these uncertain values, we have constructed a fuzzy confidence model, through which these values could be collectively analyzed and interpreted as collective experience confidence of users. We analyze this model within a scenario, comprising weighted user profiles of a semantically enabled cultural heritage knowledge platform. Initial simulation results have shown the benefits of our mechanism for alleviating problem of sparse and empty profiles.

  • 13.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Structural Determination of Ontology-Driven Trust Networks in Semantic Social Institutions and Ecosystems2007In: Proceedings of the International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM'07) and the International Conference on Advances in Semantic Processing SEMAPRO, 2007, p. 263-268Conference paper (Refereed)
    Abstract [en]

    Social institutions and ecosystems are growing across the web and social trust networks formed within these systems create an extraordinary test-bed to study relation dependant notions such as trust, reputation and belief. In order to capture, model and represent the semantics of trust relationships forming the trust networks, main components of relationships are represented and described using ontologies. This paper investigates how effective design of trust ontologies can improve the structure of trust networks created and implemented within semantic web-driven social institutions and systems. Based on the context of our research, we represent a trust ontology that captures the semantics of the structure of trust networks based on the context of social institutions and ecosystems on semantic web.

  • 14.
    Dokoohaki, Nima
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Afzal, Usman
    KTH, School of Information and Communication Technology (ICT).
    Islam, Md. Mistamikul
    KTH, School of Information and Communication Technology (ICT).
    An Enterprise Social Recommendation System for Connecting Swedish Professionals2014In: Proceedings - IEEE 38th Annual International Computers, Software and Applications Conference Workshops, COMPSACW 2014 / [ed] Carl K. Chang, Yan Gao, Ali Hurson, Mihhail Matskin, Bruce McMillin, Yasuo Okabe, IEEE Communications Society, 2014, p. 234-239Conference paper (Refereed)
    Abstract [en]

    Most cooperative businesses rely on some form of social networking system to facilitate user profiling and networking of their employees. To facilitate the discovery, matchmaking and networking among the co-workers across the enterprises social recommendation systems are often used. Off-the-shelf nature of these components often makes it hard for individuals to control their exposure as well as their preferences of whom to connect to. To this end, trust based recommenders have been amongst the most popular and demanding solutions due to their advantage of using social trust to generate more accurate suggestions for peers to connect to. They also allow individuals to control their exposure based on explicit trust levels. In this work we have proposed for an enterprise trust-based recommendation system with privacy controls. To generate accurate predictions, a local trust metric is defined between users based on correlations of user's profiled content such as blogging, articles wrote, comments, and likes along with profile information such as organization, region, interests or skills. Privacy metric is defined in such a way that users have full freedom either to hide their data from the recommender or customize their profiles to make them visible only to users with defined level of trustworthy.

  • 15. Dokoohaki, Nima
    et al.
    Zikou, Filippia
    KTH.
    Gillblad, Daniel
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Predicting Swedish Elections with Twitter: A Case for Stochastic Link Structure Analysis2015In: PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), Association for Computing Machinery (ACM), 2015, p. 1269-1276Conference paper (Refereed)
    Abstract [en]

    The question that whether Twitter data can be leveraged to forecast outcome of the elections has always been of great anticipation in the research community. Existing research focuses on leveraging content analysis for positivity or negativity analysis of the sentiments of opinions expressed. This is while, analysis of link structure features of social networks underlying the conversation involving politicians has been less looked. The intuition behind such study comes from the fact that density of conversations about parties along with their respective members, whether explicit or implicit, should reflect on their popularity. On the other hand, dynamism of interactions, can capture the inherent shift in popularity of accounts of politicians. Within this manuscript we present evidence of how a well-known link prediction algorithm, can reveal an authoritative structural link formation within which the popularity of the political accounts along with their neighbourhoods, shows strong correlation with the standing of electoral outcomes. As an evidence, the public time-lines of two electoral events from 2014 elections of Sweden on Twitter have been studied. By distinguishing between member and official party accounts, we report that even using a focus-crawled public dataset, structural link popularities bear strong statistical similarities with vote outcomes. In addition we report strong ranked dependence between standings of selected politicians and general election outcome, as well as for official party accounts and European election outcome.

  • 16.
    Fazeli, Soude
    et al.
    KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
    Zarghami, Alireza
    Dokoohaki, Nima
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Elevating Prediction Accuracy in Trust-aware Collaborative Filtering Recommenders through T-index Metric and TopTrustee lists2010In: Journal of Emerging Technologies in Web Intelligence, ISSN 1798-0461, Vol. 2, no 4, p. 300-309Article in journal (Refereed)
    Abstract [en]

    The growing popularity of Social Networks raises the important issue of trust. Among many systems which have realized the impact of trust, Recommender Systems have been the most influential ones. Collaborative Filtering Recommenders take advantage of trust relations between users for generating more accurate predictions. In this paper, we propose a semantic recommendation framework for creating trust relationships among all types of users with respect to different types of items, which are accessed by unique URI across heterogeneous networks and environments. We gradually build up the trust relationships between users based on the rating information from user profiles and item profiles to generate trust networks of users. For analyzing the formation of trust networks, we employ Tindex as an estimate of a user’s trustworthiness to identify and select neighbors in an effective manner. In this work, we utilize T-index to form the list of an item’s raters, called TopTrustee list for keeping the most reliable users who have already shown interest in the respective item. Thus, when a user rates an item, he/she is able to find users who can be trustworthy neighbors even though they might not be accessible within an upper bound of traversal path length. An empirical evaluation demonstrates how T-index improves the Trust Network structure by generating connections to more trustworthy users. We also show that exploiting Tindex results in better prediction accuracy and coverage of recommendations collected along few edges that connect users on a Social Network.

  • 17.
    Fazeli, Soude
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Zarghami, Alireza
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Dokoohaki, Nima
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Mechanizing Social Trust-Aware Recommenders with T-Index Augmented Trustworthiness2010In: TRUST, PRIVACY AND SECURITY IN DIGITAL BUSINESS  / [ed] Katsikas S; Lopez J; Soriano M, 2010, Vol. 6264, p. 202-213Conference paper (Refereed)
    Abstract [en]

    Social Networks have dominated growth and popularity of the Web to an extent which has never been witnessed before. Such popularity puts forward issue of trust to the participants of Social Networks. Collaborative Filtering Recommenders have been among many systems which have begun taking full advantage of Social Trust phenomena for generating more accurate predictions. For analyzing the evolution of constructed networks of trust, we utilize Collaborative Filtering enhanced with T-index as an estimate of a user's trustworthiness to identify and select neighbors in an effective manner. Our empirical evaluation demonstrates how T-index improves the Trust Network structure by generating connections to more trustworthy users. We also show that exploiting T-index results in better prediction accuracy and coverage of recommendations collected along few edges that connect users on a network.

  • 18.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Semantic Middleware for Robot Swarm Interaction through Web Services2008In: MIC Special Session on Computing Systems in Dynamic Environments / [ed] L. Bruzzone, 2008Conference paper (Refereed)
    Abstract [en]

    In this paper we propose a semantic middleware architecture and communication support for environments with swarm robots. Our main assumption is that robots can communicate via wireless networks while we don't assume high processing power in the robots. Basic advantage of the proposed middleware is the extension of robots' capabilities via access to semantic information and powerful processing engines. The architecture is conformant with main standard solutions and allows reusing intelligent functionality implemented in the external world.

  • 19.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Mediator-based Distributed Web Services Discovery and Invocation for Infrastructure-less Mobile Dynamic Systems2008In: proceedings of 4th International IEEE Conference of Next generation Web services practices (NWeSP.08), 2008, p. 46-53Conference paper (Refereed)
    Abstract [en]

    Mobile autonomous systems like robot swarms or mobile software agents operate in a dynamic environment pertaining self-organization, self configurationand heterogeneity of computing entities.In such settings there is a need for autonomicpublishing and discovery of resources and just-in-timeintegration for on-the-fly service consumption withoutany a priori knowledge of available services both withinthe execution environment and from the outsideworld. We propose a mediator-based distributed Webservices discovery and invocation middleware.Moreover we present experimental results on animplemented robot swarm simulation environment. Wepropose a conceptual classification of computingentities on the basis of communication capabilities andconceptual overlay formation for query propagation.Our approach provides a loose coupling in terms ofspace and time and uses both Internet-basedcommunication and RDF-based communication viamessages mediators/post-boxes between entities wheninter-communication between entities is not possible.

  • 20.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    DeLP Based Semantic Location Lattice for Intelligent Robotic Navigation2008In: Proceedings of the 2008 International Conference on Artificial Intelligence, ICAI 2008 and Proceedings of the 2008 International Conference on Machine Learning; Models, Technologies and Applications / [ed] H. Arabnia et al, 2008, p. 686-692Conference paper (Refereed)
    Abstract [en]

    Location models require a well-defined representation of spatial connectivity and hierarchical relationship between different spatial concepts; and are fundamental for location navigation, location based services and contextual query responses. Current location models rely on a priori knowledge of surrounding environment and mostly the semantics of relationships are over-looked. In this paper we propose an incremental semantic spatial relationship building approach for robotic agents based on formal concept analysis and defeasible reasoning. We consider a number of cases in which an autonomous robot with incomplete information about the environment can perform reasoning and update its location navigation. We use contextual information for establishing strength of partial order relationship between discovered concepts of robotic navigation/computing environment.

  • 21.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Kungas, Peep
    Distributed and Passive Web services discovery middleware for Pervasive services at the edges of Internet2010In: Second International Conferences on Advanced Service Computing SERVICE COMPUTATION, 2010Conference paper (Refereed)
  • 22.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Light-Weight Decentralized Autonomic Web Service Discovery for Systems with Heterogeneous Communication Capabilities2008In: the proceedings of 12th IASTED International Conference on Internet and Multimedia Systems and Applications (IMSA.08) / [ed] M. Mandal, 2008, p. 7-18Conference paper (Refereed)
    Abstract [en]

    Interoperability between autonomous systems like robot swarm or mobile software agents rely on efficient and seamless communication. Such mobile and dynamic environments pertain self-organization and self configuration of computing entities, a need for autonomic publishing and discovery of resources, and communication from and to outside world. Furthermore, such systems are attributed by heterogeneous communication capabilities of various computing entities. We take Web services approach for robot swarm based on robotic communication capabilities and propose a collaborative and decentralized services discovery and management middleware. Our approach provides a loose coupling in terms of space and time and uses both Internet based communication and RFID tags as message post boxes/relays for communication between robots when communication over the Internet is not available.

  • 23.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Distributed Discovery and Invocation of Web Services in Infrastructure-less Dynamic Environments2009In: International Journal of Web Services Practices (IJWSP), ISSN 1738-6535, Journal of Web Services Practices, ISSN 1738-6535, Vol. 3, no 3-4, p. 171-184Article in journal (Refereed)
    Abstract [en]

    Mobile autonomous systems like robot swarms or mobile software agents operate in a dynamic environment pertaining self-organization, selfconfiguration and heterogeneity of computing entities. In such settings there is a need for autonomic publishing and discovery of resources and just-in-time integration for on-the-fly service consumption without any a priori knowledge of available services both within the execution environment and from the outside world. We propose a mediator-based distributed Web services discovery and invocation middleware. Moreover we present experimental results on an implemented robot swarm simulation environment. We propose a conceptual classification of computing entities on the basis of communication capabilities and conceptual overlay formation for query propagation. Our approach provides a loose coupling in terms of space and time and uses both Internet-based communication and RDF-based communication via messages mediators/post-boxes between entities when inter-communication between entities is not possible.

  • 24.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    Distributed Web Services Discovery Middleware for Edges of Internet2010In: IEEE International Conference on Web Services, 2010, p. 680-682Conference paper (Refereed)
    Abstract [en]

    The advent of mobile computing devices and development of wireless and ad-hoc networking technologies has led to growth of infrastructure-less environments. Mostly, these environments lie at the edges of Internet i.e. they are disconnected/sparsely connected to rest of the world. In order to exploit the access to such edges of Internet, we propose and experimentally evaluate an interoperability middleware that synergizes P2P technology, message queuing support and a passive distributed UDDI for Web services discovery and invocation.

  • 25. Heiberg, T.
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Pedersen, J.
    An agent-based architecture for customer services management and product search2002In: Informatica (Vilnius), ISSN 0868-4952, E-ISSN 1822-8844, Vol. 13, no 4, p. 441-454Article in journal (Refereed)
    Abstract [en]

    The amount of products and services available over the Internet increases significantly and it soon becomes beyond users ability to analyze and compare them. At the same time the number of potential customers available via the Internet also increases dramatically and starts to be beyond the service providers ability to perform efficient targeted marketing. A possible way for relaxing the above-mentioned limitations could be in usage of electronic assistants, both for customers and providers. Such assistants may serve as mediators for commercial Internet-based activity. Software agents could play role of such mediators representing customers and providers in the network. In this paper we present our experience and a solution to using agent technology in customer services management for mobile users. The solution is intended to increase granularity and personalization in targeted advertising while ensuring customer privacy. The proposed solution has been implemented in a prototype system for providing services for,users of mobile devices.

  • 26.
    Jaradat, Shatha
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Dokoohaki, Nima
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    OLLDA: A Supervised and Dynamic Topic Mining Framework in Twitter2015In: 2015 IEEE International Conference on Data Mining Workshop (ICDMW), 2015, p. 1354-1359Conference paper (Refereed)
    Abstract [en]

    Analyzing media in real-time is of great importance with social media platforms at the epicenter of crunching, digesting and disseminating content to individuals connected to these platforms. Within this context, topic models, specially LDA, have gained strong momentum due to their scalability, inference power and their compact semantics. Although, state of the art topic models come short in handling streaming large chunks of data arriving dynamically onto the platform, thus hindering their quality of interpretation as well as their adaptability to information overload. As a result, in this manuscript we propose for a labelled and online extension to LDA (OLLDA), which incorporates supervision through external labeling and capability of quickly digesting real-time updates thus making it more adaptive to Twitter and platforms alike. Our proposed extension has capability of handling large quantities of newly arrived documents in a stream, and at the same time, is capable of achieving high topic inference quality given the short and often sloppy text of tweets. Our approach mainly uses an approximate inference technique based on variational inference coupled with a labeled LDA model. We conclude by presenting experiments using a one year crawl of Twitter data that shows significantly improved topical inference as well as temporal user profile classification when compared to state of the art baselines.

  • 27.
    Jaradat, Shatha
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Dokoohaki, Nima
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Ferrari, Elena
    Trust And Privacy Correlations in Social Networks: A Deep Learning Framework2016In: PROCEEDINGS OF THE 2016 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING ASONAM 2016, IEEE conference proceedings, 2016, p. 203-206Conference paper (Refereed)
    Abstract [en]

    Online Social Networks (OSNs) remain the focal point of Internet usage. Since the beginning, networking sites tried best to have right privacy mechanisms in place for users, enabling them to share the right content with the right audience. With all these efforts, privacy customizations remain hard for users across the sites. Existing research that address this problem mainly focus on semi-supervised strategies that introduce extra complexity by requiring the user to manually specify initial privacy preferences for their friends. In this work, we suggest an adaptive solution that can dynamically generate privacy labels for users in OSNs. To this end, we introduce a deep reinforcement learning framework that targets two key problems in OSNs like Facebook: the exposure of users' interactions through the network to less trusted direct friends, and the possibility of propagating user updates through direct friends' interactions to indirect friends. By implementing this framework, we aim at understanding how social trust and privacy could be correlated, specifically in a dynamic fashion. We report the ranked dependence between the generated privacy labels and the estimated user trust values, which indicate the ability of the framework to identify the highly trusted users and share with them higher percentages of data.

  • 28.
    Javed, Mohtasim
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Haseeb, Abdul
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Semantic manipulation of non- Semantic/natural-language queries2010In: Proceedings of the 9th Joint Conference on Knowledge-Based Software Engineering, JCKBSE 2010, 2010, p. 210-222Conference paper (Refereed)
    Abstract [en]

    Rapid growth of information has made information access inherently difficult. Semantic Web, with the help of formal Ontologies, has provided an efficient way to represent data which makes it easy to find and organize by creating a mesh of information linked up in machine process-able way. The formal query languages (SPARQL) can exploit the semantics in information access; however formal languages are complex for naïve users. On the other hand, keyword search can't benefit from semantics of information. In this paper we present a query interface that performs semantic manipulation of non- semantic natural language-based queries. The proposed query interface semantically manipulates the user query to generate RDF triples to be queried using SPARQL. Proposed system provides the richness of semantics of formal query languages while maintaining query simplicity.

  • 29. Khan, A. B.
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Supporting place/space based patterns of citywide mobile learning through multi-agent framework2012In: Proceedings 2012 17th IEEE International Conference on Wireless, Mobile and Ubiquitous Technology in Education, WMUTE 2012, IEEE , 2012, p. 152-156Conference paper (Refereed)
    Abstract [en]

    There are numerous possible patterns consisting of learners, technological components and physical locations (i.e. Spaces) which can be identified in the context of citywide mobile learning (CML). By patterns, we mean to refer to the different ways in which learners are associated with the Spaces where the learning occurs, with technology that supports learning and among the learners themselves. Envisioning the entire set of possible scenarios, which can exist in the citywide context and designing to support them is not only difficult, but also practically impossible. Therefore, there is a need to condense and generalize all the numerous possible scenarios of CML into few core patterns, which can be use as basic building blocks to construct and support more complex CML scenarios. A regular trend in the currently existing literature is to consider only one or two use-cases while neglecting others. In this paper we address this problem by presenting six general patterns instead of use-cases that can exist in citywide context. These patterns take into account three fundamental aspects of CML, (1) learner, (2) Place/Space and (3) the technological components needed to support CML.

  • 30. Khan, Basit
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    A Platform for Actively Supporting e-Learning in Mobile Networks2010In: International Journal of Mobile and Blended Learning, ISSN 1941-8647, E-ISSN 1941-8655, International Journal of Mobile and Blended Learning, ISSN 1941-8647, Vol. 2, p. 55-79Article in journal (Refereed)
  • 31. Khan, Basit
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    AGORA Framework for Service Discovery and Resource Allocation2010In: The Fifth International Conference on Internet and Web Applications and Services ICIW 2010, 2010, p. 438-444Conference paper (Refereed)
  • 32. Khan, Basit
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    FABULA Platform for Active e-Learning in Mobile Networks2009In: Proceedings of the IADIS International Conference Mobile Learning 2009., 2009, p. 33-41Conference paper (Refereed)
  • 33. Khan, Basit
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Multiagent system to support Place/Space based mobile learning in city2011In: International Conference on Information Society, i-Society 2011, 2011, p. 66-71Conference paper (Refereed)
    Abstract [en]

    Different approaches have been developed to provide technical support for mobile learning. Most these approaches consider only the physical properties of learning environment. In this work, we not only focus on the physical/spatial dimension of the learning environment of the city, but also pay attention to the notion of Place which is a meaningful outcome of peoples understanding of Space. This paper illustrates how a theoretical conceptualization of Spaces and Places is mapped into a multiagent framework called AGORA. It presents the design aspects of a mobile learning system, which uses software agents as its core functional units. We discuss how the theoretical concepts are used to define a technical solution to support mobile learning in a citywide context.

  • 34. Khan, Basit
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Towards an Engineering of Multi-Agent Eco-Systems2010In: IEEE International Conference on Digital Ecosystems and Technology 2010, 2010, p. 340-345Conference paper (Refereed)
  • 35.
    Khan, Basit
    et al.
    Norwegian University of Science and Technology (NTNU), Norway.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101). Norwegian University of Science and Technology (NTNU), Norway.
    Rossitto, Chiara
    Stockholm University, Sweden.
    Towards a Places and Spaces based city-wide mobile learning through multi-agent support2011In: Digital Ecosystems and Technologies Conference (DEST), 2011 Proceedings of the 5th IEEE International Conference on / [ed] Farookh Khadeer, Hussain,Chang, Elizabeth, IEEE , 2011, p. 164-169Conference paper (Refereed)
    Abstract [en]

    This paper illustrates how the conceptualization of Places can be used to inform the technical design of mobile learning system. We apply the concept of Place in a multi-agent framework for supporting informal city-wide mobile learning activities. By taking input from the theoretical framework for analysing collaborative learning activities, we adopt the structure and organization of multi-gent framework. The functionality and components of the system are defined in light of the theoretical work. This work bridges the gap between theory and it's application in technology for mobile learning in our project.

  • 36. Kungas, Peep
    et al.
    Dumas, Marlon
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Analyzing Web Services Networks: Theory and Practice2014In: Advanced Web Services / [ed] Athman Bouguettaya,Quan Z. Sheng, Florian Daniel, New York: Springer-Verlag New York, 2014, p. 381-406Chapter in book (Refereed)
    Abstract [en]

    This paper addresses the problem of applying the general network theory for analyzing qualitatively Web services networks. The paper reviews current approaches to analyzing Web services networks, generalizes the published approaches into a formal framework for analyzing Web services networks and demonstrates its applicability in practice. More specifically, two case studies are described where the presented framework has been applied. The first one considers identification of redundant data in large-scale service-oriented information systems, while the second one measures information diffusion between individual information systems.

  • 37. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Combining Symbolic and Non-Symbolic Negotiation for Agent-Based Web Service Composition2005In: Proceedings of the 2005 International Conference on Artificial Intelligence ICAI'05, CSREA Press, 2005, p. 513-519Conference paper (Refereed)
    Abstract [en]

    The paper presents an architecture and a methodology for agent-based Web service discovery and composition. We assume that Web services are described in DAML-S. Since DAML-S represents declarative information about services, symbolic reasoning can be applied for search or composition of new services automatically. We propose the usage of symbolic agent negotiation for dynamic Web service discovery and composition, while nonsymbolic negotiation is applied for negotiating over the cost or other attributes of the composite service. Therefore, by using symbolic negotiation for automated service composition, we support declarative information gathering and integration during service composition, whilst non-symbolic negotiation facilitates pragmatic issues of Web service execution.

  • 38. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Detection of Missing Web Services: The Partial Deduction Approach2005In: International Journal of Web Services Practices (IJWSP), ISSN 1738-6535, Vol. 1, no 1-2, p. 133-141Article in journal (Refereed)
  • 39. Kungas, Peep
    et al.
    Matskin, Mihhail
    Norwegian Univ Sci & Technol, Dept Comp & Informat Sci, N-7034 Trondheim, Norway.
    Detection of Missing Web Services: The Partial Deduction Approach2005In: Proceedings of International Conference on Next Generation Web Services Practices, NWeSP'05, IEEE Computer Society, 2005, p. 339-344Conference paper (Refereed)
    Abstract [en]

    Many methods have been recently proposed for composing automatically Web services from existing ones. The methods range from AI planning to automated theorem proving and graph search algorithms. However the usability of these methods is greatly affected by two assumptions. Firstly, it is assumed that developers provide consistent declarative descriptions of Web services. Secondly, it is assumed that there exists a sufficient set of atomic Web services, which would facilitate the composition of all other Web services. In this paper we propose a method to ensure these two assumptions by using analysis of Web services' descriptions. In particular we apply partial deduction for identifying possible inconsistencies in Web service descriptions. Our method also determines possibly missing atomic Web services, which should be implemented in order to compose a requested composite Web service.

  • 40.
    Kungas, Peep
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    From web services annotation and composition to web services domain analysis2007In: International Journal of Metadata, Semantics and Ontologies, ISSN 1744-2621, E-ISSN 1744-263X, Vol. 2, no 3, p. 157-178Article in journal (Refereed)
    Abstract [en]

    Automated web service annotation and composition are seen as complimentary technologies. While automated annotation allows to extract web service semantics from existing WSDL documents, automated composition uses this semantics for integrating applications. Anyway, automated composition can be applied not only to constructing new but also to analysis of existent web services. Therefore applicability of both methodologies is essential for increasing the productivity of information system integration. In this paper we propose application of automated composition for analysing web services domains. We identify and analyse some general web services properties in the context of industrial and public web services.

  • 41.
    Kungas, Peep
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Interaction and Potential Synergy between Commercial and Governmental Web Services:  a Case Study2007In: SERVICES 2007, Proceedings of 2007 IEEE Congress on Services, 2007, p. 1-8Conference paper (Refereed)
    Abstract [en]

    Recent progress in the field of Web services has resulted in deployment of a significant number of Web services. Furthermore, it is expected that the number of available Web services will constantly grow in the following years. Due to the high number of available Web services, it is a hard task for developers and business analysts to choose which Web services are most suitable for integration. However, despite the increased academic and commercial interest to Web services, there is currently no survey available analysing most relevant Web services. Moreover, to the best of our knowledge, there is no publicly available study analysing the structure and potential synergy between commercial and governmental Web services. In this paper we target these shortcomings by providing a case study of automated Web service composition for semantically annotated commercial and governmental Web services. We propose a method for identifying most applicable Web services and demonstrate it on a case study. We also analyse interaction and potential synergy between commercial and governmental Web services.

  • 42. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Linear logic, partial deduction and cooperative problem solving2004In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2990, p. 263-279Article in journal (Refereed)
    Abstract [en]

    In this paper we present a model of cooperative problem solving (CPS). Linear Logic (LL) is used for encoding agents' states, goals and capabilities. LL theorem proving is applied by each agent to determine whether the particular agent is capable of solving the problem alone. If no individual solution can be constructed, then the agent may start negotiation with other agents in order to find a cooperative solution. Partial deduction in LL is used to derive a possible deal. Finally proofs are generated and plans are extracted from the proofs. The extracted plans determine agents' responsibilities in cooperative solutions.

  • 43. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Partial Deduction for assisting Automated Semantic Web Service Composition2005In: Proceedings of the Workshop on Exploring Planning and Scheduling for Web Services, Grid and Autonomic Computing held in conjunction with The Twentieth National Conference on Artificial Intelligence , (AAAI 2005), 2005, p. 43-45Conference paper (Refereed)
  • 44. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Partial deduction for linear logic - The symbolic negotiation perspective2005In: Agents and Peer-To-Peer Computing / [ed] Leite, J; Omicini, A; Torroni, P; Yolum, P, BERLIN: SPRINGER , 2005, Vol. 3476, p. 35-52Conference paper (Refereed)
    Abstract [en]

    Symbolic negotiation is regarded in the field of computer science as a process, where parties try to reach an agreement on the high-level means for achieving their goals by applying symbolic reasoning techniques. It has been proposed [1] that symbolic negotiation could be formalised as Partial Deduction (PD) in Linear Logic (LL). However, the paper [1] did not provided a formalisation of the PD process in LL. In this paper we fill the gap by providing a formalisation of PD for !-Horn fragment of LL. The framework can be easily extended for other fragments of LL as well such that more comprehensive aspects of negotiation can be described. In this paper we consider also soundness and completeness of the formalism. It turns out that, given a certain PD procedure, PD for LL in !-Horn fragment is sound and complete. We adopt the hypothesis that an essential component of symbolic negotiation is Cooperative Problem Solving (CPS). Thus a formal system for symbolic negotiation would consist of CPS rules plus negotiationspecific rules. In this paper only CPS rules are under investigation while negotiation-specific rules shall be published in another paper.

  • 45. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Semantic Web Service Composition through a P2P-Based Multi-Agent Environment2005In: Proceedings of the Fourth International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2005) in conjunction with AAMAS 2005, 2005Conference paper (Refereed)
    Abstract [en]

    This paper describes a multi agent system (MAS) for distributed composition of Semantic Web services. Since our system is intended to function in highly dynamic environments, where heterogeneous agents rapidly join and leave the system, we consider P2P approach as most suitable for facilitating agent and service discovery. The MAS is based on Chord P2P network, which allows the MAS to dynamically publish and locate available Semantic Web services, which are specified with OWL-S. In order to compose new Web services from existing ones, agents apply symbolic reasoning in a cooperative problem solving manner.

  • 46.
    Kungas, Peep
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Symbolic Negotiation: Partial Deduction for Linear Logic with Coalition Formation2008In: Web Intelligence and Agent Systems, ISSN 1570-1263, E-ISSN 1875-9289, Vol. 6, no 2, p. 193-215Article in journal (Refereed)
    Abstract [en]

    In this paper we present a formalism for symbolic negotiation while regarding symbolic negotiation as cooperative problem solving (CPS). CPS is based on symbolic reasoning and is extended with negotiation and coalition formation rules. We formalize partial deduction for intuitionistic linear logic and use it as a foundation for formalization of symbolic negotiation. We also formalize the process of coalition formation and analyse its effect to symbolic negotiation and CPS. Soundness and compleness proofs for the proposed formalisms are given.

  • 47.
    Kungas, Peep
    et al.
    Norwegian University of Science and Technology, Department of Computer and Information Science, Trondheim, Norway.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Symbolic Negotiation Revisited2006In: Proceedings of Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems, 2006, p. 432-434Conference paper (Refereed)
    Abstract [en]

    In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is extended with negotiation-specific rules. The underlying CPS formalism was previously presented in [3]. Here we extend the results and position symbolic negotiation according to other distributed problem solving mechanisms.

  • 48. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Symbolic Negotiation with Linear Logic2004In: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, ISSN 0302-9743, Vol. 3259, p. 71-88Article in journal (Refereed)
    Abstract [en]

    Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated [18] how symbolic negotiation and distributed planning together could be formalised as distributed Linear Logic (LL) theorem proving. LL has been chosen mainly because of its expressive power for representation of resources and its computation-oriented nature. This paper extends the previous work by taking advantage of a richer fragment of LL and introducing two sorts of nondeterministic choices into negotiation. This allows agents to reason and negotiate under certain degree of uncertainty. Additionally, a way of granting unbounded access to resources during negotiation is considered. Finally we extend our framework with first-order LL for expressing more complex offers during negotiation.

  • 49. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Web services analysis: Making use of web service composition and annotation2006In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) / [ed] Mizoguchi, R; Shi, Z; Giunchiglia, F, 2006, Vol. 4185, p. 501-515Conference paper (Refereed)
    Abstract [en]

    Automated Web service composition and automated Web service annotation could be seen as complimentary methodologies. While automated annotation allows to extract Web service semantics from existing WSDL documents, automated composition uses this semantics for integrating applications. Therefore applicability of both methodologies is essential for increasing the productivity of information system integration. Although several papers have proposed methods for automated annotation, there is a lack of studies providing analysis of the general structure of Web services. We argue that having an overview of general Web services structures would greatly improve design of new annotation methods. At the same time, progress in automated composition has resulted in several methods for automating Web services orchestration. In this paper we propose application of automated composition also for analysing Web services domain. We identify and analyse some general Web services properties and provide their interpretation in an industrial context.

  • 50.
    Kungas, Peep
    et al.
    Norwegian University of Science and Technology, Department of Computer and Information Science, Trondheim, Norway.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Web Services Roadmap: The Semantic Web Perspective2006In: Proceedings of International Conference on Internet and Web Applications and Services, ICIW'06, IEEE Computer Society, 2006, p. 130-Conference paper (Refereed)
    Abstract [en]

    Recentlythefield ofWebserviceshas gained focus both in industry and academia. While industry has been mostly interested in standardisation and promotion ofthetechnology, academia has been looking for ways to fitthetechnology into other frameworks, such astheSemanticWeb. Anyway, despite oftheincreased academic and commercial interest toWebservices, there are currently only few case studies available aboutWebservicesintheSemanticWebcontext. Moreover, according to authors' knowledge, there is no publicly available study analysing which data is currently mostly provided/required byWebservices. In this paper we target these shortcomings by providing a case study of semantically annotated commercial and governmentalWebservices. We analyse interaction and potential synergy between commercial and governmentalWebservices. Alsotherole ontologies forsemanticintegration ofWebservicesis analysed. Moreover, we identifythemost common data exploited by currentWebservices.

12 1 - 50 of 98
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf