Abstract:Perceptual transparency and robustness are conflicting requirements. To ensure the security of the watermark how to choose the embedding position and intensity is a difficult problem. Chaotic system has characteristics of sensitivity to initial value and unpredictability. High-dimensional chaotic systems have advantage of higher secrecy, so this paper chooses Lorenz chaotic attractor to encrypt binary watermark image. Through the statistic analysis of block energy of the host image, which is applied DWT repeatedly up to the third level, so watermark adaptively embedded into the greatest coefficients which belong to the selected blocks by using the properties of human visual system. Additionally, to realize the blind digital watermarking extraction, chaotic sequence is also applied in selected wavelet coefficients to change the original value of the inherent relationship between wavelet coefficients. Theoretical analysis and experiment results show that the proposed algorithm has high robustness and better performance of perceptual transparency.
Controlled terms:Algorithms - Digital watermarking - Discrete wavelet transforms - Energy management - Transparency - Watermarking
Uncontrolled terms:Belong to - Blind digital watermarking - Chaotic attractors - Chaotic sequence - DWT - Energy analysis - High robustness - High-dimensional - Host images - Human Visual System - Initial values - Perceptual transparency - Statistic analysis - Third level - Watermark images - Watermarking algorithms - Wavelet coefficients
Classification code:961 Systems Science - 931 Classical Physics; Quantum Theory; Relativity - 921.3 Mathematical Transformations - 921 Mathematics - 811.1.1 Papermaking Processes - 741.1 Light/Optics - 723.2 Data Processing and Image Processing - 723 Computer Software, Data Handling and Applications - 525 Energy Management and Conversion
DOI:10.4156/jdcta.vol4. issue9.19
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110313592559
Title:Finding frequent items over data stream
Authors:Tu, Li (1); Chen, Ling (1)
Author affiliation:(1) Department of Computer Science, Yangzhou University, Yangzhou 225009, China; (2) Department of Computer Science, Jiangyin Polytechnic College, Jiangyin 214405, China; (3) National Key Lab of Novel Software Tech, Nanjing University, Nanjing 210093, China
Corresponding author:Tu, L.(yzutuli@yahoo.com.cn)
Source title:Journal of Computational Information Systems
Abbreviated source title:J. Comput. Inf. Syst.
Volume:6
Issue:12
Issue date:December 2010
Publication year:2010
Pages:4127-4134
Language:English
ISSN:15539105
Document type:Journal article (JA)
Publisher:Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States
Abstract:We investigate the problem of finding the frequent items in a continuous data stream. In the literature, most of the existing algorithms for mining frequent items over data streams do not emphasis the importance of the more recent data items. We present an efficient algorithm F-Stream based on sliding window for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithm can detect Ε-1-approximate frequent items in a data stream using O(Ε-1) memory space and the processing time for each data item is O(Ε-1). Extensive experimental results show that F-Stream outperforms other methods in terms of accuracy, memory requirement, and processing speed. © 2010 Binary Information Press.
Number of references:17
Main heading:Data processing
Controlled terms:Algorithms - Data communication systems - Data mining - Hydraulics
Uncontrolled terms:Continuous data - Data items - Data sampling - Data stream - Efficient algorithm - Frequency counts - Frequent items - Memory requirements - Memory space - Processing speed - Processing Time - Sliding Window
Classification code:921 Mathematics - 723.2 Data Processing and Image Processing - 723 Computer Software, Data Handling and Applications - 718 Telephone Systems and Related Technologies; Line Communications - 717 Optical Communication - 716 Telecommunication; Radar, Radio and Television - 632.1 Hydraulics
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110313592569
Title:Using logic rules for concept refinement learning in FOL
Authors:Shi, Zhenguo (1); Li, Yun (2); Liu, Zongtian (3); Chen, Jianping (1); Feng, Dasheng (1)
Author affiliation:(1) School of Computer Science and Technology, Nantong University, Nantong 226019, China; (2) College of Information Engineering, Yangzhou University, Yangzhou 225009, China; (3) School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China
Corresponding author:Shi, Z.(chinaemail@sohu.com)
Source title:Journal of Computational Information Systems
Abbreviated source title:J. Comput. Inf. Syst.
Volume:6
Issue:12
Issue date:December 2010
Publication year:2010
Pages:4215-4222
Language:English
ISSN:15539105
Document type:Journal article (JA)
Publisher:Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States
Abstract:In this paper, it has been explored that the use of logic rules as key element in concept refinement learning. A logic rule is a formal grammar in logic for expressing formation rules of a formal language. First order logic in Inductive Logic Programming(ILP) and programming language in Genetic Programming(GP) are formal languages, the logic rule is available to express syntax and semantics of them. Concept refinement learning including inductive concept learning by employing ILP and evolutionary concept learning by employing GP. A framework is presented that combining ILP and GP using logic rules for concept refinement learning in first order logic. The viability of our approach is illustrated by comparing the performance of our learner with that of other concept learners such as Progol, CfgGP, GGP on a variety of target concepts. We conclude with some observations about the merits of our approach and about possible extensions. © 2010 Binary Information Press.
Number of references:16
Main heading:Inductive logic programming (ILP)
Controlled terms:Evolutionary algorithms - Formal languages - Formal logic - Genetic programming - Learning systems - Query languages - Semantics
Uncontrolled terms:Concept Refinement Learning - Evolutionary concept learning - First order logic - Formal grammars - Inductive concept learning - Key elements - Logic rules - Programming language - Target concept
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 903.2 Information Dissemination - 921 Mathematics
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20111813950212
Title:High entrapment efficiency of chitosan/polylactic acid/tripolyphotspate nanosized microcapsules for rapamycin by an emulsion-evaporation approach
Authors:Fu, Jing (1); Wang, Daxin (3); Wang, Ting (2); Yang, Wenjing (2); Deng, Yan (4); Wang, Hua (3); Jin, Shiguang (3); He, Nongyue (2)
Author affiliation:(1) Departments of Public Health, Southeast, Nanjing 210096, China; (2) State Key Laboratory of Bioelectronics, Southeast University, Nanjing 210096, China; (3) Clinical Medical College, Yangzhou University, Yangzhou 225001, China; (4) Hunan Key Laboratory of Green-Packaging and Application of NanoBio Technology, Hunan University of Technology, Zhuzhou 412007, China
Corresponding author:Wang, D.
Source title:Journal of Biomedical Nanotechnology
Abbreviated source title:J. Biomed. Nanotechnol.
Volume:6
Issue:6
Issue date:December 2010
Publication year:2010
Pages:725-728
Language:English
ISSN:15507033
E-ISSN:15507041
Document type:Journal article (JA)
Publisher:American Scientific Publishers, 25650 North Lewis Way, Stevenson Ranch, California, 91381-1439, United States
Abstract:Chitosan (CS)/polylactic acid (PLA)/tripolyphotspate (TPP) nanosized microcapsules were prepared by emulsion-evaporation. The average diameter of the obtained nanosized microcapsules was around 100-300 nm, and a homogeneous size distribution and good dispersion were observed. The entrapment efficiency of the nanosized CS/PLA/TPP microcapsules for rapamycin was increased with the increase in amount of PLA. When the ratio of CS to PLA was 80 to 20, the entrapment efficiency of CS/PLA/TPP nanosized microcapsules for rapamycin reached the highest (89.8±1.72%). It was also observed that The RAPA entrapment efficiency reached its highest at 20% of addition dosage of RAPA. Copyright © 2010 American Scientific Publishers All rights reserved.
Number of references:48
Main heading:Efficiency
Controlled terms:Chitin - Chitosan - Emulsification - Evaporation - Phase transitions
Uncontrolled terms:Average diameter - Entrapment efficiency - Microcapsules - Nano-sized - Poly lactic acid - Rapamycin - Sustained release
Classification code:801.4 Physical Chemistry - 802.3 Chemical Operations - 804.1 Organic Compounds - 913.1 Production Engineering
DOI:10.1166/jbn.2010.1135
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110313592568
Title:FBUP2PSim: A flow-based universal peer-to-peer simulator
Authors:Tang, Keming (1); Wang, Chuangwei (2); Chen, Ling (3); Gu, Yuan (3)
Author affiliation:(1) College College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; (2) College College of Information Science and Technology, Yancheng Teachers University, Yancheng 224002, China; (3) Department of Computer Science and Engineering, Yangzhou University, Yangzhou 225009, China
Corresponding author:Chen, L.(yzulchen@gmail.com)
Source title:Journal of Computational Information Systems
Abbreviated source title:J. Comput. Inf. Syst.
Volume:6
Issue:12
Issue date:December 2010
Publication year:2010
Pages:4207-4214
Language:English
ISSN:15539105
Document type:Journal article (JA)
Publisher:Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States
Abstract:Research community on distributed systems, and in particular on peer-to-peer systems, needs tools for evaluating their own protocols and services. Since an experimental evaluation is not always feasible, simulations are becoming the most popular and efficient tools for investigating and validating peer-to-peer systems. Nevertheless, the majority of them are customized simulators, either poorly documented or not extensible to other protocols and settings, so those simulators do not serve general overlay evaluation purposes. Thus, in this paper we are mainly interested in extensible, scalable, high-level overlay and simulation frameworks. In particular, considering the disadvantage of packet-based P2P simulator, such as big overhead and bad scalability, and the advantage of flow-based P2P simulator, such as more universal and good scalability, designing scheme and important components of a flow-based universal peer-to-peer simulator are introduced. As exemplified in this paper by means of the simulator of Chord and Gnutella P2P systems we validated its feasibility. © 2010 Binary Information Press.
Number of references:13
Main heading:Distributed computer systems
Controlled terms:Peer to peer networks - Scalability - Simulators
Uncontrolled terms:Designing scheme - Distributed systems - Experimental evaluation - FBUP2PSim - Flow-Based - Gnutella - P2P system - Packet-based - Peer to peer - Peer-to-Peer system - Research communities - Simulation framework
Classification code:961 Systems Science - 723 Computer Software, Data Handling and Applications - 722.4 Digital Computers and Systems - 722 Computer Systems and Equipment - 718 Telephone Systems and Related Technologies; Line Communications - 671 Naval Architecture - 621 Nuclear Reactors
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110413618071
Title:A collaborative filtering recommendation algorithm based on user interest change and trust evaluation
Authors:Chen, Zhimin (1); Jiang, Yi (1); Zhao, Yao (1)
Author affiliation:(1) Institute of Information Engineering, Yangzhou University, Yangzhou, China
Corresponding author:Chen, Z.(zmchen@yzu.edu.cn)
Source title:International Journal of Digital Content Technology and its Applications
Abbreviated source title:Int. J. Digit. Content Technol. Appl.
Volume:4
Issue:9
Issue date:December 2010
Publication year:2010
Pages:106-113
Language:English
ISSN:19759339
Document type:Journal article (JA)
Publisher:Advanced Institute of Convergence Information Technology, 707 Seokjang-dong, Gyeongju, Gyeongbuk, Korea, Republic of
Abstract:Collaborative filtering algorithm is one of the most successful technologies used in personalized recommendation system. However, traditional algorithms focus only on user ratings and do not consider the changes of user interest and the credibility of ratings data, which affected the quality of the system's recommendation seriously. To solve this problem, this paper presents an improved algorithm. Firstly, the user's rating is given a weight by a gradual time decrease and credit assessment in the course of user similarity measurement, and then several users highly similar with active user are selected as his neighbor. Finally, the active user's preference for an item can be represented by the average scores of his neighbor. Experimental results show that the algorithm can make the neighbor recognition more accurately and enhance the quality of recommendation system effectively.
Number of references:11
Main heading:Signal filtering and prediction
Controlled terms:Algorithms
Uncontrolled terms:Collaborative filtering - Collaborative filtering algorithms - Credit assessment - Improved algorithm - Personalized recommendation systems - Recommendation algorithms - Recommendation systems - Similarity measure - Similarity measurements - Time weight - Trust evaluation - User interests - User rating
Classification code:723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 921 Mathematics
DOI:10.4156/jdcta.vol4. issue9.13
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20114414467043
Title:Study on improving the flow in forebay of the pumping station
Authors:Liu, Chao (1); Zhou, Jiren (1); Cheng, Li (1); Jin, Yan (1); Han, Xu (2)
Author affiliation:(1) College of Hydraulic Engineering, Yangzhou University, 131 Jiangyang Middle Road, Yangzhou 225009, China; (2) Institute of Design and Research on Hydraulic Engineering of Inner Mongolia, 85 Hulen South RD., Huhehaote, Inner Mongolia, China
Corresponding author:Liu, C.(liuchao@yzu.edu.cn)
Source title:American Society of Mechanical Engineers, Fluids Engineering Division (Publication) FEDSM
Abbreviated source title:ASME Fluids Eng Div Publ FEDSM
Volume:1
Issue:PARTS A, B AND C
Monograph title:ASME 2010 3rd Joint US-European Fluids Engineering Summer Meeting Collocated with 8th International Conference on Nanochannels, Microchannels, and Minichannels, FEDSM2010
Volume title:Symposia
Issue date:2010
Publication year:2010
Pages:481-487
Language:English
ISSN:08888116
CODEN:FEDSDL
ISBN-13:9780791849484
Document type:Conference article (CA)
Conference name:ASME 2010 3rd Joint US-European Fluids Engineering Summer Meeting, FEDSM 2010 Collocated with 8th International Conference on Nanochannels, Microchannels, and Minichannels
Conference date:August 1, 2010 - August 5, 2010
Conference location:Montreal, QC, Canada
Conference code:87044
Sponsor:Fluids Engineering Division
Publisher:American Society of Mechanical Engineers, 3 Park Avenue, New York, NY 10016-5990, United States
Abstract:The flow pattern in the forebay of pumping station is of very important influence on the operation of the pumps. The different kinds of unlike flow pattern, such as large scale circulations and vortices, are often found in the forebay of pumping station especially with multi-pumps. This paper takes the study on improving the flow pattern in the forebay to ensure a good flow condition for pumps operation. The computational results of three dimensional flow fields in an original designed forebay were obtained and a large circulation was found in the forebay on the side which caused serious problems to the operation of pumps. A typical combined means were applied to improve the flow motion. The computational results of the flow fields shows that the large circulation was eliminated and the flow distribution was improved, which was verified by the model test. The improved design has been successfully used to a large pumping station. Copyright © 2010 by ASME.
Number of references:10
Main heading:Pumps
Controlled terms:Flow fields - Flow patterns - Microchannels - Pumping plants - Vortex flow
Uncontrolled terms:Computational results - Flow condition - Flow distribution - Flow motion - Forebay - Large-scale circulation - Model tests - Numeric simulation - Pumping station - Pumping stations - Pumps operation - Three dimensional flow field - Vortex
Classification code:446 Waterworks - 604 Metal Cutting and Machining - 618.2 Pumps - 631 Fluid Flow - 631.1 Fluid Flow, General
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110313592546
Title:Local energy based image fusion in sharp frequency localized contourlet transform
Authors:Lu, Huimin (1); Hu, Xuelong (1); Zhang, Lifeng (2); Yang, Shiyuan (2); Serikawa, Seiichi (2)
Author affiliation:(1) School of Information Engineering, Yangzhou Uinveristy, Yangzhou 225009, China; (2) Department of Electrical Engineering and Electronics, Kyushu Institute of Technology, Kitakyushu 8048550, Japan
Corresponding author:Lu, H.(yzulhm@126.com)
Source title:Journal of Computational Information Systems
Abbreviated source title:J. Comput. Inf. Syst.
Volume:6
Issue:12
Issue date:December 2010
Publication year:2010
Pages:3997-4005
Language:English
ISSN:15539105
Document type:Journal article (JA)
Publisher:Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States
Abstract:Image fusion method based on multiscale transform (MST) is a popular choice in recent research. Sharp frequency localized contourlet transform (SFLCT) that significantly outperform the original contourlet transform is proposed. Commonly, the upsamplers and the downsamplers presented in directional filter banks of SFLCT make the resulting image not shift-invariant and easily cause the pseudo-Gibbs phenomena. In order to suppress the pseudo-Gibbs phenomena, we apply cycle spinning as compensation. Then, the coefficients of shifted images are calculated. We take the following image fusion rules. First, cycle spinning the source images, the shifted images are obtained. Second, selecting the low-frequency coefficients by the local energy method and calculating the high-frequency coefficients by the sum modified Laplacian (SML), and the coefficients fusion follows. Third, applying the inverse SFLCT and the inverse cycle-spinning sequentially, the image is reconstructed. Numerical experiment results show that the proposed method significantly outperform the wavelet transform, the pyramid transform and the curvelet transform both in visual quality and in quantitative analysis. © 2010 Binary Information Press.
Number of references:13
Main heading:Image fusion
Controlled terms:Filter banks - Laplace transforms - Numerical methods - Wavelet transforms
Uncontrolled terms:Contourlet transform - Cycle-spinning - Directional filter banks - Local energy - Sum-Modified-Laplacian
Classification code:713 Electronic Circuits - 716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 921.3 Mathematical Transformations - 921.6 Numerical Methods
Database:Compendex
Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110113546139
Title:A four degrees of freedom parallel manipulator for machining
Authors:Chen, Wenjia (1); He, Yanzhong (1); Zhang, Jiang (1)
Author affiliation:(1) College of Mechanical Engineering, Yangzhou University, Yangzhou 225009, China
Corresponding author:Chen, W.(wjchen@yzu.edu.cn)
Source title:Advanced Materials Research
Abbreviated source title:Adv. Mater. Res.
Volume:139-141
Monograph title:Manufacturing Engineering and Automation I
Issue date:2010
Publication year:2010
Pages:2168-2171
Language:English
ISSN:10226680
ISBN-13:9780878492268
Document type:Conference article (CA)
Conference name:2010 International Conference on Manufacturing Engineering and Automation, ICMEA2010
Conference date:December 7, 2010 - December 9, 2010
Conference location:Guangzhou, China
Conference code:83170
Sponsor:Guangzhou University; The University of New South Wales; Huazhong University of Science and Technology; Xi'an Jiaotong University
Publisher:Trans Tech Publications, P.O. Box 1254, Clausthal-Zellerfeld, D-38670, Germany
Abstract:In the past decades, a number of parallel manipulators have been extensively studied. However, most efforts are dedicated to six degrees of freedom (DOF) or three-DOF manipulators. There is a need for equipment providing more than three DOF's arranged in parallel and based on simpler arrangements than six-DOF arrangements in application. This paper presents a novel four-DOF parallel platform manipulator with base mounted prismatic actuators. The manipulator is driven by four linear actuators. The movable platform of the manipulator can translate along two directions and rotate around two axes respectively. The kinematics model is formulated, which describes the inverse and forward kinematics transformation. It is very easy to develop a five-axis NC machine-tool which is of large-workspace based on the four-DOF parallel mechanism presented in this paper. © (2010) Trans Tech Publications.
Number of references:9
Main heading:Manipulators
Controlled terms:Actuators - Industrial engineering - Kinematics - Manufacture - Mathematical models - Mechanisms - Tools
Uncontrolled terms:Five-axis - Forward kinematics - Four-degrees-of-freedom - Kinematics models - Linear actuator - Parallel manipulators - Parallel mechanisms - Parallel platforms - Singularity - Six degrees of freedom - Six-DOF - Two directions