Pub Date : 2017-11-01DOI: 10.1109/ICSESS.2017.8342935
P. Guo, Q. Gao
Most of the existing studies for plant identification focus on identifying the plants with pictures of a single organ, such as leaf or flower. The information provided by single organ is always limited and sometimes confused. A new identification method, Multi-Organ Integrated PlantNet, is proposed in this paper which combines the diverse information of multiple organs. The method consists of two stages. Firstly, we use the framework of convolutional neural networks (CNN) to make the preliminary plant decision based on single organ. Then we make the final plant decision based on multiple organs using Linear Weighted Classification and Support Vector Machine (SVM). The experiments conducted on the dataset of 100 species show that our new method improve the identification accuracy by about 15% compared with the Single Organ PlantNet.
{"title":"A multi-organ plant identification method using convolutional neural networks","authors":"P. Guo, Q. Gao","doi":"10.1109/ICSESS.2017.8342935","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342935","url":null,"abstract":"Most of the existing studies for plant identification focus on identifying the plants with pictures of a single organ, such as leaf or flower. The information provided by single organ is always limited and sometimes confused. A new identification method, Multi-Organ Integrated PlantNet, is proposed in this paper which combines the diverse information of multiple organs. The method consists of two stages. Firstly, we use the framework of convolutional neural networks (CNN) to make the preliminary plant decision based on single organ. Then we make the final plant decision based on multiple organs using Linear Weighted Classification and Support Vector Machine (SVM). The experiments conducted on the dataset of 100 species show that our new method improve the identification accuracy by about 15% compared with the Single Organ PlantNet.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123052674","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343040
Xu Yamei, Panpan Du
Handwritten Uighur characters contain a lot of small and random writing strokes, which make character recognition more complicated. For 128 Uighur characters, an efficient offline handwriting recognition algorithm based on grapheme (part of a character) analysis is proposed in this paper. Firstly, by dot stroke detection and component analysis, 128 character models are established by decomposing the Uighur characters as three type graphemes: dot, affix and main graphemes. Secondly, the Uighur characters are pre-classified into 12 subclasses through their grapheme compositions. Finally, different classifiers are designed for various types of graphemes. With the fusion coefficients of graphemes estimated, the character recognition result is given by fusing the graphemes classification outputs using the weighted naive Bayesian algorithm. Experimental results show that the algorithm can effectively identify the 128 unconstrained handwritten Uyghur characters.
{"title":"Offline handwritten Uighur character recognition based on grapheme analysis","authors":"Xu Yamei, Panpan Du","doi":"10.1109/ICSESS.2017.8343040","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343040","url":null,"abstract":"Handwritten Uighur characters contain a lot of small and random writing strokes, which make character recognition more complicated. For 128 Uighur characters, an efficient offline handwriting recognition algorithm based on grapheme (part of a character) analysis is proposed in this paper. Firstly, by dot stroke detection and component analysis, 128 character models are established by decomposing the Uighur characters as three type graphemes: dot, affix and main graphemes. Secondly, the Uighur characters are pre-classified into 12 subclasses through their grapheme compositions. Finally, different classifiers are designed for various types of graphemes. With the fusion coefficients of graphemes estimated, the character recognition result is given by fusing the graphemes classification outputs using the weighted naive Bayesian algorithm. Experimental results show that the algorithm can effectively identify the 128 unconstrained handwritten Uyghur characters.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124558114","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342890
Xuqin Yan, Yanqiang Li, Xiaowei Li
Modeling and simulation is becoming one of the most powerful techniques in the development of modern automotive systems. UPPAAL, as a toolbox for modeling, simulation and verification of real-time systems, has by now reached a state, where they are mature enough for application on a number of case-studies in real-time controllers and real-time communication protocols. However the simulation of UPPAAL is not really real-time. In this paper we explore an approach for real-time simulation of the UPPAAL model. We represent an UPPAAL model to C++ code. Based on a transformed UPPAAL model, real-time simulation can be taken. The approach can be used to real-time simulating an UPPAAL model, and many works can be done based on the transformed UPPAAL model.
{"title":"Real-time simulation of automotive systems based on UPPAAL","authors":"Xuqin Yan, Yanqiang Li, Xiaowei Li","doi":"10.1109/ICSESS.2017.8342890","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342890","url":null,"abstract":"Modeling and simulation is becoming one of the most powerful techniques in the development of modern automotive systems. UPPAAL, as a toolbox for modeling, simulation and verification of real-time systems, has by now reached a state, where they are mature enough for application on a number of case-studies in real-time controllers and real-time communication protocols. However the simulation of UPPAAL is not really real-time. In this paper we explore an approach for real-time simulation of the UPPAAL model. We represent an UPPAAL model to C++ code. Based on a transformed UPPAAL model, real-time simulation can be taken. The approach can be used to real-time simulating an UPPAAL model, and many works can be done based on the transformed UPPAAL model.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121311466","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342950
Peng Li
Object-Relational Mapping (ORM) is often used between tiers in a Web-based system to automate the persistence of data to secondary storage. ORMs work by transparently providing developers with an object-oriented representation of some view of the tables in a database. Although the ORM approach is beneficial, it is not easy for a developer to integrate push-style development into object-relational model. In this project, we investigate an event-driven style of programming where developers could register for notification of updates to specific properties of ORM mapped objects. A key challenge in this context is maintaining consistency between the state of the objects of the ORM and the high-level event registration abstractions exposed to programmers. We use a running example from the RubiS web application benchmark example as evaluation to demonstrate the performance implications of the approach.
{"title":"Object-Relational event (ORE) middleware for push-based content delivery from the application tier","authors":"Peng Li","doi":"10.1109/ICSESS.2017.8342950","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342950","url":null,"abstract":"Object-Relational Mapping (ORM) is often used between tiers in a Web-based system to automate the persistence of data to secondary storage. ORMs work by transparently providing developers with an object-oriented representation of some view of the tables in a database. Although the ORM approach is beneficial, it is not easy for a developer to integrate push-style development into object-relational model. In this project, we investigate an event-driven style of programming where developers could register for notification of updates to specific properties of ORM mapped objects. A key challenge in this context is maintaining consistency between the state of the objects of the ORM and the high-level event registration abstractions exposed to programmers. We use a running example from the RubiS web application benchmark example as evaluation to demonstrate the performance implications of the approach.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128461887","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343030
Zhu Weiwei, Zhang Xu, Jin Xin, Li Xing, Chen Yitong, Sun Yi, Lin Bin
The power industry is an important energy pillar industry in the country and is the basis of our daily work and life. Power communication network is a special communication network in the power system, carrying all the power production and management business. The normal operation of the power communication network is related to the safety and stability of the whole power grid. With the power communications network business continues to increase, the performance requirements of data transmission also increasing. Power fiber is a key part of the power communication network, reliability and stability of the entire power grid has an important impact. Relying on manual processing of communication network resources and the implementation of dynamic management, has been unable to adapt to line equipment, large variety, rapid changes, complex management and so on. Once the power fiber failure, it will cause communication interruption, especially the relay protection business interruption, may cause power grid accidents, resulting in significant losses. In order to reduce the risk of fiber failure, optical network survivability mechanism has been widely concerned and studied. Based on the existing optical fiber transmission technology and power line carrier technology, this paper proposes a two-layer communication network and establishes an inter-layer coordination mechanism to enhance the survivability of the optical fiber transmission network so that the communication service can get better after the fiber failure The recovery effect.
{"title":"Research on multi-layer survivability inter-level coordination planning of power communication network","authors":"Zhu Weiwei, Zhang Xu, Jin Xin, Li Xing, Chen Yitong, Sun Yi, Lin Bin","doi":"10.1109/ICSESS.2017.8343030","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343030","url":null,"abstract":"The power industry is an important energy pillar industry in the country and is the basis of our daily work and life. Power communication network is a special communication network in the power system, carrying all the power production and management business. The normal operation of the power communication network is related to the safety and stability of the whole power grid. With the power communications network business continues to increase, the performance requirements of data transmission also increasing. Power fiber is a key part of the power communication network, reliability and stability of the entire power grid has an important impact. Relying on manual processing of communication network resources and the implementation of dynamic management, has been unable to adapt to line equipment, large variety, rapid changes, complex management and so on. Once the power fiber failure, it will cause communication interruption, especially the relay protection business interruption, may cause power grid accidents, resulting in significant losses. In order to reduce the risk of fiber failure, optical network survivability mechanism has been widely concerned and studied. Based on the existing optical fiber transmission technology and power line carrier technology, this paper proposes a two-layer communication network and establishes an inter-layer coordination mechanism to enhance the survivability of the optical fiber transmission network so that the communication service can get better after the fiber failure The recovery effect.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129273392","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342901
Ze Zhang, Yongjun Shen, Guidong Zhang, Yongqiang Song, Yan Zhu
Stock price is one of intricate non-linear dynamic system. Typically, Elman neural network is a local recurrent neural network, having one context layer that memorizes the past states, which is quite fit for resolving time series issues. Given this, this paper takes Elman network to predict the opening price of stock market. Considering that Elman network is limited, this paper adopts self-adapting variant PSO algorithm to optimize the weights and thresholds of network. Afterwards, the optimized data, regarded as initial weight and threshold value, is given to Elman network for training, accordingly the prediction model for opening price of stock market based on self-adapting variant PSO-Elman network is formed. Finally, this paper verifies that model by some stock prices, and compares with BP network and Elman network, so as to draw the result that shows the precision and stability of this predication model both are superior to the traditional neural network.
{"title":"Short-term prediction for opening price of stock market based on self-adapting variant PSO-Elman neural network","authors":"Ze Zhang, Yongjun Shen, Guidong Zhang, Yongqiang Song, Yan Zhu","doi":"10.1109/ICSESS.2017.8342901","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342901","url":null,"abstract":"Stock price is one of intricate non-linear dynamic system. Typically, Elman neural network is a local recurrent neural network, having one context layer that memorizes the past states, which is quite fit for resolving time series issues. Given this, this paper takes Elman network to predict the opening price of stock market. Considering that Elman network is limited, this paper adopts self-adapting variant PSO algorithm to optimize the weights and thresholds of network. Afterwards, the optimized data, regarded as initial weight and threshold value, is given to Elman network for training, accordingly the prediction model for opening price of stock market based on self-adapting variant PSO-Elman network is formed. Finally, this paper verifies that model by some stock prices, and compares with BP network and Elman network, so as to draw the result that shows the precision and stability of this predication model both are superior to the traditional neural network.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115884405","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343039
Z. Xiaoxue, Z. Mengmeng, Liu Gang
As an important part of the optimization design of military information system architecture, service optimization design plays a key role in the optimization design of military information system architecture. Based on the relationship among the service data in the data meta-model, this paper studied the content of service optimization design in military information system architecture, and analyzed the optimization design of combat activities to service, including service discovery, services flow generation and service composition optimization problem. Then established the model of the optimal design problem of service process generation. Finally, the solution to the problem of service process generation is put forward.
{"title":"Research on service optimization design of military information system architecture","authors":"Z. Xiaoxue, Z. Mengmeng, Liu Gang","doi":"10.1109/ICSESS.2017.8343039","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343039","url":null,"abstract":"As an important part of the optimization design of military information system architecture, service optimization design plays a key role in the optimization design of military information system architecture. Based on the relationship among the service data in the data meta-model, this paper studied the content of service optimization design in military information system architecture, and analyzed the optimization design of combat activities to service, including service discovery, services flow generation and service composition optimization problem. Then established the model of the optimal design problem of service process generation. Finally, the solution to the problem of service process generation is put forward.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310891","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343059
O. Clement, Zhili Chen, Hui Zhang
Breast cancer is especially a concern in woman and it is one of the most leading causes of death among woman in the world. The adoption of classical statistical modeling techniques has standardized computer vision in last few years. For better recognition information, most recognition algorithms depend on careful positioning of an object into a canonical pose, so that we can have meaningful information examined. Currently, a new statistical-theoretic approach is presented for finding the alignment (using entropy minimization with brightness transformation) of mammographic images of differing patients in this paper. Registration is achieved by adjusting the relative position and orientation until the sum of the pixel-stack entropies is minimized. Segmentation analysis of digital or digitized mammographic images was firstly carried out on mammographic images of left and right breast images for 161 patients, obtained from Mammographic Image Analysis Society (MIAS) database. Given a set of unaligned exemplars of a class, such as breast, we applied an automatically built alignment mechanism, no additional labeling of parts or poses in the dataset. Using this alignment mechanism, new members of the class, such as an unseen mammographic image from a new patient, can be precisely aligned for the recognition process. Our alignment method can improve the performance on a breast abnormality recognition task, both over unaligned images and over images aligned with the proposed alignment algorithm.
{"title":"Group-wise mammographie image alignment based on entropy minimization","authors":"O. Clement, Zhili Chen, Hui Zhang","doi":"10.1109/ICSESS.2017.8343059","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343059","url":null,"abstract":"Breast cancer is especially a concern in woman and it is one of the most leading causes of death among woman in the world. The adoption of classical statistical modeling techniques has standardized computer vision in last few years. For better recognition information, most recognition algorithms depend on careful positioning of an object into a canonical pose, so that we can have meaningful information examined. Currently, a new statistical-theoretic approach is presented for finding the alignment (using entropy minimization with brightness transformation) of mammographic images of differing patients in this paper. Registration is achieved by adjusting the relative position and orientation until the sum of the pixel-stack entropies is minimized. Segmentation analysis of digital or digitized mammographic images was firstly carried out on mammographic images of left and right breast images for 161 patients, obtained from Mammographic Image Analysis Society (MIAS) database. Given a set of unaligned exemplars of a class, such as breast, we applied an automatically built alignment mechanism, no additional labeling of parts or poses in the dataset. Using this alignment mechanism, new members of the class, such as an unseen mammographic image from a new patient, can be precisely aligned for the recognition process. Our alignment method can improve the performance on a breast abnormality recognition task, both over unaligned images and over images aligned with the proposed alignment algorithm.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116701306","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342911
R. M. N. Deelaka Ranasinghe, G. Yu
This paper introduces an innovative concept design of a devise that functions as a RFID or NFC tag with fingerprint authentication. Meaning that input/output of a RF signal occurs only after the fingerprint of the user is verified. The NFC/RFID device with fingerprint authentication contains additional properties including storage for multiple NFC/RFID cards with different functions, data encryption, isolated system with no back doors, making the device secure from security threats such as hacking hardware or software, malware, third party storage of personal information, theft, data corruption and manipulation, etc. This device can open doors into new innovative concepts such as fully digital wallets, identification cards and passports etc. There for this device has the potential of opening a new page in RFID and NFC application.
{"title":"RFID/NFC device with embedded fingerprint authentication system","authors":"R. M. N. Deelaka Ranasinghe, G. Yu","doi":"10.1109/ICSESS.2017.8342911","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342911","url":null,"abstract":"This paper introduces an innovative concept design of a devise that functions as a RFID or NFC tag with fingerprint authentication. Meaning that input/output of a RF signal occurs only after the fingerprint of the user is verified. The NFC/RFID device with fingerprint authentication contains additional properties including storage for multiple NFC/RFID cards with different functions, data encryption, isolated system with no back doors, making the device secure from security threats such as hacking hardware or software, malware, third party storage of personal information, theft, data corruption and manipulation, etc. This device can open doors into new innovative concepts such as fully digital wallets, identification cards and passports etc. There for this device has the potential of opening a new page in RFID and NFC application.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117081862","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343044
Leqiang Bai, Guoku Li, H. Zhu
For the problem that the existing source-location privacy protection algorithms have lower safety periods, source-location privacy protection algorithm based on linear directional phantom source node is proposed. The algorithm establishes a linear equation with coordinates of node, determines direction of transmission path by linear equation, determines random walk hops by random function, determines phantom source by random selection of nodes. Finally, the data will be transmitted to sink node by phantom source node. The experimental results show that the algorithm can enhance the safety period and protect source location privacy effectively compared with the existing source location privacy protection algorithms. Even if source node is close to sink node, the algorithm can still increase safety period effectively.
{"title":"Privacy protection algorithm based on linear directional phantom source node in WSN","authors":"Leqiang Bai, Guoku Li, H. Zhu","doi":"10.1109/ICSESS.2017.8343044","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343044","url":null,"abstract":"For the problem that the existing source-location privacy protection algorithms have lower safety periods, source-location privacy protection algorithm based on linear directional phantom source node is proposed. The algorithm establishes a linear equation with coordinates of node, determines direction of transmission path by linear equation, determines random walk hops by random function, determines phantom source by random selection of nodes. Finally, the data will be transmitted to sink node by phantom source node. The experimental results show that the algorithm can enhance the safety period and protect source location privacy effectively compared with the existing source location privacy protection algorithms. Even if source node is close to sink node, the algorithm can still increase safety period effectively.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115775283","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
扫码关注我们
求助内容：
应助结果提醒方式：