Two classes of time-dependent matrices are proposed and investigated in this paper in terms of their pseudoinverses solving. On one hand, the pseudoinverse of Getz-Masden matrix can be solved by Getz-Masden dynamic system (GMDS) effectively and accurately. On the other hand, the GMDS can not solve for the pseudoinverse of Zhang matrix, as found and shown in this paper. Besides, for the purpose of obtaining the discrete-time GMDS and illustrating the phenomena, Euler forward formula and four-point ZeaD (Zhang et al discretization) formula are adopted to discretize the continuous-time GMDS. After getting the two discrete-time GMDS models, the solving situations of Getz-Masden matrix and Zhang matrix are compared.
{"title":"Zhang Matrix Found as an Exception with its Time-Dependent Pseudoinverse Unsolvable by Getz-Masden Dynamic System","authors":"Yunong Zhang, Guangyuan Shi, Jian Li, Guofu Wu, Zhiyuan Qi","doi":"10.1109/ICSAI.2018.8599426","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599426","url":null,"abstract":"Two classes of time-dependent matrices are proposed and investigated in this paper in terms of their pseudoinverses solving. On one hand, the pseudoinverse of Getz-Masden matrix can be solved by Getz-Masden dynamic system (GMDS) effectively and accurately. On the other hand, the GMDS can not solve for the pseudoinverse of Zhang matrix, as found and shown in this paper. Besides, for the purpose of obtaining the discrete-time GMDS and illustrating the phenomena, Euler forward formula and four-point ZeaD (Zhang et al discretization) formula are adopted to discretize the continuous-time GMDS. After getting the two discrete-time GMDS models, the solving situations of Getz-Masden matrix and Zhang matrix are compared.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121094165","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599439
Guanghua Chen, Qinghua Dai, Xiao Tang, Zihao Xu
In order to solve the problem of poor accuracy and matching speed in finger vein recognition, an improved Least Trimmed Square Hausdorff Distance (LTS-HD) finger vein recognition based on weighted matching point algorithm is proposed in this paper. The incremental neighborhood search method is used to achieve matching acceleration for Least Trimmed Square Hausdorff Distance algorithm firstly, and the optimal matching weights for different types of matching points is searched by Particle Swarm Optimization, at the same time, the particle box exclusion mechanism is applied to avoid premature convergence so as to achieve global particle optimization. On this basis, the directional matching points which can effectively characterize the vein pattern information are extracted, and the optimal weights of vein matching point is calculated after introducing the weights and model optimization. At last, the improved Least Trimmed Square Hausdorff Distance algorithm is used to achieve finger vein recognition by introducing the optimal weights. Compared with other algorithms, the results show that the proposed algorithm has a significant improvement in the objective indicators such as matching speed and accuracy.
{"title":"An Improved Least Trimmed Square Hausdorff Distance Finger Vein Recognition","authors":"Guanghua Chen, Qinghua Dai, Xiao Tang, Zihao Xu","doi":"10.1109/ICSAI.2018.8599439","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599439","url":null,"abstract":"In order to solve the problem of poor accuracy and matching speed in finger vein recognition, an improved Least Trimmed Square Hausdorff Distance (LTS-HD) finger vein recognition based on weighted matching point algorithm is proposed in this paper. The incremental neighborhood search method is used to achieve matching acceleration for Least Trimmed Square Hausdorff Distance algorithm firstly, and the optimal matching weights for different types of matching points is searched by Particle Swarm Optimization, at the same time, the particle box exclusion mechanism is applied to avoid premature convergence so as to achieve global particle optimization. On this basis, the directional matching points which can effectively characterize the vein pattern information are extracted, and the optimal weights of vein matching point is calculated after introducing the weights and model optimization. At last, the improved Least Trimmed Square Hausdorff Distance algorithm is used to achieve finger vein recognition by introducing the optimal weights. Compared with other algorithms, the results show that the proposed algorithm has a significant improvement in the objective indicators such as matching speed and accuracy.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121098283","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599407
Naifan Xue, Junjie Yang
This paper discusses the theory of the location of the partial discharge and carries out a PD experiment with a real power transformer. Five Ultra high frequency (UHF) sensors are used to detect the PD source. The location of the PD source can be analyzed and calculated by establishing a power transformer model and collecting the electromagnetic signals generated from the PD source. A comparison between the actual PD source and the estimated location is also made. Time difference of arrival (TDOA) of distinct signals collected by different sensors can be used to search for the PD location. Distance equations are formulated based on the geometrical relationship and the 2-norm theory. To determine the time difference, first peak method is used in the power transformer model.
本文讨论了局部放电的定位原理，并在实际电力变压器上进行了局部放电实验。使用5个UHF (Ultra high frequency)传感器检测PD源。通过建立电力变压器模型，采集PD源产生的电磁信号，可以对PD源的位置进行分析计算。对实际PD源和估计位置进行了比较。利用不同传感器采集到的不同信号的到达时间差(TDOA)来搜索PD位置。根据几何关系和二范数理论建立了距离方程。在电力变压器模型中，采用首峰法确定时间差。
{"title":"The Location of Partial Discharge Source in the Power Transformer with UHF Sensors","authors":"Naifan Xue, Junjie Yang","doi":"10.1109/ICSAI.2018.8599407","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599407","url":null,"abstract":"This paper discusses the theory of the location of the partial discharge and carries out a PD experiment with a real power transformer. Five Ultra high frequency (UHF) sensors are used to detect the PD source. The location of the PD source can be analyzed and calculated by establishing a power transformer model and collecting the electromagnetic signals generated from the PD source. A comparison between the actual PD source and the estimated location is also made. Time difference of arrival (TDOA) of distinct signals collected by different sensors can be used to search for the PD location. Distance equations are formulated based on the geometrical relationship and the 2-norm theory. To determine the time difference, first peak method is used in the power transformer model.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234935","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599367
You Wu, Haifei Xia, Chen Cheng
Wireless channel has many characteristics such as reciprocity, time variation, spatial uniqueness, etc. This paper extracted secret key from its noisy radio channel measurements at two nodes by exploiting the reciprocity of wireless channel in time division system. Therefore, the secret key could be generated with the channel estimation to overcome the drawback of the key pre-distribution mechanism. Aiming at solving the problem that the multibit adaptive quantization scheme to achieve low key generation consistency probability, the paper proposes m-windows filtering mechanism to preprocess channel eigenvalues. The simulation results show that the improved algorithm achieves higher key agreement rate and key generation rate, especially when the signal to noise ratio is low, reduce the key inconsistency rate particularly noticeable.
{"title":"Improved Mult-bit Adaptive Quantization algorithm for Physical Layer Security based on Channel Charscteristics","authors":"You Wu, Haifei Xia, Chen Cheng","doi":"10.1109/ICSAI.2018.8599367","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599367","url":null,"abstract":"Wireless channel has many characteristics such as reciprocity, time variation, spatial uniqueness, etc. This paper extracted secret key from its noisy radio channel measurements at two nodes by exploiting the reciprocity of wireless channel in time division system. Therefore, the secret key could be generated with the channel estimation to overcome the drawback of the key pre-distribution mechanism. Aiming at solving the problem that the multibit adaptive quantization scheme to achieve low key generation consistency probability, the paper proposes m-windows filtering mechanism to preprocess channel eigenvalues. The simulation results show that the improved algorithm achieves higher key agreement rate and key generation rate, especially when the signal to noise ratio is low, reduce the key inconsistency rate particularly noticeable.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497017","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599328
I. Yilmaz, Jie Yang, Emrecan Altinsoy, Lei Zhou
Karyotyping is one of the most common procedure in cytogenetics to identify and evaluate the presence of genetic defects or disorders. Developing an automatic analysis algorithm for this procedure was studied by numerous other researchers before. One of the fundamental parts of this process is the segmentation of chromosomes, which is followed by classification. Despite recent improvements in deep neural networks and image classification, high-quality segmentation is essential to achieve accurate classification results. Still, automatic segmentation and extrication of touching and overlapping chromosomes are current problems. In the light of the above, this paper is intended to present an automatic segmentation and separation of G-band human chromosomes. we have tried to present an algorithm to overcome all the difficulties such as accurate thresholding, separation of touching and overlapping chromosomes. Unlike previous studies, we are also focusing on issues that may increase the segmentation quality beyond the separation of overlapping chromosomes. In this work, we present an end-to-end segmentation of chromosome images. This process includes noise removal and rejection of unwanted objects, separating fore and background, a binary watershed approach to divide intuitively and easily detectable clusters, finding a geodesic path between chromosomes in remaining clusters and finally disentangling of overlapped and complex clusters. We also built a user interface and let a little human intervention to detect unnoticed clusters. We have tested the proposed method on 145 chromosome images that contain 6678 chromosomes and 6532 (97.8%) of them have been correctly extracted.
{"title":"An Improved Segmentation for Raw G-Band Chromosome Images","authors":"I. Yilmaz, Jie Yang, Emrecan Altinsoy, Lei Zhou","doi":"10.1109/ICSAI.2018.8599328","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599328","url":null,"abstract":"Karyotyping is one of the most common procedure in cytogenetics to identify and evaluate the presence of genetic defects or disorders. Developing an automatic analysis algorithm for this procedure was studied by numerous other researchers before. One of the fundamental parts of this process is the segmentation of chromosomes, which is followed by classification. Despite recent improvements in deep neural networks and image classification, high-quality segmentation is essential to achieve accurate classification results. Still, automatic segmentation and extrication of touching and overlapping chromosomes are current problems. In the light of the above, this paper is intended to present an automatic segmentation and separation of G-band human chromosomes. we have tried to present an algorithm to overcome all the difficulties such as accurate thresholding, separation of touching and overlapping chromosomes. Unlike previous studies, we are also focusing on issues that may increase the segmentation quality beyond the separation of overlapping chromosomes. In this work, we present an end-to-end segmentation of chromosome images. This process includes noise removal and rejection of unwanted objects, separating fore and background, a binary watershed approach to divide intuitively and easily detectable clusters, finding a geodesic path between chromosomes in remaining clusters and finally disentangling of overlapped and complex clusters. We also built a user interface and let a little human intervention to detect unnoticed clusters. We have tested the proposed method on 145 chromosome images that contain 6678 chromosomes and 6532 (97.8%) of them have been correctly extracted.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124859829","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599374
Wen Wang, Weiguo Shen, Yaxin Sun, Bin Chen, Rong Zhu
Dimensionality reduction is an important processing step for pattern recognition. Designing a new optimization goal is a popular method to improve the effect of the dimensionality decrease method. In this paper, we noted that the distribution density of data was not considered in the most classifiers, which may have a negative impact on the classifier. To overcome the above problem, a new optimization goal is designed under the distribution density of the data. In this optimization goal, the sample with smaller density owns larger impact for the optimization result, and then the density of sample could be adjusted to nearly the same in the low dimensional space. The experiments performed verified the proposed method in terms of classification performance.
{"title":"Dimensionality reduction via adjusting data distribution density","authors":"Wen Wang, Weiguo Shen, Yaxin Sun, Bin Chen, Rong Zhu","doi":"10.1109/ICSAI.2018.8599374","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599374","url":null,"abstract":"Dimensionality reduction is an important processing step for pattern recognition. Designing a new optimization goal is a popular method to improve the effect of the dimensionality decrease method. In this paper, we noted that the distribution density of data was not considered in the most classifiers, which may have a negative impact on the classifier. To overcome the above problem, a new optimization goal is designed under the distribution density of the data. In this optimization goal, the sample with smaller density owns larger impact for the optimization result, and then the density of sample could be adjusted to nearly the same in the low dimensional space. The experiments performed verified the proposed method in terms of classification performance.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123578071","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599463
Ping Chen, Han Yu, Min Zhao, Jinshuang Wang
The root cause of cross-site scripting(XSS) attack is that the JavaScript engine can’t distinguish between the JavaScript code in Web application and the JavaScript code injected by attackers. Moving Target Defense (MTD) is a novel technique that aim to defeat attacks by frequently changing the system configuration so that attackers can’t catch the status of the system. This paper describes the design and implement of a XSS defense method based on Moving Target Defense technology. This method adds a random attribute to each unsafe element in Web application to distinguish between the JavaScript code in Web application and the JavaScript code injected by attackers and uses a security check function to verify the random attribute, if there is no random attribute or the random attribute value is not correct in a HTML (Hypertext Markup Language) element, the execution of JavaScript code will be prevented. The experiment results show that the method can effectively prevent XSS attacks and have little impact on the system performance.
{"title":"Research and Implementation of Cross-site Scripting Defense Method Based on Moving Target Defense Technology","authors":"Ping Chen, Han Yu, Min Zhao, Jinshuang Wang","doi":"10.1109/ICSAI.2018.8599463","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599463","url":null,"abstract":"The root cause of cross-site scripting(XSS) attack is that the JavaScript engine can’t distinguish between the JavaScript code in Web application and the JavaScript code injected by attackers. Moving Target Defense (MTD) is a novel technique that aim to defeat attacks by frequently changing the system configuration so that attackers can’t catch the status of the system. This paper describes the design and implement of a XSS defense method based on Moving Target Defense technology. This method adds a random attribute to each unsafe element in Web application to distinguish between the JavaScript code in Web application and the JavaScript code injected by attackers and uses a security check function to verify the random attribute, if there is no random attribute or the random attribute value is not correct in a HTML (Hypertext Markup Language) element, the execution of JavaScript code will be prevented. The experiment results show that the method can effectively prevent XSS attacks and have little impact on the system performance.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115504944","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599333
Yang Song, Lei Wang, Xinhe Zhang, Lei Ma, Xing Li
In view of the participation of integrated energy service providers in carbon emission trading, a bundled cooperative mechanism between integrated energy service providers and control enterprises is designed. With power generation enterprises as representatives, the cost efficiency of integrated energy service providers in bundled cooperation has been analyzed. The low-carbon comprehensive benefits of integrated energy service providers are defined by emission reduction profit, and a new type energy-saving project investment decision model with the aim of maximizing low-carbon comprehensive benefits is established. The case study verifies the promotion of the increase in the planning capacity of new energy-saving projects and the improvement of the profit of integrated energy service providers by carbon value. The differences in the bundled cooperation between integrated energy service providers and different types of power generation enterprises have been analyzed.
{"title":"Low-carbon Comprehensive Benefit Analysis of Integrated Energy Service Provider Under Bundled Cooperation Mode","authors":"Yang Song, Lei Wang, Xinhe Zhang, Lei Ma, Xing Li","doi":"10.1109/ICSAI.2018.8599333","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599333","url":null,"abstract":"In view of the participation of integrated energy service providers in carbon emission trading, a bundled cooperative mechanism between integrated energy service providers and control enterprises is designed. With power generation enterprises as representatives, the cost efficiency of integrated energy service providers in bundled cooperation has been analyzed. The low-carbon comprehensive benefits of integrated energy service providers are defined by emission reduction profit, and a new type energy-saving project investment decision model with the aim of maximizing low-carbon comprehensive benefits is established. The case study verifies the promotion of the increase in the planning capacity of new energy-saving projects and the improvement of the profit of integrated energy service providers by carbon value. The differences in the bundled cooperation between integrated energy service providers and different types of power generation enterprises have been analyzed.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"49 3-10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116528662","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}
Online reviews provide consumers with information about products and services that may affect their purchasing decisions. As such, the customer attitude in the reviews play a important role to product sales. In this study, new sentiment prediction method is presented to enhance the forecasting accuracy by utilizing review dual-sentiments and employing non- linear manifold dynamics algorithm. Not only this method can extract and separate the polarity sentiment factors from the content of each online review, but also can remove the seasonality of products and mix the different types’ data. Extensive experimental results validate the effectiveness of our proposed method.
{"title":"Predicting Sales Performance Based on Polarity Sentiments of Online Reviews and Manifold Dynamics Method","authors":"Zixin Dou, Yongjun Hu, Peng Cheng, Lijuan Huang, Jiuzhen Liang, Hailian Xiao","doi":"10.1109/ICSAI.2018.8599295","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599295","url":null,"abstract":"Online reviews provide consumers with information about products and services that may affect their purchasing decisions. As such, the customer attitude in the reviews play a important role to product sales. In this study, new sentiment prediction method is presented to enhance the forecasting accuracy by utilizing review dual-sentiments and employing non- linear manifold dynamics algorithm. Not only this method can extract and separate the polarity sentiment factors from the content of each online review, but also can remove the seasonality of products and mix the different types’ data. Extensive experimental results validate the effectiveness of our proposed method.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114410559","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 : 2018-11-01DOI: 10.1109/ICSAI.2018.8599321
S. Johnson, Lirong Zhang, Jun Zheng, Yuanchen Liu, Guorui Li, X. Wu, Kaimin Shen
Desktop flexibility and security is an important requirement for the operation, management and maintenance of desktop technology in Colleges and universities, which directly reflects the quality and level of information construction in Colleges and universities. By analyzing the effectiveness of traditional desktop technology, this paper clarifies the special performance requirements of desktop technology in art and design colleges and universities, designs a desktop component centralized management mode based on virtualization technology, and constructs a virtual desktop based on FlexPod architecture using vGPU technology. Application platform. The application of this platform greatly reduces the complexity of IT management on the basis of improving desktop performance, and provides a reference model for the application of virtualized desktop technology in national art and design colleges.
{"title":"Application Research on Virtualized Desktop Technology in Private Colleges and Universities of Art and Design","authors":"S. Johnson, Lirong Zhang, Jun Zheng, Yuanchen Liu, Guorui Li, X. Wu, Kaimin Shen","doi":"10.1109/ICSAI.2018.8599321","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599321","url":null,"abstract":"Desktop flexibility and security is an important requirement for the operation, management and maintenance of desktop technology in Colleges and universities, which directly reflects the quality and level of information construction in Colleges and universities. By analyzing the effectiveness of traditional desktop technology, this paper clarifies the special performance requirements of desktop technology in art and design colleges and universities, designs a desktop component centralized management mode based on virtualization technology, and constructs a virtual desktop based on FlexPod architecture using vGPU technology. Application platform. The application of this platform greatly reduces the complexity of IT management on the basis of improving desktop performance, and provides a reference model for the application of virtualized desktop technology in national art and design colleges.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128281467","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
扫码关注我们
求助内容：
应助结果提醒方式：