发布求助
文献互助 智能选刊 最新文献

AASRI Procedia最新文献

筛选
英文 中文
Study of Qualitative Data Cluster Model based on Granular Computing 基于颗粒计算的定性数据聚类模型研究
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.048
Haiyan Li, Shen Yang, Hong Liu
{"title":"Study of Qualitative Data Cluster Model based on Granular Computing","authors":"Haiyan Li,&nbsp;Shen Yang,&nbsp;Hong Liu","doi":"10.1016/j.aasri.2013.10.048","DOIUrl":"10.1016/j.aasri.2013.10.048","url":null,"abstract":"<div><p>Granular computing theories in the field of computer are introduced into the statistical analysis of qualitative data, based on the traditional qualitative data analysis methods. Multidimensional qualitative data by use of information system are described, and the mathematical model of qualitative data cluster model based on granular computing is given. The feasibility and the superiority are verified by treating massive data. This method may provide a new train of thought for analysis of large and complex qualitative data.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 329-333"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81227513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Computational Exploration of Theme-based Blog Data Using Topic Modeling, NERC and Sentiment Classifier Combine 结合主题建模、NERC和情感分类器的主题博客数据计算探索
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.033
V.K. Singh , P. Waila , R. Piryani , A. Uddin
{"title":"Computational Exploration of Theme-based Blog Data Using Topic Modeling, NERC and Sentiment Classifier Combine","authors":"V.K. Singh ,&nbsp;P. Waila ,&nbsp;R. Piryani ,&nbsp;A. Uddin","doi":"10.1016/j.aasri.2013.10.033","DOIUrl":"10.1016/j.aasri.2013.10.033","url":null,"abstract":"<div><p>This paper presents findings of our exploratory research work on a novel combine of Topic Modeling, Named Entity Recognition and Sentiment Classification for sociological analysis of blog data. We have collected more than 500 blog posts on the broader theme of ‘Discrimination, Abuse and Crime against Women’. We employed topic discovery to identify top keywords and key themes and implemented the 7-entity model Named Entity Recognition process to identify the key persons, organizations and locations discussed in the blog posts. Thereafter we performed sentiment classification of the entire blog data into positive and negative categories using SentiWordNet. The results obtained are very interesting and validate the usefulness of our approach for computational analysis of social media data. The key contribution of the paper is to propose a novel Text Analytics combine and demonstrate its applicability for computational exploration of the social media data for sociological analysis purposes.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 212-222"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.033","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75103799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Design Reusability and Adaptability for Concurrent Software 并行软件设计的可重用性和适应性
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.069
Paniti Netinant
{"title":"Design Reusability and Adaptability for Concurrent Software","authors":"Paniti Netinant","doi":"10.1016/j.aasri.2013.10.069","DOIUrl":"10.1016/j.aasri.2013.10.069","url":null,"abstract":"<div><p>Developing reusable and adaptable concurrent software are very difficult. Reusability and adaptability in concurrent software become minimal. These collaborations not only perimeter reusability, but also make modification invasive changes to meet new requirements in the design of the concurrent software. The concurrent system has to reengineer, in order to meet the future requirements. A misunderstanding, that a concurrent object-oriented programming generally endorses reusability and adaptability, as none of these problems is imposed. Software developers have to specifically deliberate software making reusability and adaptability. We present a concurrent aspect framework which better supporting reusability and adaptability. In the framework, functional components and system assets are relatively separated. This technique makes concurrent software developing better reusability and adaptability. A framework enables manageable reusability and adaptability for building of concurrent software. Our research focuses on decomposition of contact in concurrent software development and our goal is to demonstrate a better model of concurrent software design.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 133-139"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84871509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Automatic Definition of Regions of Interest on Renal Scintigraphic Images 肾脏扫描图像感兴趣区域的自动定义
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.007
Yassine Aribi, Ali Wali, Mohamed Chakroun, Adel M. Alimi
{"title":"Automatic Definition of Regions of Interest on Renal Scintigraphic Images","authors":"Yassine Aribi,&nbsp;Ali Wali,&nbsp;Mohamed Chakroun,&nbsp;Adel M. Alimi","doi":"10.1016/j.aasri.2013.10.007","DOIUrl":"10.1016/j.aasri.2013.10.007","url":null,"abstract":"<div><p>Renography is a radionuclide technique introduced in medicine since the early sixties in the daily practice. It allows measuring the function of each kidney separately in case of unilateral or bilateral uro-nephrological disease. A new system for analysis of Renography is presented in this paper. Our system aims to show a fully automated method for drawing the renal regions of interest based on a multi-agent system that incorporates spatio-temporal interest points detection on scintigraphic images by using the HOG3D descriptor to initialize agents. We used both types of agents, namely supervisor agents and explorator agents, they communicate among themselves and they inspire in their behavior from the Fast Marching method. Our system was tested on many real patients’ cases and we have obtained encouraging results. Clinical validation showed a constant agreement between the approach presented and manual segmentation by professionals in the nuclear medicine.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 37-42"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.007","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89397727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
A New Technique for Generating Minimal Cut Sets in Nontrivial Network 非平凡网络中生成最小割集的新技术
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.060
Mohamed-Larbi Rebaiaia , Daoud Ait-Kadi
{"title":"A New Technique for Generating Minimal Cut Sets in Nontrivial Network","authors":"Mohamed-Larbi Rebaiaia ,&nbsp;Daoud Ait-Kadi","doi":"10.1016/j.aasri.2013.10.060","DOIUrl":"10.1016/j.aasri.2013.10.060","url":null,"abstract":"<div><p>Network reliability analysis problem is the center of many scientific productions. It consists of evaluating the all-terminal reliability of networks. Two classes have emerged; exact and approximate methods. The aim of this paper is to present an efficient exact method for enumerating minimal cuts (MCS) of R-networks. The algorithm proceeds by determining minimal paths set (MPS) and from which minimal cuts are generated by managing binary decision diagrams. The manipulation process consists of a series of transformations, reductions and filtering operations. The approach succeeds in the reduction of computation time and memory space and was applied for evaluating the reliability of a national radio communication network.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 67-76"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.060","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84013999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Energy-efficient Relay Selection for Multicast Communication 节能中继选择的组播通信
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.064
Junxing Wang, Zhigang Chen, Yuan Yao
{"title":"Energy-efficient Relay Selection for Multicast Communication","authors":"Junxing Wang,&nbsp;Zhigang Chen,&nbsp;Yuan Yao","doi":"10.1016/j.aasri.2013.10.064","DOIUrl":"10.1016/j.aasri.2013.10.064","url":null,"abstract":"<div><p>Aimed at the problem that system energy consumption of the traditional cooperative multicast is large with increase of the number of users, four energy-efficient relay selection schemes are proposed to reduce system energy consumption. By using exhaustive search method, the optimal relay selection algorithm selects relays from all the possible combinations of relays, the scheme could reduce energy consumption and improve energy efficiency effectively at high computational complexity. According to the thought of iteration, greedy algorithm chooses relays using the selected relays, though the scheme doesn’t achieve the energy efficiency of the optimal relay selection algorithm, it reduces computational complexity. Besides, relay selection based on multicast rate of users selects relays using the multicast rate of each user by which the rest users with bad channel condition could decode data correctly, and relay selection based on channel state information (CSI) among users chooses relays according to the whole CSI between each user decoded data correctly and all users failed to decode data, these two schemes further reduce complexity compared to greedy algorithm. Results show that all the proposed energy-efficient relay selection approaches could improve energy efficiency while meeting the requirement of fairness.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 98-105"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.064","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80801391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Qualities of Interest for Spontaneous Networked Organizations 自发网络组织的兴趣性质
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.019
Saad Alqithami, Henry Hexmoor
{"title":"Qualities of Interest for Spontaneous Networked Organizations","authors":"Saad Alqithami,&nbsp;Henry Hexmoor","doi":"10.1016/j.aasri.2013.10.019","DOIUrl":"10.1016/j.aasri.2013.10.019","url":null,"abstract":"<div><p>In spontaneous networked organizations, or any dynamic open organizations, autonomous agents must interact among themselves to achieve their goals. Agents usually interact, with which they have no experience, due to the scale and dynamism in these organizations. Each agent must, therefore, achieve certain qualities of interests in order to be capable of amalgamating fast. In light of this, we construct qualities of interest for a spontaneous networked organization. Theoretical aspects will be described including social harmony, coherence and spontaneity and their effect on the interaction process among agents inside such a collaborative organization. This study helps to improve the social capital of any networked organization.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 118-124"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72811308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Analysis for Small-World Network's Evolution based on Network Entropy 基于网络熵的小世界网络演化分析
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.089
Liangxun Shuo, Yiying Chen, Zexin Zhang, Wenbin Li
{"title":"The Analysis for Small-World Network's Evolution based on Network Entropy","authors":"Liangxun Shuo,&nbsp;Yiying Chen,&nbsp;Zexin Zhang,&nbsp;Wenbin Li","doi":"10.1016/j.aasri.2013.10.089","DOIUrl":"10.1016/j.aasri.2013.10.089","url":null,"abstract":"<div><p>In modeling algorithms of Scale-free or Small-World network, the modification for nodes denotes the metabolism of the system components, and the change for edges represents the metabolism of the system structure. Due the modifications of nodes and edges, network structure as well as the network's entropy is changed. Therefore, the entropy of the network is used to depict the metabolic processes of the system in this paper Based on the network entropy, the WS model is analyzed. The conclusions are that firstly the change of network entropy of WS network is U-shaped. Secondly, under the same conditions, the value of p affects the rate of decrease and increase in the entropy's graphic. And, K decides the timing of change from drop to rising.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 274-280"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.089","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77103774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Parallel Processing of Sensor Network Data Using Column-oriented Databases 基于列式数据库的传感器网络数据并行处理
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.051
Kyung-Chang Kim , Choung-Seok Kim
{"title":"Parallel Processing of Sensor Network Data Using Column-oriented Databases","authors":"Kyung-Chang Kim ,&nbsp;Choung-Seok Kim","doi":"10.1016/j.aasri.2013.10.051","DOIUrl":"10.1016/j.aasri.2013.10.051","url":null,"abstract":"<div><p>Many wireless sensor network (WSN) applications require join of sensor data belonging to various sensor nodes. For join processing, it is important to minimize the communication cost since it is the main consumer of battery power. In this paper, we introduce a parallel join technique for sensor networks. A WSN consists of many independent sensor nodes and provides a natural platform for a shared-nothing architecture to carry out parallel processing. The proposed parallel join algorithm is based on sensor data that are stored in column-oriented databases. A column-oriented database store table data column-wise rather than row-wise as in traditional relational databases. The proposed algorithm is energy-efficient for two clear reasons. First, unlike relational databases, only relevant columns are shipped to the join region for final join processing. Second, parallel join processing of sensor data also improves performance. The performance analysis shows that the proposed algorithm outperforms join algorithms for sensor data that are based on relational databases.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 2-8"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.051","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73558863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Research of AODV Routing Protocol for Ad Hoc Networks1 面向Ad Hoc网络的AODV路由协议研究[j]
AASRI Procedia Pub Date : 2013-01-01 Epub Date: 2013-11-27 DOI: 10.1016/j.aasri.2013.10.054
Sheng Liu, Yang Yang, Weixing Wang
{"title":"Research of AODV Routing Protocol for Ad Hoc Networks1","authors":"Sheng Liu,&nbsp;Yang Yang,&nbsp;Weixing Wang","doi":"10.1016/j.aasri.2013.10.054","DOIUrl":"10.1016/j.aasri.2013.10.054","url":null,"abstract":"<div><p>Firstly, this paper describes the basic characteristic, key techniques of Ad Hoc networks, and compared with other mobile communication systems. Through analyzing and comparing with DSR, TORA, ABR, AODV, it researched on-demand routing protocol for Ad Hoc networks. It introduces AODV routing protocol in details. It presents an optimized protocol: B-AODV, based on the shortage of routing finding and routing repair of AODV. In B-AODV, first through reverse request by sending BRREQ replace of RREP, it reduces the time of routing finding. Second, two hops IP record in control messages and route table can improve the rate of routing repair and reduces the times of routing findings. And it improves the function of Ad Hoc network. This simulation experiment is based on NS2 and compared the performance of AODV and B-AODV. And it compared the differences of control packets, ratio of packets, end to end delay for AODV and B- AODV. It shows that B-AODV is better than AODV.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 21-31"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.054","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91260675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 42
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书