Change search
Refine search result
1 - 21 of 21
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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.
    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.

  • 2. 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.

  • 3.
    Lindbäck, Leif
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Vlassov, Vladimir
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Violino, Gabriele
    Net Result AB.
    Churn Tolerant Virtual Organization File System for Grids2010In: PARALLEL PROCESSING AND APPLIED MATHEMATICS, PART II / [ed] Wyrzykowski, R; Dongarra, J; Karczewski, K; Wasniewski, J, Springer Berlin/Heidelberg, 2010, Vol. 6068, p. 194-203Conference paper (Refereed)
    Abstract [en]

    A Grid computing environment allows forming Virtual Organizations (VOs) to aggregate and share resources We present. a VO File System (VOFS) which is a VO-aware distributed file system that allows VO members to share files VOFS supports access and location transparency by maintaining a common file namespace, which is decentralized in order to improve robustness VOFS includes a P2P system of file servers, a VO membership service and a policy and role based security mechanism VOFS can he mounted to a local file system in order to access files using POSIX file API VOFS can operate in a dynamic Grid environment (e g desktop Grids) since it tolerates unplanned resource arrival and departure (churn) while maintaining a single uniform namespace It supports transparent disconnected operations that allow the user to work on files while being disconnected.

  • 4.
    Magureanu, Stefan
    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.
    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.
    Design and Analysis of a Gossip-based Decentralized Trust Recommender System2012In: 4th ACM Recommender Systems (RecSys) Workshop on Recommender Systems & the Social Web, 2012Conference paper (Refereed)
    Abstract [en]

    Information overload has become an increasingly common problem in today’s large scale internet applications. Collaborative filtering(CF) recommendation systems have emerged   as a popular solution to this problem by taking advantage of underlying social networks. Traditional CF recommenders suffer from lack of scalability[18] while decentralized recommendation systems (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in this paper we propose a decentralized approach to CF recommender sys  tems that takes advantage of the popular P2P T-Man algorithm to create and maintain an overlay network capable of generating predictions based on only local information. We       analyze our approaches performance in terms of prediction accuracy and item-coverage function of neighborhood size as well as number of T-Man rounds. We show our system       achieves better accuracy than previous approaches while implementing a highly scalable, decentralized paradigm. We also show our system is able to generate predictions for a       large fraction of users, which is comparable with the centralized approaches.

  • 5.
    Magureanu, Stefan
    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.
    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.
    Epidemic trust-based recommender systems2012In: Proceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012, IEEE , 2012, p. 461-470Conference paper (Refereed)
    Abstract [en]

    Collaborative filtering(CF) recommender systems are among the most popular approaches to solving the information overload problem in social networks by generating accurate predictions based on the ratings of similar users. Traditional CF recommenders suffer from lack of scalability while decentralized CF recommenders (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in this paper we propose a decentralized approach to CF recommender systems that uses the T-Man algorithm to create and maintain an overlay network that in turn would facilitate the generation of recommendations based on local information of a node. We analyse the influence of the number of rounds and neighbors on the accuracy of prediction and item coverage and we propose a new approach to inferring trust values between a user and its neighbors. Our experiment son two datasets show an improvement of prediction accuracy relative to previous approaches while using a highly scalable, decentralized paradigm. We also analyse item coverage and show that our system is able to generate predictions for significant fraction of the users, which is comparable with the centralized approaches.

  • 6.
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Web Service Ontology Learning, Analysis and Usage for Service Selection and Composition2013Doctoral thesis, monograph (Other academic)
  • 7.
    Mokarizadeh, Shahab
    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.
    Bunea, Ramona
    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.
    Enhancing Social Matrix Factorization with Privacy2013In: Proceedings of the ACM Symposium on Applied Computing, 2013, p. 277-278Conference paper (Refereed)
    Abstract [en]

    Within the course of this manuscript we present a privacy-preserving collaborative filtering recommender system whichaims at alleviating the concern with privacy of user pro-files within the context of sparse social trust data. Whileproblem of sparsity in social trust is often addressed by tak-ing similarity driven trust measures through a probabilisticmatrix factorization technique, we address the issue of pri-vacy by proposing a dynamic privacy inference model. Theprivacy inference model exploits the underlying inter-entitytrust information in order to build a personalized privacyperspective for each individual within the social network.This is followed by our evaluation of the proposed solutionby adopting an off-the-shelf collaborative filtering recom-mender library, in order to generate predictions using thispersonalized view.

  • 8.
    Mokarizadeh, Shahab
    et al.
    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.
    Küngas, Peep
    Trust and Privacy Enabled Service Composition using Social Experience2010In: 10th IFIP International Conference on e-business,e-services and e-society (I3E), Springer, 2010, p. 226-236Conference paper (Refereed)
    Abstract [en]

    In this paper, we present a framework for automatic selection andcomposition of services which exploits trustworthiness of services as a metric formeasuring the quality of service composition. Trustworthiness is defined in terms ofservice reputation extracted from user profiles. The profiles are, in particular, extractedand inferred from a social network which accumulates users past experience withcorresponding services. Using our privacy inference model we, first, prune socialnetwork to hide privacy sensitive contents and, then, utilize a trust inference basedalgorithm to measure reputation score of each individual service, and subsequentlytrustworthiness of their composition

  • 9.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Grosso, Alberto
    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
    Haseeb, Abdul
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Applying Semantic Web Service Composition for Action Planning in Multi-Robot Systems2009In: 2009 FOURTH INTERNATIONAL CONFERENCE ON INTERNET AND WEB APPLICATIONS AND SERVICES / [ed] Sasaki H, Bellot GO, Ehmann M, Dini O, NEW YORK: IEEE , 2009, p. 370-376Conference paper (Refereed)
    Abstract [en]

    In this paper we demonstrate how the Web services based solutions can be effectively utilized and integrated into robotic world. In particular, we consider robotic systems where overall control is not embedded into any of the robots and the local behavior of each robot is loosely dependent on behavior of other robots. We propose an architecture for swarm action planning based on Web services paradigm exploiting a problem ontology for service discovery, linear logic based service composition for action planning and a task allocation layer for finding the most suitable robot to perform an action. In our solution all entities in the system expose their functionalities as Web services and allow dynamic service discovery and selection.

  • 10.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Kungas, Peep
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    A framework for evaluating semantic annotations of Web services: A network theory based approach for measuring annotation quality2014In: Web Intelligence and Agent Systems, ISSN 1570-1263, E-ISSN 1875-9289, Vol. 12, no 1, p. 15-34Article in journal (Refereed)
    Abstract [en]

    In the past years various methods have been developed which require semantic annotations of Web services as an input. Such methods typically leverage discovery, match-making, composition and execution of Web services in dynamic settings. At the same time a number of automated Web service annotation approaches have been proposed for enabling application of these methods in settings where it is not feasible to provide the annotations manually. However, lack of effective automated evaluation frameworks has seriously limited proper assessment of the constructed annotations in settings where the overall annotation quality of large quantities of Web services needs to be evaluated. This paper describes an evaluation framework for measuring the quality of semantic annotations for a large number of real-world Web services from heterogeneous application domains. The evaluation framework is generally based on analyzing properties of Web service networks constructed from semantic annotations of the Web services. More specifically, we measure scale-free, small-world and correlation degree properties of the networks to evaluate the overall quality of annotations. The evaluation is demonstrated using annotations constructed semi-automatically for a set of publicly available WSDL documents containing descriptions of about 200 000 Web service operations.

  • 11.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kungas, Peep
    University of Tartu.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Evaluation of a Semi-Automated Semantic Annotation Approach for Bootstrapping the Analysis of Large-scale Web Service Networks2011In: International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), 2011 IEEE/WIC/ACM, IEEE Computer Society, 2011, p. 388-395Conference paper (Refereed)
    Abstract [en]

    In recent years many methods have been proposed, which require semantic annotations of Web services as an input. Such methods include discovery, match-making, composition and execution of Web services in dynamic settings, just to mention few. At the same time automated Web service annotation approaches have been proposed for supporting application of former methods in settings where it is not feasible to provide the annotations manually. However, lack of effective automated evaluation frameworks has seriously limited proper evaluation of the constructed annotations in practical settings where the overall annotation quality of millions of Web services needs to be evaluated. This paper describes an evaluation framework for measuring the quality of semantic annotations of large number of Web services descriptions provided in form of WSDL and XSD documents. The evaluation framework is based on analyzing network properties, namely scale-free and small-world properties, of Web service networks, which in turn have been constructed from semantic annotations of Web services. The evaluation approach is demonstrated through evaluation of a semi-automated annotation approach, which was applied to a set of publicly available WSDL documents describing altogether ca 200 000 Web service operations.

  • 12.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kungas, Peep
    University of Tartu.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Evaluation of Semi-Automatic Acquisition of Semantic Descriptions of Web Services2011Conference paper (Refereed)
    Abstract [en]

    This paper introduces and evaluates a novel Web service interface annotation and matching scheme designed for processing large sets of Web service interface descriptions. The matching scheme relies on a set of rules, which exploit the structural relationships encoded in an automatically learned ontology to discover matching interface elements. The proposed scheme is evaluated on a Web services interface corpus consisting of WSDL descriptions. The experimental results show that the proposed matching scheme can be used for bootstrapping large-scale Web service interface annotation.

  • 13.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Kungas, Peep
    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.
    Ontology acquisition from web service descriptions2013In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, Coimbra, Portugal, March 18-22, 2013. ACM 2013 9 / [ed] Sung Y. Shin, José Carlos Maldonado (Eds), 2013, p. 325-332Conference paper (Refereed)
    Abstract [en]

    The lack of formally expressed semantics in web services complemented with the increasing number of available web services is the main obstacle in analyzing and using the existing web services exposed in the Web. In the absence of appropriate reference domain ontology, annotation of existing web services is dependent on ontology development and ontology learning techniques. In this paper we present an unsupervised ontology learning approach tailored to learning from WSDL documents. The most specific feature of the suggested approach is that it constructs (semi-) automatically ontology fragments from a collection of WSDL documents, that lack any extra textual documentation, by just exploiting element names in the WSDL document. The suggested approach combines both linguistic and statistic analysis techniques such as lexico-syntactic patterns and term co-occurrence analysis. The preliminary results show that the generated ontology captures correctly more than half of the semantic classes and instances as well as taxonomic and non-taxonomic relations, hence, providing a reasonable basis for automatic web services annotation.

  • 14.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Kungas, Peep
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Utilizing Web Services Networks for Web Service Innovation2014In: / [ed] David De Roure, Bhavani Thuraisingham, Jia Zhang, IEEE Communications Society, 2014, p. 646-653Conference paper (Refereed)
    Abstract [en]

    The increasing presence and adoption of Web services on the Web has promoted the significance of management of new service development for service developing sectors. The major challenge is that how to find missing but potentially valuable Web services to be developed. This problem can be divided into two sub-problems: finding missing Web services and measuring the added-value of the introduced services. This paper addresses a plausible solution to the first sub problem. Given a collection of Web services, we propose a framework for suggesting a set of candidate Web services that can be introduced to the collection. These suggested services are novel and do not present in the given collection. Our solution relies on the network structure of Web services for finding and recommending new Web services and utilizes the already observed properties of Web services networks for collective evaluation of the suggested services. The proposed solution is evaluated using 753 semantically annotated Web services. The experimental results shows that the proposed framework provides web service community with new network driven methods for finding and evaluation of new Web services.

  • 15.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Küngas, P.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Exploring information diffusion in network of semantically annotated web service interfaces2012In: WIMS '12 Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics, Association for Computing Machinery (ACM), 2012, p. 12-Conference paper (Refereed)
    Abstract [en]

    Information diffusion has been studied between and within biosphere, microblogs, social networks, citation networks and other domains where the network structure is present. These studies have been useful for acquiring intrinsic knowledge for strategic decision making in related areas, such as planning online campaigns in case of microblogs and blogo-sphere. However, despite of the advances in services science, no study has been published on analyzing information diffusion in Web services networks. This paper presents a model for measuring information diffusion between commodities of annotated Web services' descriptions. First, we exploit our previously developed ontology learning and annotation mechanism to semantically annotate harvested Web services' interface descriptions. Next, Web services networks are constructed by matching semantically annotated and categorized interfaces. Then we apply the proposed information diffusion discovery model to the constructed Web services networks. We evaluate the proposed model on two case studies - information diffusion between Web services of national registries and among commodities of public Web services. The model indicates high potential of the proposed method in understanding interactions between individual service providers and service industries.

  • 16.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Küngas, P.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Using semantic annotations of Web services for analyzing information diffusion in the Deep Web2012In: WEBIST 2012 - Proceedings of the 8th International Conference on Web Information Systems and Technologies, 2012, p. 110-115Conference paper (Refereed)
    Abstract [en]

    Since Web services represent a fragment of the Deep Web, Web service interface descriptions reflect the content types available in the Deep Web. Therefore semantic annotations of these Web service interfaces, after using them to link services to services networks, allow analysis of the structure of the Deep Web. In this work, we investigate information diffusion, as one of highlighted Deep Web research directions, among networks of Web services. We present a model for analyzing information diffusion between both individual service providers and entire service industries. The proposed model is evaluated based on set of public Web services interface description harvested from public registries. The model indicates high potential of the proposed method in understanding the hidden structure of the Deep Web and interactions between individual service providers or service industries.

  • 17.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Küngas, P.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Crasso, M.
    Campo, M.
    Zunino, A.
    Information diffusion in web services networks2012In: Web Services (ICWS), 2012 IEEE 19th International Conference on, IEEE , 2012, p. 488-495Conference paper (Refereed)
    Abstract [en]

    Information diffusion has been studied between and within biosphere, microblogs, social networks, citation networks and other domains, where the network structure is present. These studies have turned to be useful for acquiring intrinsic knowledge for strategic decision making in related areas, for example, planning online campaigns in case of microblogs and blogosphere. In the context of data-centric Web services, information exchange patterns will reveal practical heuristics for efficient Web services selection and composition. For example, by possible knowledge that there is information flow between Web services of Financial Analysis Services and Enterprise Resource Planning Services, as outlined by our experimental results, the potential applications, which interact with Financial Analysis services, can be adjusted to take advantage of Enterprise Resource Planning services as well. In this paper we present a method for analyzing information diffusion between categories of data-centric Web services. The method operates on a Web services network constructed by linking interface descriptions of categorized Web services. The proposed method is evaluated on a case study of global Web services. The results indicate high potential of the proposed model in understanding interactions between categories of Web services.

  • 18.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Küngas, Peep
    University of Tartu.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Ontology Learning for Cost-Effective Large-Scale Semantic Annotation of Web Service Interfaces2010In: Knowledge Engineering and Management by the Masses, EKAW 2010, Springer Berlin/Heidelberg, 2010, p. 401-410Conference paper (Refereed)
    Abstract [en]

    In this paper we introduce a novel unsupervised ontology learning approach, which can be used to automatically derive a reference ontology from a corpus of web services for annotating semantically the Web services in the absence of a core ontology. Our approach relies on shallow parsing technique from natural language processing in order to identify grammatical patterns of web service message element/part names and exploit them in construction of the ontology. The generated ontology is further enriched by introducing relationships between similar concepts. The experimental results on a set of global Web services indicate that the proposed ontology learning approach generates an ontology, which can be used to automatically annotate around 52% of element part and field names in a large corpus of heterogeneous Web services.

  • 19.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Rahman, Mohammed Tafiqur
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Mining and Analysis of Apps in Google Play2013In: Proceedings of the 9th International Conferenceon Web Information Systems and Technologies (WEBIST) 2013, SciTePress 2013 / [ed] Karl-Heinz Krempels, Alexander Stocker, 2013, p. 527-535Conference paper (Refereed)
  • 20. Moradi, F.
    et al.
    Ayani, Rassul
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Tan, G.
    A rule-based semantic matching of base object models2009In: International Journal of Simulation and Process Modelling, ISSN 1740-2123, E-ISSN 1740-2131, Vol. 5, no 2, p. 132-145Article in journal (Refereed)
    Abstract [en]

    Creating simulation models via composition of predefined and reusable components is an efficient way of reducing costs and time associated with the simulation model development. However, to successfully compose models one has to solve the issues of syntactic and semantic composability of components. The Base Object Model (BOM) standard is an attempt to ease reusability and composition of simulation models. However, the BOM does not contain sufficient information for defining necessary concepts and terms to avoid ambiguity, and neither does it have any method for dynamic aspects matching conceptual models (i.e., their state-machines). In this paper, we present our approach for enhancement of the semantic contents of BOMs and propose a three-layer model for syntactic and semantic matching of BOMs. The enhancement includes ontologies for entities, events and interactions in each component. We also present an OWL-S description for each component, including the state-machines. To test our approach, we specify some simulation scenarios and implement BOMs as building blocks for development of those scenarios, one of which is presented in this paper. We also define composability degree, which quantifies closeness of the composed model to a given model specification. Our results show that the three-layer model is promising and can improve and simplify the composition of BOM-based components.

  • 21.
    Moradi, Farshad
    et al.
    Swedish Defence Research Agency, FOI.
    Ayani, Rassul
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Akbari Shahmirzadi, Gholam Hossein
    KTH, School of Information and Communication Technology (ICT).
    Tan, Gary
    National University of Singapore.
    A rule-based approach to syntactic and semantic composition of BOMs2007In: 11th IEEE International Symposium on Distrubuted Simulation and Real Time Applications, 2007, p. 145-155Conference paper (Refereed)
    Abstract [en]

    Creating simulation models via composition of predefined and reusable components is an efficient way of reducing costs and time associated with the simulation model development process. However, in order to successfully compose models one has to solve the issues of syntactic and semantic composability of components. HLA is the most widely used architecture for distributed simulations today. It provides a simulation environment and standards for specifying simulation parts and interactions between simulation parts. But it provides little support for semantic composability. The Base Object Model (BOM) standard is an attempt to ease reusability and composition of simulation models. However, BOMs do not contain sufficient information for defining concepts and terms in order to avoid ambiguity, and provide no methods for matching conceptual models (state machines).

    In this paper, we present our approach for enhancement of the semantic contents of BOMs and propose a three-layer model for syntactic and semantic matching of BOMs. The semantic enhancement includes ontologies for entities, event and interactions in each component. We also present an OWL-S description for each component including the state machines. The three-layer model, consists of syntactic matching, static semantic matching and dynamic semantic matching utilising a set of rules for reasoning about the compositions. We also describe our discovery and matching rules, which have been implemented in the Jess inference engine. In order to test our approach we have defined some simulation scenarios and implemented BOMs as building blocks for development of those scenarios, one of which has been presented in this paper. Our result shows that the three-layer model is promising and can improve and simplify composition of BOM-based components.

1 - 21 of 21
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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