2013 Ninth International Conference on Semantics, Knowledge and Grids最新文献

An Access Control Model for Organisational Management in Enterprise Architecture 企业架构中组织管理的访问控制模型

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.12

Khaled Gaaloul, H. Proper

{"title":"An Access Control Model for Organisational Management in Enterprise Architecture","authors":"Khaled Gaaloul, H. Proper","doi":"10.1109/SKG.2013.12","DOIUrl":"https://doi.org/10.1109/SKG.2013.12","url":null,"abstract":"Enterprise architecture (EA) aims to provide management with appropriate indicators and controls to steer and model service-oriented enterprises. EA offers a suitable operating platform to support an organisation's future goals and the roadmap for moving towards this vision. Despite significant research interest in the domain, common enterprises architecture frameworks lack of access control mechanisms supporting security requirements within organisations. Security has become a matter of paramount concern when managing organisations resources such as stakeholders' authorisation or sensitive data. In this paper, we propose an innovative approach for managing organisational resources in enterprise architecture. In doing so, we reason about task-based resources in the EA language ArchiMate. The idea is to build a conceptual model supporting access control when modelling a business process (set of tasks) in ArchiMate. We then map the common concepts with the role-based access control model (RBAC) to specify the required authorisation policies as part of the security specifications and guidelines in EA. Finally, a case study illustration will be used for the evaluation as part of the research approach.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122666063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Automated Theorem Finding by Forward Deduction Based on the Semi-lattice Model of Formal Theory: A Case Study in NBG Set Theory 基于形式理论半格模型的正演自动定理发现&以NBG集合理论为例

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.36

Hongbiao Gao, Y. Goto, Jingde Cheng

引用次数: 1

Using Association Link Network Model for Organizing Video Resources from Web 利用关联链路网络模型组织Web视频资源

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.8

Zheng Xu, Xiangfeng Luo, Chen Liang, Fenglin Zhi, Lin Mei

{"title":"Using Association Link Network Model for Organizing Video Resources from Web","authors":"Zheng Xu, Xiangfeng Luo, Chen Liang, Fenglin Zhi, Lin Mei","doi":"10.1109/SKG.2013.8","DOIUrl":"https://doi.org/10.1109/SKG.2013.8","url":null,"abstract":"Recent research shows that videos \"in the wild\" are growing at a staggering rate. The rapid increase number of video resources has brought an urgent need to develop intelligent methods to organize the video events. In this paper, we use the Association Link Network model for organizing video resources from Web. Association Link Network is a kind of semantic link network, which is designed to establish associated relations among various resources (e.g., Web pages or documents in digital library) aiming at extending the loosely connected network of no semantics (e.g., the Web) to an association-rich network. Since the theory of cognitive science considers that the associated relations can make one resource more comprehensive to users, the motivation of ALN is to organize the associated resources loosely distributed in the Web for effectively supporting the Web intelligent activities such as browsing, knowledge discovery and publishing, etc. The tags and surrounding texts of video resources are used to represent the semantic content. The relatedness between tags and surrounding texts are implemented in the Association Link Network model. Two data sets from YouTube and Flickr1 are used to evaluate the proposed method. The experimental results show that the proposed method can measure the association relations accurately and robustly.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127744544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Formal Verification of SCA Assembly Model with Event-B 使用Event-B对SCA组装模型进行正式验证

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.31

Aida Lahouij, Lazhar Hamel, Mohamed Graiet

引用次数: 7

A Software Defined Self-Aware Network: The Cognitive Packet Network 软件定义的自我意识网络:认知包网络

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/NCCA.2014.9

E. Gelenbe

引用次数: 22

Sentimental Space Based Analysis of User Personalized Sentiments 基于情感空间的用户个性化情感分析

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.16

Xinzhi Wang, Xiangfeng Luo

引用次数: 10

Data Compression Techniques and Algorithms for Effectively and Efficiently Managing Multidimensional Stream Cubes over Grids 网格上多维流立方体有效管理的数据压缩技术和算法

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.18

A. Cuzzocrea

引用次数: 0

An Efficient Multicore Based Parallel Computing Approach for TSP Problems TSP问题的高效多核并行计算方法

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.41

Y. Li, Kai Ma, Jiong Zhang

{"title":"An Efficient Multicore Based Parallel Computing Approach for TSP Problems","authors":"Y. Li, Kai Ma, Jiong Zhang","doi":"10.1109/SKG.2013.41","DOIUrl":"https://doi.org/10.1109/SKG.2013.41","url":null,"abstract":"TSP (Travelling Salesman Problem) is a typical problem in the scientific and business computing applications such as social network analysis, VLSI chip design, etc. However TSP is regarded as not only a combinatorial optimization problem but also a typical NP-hard problem, and becomes an important method of verifying the correctness and feasibility of new algorithms. Branch and bound algorithm is used to solve TSP because of accuracy results and efficient cutting branch strategy, which has great room for development. However, branch and bound algorithm has its own shortcomings, e.g. acceleration effect is not obvious or even failure for large-scale TSP on single core (In experiment, when the node number is greater than 13, we cannot get the result.), algorithm is more complex and has a bad effect on implementation and practical application. In this paper parallel branch and bound algorithm based on multicore has been improved and proposed to solve classic TSP for the two shortcomings. It estimates the bound by limit method according to greedy algorithm and minimum of distance matrix. The parallel algorithm draws on the implicit parallelism of branch and bound algorithm to propose a multi-branch parallel mechanism to improve the optimization efficiency. And on each core the algorithm eliminates the sub-loop to avoid repetitive calculations. Multicore solves problems of load balancing and task scheduling by collaboration of static and dynamic, integration of master core and slave core. This paper uses the Beehive 6.0 as multi-core platform to verify TSP by improved algorithm. Simulation results show that our algorithm is efficient and useful, which not only avoids the bottleneck of scale increasing on single core computer, but also improves the speed of cutting branch on multicore computer.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124873479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Location-Driven Geographical Topic Discovery 位置驱动的地理主题发现

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.20

Li Zhang, Xiaoping Sun, H. Zhuge

{"title":"Location-Driven Geographical Topic Discovery","authors":"Li Zhang, Xiaoping Sun, H. Zhuge","doi":"10.1109/SKG.2013.20","DOIUrl":"https://doi.org/10.1109/SKG.2013.20","url":null,"abstract":"With the prevalence of geo-position devices GPS and smart phones, textual information, long or short, associated with GPS tags usually denoted by a coordinate with latitude and longitude is widely encountered on the Web. For example, in Twitter, smart phones record the location of every tweet after it is authorized. The spatial objects on Google map are also presented with some textual descriptions. These data provide researchers two-dimension perspectives, fusing both location and textual dimension. In real world, similar concepts, discussions, product sales and geographic objects are often gathered together which people are interest in. This paper studied three methods that combine a density-based clustering method DBSCAN with LDA (Latent Dirichlet Allocation) method in different ways to discover geographical topics. The first method clusters the GPS tagged documents and then for each clustered region, it applies LDA on the document set in that region, The second method first uses DBSCAN to find clusters among documents, merges documents from each cluster region into one document and form one document set on which LDA is applied, The third method applies LDA on the whole document set, and then, extracts topics generated by LDA in a specific region from DBSCAN. Abundant experiments are conducted with varying parameters. It is shown that three methods performed well in discovering topics in clusters, but the first two methods take much less computing time.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122564237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Threshold and Associative Based Classification for Social Spam Profile Detection on Twitter 基于阈值和关联分类的Twitter社交垃圾文件检测

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.15

Willian Hua, Yanqing Zhang

{"title":"Threshold and Associative Based Classification for Social Spam Profile Detection on Twitter","authors":"Willian Hua, Yanqing Zhang","doi":"10.1109/SKG.2013.15","DOIUrl":"https://doi.org/10.1109/SKG.2013.15","url":null,"abstract":"Online Social Networks (OSNs) such as Facebook and Twitter are the fastest growing online entities. Because they do not require much authentication for a user to create an account, they are susceptible to social spam attacks. These low-quality, unsolicited, and unwanted bulk messages commonly originate from Social Spam Profiles (SSPs). Spam messages may contain harmful virus links that infect users and propagate throughout OSNs. Twitter, a fast growing OSN site, has a large number of SSPs that have the potential to harm legitimate users. In this paper, a fast and scalable approach is proposed to detect SSPs on Twitter using content, behavioral, and graph-based data. After various investigations, a threshold and associative based classifier is created. Then, the new classifier is compared with the supervised machine learning algorithm, SVM, and two other existing algorithms in terms of accuracy, precision, sensitivity, and specificity. The new classifier with an accuracy of 79.26% is better than SVM with an accuracy of 69.32%. In summary, SSPs are younger, have more statuses, more tweets in succession, and contain keywords that differentiate a spam profile from a non-spam profile.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124889540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20