Pub Date : 2010-06-07DOI: 10.1109/ICNDS.2010.5479313
Nian Liu, Yajian Zhou, Xinxin Niu, Yixian Yang
There has been increasing concern about Databaseas-a-Service(DAS) architectures. In the DAS model, the conventional scheme for query over encrypted data in database is to construct efficient index in database. This can ensure query efficiency. However, the fuzzy search is often used in the query of character data. It will be very tough owing to data encryption. Even the tiny changes of plaintext, the ciphtext will be quite distinct. Therefore, it is crucial to construct efficient index of encrypted character strings. To address these problems, a cryptographic scheme of character data in relational database is proposed in this paper. In this scheme, the char or varchar data type and clob data type will be considered respectively. For the data of char or varchar type, an index based double filtration is established. The index includes two parts: the first part of index is used to determine the set of existed characters in original string, and the second part stores the characteristic value of the characters' positions. The first part of index implements the first filtration, which will filter all the records include inaccurate characters. The second part of index is used to verify the positions of character strings. It's the second filtration. For the data of clob type, instead of the original character data, the positions of all the character strings will be stored. This scheme avoids needless decryption and data transfer. Consequently, better query efficiency is achieved and fuzzy search is well supported.
{"title":"Querying encrypted character data in DAS model","authors":"Nian Liu, Yajian Zhou, Xinxin Niu, Yixian Yang","doi":"10.1109/ICNDS.2010.5479313","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479313","url":null,"abstract":"There has been increasing concern about Databaseas-a-Service(DAS) architectures. In the DAS model, the conventional scheme for query over encrypted data in database is to construct efficient index in database. This can ensure query efficiency. However, the fuzzy search is often used in the query of character data. It will be very tough owing to data encryption. Even the tiny changes of plaintext, the ciphtext will be quite distinct. Therefore, it is crucial to construct efficient index of encrypted character strings. To address these problems, a cryptographic scheme of character data in relational database is proposed in this paper. In this scheme, the char or varchar data type and clob data type will be considered respectively. For the data of char or varchar type, an index based double filtration is established. The index includes two parts: the first part of index is used to determine the set of existed characters in original string, and the second part stores the characteristic value of the characters' positions. The first part of index implements the first filtration, which will filter all the records include inaccurate characters. The second part of index is used to verify the positions of character strings. It's the second filtration. For the data of clob type, instead of the original character data, the positions of all the character strings will be stored. This scheme avoids needless decryption and data transfer. Consequently, better query efficiency is achieved and fuzzy search is well supported.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131908650","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 : 2010-06-07DOI: 10.1109/ICNDS.2010.5479281
Li Zhao
The E-marketing model in China adopts the international generic model, which develops from WAN into the LAN. This model requires complete support systems, such as modern logistics distribution system, sound credit system and online settlement system. But these systems in China don't satisfy this demand. This paper addresses this problem and proposes a community-based E-marketing model. The model includes three development phases, i.e. establishing independent e-business community based on LAN, setting up e-business network based on MAN, establishing e-business network based on WAN. This model can solve the problems of current e-marketing and drive e-marketing development rapidly.
{"title":"Study on e-marketing model based on resident community","authors":"Li Zhao","doi":"10.1109/ICNDS.2010.5479281","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479281","url":null,"abstract":"The E-marketing model in China adopts the international generic model, which develops from WAN into the LAN. This model requires complete support systems, such as modern logistics distribution system, sound credit system and online settlement system. But these systems in China don't satisfy this demand. This paper addresses this problem and proposes a community-based E-marketing model. The model includes three development phases, i.e. establishing independent e-business community based on LAN, setting up e-business network based on MAN, establishing e-business network based on WAN. This model can solve the problems of current e-marketing and drive e-marketing development rapidly.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126307685","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 : 2010-06-07DOI: 10.1109/ICNDS.2010.5479155
Ren-Jye Liu, D. Niu
In recent years, the rapid development of trusted computing with active defense ideas to solve security problem of computer and network system, and trusted computing is believed to be the most likely fundamentally solve the security of computer system. This paper puts forward an application scheme of trusted computing platform being used in electric power information system. According to security requirements of electric power information system, it designs a method of constructing dynamic trust chain based on system management mode (SMM), and makes dynamic measurement to system program and key application, in order to ensure operating system environment integrity and trusty, effectively defenses against malicious code, make great efforts to enhance power information system security defense capabilities.
{"title":"Application research of trusted computing platform in electric power information system","authors":"Ren-Jye Liu, D. Niu","doi":"10.1109/ICNDS.2010.5479155","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479155","url":null,"abstract":"In recent years, the rapid development of trusted computing with active defense ideas to solve security problem of computer and network system, and trusted computing is believed to be the most likely fundamentally solve the security of computer system. This paper puts forward an application scheme of trusted computing platform being used in electric power information system. According to security requirements of electric power information system, it designs a method of constructing dynamic trust chain based on system management mode (SMM), and makes dynamic measurement to system program and key application, in order to ensure operating system environment integrity and trusty, effectively defenses against malicious code, make great efforts to enhance power information system security defense capabilities.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132179914","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 : 2010-05-30DOI: 10.1109/ICNDS.2010.5479353
Li Zhang, Bo Liu
In this paper, we propose the application of gray Markov model for forecasting methods, and amend with the smooth ratio the historical data, establish the GM (1,1) model . By determining the coefficients to obtain the development series of the future road passenger traffic amount, and by combining the Markov chain process, to classify the random sequence status into three categories, by determining the status transfer matrix, we predict the road passenger traffic amount in 5 years. The theoretical analysis and practical application show that the prediction is more reliable using this method. We can manage the development of passenger traffic, which helps the administration to make decisions.
{"title":"Highway passenger traffic volume research based on gray - Markov prediction model","authors":"Li Zhang, Bo Liu","doi":"10.1109/ICNDS.2010.5479353","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479353","url":null,"abstract":"In this paper, we propose the application of gray Markov model for forecasting methods, and amend with the smooth ratio the historical data, establish the GM (1,1) model . By determining the coefficients to obtain the development series of the future road passenger traffic amount, and by combining the Markov chain process, to classify the random sequence status into three categories, by determining the status transfer matrix, we predict the road passenger traffic amount in 5 years. The theoretical analysis and practical application show that the prediction is more reliable using this method. We can manage the development of passenger traffic, which helps the administration to make decisions.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117047149","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}
Traditional performance analysis aiming at OMC performance data mainly focuses on two aspects: longitudinal comparison of the same network element in different time periods and horizontal comparison of the different network elements in the same time. It's lack of association analysis between performance indexes and in-depth data mining. In this paper, a network performance analysis approach based on correlation analysis and regression analysis is presented which focusing on solving the difficult problem that general diagnosis algorithms can hardly build for CDMA network optimization. Based on the characteristic of performance indexes, the statistical method was introduced to performance optimization. The correlation coefficients and degree of curve fitting were proposed to measure the related degree between performance indexes, which is the foundation of fault diagnosis for engineers. With the practical application to the network optimization, it's proved that the statistical analysis is a novel and efficient tool for performance optimization and fault diagnosis.
{"title":"Performance analysis for a CDMA network based on statistical algorithms","authors":"Cen Lu, Cuibo Yu, Xiaohua Zhang, Lihua Mu, Tingting Xu","doi":"10.1109/ICNDS.2010.5479421","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479421","url":null,"abstract":"Traditional performance analysis aiming at OMC performance data mainly focuses on two aspects: longitudinal comparison of the same network element in different time periods and horizontal comparison of the different network elements in the same time. It's lack of association analysis between performance indexes and in-depth data mining. In this paper, a network performance analysis approach based on correlation analysis and regression analysis is presented which focusing on solving the difficult problem that general diagnosis algorithms can hardly build for CDMA network optimization. Based on the characteristic of performance indexes, the statistical method was introduced to performance optimization. The correlation coefficients and degree of curve fitting were proposed to measure the related degree between performance indexes, which is the foundation of fault diagnosis for engineers. With the practical application to the network optimization, it's proved that the statistical analysis is a novel and efficient tool for performance optimization and fault diagnosis.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127180768","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 : 2010-05-30DOI: 10.1109/ICNDS.2010.5479607
Xiaoming Bai, Chengzhang Wang
Color face is composed of information of different channels and provides more cues for recognition than grey scale one. A revised NMF with LDA based color face recognition approach is proposed in this paper. Block diagonal matrix is exploited to encode color information of different channels. And block diagonal constraint is imposed on NMF to factorize matrix. Class information of face samples is integrated into the approach through LDA on factorization coefficients. Experimental results on CVL and CMU PIE databases verify the effectiveness of the proposed approach.
{"title":"Revised NMF with LDA based color face recognition","authors":"Xiaoming Bai, Chengzhang Wang","doi":"10.1109/ICNDS.2010.5479607","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479607","url":null,"abstract":"Color face is composed of information of different channels and provides more cues for recognition than grey scale one. A revised NMF with LDA based color face recognition approach is proposed in this paper. Block diagonal matrix is exploited to encode color information of different channels. And block diagonal constraint is imposed on NMF to factorize matrix. Class information of face samples is integrated into the approach through LDA on factorization coefficients. Experimental results on CVL and CMU PIE databases verify the effectiveness of the proposed approach.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125034672","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 : 2010-05-30DOI: 10.1109/ICNDS.2010.5479333
Wang Xueyuan
According to the design procedure of fault self-diagnosis system and features of automatic transmission system, the list of relation and mapping between fault symptoms and fault causes are made in this paper. Applying the approach of fault self-diagnosis based on fuzzy neural network, fault diagnosis of the automatic transmission electronic control system is realized. The structure of fuzzy neural network and its corresponding learning method and pretreating strategy about the training samples are introduced in this paper. Using MATLAB as simulation platform, this fault diagnosis method is simulated with neural networks toolbox. The simulation results show that this fault diagnosis approach is effective and applied.
{"title":"Fault self-diagnosis system of automatic transmission based on fuzzy BP network","authors":"Wang Xueyuan","doi":"10.1109/ICNDS.2010.5479333","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479333","url":null,"abstract":"According to the design procedure of fault self-diagnosis system and features of automatic transmission system, the list of relation and mapping between fault symptoms and fault causes are made in this paper. Applying the approach of fault self-diagnosis based on fuzzy neural network, fault diagnosis of the automatic transmission electronic control system is realized. The structure of fuzzy neural network and its corresponding learning method and pretreating strategy about the training samples are introduced in this paper. Using MATLAB as simulation platform, this fault diagnosis method is simulated with neural networks toolbox. The simulation results show that this fault diagnosis approach is effective and applied.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123664260","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 : 2010-05-30DOI: 10.1109/ICNDS.2010.5479332
Bai Peiwen
Due to information asymmetries good firms or bad firms all finance and invest under some conditions, who prefer equity to debt financing when the NPV of a project is enough low, and prefer debt to equity financing when the NPV of the project is enough high. Financing produces the firms' overinvestment or underinvestment, the probability of which is affected by factors. In special, if the firms only issue debt, then they can avoid overinvestment or underinvestment. Firm assets-in-place and the true NPV of the project being transparent may avoid overinvestment or underinvestment. Furthermore consider dynamic stock financing, it is discovered there are many equilibria in stock financing and distorted investment which are related with different information asymmetries.
{"title":"Information asymmetries, financing and distorted investment","authors":"Bai Peiwen","doi":"10.1109/ICNDS.2010.5479332","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479332","url":null,"abstract":"Due to information asymmetries good firms or bad firms all finance and invest under some conditions, who prefer equity to debt financing when the NPV of a project is enough low, and prefer debt to equity financing when the NPV of the project is enough high. Financing produces the firms' overinvestment or underinvestment, the probability of which is affected by factors. In special, if the firms only issue debt, then they can avoid overinvestment or underinvestment. Firm assets-in-place and the true NPV of the project being transparent may avoid overinvestment or underinvestment. Furthermore consider dynamic stock financing, it is discovered there are many equilibria in stock financing and distorted investment which are related with different information asymmetries.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125473235","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 : 2010-05-30DOI: 10.1109/ICNDS.2010.5479266
Jianhong Zhang, Hua Chen
Proxy signature is an important delegation technique. Since it was introduced in 1996, many variants of proxy signature schemes have been proposed. Among of them, the requirement of proxy signer's privacy protection and the revocation of proxy signer's anonymous identity are needful in some practical applications. Recently, Wang et.al gave a new signature type: proxy ring signature with revocable anonymity. It allows that proxy signer anonymously produces a proxy signature. However, it is anonymous for the others except that the original signer can know exactly who is the actual proxy signer. Unfortunately, in this paper, by analyzing the scheme, we show that the scheme does not satisfy anonymity, that is to say, given an anonymous proxy signature, the others also can know the actual identity of proxy signer beside original signer. At the same time, it cannot also revoke anonymity of proxy signer's identity. Finally, we give the corresponding attacks on the scheme and the reasons to produce suck attacks.
{"title":"Breaking a proxy ring signature with revocable anonymity in MINE2009","authors":"Jianhong Zhang, Hua Chen","doi":"10.1109/ICNDS.2010.5479266","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479266","url":null,"abstract":"Proxy signature is an important delegation technique. Since it was introduced in 1996, many variants of proxy signature schemes have been proposed. Among of them, the requirement of proxy signer's privacy protection and the revocation of proxy signer's anonymous identity are needful in some practical applications. Recently, Wang et.al gave a new signature type: proxy ring signature with revocable anonymity. It allows that proxy signer anonymously produces a proxy signature. However, it is anonymous for the others except that the original signer can know exactly who is the actual proxy signer. Unfortunately, in this paper, by analyzing the scheme, we show that the scheme does not satisfy anonymity, that is to say, given an anonymous proxy signature, the others also can know the actual identity of proxy signer beside original signer. At the same time, it cannot also revoke anonymity of proxy signer's identity. Finally, we give the corresponding attacks on the scheme and the reasons to produce suck attacks.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743132","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 : 2010-05-30DOI: 10.1109/ICNDS.2010.5479387
Guo Peng, Hu Jun-da, Hu Hui
Data broadcasting is an important technology to improve the retractility of mobile computation system in unsymmetrical network. In the paper, a kind of multi-disk broadcasting dispatching technology is presented based on hyper graph, which can determine the amount of disks, the contribution of data items to each disks and their relative frequency by computer. The theoretical analysis and experiment results indicate that the method can greatly improve the average visiting time of data item .
{"title":"Dynamic data broadcasting dispatching technology based on hyper graph in unsymmetrical network","authors":"Guo Peng, Hu Jun-da, Hu Hui","doi":"10.1109/ICNDS.2010.5479387","DOIUrl":"https://doi.org/10.1109/ICNDS.2010.5479387","url":null,"abstract":"Data broadcasting is an important technology to improve the retractility of mobile computation system in unsymmetrical network. In the paper, a kind of multi-disk broadcasting dispatching technology is presented based on hyper graph, which can determine the amount of disks, the contribution of data items to each disks and their relative frequency by computer. The theoretical analysis and experiment results indicate that the method can greatly improve the average visiting time of data item .","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"442 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122788555","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
扫码关注我们
求助内容：
应助结果提醒方式：