Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747510
Nasser Zalmout, M. Ghanem
We present and apply a generic methodology for multidimensional community detection from Twitter data. The approach builds on constructing multiple network structures based on the similarity and interaction patterns that exist between different users. It then applies traditional network centric community detection techniques to identify clusters of users. The paper also approaches the issues of dynamicity and evolution in Social Media by developing a Bayesian classifier that maps new users to the detected communities. Using a data set of UK political Tweets, we evaluate the factors affecting the quality of the detected communities. We also investigate how the accuracy of the classifier is affected by the dynamicity of the network evolution and the time elapsed between community detection and classifier application.
{"title":"Multidimensional community detection in Twitter","authors":"Nasser Zalmout, M. Ghanem","doi":"10.1109/ICIST.2013.6747510","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747510","url":null,"abstract":"We present and apply a generic methodology for multidimensional community detection from Twitter data. The approach builds on constructing multiple network structures based on the similarity and interaction patterns that exist between different users. It then applies traditional network centric community detection techniques to identify clusters of users. The paper also approaches the issues of dynamicity and evolution in Social Media by developing a Bayesian classifier that maps new users to the detected communities. Using a data set of UK political Tweets, we evaluate the factors affecting the quality of the detected communities. We also investigate how the accuracy of the classifier is affected by the dynamicity of the network evolution and the time elapsed between community detection and classifier application.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129874388","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747494
Su-zhen Liu, Huifang Yang, Longzheng Tong, Weifang Liu
In the present study, a voxel-based morphometry (VBM) and three dimensional texture analysis were used to detect brain structural changes of AD subjects in preclinical phase. Three groups of T1-weighed MRI data were selected from Open Access Series of Imaging Studies (OASIS) database, including 13 converted subjects (CS) who were cognitively healthy at baseline, 13 non-demented subjects (NS) remained cognitively healthy, and 64 demented subjects (DS) for control study. Results showed grey matter (GM) atrophy in bilateral occipital lobe, superior temporal gyrus, and left inferior temporal lobe in CS (p< 0.001); textural features of the largest cluster significantly differed from that of NS, with the classification accuracy of 88.5% through cross validation, which may highlight the key role of these regions in prediction of the disease. Morphometric measurement plus texture analysis presents feasible in detecting preclinical AD.
本研究采用基于体素的形态测量(VBM)和三维纹理分析方法检测阿尔茨海默病受试者临床前阶段的脑结构变化。从Open Access Series Imaging Studies (OASIS)数据库中选择三组t1加权MRI数据，包括13例基线认知健康的转换受试者(CS)、13例认知健康的非痴呆受试者(NS)和64例痴呆受试者(DS)作为对照研究。结果CS患者双侧枕叶、颞上回、左侧颞下叶灰质萎缩(p< 0.001);最大聚类的纹理特征与NS存在显著差异，交叉验证的分类准确率为88.5%，这可能突出了这些区域在疾病预测中的关键作用。形态学测量加织构分析在临床前AD检测中是可行的。
{"title":"Detecting grey matter changes in preclinical phase of Alzheimer's disease by voxel-based morphometric and textural features: A preliminary study","authors":"Su-zhen Liu, Huifang Yang, Longzheng Tong, Weifang Liu","doi":"10.1109/ICIST.2013.6747494","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747494","url":null,"abstract":"In the present study, a voxel-based morphometry (VBM) and three dimensional texture analysis were used to detect brain structural changes of AD subjects in preclinical phase. Three groups of T1-weighed MRI data were selected from Open Access Series of Imaging Studies (OASIS) database, including 13 converted subjects (CS) who were cognitively healthy at baseline, 13 non-demented subjects (NS) remained cognitively healthy, and 64 demented subjects (DS) for control study. Results showed grey matter (GM) atrophy in bilateral occipital lobe, superior temporal gyrus, and left inferior temporal lobe in CS (p< 0.001); textural features of the largest cluster significantly differed from that of NS, with the classification accuracy of 88.5% through cross validation, which may highlight the key role of these regions in prediction of the disease. Morphometric measurement plus texture analysis presents feasible in detecting preclinical AD.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130273569","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747837
Yafang Wang, Xiaozhe Zheng, L. Guan
In view of IP multimedia subsystem (IMS) which is the focus of technical research in the field of communication, analyse the scheme of IMS network based on service provision and service triggering mechanism. According to the application triggering architecture, service triggering data and service triggering process, this paper carried out a detailed analysis, and set up IMS system basing on Linux operating system. Then take a test to the system function whose results show that the service scheme ensures the normal use of services provided by IMS service architecture when a user is performing IMS calling.
{"title":"Research on service scheme in IP multimedia subsystem network","authors":"Yafang Wang, Xiaozhe Zheng, L. Guan","doi":"10.1109/ICIST.2013.6747837","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747837","url":null,"abstract":"In view of IP multimedia subsystem (IMS) which is the focus of technical research in the field of communication, analyse the scheme of IMS network based on service provision and service triggering mechanism. According to the application triggering architecture, service triggering data and service triggering process, this paper carried out a detailed analysis, and set up IMS system basing on Linux operating system. Then take a test to the system function whose results show that the service scheme ensures the normal use of services provided by IMS service architecture when a user is performing IMS calling.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125069666","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747643
Gaoming Du, Jing He, Y. Song, Duoli Zhang, Huajie Wu
Packet-circuit switching adopted by network on chip is a new data transmission protocol, which establishes a route by sending a request packet and transfers data by circuit switching. In order to make the network based on the protocol show excellent performance, we build data transmission link as rapidly and successfully as possible, which depends on the quality of routing algorithm. In this paper, XY routing algorithm, Turn routing algorithm and Retrograde-Turn routing algorithm are applied on Network-on-Chip. According to different packet lengths and injection rates, we construct different network congestion situations to test network performance. Compared with the XY routing algorithm, the experiment results demonstrate that the Retrograde-Turn routing algorithm can improve average throughput and average latency by 32.99% and 12.16% at best, respectively, when the packet length is long and the injection rate is high.
{"title":"Comparison of NoC routing algorithms based on packet-circuit switching","authors":"Gaoming Du, Jing He, Y. Song, Duoli Zhang, Huajie Wu","doi":"10.1109/ICIST.2013.6747643","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747643","url":null,"abstract":"Packet-circuit switching adopted by network on chip is a new data transmission protocol, which establishes a route by sending a request packet and transfers data by circuit switching. In order to make the network based on the protocol show excellent performance, we build data transmission link as rapidly and successfully as possible, which depends on the quality of routing algorithm. In this paper, XY routing algorithm, Turn routing algorithm and Retrograde-Turn routing algorithm are applied on Network-on-Chip. According to different packet lengths and injection rates, we construct different network congestion situations to test network performance. Compared with the XY routing algorithm, the experiment results demonstrate that the Retrograde-Turn routing algorithm can improve average throughput and average latency by 32.99% and 12.16% at best, respectively, when the packet length is long and the injection rate is high.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131323708","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747556
Jian Cao, S. Sun, X. Duan
In the fault classification process, a flexible SVM classification algorithm is proposed to solve the unreasonable condition that the number of muti-classification decision boundary is stationary when using the traditional support vector machine(SVM). The algorithm is based on support vector data description(SVDD) hypersphere determine the sample distribution characteristics similar class of fusion as a new class, guaranted to produce classifications which are easy to distinguish. Training multi hyperspheres between the new classes and SVM decision boundary within the new class. Using one-to-one vote to choose. Experiments show that this algorithm has a better classification performance, and can reduce training time and determine time which can be well applied to fault classification.
{"title":"A multi-classification algorithm based on support vectors","authors":"Jian Cao, S. Sun, X. Duan","doi":"10.1109/ICIST.2013.6747556","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747556","url":null,"abstract":"In the fault classification process, a flexible SVM classification algorithm is proposed to solve the unreasonable condition that the number of muti-classification decision boundary is stationary when using the traditional support vector machine(SVM). The algorithm is based on support vector data description(SVDD) hypersphere determine the sample distribution characteristics similar class of fusion as a new class, guaranted to produce classifications which are easy to distinguish. Training multi hyperspheres between the new classes and SVM decision boundary within the new class. Using one-to-one vote to choose. Experiments show that this algorithm has a better classification performance, and can reduce training time and determine time which can be well applied to fault classification.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"42 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120914916","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747495
Jiamin Fu, Zhen Liu, Xin Gao
This paper analyzes the resting state fMRI signal of 21 ADHD subjects and 27 healthy volunteers, and proposes a novel method for extracting an effective feature in frequency domain. Utilizing this feature, the ADHD subjects and the control persons are classified with an accuracy of 95.83% by support vector machine (SVM). Furthermore, using this method, some specific brain regions such as the right amygdaloid nucleus, the left thalamus, cerebellum and vermis, with high classification accuracies, are relative to the pathological mechanism of ADHD which are consistent with the previous research results.
{"title":"Investigation of low frequency drift in attention deficit hyperactivity disorder fMRI Signal","authors":"Jiamin Fu, Zhen Liu, Xin Gao","doi":"10.1109/ICIST.2013.6747495","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747495","url":null,"abstract":"This paper analyzes the resting state fMRI signal of 21 ADHD subjects and 27 healthy volunteers, and proposes a novel method for extracting an effective feature in frequency domain. Utilizing this feature, the ADHD subjects and the control persons are classified with an accuracy of 95.83% by support vector machine (SVM). Furthermore, using this method, some specific brain regions such as the right amygdaloid nucleus, the left thalamus, cerebellum and vermis, with high classification accuracies, are relative to the pathological mechanism of ADHD which are consistent with the previous research results.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126082039","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747722
Hann-Tzong Chern, Bo Xu
Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here. In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.
{"title":"The bandwidth allocation by queue length (BA-QL) for WiMAX network","authors":"Hann-Tzong Chern, Bo Xu","doi":"10.1109/ICIST.2013.6747722","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747722","url":null,"abstract":"Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here. In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794074","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747582
Youzhi Zhang, Peng Zhang, Ye Li, Wenshuo Zhang, Lin Zhao
This paper presents a method to improve the payload of spread spectrum (SS) based audio watermarking via an M-ary SS modulation technique called code phase shift keying (CPSK), in which the code phase of the spreading sequence is modulated with multiple data bits. Compared with the code division multiple access (CDMA) based watermarking with the same transparency and payload, the proposed scheme provides better robustness against common attacks for large M, and requires lower embedding and extraction complexity.
{"title":"High-payload spread spectrum based audio watermarking via M-ary code phase shift keying","authors":"Youzhi Zhang, Peng Zhang, Ye Li, Wenshuo Zhang, Lin Zhao","doi":"10.1109/ICIST.2013.6747582","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747582","url":null,"abstract":"This paper presents a method to improve the payload of spread spectrum (SS) based audio watermarking via an M-ary SS modulation technique called code phase shift keying (CPSK), in which the code phase of the spreading sequence is modulated with multiple data bits. Compared with the code division multiple access (CDMA) based watermarking with the same transparency and payload, the proposed scheme provides better robustness against common attacks for large M, and requires lower embedding and extraction complexity.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133716420","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747619
Huan Ying, Hao Zhu, Donghui Wang, C. Hou
Memcpy function is invoked frequently by digital signal processor to handle data transfer during encoding and decoding of multimedia. This paper presents a novel scheme to generate optimal memcpy assembly code for a reduced instruction set computer architecture. Based on the ordered binary decision diagram and the concept of data mining, the proposed solution completely exploits the available optimization according to the input parameters of memcpy. Thus, the memcpy function assembly code generated by our proposal accomplishes the directed-optimal data transfer during execution. Experimental results showed that the solution improves the performance of memcpy effectively. It reduced 56.5c/o executed cycles on average. Moreover, the approach of generation for memcpy at assembly level is portable for any other reduced instruction set computer architecture with modification of the customization file.
{"title":"A novel scheme to generate optimal memcpy assembly code","authors":"Huan Ying, Hao Zhu, Donghui Wang, C. Hou","doi":"10.1109/ICIST.2013.6747619","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747619","url":null,"abstract":"Memcpy function is invoked frequently by digital signal processor to handle data transfer during encoding and decoding of multimedia. This paper presents a novel scheme to generate optimal memcpy assembly code for a reduced instruction set computer architecture. Based on the ordered binary decision diagram and the concept of data mining, the proposed solution completely exploits the available optimization according to the input parameters of memcpy. Thus, the memcpy function assembly code generated by our proposal accomplishes the directed-optimal data transfer during execution. Experimental results showed that the solution improves the performance of memcpy effectively. It reduced 56.5c/o executed cycles on average. Moreover, the approach of generation for memcpy at assembly level is portable for any other reduced instruction set computer architecture with modification of the customization file.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133780939","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}
Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747733
Andrew Lo
Independent innovation is the driving force for the development of enterprises, especially small and medium-sized enterprises (SMEs). This paper studies a small radio and television broadcasting equipment manufacturer called CG's entrepreneurial journey, analyzes the company's “technological innovation + brand internationalization + social capital integration” entrepreneurial model, and finds that this mixed independent innovation model can enhance a company's independent innovation capacity and competitiveness, and thus it quickly occupied the market. The research findings can provide something positive for SMEs in developing countries to draw on.
{"title":"A case study of small and medium-sized enterprises' entrepreneurial models based on independent innovation","authors":"Andrew Lo","doi":"10.1109/ICIST.2013.6747733","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747733","url":null,"abstract":"Independent innovation is the driving force for the development of enterprises, especially small and medium-sized enterprises (SMEs). This paper studies a small radio and television broadcasting equipment manufacturer called CG's entrepreneurial journey, analyzes the company's “technological innovation + brand internationalization + social capital integration” entrepreneurial model, and finds that this mixed independent innovation model can enhance a company's independent innovation capacity and competitiveness, and thus it quickly occupied the market. The research findings can provide something positive for SMEs in developing countries to draw on.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133623367","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：