Chinchen Chang, Yi-Hui Chen, Zhi-Hui Wang, Mingchu Li
{"title":"A Data Embedding Scheme Based on a Magic Matrix and Wet Paper Codes","authors":"Chinchen Chang, Yi-Hui Chen, Zhi-Hui Wang, Mingchu Li","doi":"10.1109/CINC.2009.250","DOIUrl":"https://doi.org/10.1109/CINC.2009.250","url":null,"abstract":"Data embedding is one of the important issues for securely conveying secrets from senders to receivers without arousing any notices to attackers. Wet paper coding (WPC) is one of the data embedding schemes which embeds secrets into a subset of pixels of an image. The pixels in the subset are also called dry pixels. Inspired by wet paper coding, a novel data embedding scheme with a magic matrix is presented in this paper. Before data embedding, pixels are randomly chosen to define which pixels are dry and wet. Later on, two pixels are treated as a group and each group is judged as embeddable if at least one pixel is a dry pixel in the group. The experimental results show that our proposed scheme can achieve not only good visual quality but also high embedding rate.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129288690","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}
{"title":"Deep Semantic Integration for Information System","authors":"Zhenxin Qu, Shengqun Tang","doi":"10.1109/CINC.2009.94","DOIUrl":"https://doi.org/10.1109/CINC.2009.94","url":null,"abstract":"When applied semantic integration technology to databases, common method is to rewrite semantic query into SQL statements, while only RDFs vocabularies are supported at most. Semantics having been realized is weak. A more perfect algorithm inherited from the idea of rewriting semantic query is proposed, a sub set of OWL is supported, and semantics having been supported is more deep than ever. Ontology and query all are transformed into graphs, semantic match is done. Applying breadth-first search on match result, SQL statements will be generated. A case is designed to exemplify it, which shows that some OWL constructors have been supported.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128596116","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}
{"title":"Fault Diagnosis of Bearing Based on Empirical Mode Decomposition and Decision Directed Acyclic Graph Support Vector Machine","authors":"Qiumian Hao, Wang Ziying","doi":"10.1109/CINC.2009.43","DOIUrl":"https://doi.org/10.1109/CINC.2009.43","url":null,"abstract":"When faults of bearing happen, vibration signal of rotation machine always behave in complex form of modulation. The EMD can adaptively decompose signal according to the physical meaning of signal. The SVM has been used in many fields including fault diagnosis because of its excellent learning performance and favorable generalization capability. In this paper, energy eigenvector of frequency band is got through EMD. Fault diagnosis of bearings is realized by DDAGSVM. The most excellent model parameters are selected based on LOO. The final results indicate that the method based on EMD and DDAGSVM can effectively discriminate different faulty states of bearings.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128734832","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}
{"title":"Global Exponential Stability Analysis for Uncertain Neural Networks with Discrete and Distributed Time-Varying Delays","authors":"W. Guan, Yiming Chen, Hong-Chen Sun, Zenghui Xu","doi":"10.1109/CINC.2009.262","DOIUrl":"https://doi.org/10.1109/CINC.2009.262","url":null,"abstract":"In this paper, the global exponential stability is investigated for a class of neural networks with both discrete and distributed delays and norm-bounded uncertainties. The discrete delay considered in this paper is interval-like time-varying delay. By using Lyapunov stable theory and linear matrix inequality, the derived criteria are not only dependent on distributed delay but also on the lower bound and upper bound of discrete time delay. And we don’t need the restriction that the derivative of discrete time-varying delay is less than one. A numerical example is given to illustrate the effectiveness and improvement over some existing results.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"771 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116411638","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}
{"title":"The Improved Training Algorithm of Back Propagation Neural Network with Self-adaptive Learning Rate","authors":"Yong Li, Yang Fu, Hui Li, Siqi Zhang","doi":"10.1109/CINC.2009.111","DOIUrl":"https://doi.org/10.1109/CINC.2009.111","url":null,"abstract":"This paper addresses the questions of improving convergence performance for back propagation (BP) neural network. For traditional BP neural network algorithm, the learning rate selection is depended on experience and trial. In this paper, based on Taylor formula the function relationship between the total quadratic training error change and connection weights and biases changes is obtained, and combined with weights and biases changes in batch BP learning algorithm, the formula for self-adaptive learning rate is given. Unlike existing algorithm, the self-adaptive learning rate depends on only neural network topology, training samples, average quadratic error and error curve surface gradient but not artificial selection. Simulation results show iteration times is significant less than that of traditional batch BP learning algorithm with constant learning rate.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117166595","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}
{"title":"Real-time Multimedia Quality Assessment Based on Media Delay Index and Support Vector Machine","authors":"Wenbi Rao, Yingshu Li","doi":"10.1109/CINC.2009.28","DOIUrl":"https://doi.org/10.1109/CINC.2009.28","url":null,"abstract":"The more areas the multimedia used in, the more effective measures about quality of service are required. This paper presents a new method for multimedia quality assessment. This method uses Media Delivery Index algorithm to analyze the situation of current network and get a series of index as media attributes. Using an intelligent algorithm -- Support Vector Machine as a classifier which maps the network parameters with end-users’ feeling. This is a No-Reference method to evaluate the media quality. There is no need to access the original signal in the operation phase, and the obtained results correlate well with human perception. And compared with the Neural Network quality assessment, the new method is more stable and expansive. So this method can be widely used in real-time system to calculate the magnitude of quality of service automatically.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273852","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}
{"title":"Application of Genetic Algorithms in Ranking Method of Judgment Matrix","authors":"Zhengang Ning, Chi Jing, Yanfen Gao","doi":"10.1109/CINC.2009.200","DOIUrl":"https://doi.org/10.1109/CINC.2009.200","url":null,"abstract":"According to the property that the ratio of corresponding elements is a constant in any two rows of consistency matrix, the indirect judgment information of the judgment matrix is comprehensively used to construct a constrained programming model in order to determine the ranking weight of judgment matrix. And the Genetic Algorithms is used to solve the model. Finally, an example is given to demonstrate this method. The results showed that weight dispersion got by this method is higher, and it is also much easier to identify the optimal plan.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114282578","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}
{"title":"Nutritional Diet Decision Using Multi-objective Difference Evolutionary Algorithm","authors":"Zhenkui Pei, Zhen Liu","doi":"10.1109/CINC.2009.175","DOIUrl":"https://doi.org/10.1109/CINC.2009.175","url":null,"abstract":"The nutrition diet decision problems on Multi-objective optimization are solved by using Compromise Difference Evolutionary (DE) algorithm. This method is equipped with a domination selection operator to enhance its performance by favoring non–dominated individuals in the populations. DE is a population based search algorithm, which is an improved version of Genetic Algorithm (GA). Simulations carried out involved solving nutrition decision using a method that relationships of dominant to determine the fitness, and finding Pareto optimum set for the nutrition decision problem. Compromise Difference Evolutionary found to be stable and more accurate in optimization compared to simple GA.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114225471","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}
{"title":"A Routing Algorithm for ZigBee Network Based on Dynamic Energy Consumption Decisive Path","authors":"Fenghui Zhang, Huiling Zhou, Xiaoguang Zhou","doi":"10.1109/CINC.2009.193","DOIUrl":"https://doi.org/10.1109/CINC.2009.193","url":null,"abstract":"The energy-efficiency usage is relative to each layer of wireless sensor networks. In order to improve the ZigBee mesh routing protocol for energy-efficiency usage, we propose a routing algorithm combining AODVjr with the node residual energy. To reduce the energy consumption of bottleneck nodes and extend network lifetime, the improved routing algorithm aims to build a new balancing method between the energy-aware routing metric and the shortest path. Based on the energy model of CC2430 RF transceiver, the implemented routing protocol is simulated using NS2 (Network Simulator version 2). Simulation result shows that this improved protocol can extend the network lifetime very efficiently.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114248416","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}
{"title":"Statistical Study on Disease-Related ncRNAs Using Z-curve Method","authors":"Yan-ling Yang","doi":"10.1109/CINC.2009.80","DOIUrl":"https://doi.org/10.1109/CINC.2009.80","url":null,"abstract":"It has become very important to study non-coding RNAs in the recent years. The Z curve is a very useful method for visualizing and analyzing DNA sequences among the approaches of researching ncRNAs. It is a three-dimensional space curve that constitutes a unique representation of a given DNA sequence, i.e., both the Z-curver and the given DNA sequence can be uniquely reconstructed from the other. Using Z curve method, we select 15 disease related ncRNAs sequences from the NONCODE database, which relate with Alzheimer Disease. The corresponding Z curves of the studied ncRNAs, sequences have been mapped and compared. The statistical features of the Z curves are obtained. These features indicate that the ncRNAs sequences, which play same roles in the celluar process, have almost the same Z-curves. And the base content in these sequences is almost same too, in spite of coming from different organisms.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127526574","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}