Pub Date : 2014-06-27DOI: 10.1109/ICSESS.2014.6933776
Z. Chen, Chenhao Mu, Fan Xu
Embedded zero-tree wavelet (EZW) is a kind of image compression algorithm which provides high compression rates fast. In order to improve the quality of reconstructed image after decoding, in this research, we put forward an improvement of embedded zerotree wavelet coding and simulate this new algorithm. This method takes full advantages of the Compressed Sensing (CS) theory and EZW. Simulation results demonstrated that the proposed method improved the quality of the unzipped image significantly.
{"title":"An improvement of embedded zerotree wavelet coding based on compressed sensing","authors":"Z. Chen, Chenhao Mu, Fan Xu","doi":"10.1109/ICSESS.2014.6933776","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933776","url":null,"abstract":"Embedded zero-tree wavelet (EZW) is a kind of image compression algorithm which provides high compression rates fast. In order to improve the quality of reconstructed image after decoding, in this research, we put forward an improvement of embedded zerotree wavelet coding and simulate this new algorithm. This method takes full advantages of the Compressed Sensing (CS) theory and EZW. Simulation results demonstrated that the proposed method improved the quality of the unzipped image significantly.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"56 ","pages":"1177-1180"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91452463","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933628
Kehe Wu, Li Hua, Xiaoxiang Wang, Xuewei Ding
For the information system, Database acts an important role in it. How to find a way to audit the operation of the database is becoming more and more important. An effective database auditing system can not only reduce the potential security risk, also make it possible to trace the source when errors happen. In this paper, we design and implement an effective audit framework. To avoid causing any database performance delays, bypass mode is especially useful for the auditing system. Compared with the traditional audit system, our approach has more advantages for example using zero-copy to acquire and reorganize data. In addition, we have a flexible policy to audit more effectively.
{"title":"The design and implementation of database audit system framework","authors":"Kehe Wu, Li Hua, Xiaoxiang Wang, Xuewei Ding","doi":"10.1109/ICSESS.2014.6933628","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933628","url":null,"abstract":"For the information system, Database acts an important role in it. How to find a way to audit the operation of the database is becoming more and more important. An effective database auditing system can not only reduce the potential security risk, also make it possible to trace the source when errors happen. In this paper, we design and implement an effective audit framework. To avoid causing any database performance delays, bypass mode is especially useful for the auditing system. Compared with the traditional audit system, our approach has more advantages for example using zero-copy to acquire and reorganize data. In addition, we have a flexible policy to audit more effectively.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"5 1","pages":"553-556"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87338475","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933732
Zhengwei Ma, Xu-Wen Sun, Mei Yang, Kan Li, F. Long
According to the fact that the decision-making of surface vessels is more and more complicated, based on the military process of decision-making of surface vessels, using soft engineering, from the view of system science, this article expounds the complexity of the command architecture and decision-making of surface vessels, then analyzes the process of consultation decision, at last, it establishes the architecture of shipboard decision-making model based on the distributed consultation decision,. It is very useful not only for furthering the theoretical system of shipboard decision-making, but also for the research on warfare software.
{"title":"Research on architecture of surface vessels decision-making model system based on distributed consultation decision","authors":"Zhengwei Ma, Xu-Wen Sun, Mei Yang, Kan Li, F. Long","doi":"10.1109/ICSESS.2014.6933732","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933732","url":null,"abstract":"According to the fact that the decision-making of surface vessels is more and more complicated, based on the military process of decision-making of surface vessels, using soft engineering, from the view of system science, this article expounds the complexity of the command architecture and decision-making of surface vessels, then analyzes the process of consultation decision, at last, it establishes the architecture of shipboard decision-making model based on the distributed consultation decision,. It is very useful not only for furthering the theoretical system of shipboard decision-making, but also for the research on warfare software.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"32 1","pages":"992-995"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91169841","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933624
Fang Yutao, Guiping Su
In this paper, based on researches and analysis for some common testing methods of randomness, a new testing method for randomness was proposed. This new method applied theories on kolmogorov complexity and wavelet transform to the randomness testing. This new method can be used to evaluate quality of random sequences generators and security of encryption algorithms.
{"title":"A new testing method of randomness for true random sequences","authors":"Fang Yutao, Guiping Su","doi":"10.1109/ICSESS.2014.6933624","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933624","url":null,"abstract":"In this paper, based on researches and analysis for some common testing methods of randomness, a new testing method for randomness was proposed. This new method applied theories on kolmogorov complexity and wavelet transform to the randomness testing. This new method can be used to evaluate quality of random sequences generators and security of encryption algorithms.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"67 1","pages":"537-540"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73347774","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933527
Huijuan Zhang, Chao Meng
Nowadays researches related to resource management and representation of IoT (Internet of Things) emphasize on making identify regulation or describing device working principle. However they could not represent dynamic feature and multi-dimensional feature of interaction. This paper propose a multi-dimensional ontology-based IoT resource model to solve above defects. For resource management, searching and reasoning, this model divides resource into 4 key concepts: general situation, variable feature, function and enforce. Then this paper classify resource into 5 dimensions. Experimental result shows that when IoT resource contains time feature, location feature and priority feature, resource model works well to accomplish management and searching task. In addition, this model lays a foundation for service model, which is in upper layer of resource model.
{"title":"A multi-dimensional ontology-based IoT resource model","authors":"Huijuan Zhang, Chao Meng","doi":"10.1109/ICSESS.2014.6933527","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933527","url":null,"abstract":"Nowadays researches related to resource management and representation of IoT (Internet of Things) emphasize on making identify regulation or describing device working principle. However they could not represent dynamic feature and multi-dimensional feature of interaction. This paper propose a multi-dimensional ontology-based IoT resource model to solve above defects. For resource management, searching and reasoning, this model divides resource into 4 key concepts: general situation, variable feature, function and enforce. Then this paper classify resource into 5 dimensions. Experimental result shows that when IoT resource contains time feature, location feature and priority feature, resource model works well to accomplish management and searching task. In addition, this model lays a foundation for service model, which is in upper layer of resource model.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"27 1","pages":"124-127"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72683572","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933590
N. Nilsson, Yan Liu
Clustering, as a part of the Data Mining field, has been in the center of the research attention for the last decade. It is the task of finding subsets of data that are sharing the same type of attributes. Text Clustering becomes one of the most critical and important solutions in data mining to discover knowledge from fast grow up web data and log files. There are many challenges, algorithms needs to be tailored specific for each domain and scale well with growing data sets. Another interesting aspect is the design of the system. A complex set components need to interact well together. This article proposes an elegant way of clustering university educations based on their text attributes. The solution is integrated directly into a Spring Web Application. A comprehensive architecture is proposed, providing the frameworks needed. Clustering techniques such as Canopy Generation [4] and k-Means are demonstrated.
{"title":"Adopting Text Clustering in web-based application to facilitate searching of education information","authors":"N. Nilsson, Yan Liu","doi":"10.1109/ICSESS.2014.6933590","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933590","url":null,"abstract":"Clustering, as a part of the Data Mining field, has been in the center of the research attention for the last decade. It is the task of finding subsets of data that are sharing the same type of attributes. Text Clustering becomes one of the most critical and important solutions in data mining to discover knowledge from fast grow up web data and log files. There are many challenges, algorithms needs to be tailored specific for each domain and scale well with growing data sets. Another interesting aspect is the design of the system. A complex set components need to interact well together. This article proposes an elegant way of clustering university educations based on their text attributes. The solution is integrated directly into a Spring Web Application. A comprehensive architecture is proposed, providing the frameworks needed. Clustering techniques such as Canopy Generation [4] and k-Means are demonstrated.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"22 1","pages":"393-396"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72784145","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933567
Wenkuai Liang, Yi Li
As the flight scheduling has always been a key technology which reduces flight delays and costs. Rational and efficient flight sorting method not only can effectively improve the utilization of the airport, reduce flight delay, but also ensure flight safety and reduce the incidence of sudden accidents. Firstly, we studied the application of ant colony algorithm in flight sorting, and proposed a new flight sorting method which is combined with ant colony algorithm and genetic algorithm depending on the mutation characteristic of genetic algorithm; Secondly, the minimization objective model that the flight total delay was minimum was established based on the sorting method; Finally, the simulation experiment was done based on the model. The simulation results show that the proposed method can effectively reduce flight delay. Comparing with ant colony algorithm, the global optimal flight sequence can be found in a shorter time.
{"title":"Research on optimization of flight scheduling problem based on the combination of ant colony optimization and genetic algorithm","authors":"Wenkuai Liang, Yi Li","doi":"10.1109/ICSESS.2014.6933567","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933567","url":null,"abstract":"As the flight scheduling has always been a key technology which reduces flight delays and costs. Rational and efficient flight sorting method not only can effectively improve the utilization of the airport, reduce flight delay, but also ensure flight safety and reduce the incidence of sudden accidents. Firstly, we studied the application of ant colony algorithm in flight sorting, and proposed a new flight sorting method which is combined with ant colony algorithm and genetic algorithm depending on the mutation characteristic of genetic algorithm; Secondly, the minimization objective model that the flight total delay was minimum was established based on the sorting method; Finally, the simulation experiment was done based on the model. The simulation results show that the proposed method can effectively reduce flight delay. Comparing with ant colony algorithm, the global optimal flight sequence can be found in a shorter time.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"26 1","pages":"296-299"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77263039","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933734
Xiaoyi Zhou, Lingfei Wang
The proposed SoRS algorithm is based on the SoW scheme present in [1]. In SoW algorithm, the watermark is split into four shares, 2-level DWT is applied and SVD is performed on the HL/LH subbands. While in SoRS, all the subbands of 2-level DWT performed on the low subband are selected for embedding watermark. Furthermore, SVD is performed on the singular value revised by the watermark and the carrier image. The experimental results show that SoRS has both the significant improvement in perceptibility and the robustness under various types of image processing attacks. Even though this algorithm is weak against scaling attacks, it extracts watermarks of higher quality than other algorithms under many attacks such as JPEG compression, filtering, histogram equalization, rotation, cropping and noise.
{"title":"SoRS: An effective SVD-DWT watermarking algorithm with SVD on the revised singular value","authors":"Xiaoyi Zhou, Lingfei Wang","doi":"10.1109/ICSESS.2014.6933734","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933734","url":null,"abstract":"The proposed SoRS algorithm is based on the SoW scheme present in [1]. In SoW algorithm, the watermark is split into four shares, 2-level DWT is applied and SVD is performed on the HL/LH subbands. While in SoRS, all the subbands of 2-level DWT performed on the low subband are selected for embedding watermark. Furthermore, SVD is performed on the singular value revised by the watermark and the carrier image. The experimental results show that SoRS has both the significant improvement in perceptibility and the robustness under various types of image processing attacks. Even though this algorithm is weak against scaling attacks, it extracts watermarks of higher quality than other algorithms under many attacks such as JPEG compression, filtering, histogram equalization, rotation, cropping and noise.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"228 1","pages":"1001-1006"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77520289","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933608
Lavanya Sainik, Dheeraj Khajuria
Driven by the 3GPP (3rd Generation Partnership Project) evolving standards and advent of Big Data technology, to deal with huge volume, velocity and variety of data, various industries like telecommunication, warehousing and storage, financial and many more industries need to be compliant with this evolving technology. There is a huge demand to process both real time and stored data. In this paper we have analyzed an open source framework Storm, which is a real time distributed processing engine and suggesting an improvement on its fault tolerance mechanism so that it can be flawlessly used for any data processing use case. Vanilla storm provides guaranteed message processing however it promises “at least once” level of processing. For perfect fault tolerant system “exactly one” level of processing is required and to achieve this storm provides another framework, Trident which is built on top of it. Trident provides transactional spout where transactional metadata information <; transaction id, data > is stored in zookeeper which provides distributed coordination, thus across node / hardware data can be replayed in case of any failure, timeout, retry. Trident uses zookeeper for coordination of transactional information through apache curator framework. However with current trident framework per activity level (aggregator/reducer) commit can be easily obtained but no direct implementation for single chain level transaction commit. This paper describes an approach where by modifying existing transactional trident, chain level commit can be obtained using curator recipes.
{"title":"Fault tolerant data flow using curator — Storm","authors":"Lavanya Sainik, Dheeraj Khajuria","doi":"10.1109/ICSESS.2014.6933608","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933608","url":null,"abstract":"Driven by the 3GPP (3rd Generation Partnership Project) evolving standards and advent of Big Data technology, to deal with huge volume, velocity and variety of data, various industries like telecommunication, warehousing and storage, financial and many more industries need to be compliant with this evolving technology. There is a huge demand to process both real time and stored data. In this paper we have analyzed an open source framework Storm, which is a real time distributed processing engine and suggesting an improvement on its fault tolerance mechanism so that it can be flawlessly used for any data processing use case. Vanilla storm provides guaranteed message processing however it promises “at least once” level of processing. For perfect fault tolerant system “exactly one” level of processing is required and to achieve this storm provides another framework, Trident which is built on top of it. Trident provides transactional spout where transactional metadata information <; transaction id, data > is stored in zookeeper which provides distributed coordination, thus across node / hardware data can be replayed in case of any failure, timeout, retry. Trident uses zookeeper for coordination of transactional information through apache curator framework. However with current trident framework per activity level (aggregator/reducer) commit can be easily obtained but no direct implementation for single chain level transaction commit. This paper describes an approach where by modifying existing transactional trident, chain level commit can be obtained using curator recipes.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"100 1","pages":"472-475"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75168195","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933593
Wenbing Zhao
Fault tolerance is a crucial requirement for big data and cloud computing because it helps remove single point of failures. The Paxos algorithm has been employed in a number of real-world fault tolerant systems. Fast Paxos is one of the latest algorithms in the Paxos family of algorithms for distributed consensus. In Fast Paxos, an acceptor is allowed to cast a vote for a value of its own choice unilaterally in a fast round, which eliminates a communication step for reaching consensus. As a tradeoff, a bigger quorum than simple majority must be used and a value selection rule is employed to select the right value for agreement to overcome collisions. The derivation of quorum requirements and value selection rule in the original article on Fast Paxos by Lamport, while very rigorous, may be hard to follow and difficult to implement. In this paper, we present a more intuitive approach to deriving the quorum requirements and easy-to-implement value selection rule for Fast Paxos.
{"title":"On the quorum requirement and value selection rule for Fast Paxos","authors":"Wenbing Zhao","doi":"10.1109/ICSESS.2014.6933593","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933593","url":null,"abstract":"Fault tolerance is a crucial requirement for big data and cloud computing because it helps remove single point of failures. The Paxos algorithm has been employed in a number of real-world fault tolerant systems. Fast Paxos is one of the latest algorithms in the Paxos family of algorithms for distributed consensus. In Fast Paxos, an acceptor is allowed to cast a vote for a value of its own choice unilaterally in a fast round, which eliminates a communication step for reaching consensus. As a tradeoff, a bigger quorum than simple majority must be used and a value selection rule is employed to select the right value for agreement to overcome collisions. The derivation of quorum requirements and value selection rule in the original article on Fast Paxos by Lamport, while very rigorous, may be hard to follow and difficult to implement. In this paper, we present a more intuitive approach to deriving the quorum requirements and easy-to-implement value selection rule for Fast Paxos.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"778 1","pages":"406-409"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76409385","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
扫码关注我们
求助内容：
应助结果提醒方式：