@article {739, title = {A Recognition Learning System Based on Poetry Database and Text Pattern Function}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {03/2024}, pages = {1-7}, chapter = {1}, abstract = {

This article introduces a recognition learning system based on a poetry database and text pattern function. The system aims to help students better understand and remember poetry and improve the efficiency of Chinese language learning. The system{\textquoteright}s core components include a poetry database, text pattern recognition, and personalized learning modules. The poetry database contains a wealth of poetry works, providing students with rich learning resources. The text pattern recognition module can automatically recognize patterns in poetry, such as rhyme and contrast, to help students understand the structural characteristics of poetry. The personalized learning module provides suggestions and exercises based on students{\textquoteright} learning progress and abilities to achieve precise teaching.

}, doi = {https://doi.org/10.6025/jdim/2024/22/1/1-7}, url = {https://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_1.pdf}, author = {Youyu Hu} } @article {742, title = {Recruitment Management System Design and Deployment-Based on PHP Analysis}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {11/2023}, pages = {101-109}, type = {Research}, chapter = {101}, abstract = {

\ This article aims to create a three-level architecture based on PHP to implement a company{\textquoteright}s recruitment management system. This architecture will be combined with the new features in the existing recruitment work, considering their understanding of the recruitment process and the recruitment system they have designed and implemented. This article will analyze the benefits and drawbacks of PHP language, discuss the system design and implementation method based on analysing the advantages and disadvantages of the threelevel architecture of PHP and various driver model research. Based on this analysis, choose the most appropriate design drive method for the design of a recruitment management system. Based on the features of the existing recruitment company, the system will be designed to implement company recruitment management. The actual recruitment work, divided into four parts, will be discussed in this article. The realization and function of these four modules, and their realization and function, will help standardize and systematize the recruitment process. In this article, we will discuss how the four modules of the Access control system are realized and how they work, and how the following modules are realized and function to standardize and standardize the recruitment process and significantly reduce staff recruitment workload, improve the efficiency of the transfer of recruitment, shorten the hiring process, and reduce recruitment management work costs.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/101-109}, url = {http://www.dline.info/download.php?sn=3897}, author = {Youyu Hu} } @article {732, title = {Recruitment Management System Design and Deployment-Based on PHPAnalysis}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {101-109}, chapter = {101}, abstract = {

This article aims to create a three-level architecture based on PHP to implement a company{\textquoteright}s recruitment management system. This architecture will be combined with the new features in the existing recruitment work, considering their understanding of the recruitment process and the recruitment system they have designed and implemented. This article will analyze the benefits and drawbacks of PHP language, discuss the system design and implementation method based on analysing the advantages and disadvantages of the threelevel architecture of PHP and various driver model research. Based on this analysis, choose the most appropriate design drive method for the design of a recruitment management system. Based on the features of the existing recruitment company, the system will be designed to implement company recruitment management. The actual recruitment work, divided into four parts, will be discussed in this article. The realization and function of these four modules, and their realization and function, will help standardize and systematize the recruitment process. In this article, we will discuss how the four modules of the Access control system are realized and how they work, and how the following modules are realized and function to standardize and standardize the recruitment process and significantly reduce staff recruitment workload, improve the efficiency of the transfer of recruitment, shorten the hiring process, and reduce recruitment management work costs.

}, doi = {10.6025/jdim/2023/21/4/101-109}, url = {https://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_1.pdf}, author = {Youyu Hu} } @article {766, title = {Retrieving and Processing Images from the Pages of a Historical Newspaper and Modeling the Text Topics-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {06/2021}, pages = {41-46}, type = {Research}, chapter = {41}, abstract = {

Historical newspapers are a source of research for the human and social sciences. However, these image collections are difficult to read by machine due to the low quality of the print, the lack of standardization of the pages in addition to the low quality photograph of some files. This paper presents the processing model of a topic navigation system in historical newspaper page images. The general procedure consists of four modules which are: segmentation of text sub-images and text extraction, preprocessing and representation, induced topic extraction and representation, and document viewing and retrieval interface. The algorithmic and technological approaches of each module are described and the initial test results about a collection covering a range of 28 years are presented.

}, doi = {https://doi.org/10.6025/jdim/2021/19/2/41-46}, url = {http://www.dline.info/download.php?sn=3258}, author = {Gild{\'a}cio J. de A. S{\'a} and Jos{\'e} E. B. Maia} } @article {784, title = { Real Estate Loan Knowledge-Based Recommender System-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {04/2020}, pages = {65-77}, type = {Research}, chapter = {65}, abstract = {

\ In decision making, the decision-makers frequently employ and perform routine tasks. These processes normally are time-intensive, complex, and in most cases occur regularly. To address this challenge decision makers reuse the already successful decisions. During difficult times, such actions may lead to save time, energy and man-hours, and also result in effective decision making. Memory building depends on how we successfully store earlier knowledge. We through this work introduce a recommender system which is names as BLKBRS which utilized the earlier successful models. In this work we use a case of bank loan and experimented using a semi-structured multiple attribute recommendation environment, and equate the RL-KBRS with a conventional case based reasoning system. RL-KBRS will compensate for lack of experience of young bank consultants, which permits the spread of knowledge distribution to other banks.

}, doi = {https://doi.org/10.6025/jdim/2020/18/2/65-77}, url = {http://dline.info/fpaper/jdim/v18i2/jdimv18i2_3.pdf}, author = {Abdelkader Adla} } @article {776, title = {Reviewing the Concept of Enterprise Content Management (ECM)-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {08/2020}, pages = {125-138}, type = {Research}, chapter = {125}, abstract = {

Content is simply information that is put to use through the process of repackaging and is then published for a specific purpose (i.e. text, image, 3D data, video, etc.). Organisations deal with various information assets, also known as {\^a}{\texteuro}\~{}content{\^a}{\texteuro}{\texttrademark}, to run their business operations and make important decisions. Managing content is always a challenge for an organisation. More content, particularly in digital form, that goes beyond the control of organisations is being produced. Enterprise Content Management (ECM) was initiated to help organisations manage their information assets. Over a period of 25 years, ECM has intermittently been the focus of attention due to difficulties in setting a solid research framework and the vagueness of the term ECM. Therefore, this research aims to provide a comprehensive analysis of the ECM literature to identify the current state of knowledge and future research directions. An ECM research framework is proposed to guide the literature review analysis. Based on the analysis, several important observations are highlighted and practical implications for further research are proposed.

}, doi = {https://doi.org/10.6025/jdim/2020/18/4/125-138}, url = {http://dline.info/fpaper/jdim/v18i4/jdimv18i4_1.pdf}, author = {Mohamad Rahimi Mohamad Rosman} } @article {787, title = {Rumor Retransmission on Twitter: Message Characteristics, user Characteristics and 21 Retransmission Outcomes-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {02/2020}, pages = {21-32}, type = {Research}, chapter = {21}, abstract = {

This paper seeks to depict online rumor retransmission using three main constructs, namely, message characteristics, user characteristics and retransmission outcomes. In particular, it teases retransmission outcomes into volume, immediacy and lifespan of rumor tweets. The dataset was drawn from 322 original Twitter messages which generated some 5,700 retweets about the rumored death of Lee Kuan Yew (LKY). Content analysis and statistical tests were conducted. The results confirm the robustness of the research model. Specifically, rumor message characteristics affect retransmission in terms of volume, immediacy and lifespan. Additionally, user characteristics are positively related to volume and immediacy. Finally, user characteristics have a moderating effect on the relationships between rumor message characteristics and retransmission outcomes. This paper illustrates the applicability of the information diffusion model on online rumor retransmission which hitherto has yet to be attempted. Moreover, it granularizes the concept of online rumor retransmission into three important outcomes, namely, volume, immediacy and lifespan. On the practical front, this paper has implications for organizations seeking to combat rumors.

}, doi = {https://doi.org/10.6025/jdim/2020/18/1/21-32}, url = {http://dline.info/fpaper/jdim/v18i1/jdimv18i1_3.pdf}, author = {Alton Chua and Xiaoyu Chen} } @article {643, title = {Rain Water Harvesting Basic Need of Present Urban Sector {\textendash} Use of Digital Technology for Rain Water Harvesting}, journal = {Transactions on Machine Design}, volume = {6}, year = {2018}, month = {02/2018}, pages = {21-25}, type = {Research}, author = {Anil Gaikwad} } @article {628, title = {Reliability, Neighborhood Discovery and Active Node Selection in Wireless Sensor Networks}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, pages = {13-21}, abstract = {

In the present computer world Wireless Sensor Networks are playing a major role in sensing environment, health care and embedded systems category. In WSNs sensors are the nodes which are deployed randomly and in a wide spread manner. Data can be transmitted to the controller by the sensors at periodic intervals. As the network is dynamic the number and behavior of nodes vary randomly and identifies the nodes which are active are selected and the nodes which are idle are neglected. In WSN, the topology of the network is dynamic, it is necessary to identify the neighbors in the proximity and coordinate data acquisition at the controller. In any network reliability is an important issue which deals with stability under mobility, low delay, more life time, optimal route and other optimizations.

}, author = {Bhargavi Mopuru and M Naga Bhushana Rao} } @article {682, title = {Round Instrumentation for Aerospace Application}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {06/2018}, pages = {45-56}, type = {Research}, author = {Srinivas Bachu and B. Supriya} } @article {838, title = {Research on Flexible Customization of Business Function for Intelligent Traffic Cloud Platform-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {319}, type = {Research}, chapter = {312}, abstract = {

\ According to the flexible customization requirements of Intelligent Traffic Cloud Platform business function, this paper proposed the flexible customized solutions of Intelligent Traffic Cloud Platform based on the business function framework of the existing Intelligent Traffic Cloud Platform. The plan regards the platform business function design and implementation of flexible customization model as the core. The storage of business function customization model is realized based on XML technology. It designs the driving strategy of flexible customization model and realizes the flexible customization of platform business functions. Finally, the feasibility and effectiveness of the proposed scheme is verified by a specific service function on the Intelligent Traffic Cloud Platform.

}, doi = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_2.pdf}, author = {Hua Pan and Zhongxiang Huang and Zengzhen He} } @article {466, title = {Research on flexible customization of business function for intelligent traffic cloud platform}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {312 - 319}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041029410\&partnerID=40\&md5=4bd92bd9fccdbba84441a3fd6d5cfca8}, author = {Pan, H. and Huang, Z. and He, Z.} } @article {479, title = {Research on the building of emotion metaphor corpus based on machine translation}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {224 - 229}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026655786\&partnerID=40\&md5=7cbd7dc7d8602ee1b00eeba25a5aaff4}, author = {Jiang, X.} } @article {537, title = {Research on power dispatching automation system for data management of power plant substation}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {47 - 51}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969771426\&partnerID=40\&md5=0a06da909e6eb87ef97d087705a699c9}, author = {Li, H. and Zhu, Q. and Yang, F.} } @article {527, title = {Risk evaluation of information exchange among nodes under P2P net work environment}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {199 - 203}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982861472\&partnerID=40\&md5=2afb4669d2ac571cc863d12802023a6b}, author = {Yingjun, H. and Xiaoyang, W.} } @article {565, title = {Recognizing Discrepant Traffic Data Based on Least Square Support Vector Machine}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {381 - 384}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959856888\&partnerID=40\&md5=7cb3fbd419b2490aba4f5c026628003f}, author = {Yao, C. and Gu, J.} } @article {574, title = {The research of scale-free sensor network topology evolution based on cloud computing}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {266 - 275}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942511265\&partnerID=40\&md5=9a5bc2cf6892f518d2988276246f2859}, author = {He, Y. and Zhang, W. and Jiang, N. and Li, L. and Luo, X.} } @article {569, title = {Research on Application of Digital Literature Archives Management Based on XML Database System}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {367 - 372}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959853519\&partnerID=40\&md5=7889c5ca766e50d35f6bdcfec6fe6780}, author = {Yang, Y.} } @article {562, title = {Resource Allocation with Exponential Model Prediction for Server Virtualization}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {385 - 398}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959858800\&partnerID=40\&md5=c2071f7fd5a13a3d062e5f6fe50386fe}, author = {Prangchumpol, D. and Sophatsathit, P. and Lursinsap, C. and Tantasanawong, P.} } @article {581, title = {An RFID Data cleaning strategy based on maximum entropy feature selection}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {86 - 91}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930392305\&partnerID=40\&md5=9d8f3ec32b78855920a893ba7854bec2}, author = {Liu, Y. and Liu, Y.Z. and Zhang, H. and Li, T.} } @article {452, title = {Research on analysis of factors influencing terrestrial transmission efficiency of satellite data files}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {120 - 125}, abstract = {The paper firstly proposes two factors influencing transmission rate of satellite data file, the number of files and threads. The paper uses the control variate method to design the test scheme of the transmitting satellite data file, and changes the values of variables for lots of repeated tests to achieve the mean transmission time. And the paper compared the file transmission rate under three different variables, which draws the conclusion that the transmission efficiency of using single-file and multi-thread variable combination is the best. And the paper makes deep study on the selection of the number of threads. In the test environment of network delay of 50ms, the transmission time of using 3 or 4 threads to transmit data files is short, which proves that the number of threads transmitting files needs to be determined by the network environment.}, keywords = {Number of Files, Number of Threads, Satellite Data, Transmission, Transmission Efficiency, Transmission Time}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903203624\&partnerID=40\&md5=f19f3afd8384101a14eb338817baff3c}, author = {Jing, Z.} } @article {454, title = {Research on application of image encryption technology based on chaotic of cellular neural network}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {151 - 158}, abstract = {This paper gives a brief introduction of the basic knowledge of Cellular Neural Networks and proposes an image encryption algorithm based on Cellular Neural Networks. The algorithm is based on the unique characteristics of Cellular Neural Networks by using a chaotic system of 5-D CNN as the key source. On this basis, The paper puts forward an image pixel scrambling algorithm based on Logistic chaotic sequence, which realize the image encryption. In this paper, encryption algorithms are programmed and stimulated. The results show that encryption image is the characters of higher pixels{\textquoteright} scrambling degree, small correlation between adjacent pixels, strong anti attack, higher security.}, keywords = {Cellular Neural Network (CNN), Chaotic System, Image Encryption}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903142349\&partnerID=40\&md5=c7341677c7c2ee9af614f1ed54e5a66c}, author = {Li, G.-D. and Zhao, G.-M. and Xu, W.-X. and Yao, S.-Z.} } @article {456, title = {Research on ontology construction and information extraction technology based on wordnet}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {114 - 119}, abstract = {Introducing ontology in the field of information extraction can effectively improve the performance of information extraction. Ontology of college teachers{\textquoteright} resumes are constructed in the form three layers of ontology framework structure on the basis of exploring the related technologies and criterion for building ontology, the Racer inference engine is used for realizing the consistency and accuracy detection. WordNet similarity calculation method is improved on the basis of this, so that manual collection method can be integrated into WordNet semantic similarity, thus substantially improving this method. The test shows that the result precisions based on WordNet ontology construction and information extraction both see significant improvement, which sufficiently shows the feasibility and validity of the method.}, keywords = {Information processing, Ontology construction, Ontotology construction, Similarity calculation, Word net}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903142066\&partnerID=40\&md5=34f76335049f1f44a30d7889f3b2dfd6}, author = {Hua, H.} } @article {445, title = {Research on the Application of SIFT Algorithm in UAV remote sensing image feature extraction}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {67 - 72}, abstract = {UAV remote sensing is characterized by fast speed and flexibility and applied widely. The extraction and matching for feature point of UAV image is a foundational work in the application of UAV remote sensing. SIFT is a currently widely used feature point extraction algorithm that keeps invariant as the scale changes. It is also invariant as image changes in other aspects. Meanwhile it maintains certain stability to noise and light changes. SIFT is a kind of compute-intensive mission and usually takes much time. The author made parallel processing for SIFT algorithm and good accelerator ratio has been achieved on the premise of ensuring good result of feature point extraction and matching.}, keywords = {Content processing, Feature point extraction, SIFT, UAV, Video frame processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903184144\&partnerID=40\&md5=bddf4902f4b44d9155c7e7ef6b18bbbc}, author = {Yuan, D. and Cui, X. and Xu, W. and Hong, X. and Yu, S.} } @article {441, title = {Resolving rule conflicts based on Na{\"\i}ve Bayesian model for associative classification}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {36 - 43}, abstract = {The rule conflict is an important issue for associative classification due to a large set of rules. In this paper, a new approach called Associative Classification with Bayes (AC-Bayes) is proposed. To address rule conflicts, AC-Bayes has two distinguished features: (1) Associative classification is improved. (2) Na{\"\i}ve Bayesian model is applied in process of classification. A small set of high quality rules is generated by discovering not only frequent but mutual associated itemsets. Therefore, it will reduce the opportunities of rule conflicts. AC-Bayes also selects the best n rules to predict the class value of new instances. When rule conflicts are occurred, we collect those instances covered by these matched rules to form a new training set. Then, it scans new training set to compute the posterior probabilities of each class conditioned on the test instance. The class value that maximizes the posterior probability is assigned to the test instance. The experiments{\textquoteright} results show that the improved associative classification decreases significantly the number of rules and AC-Bayes has better average classification accuracy in comparison with associative classification and Na{\"\i}ve Bayesian classification.}, keywords = {Associative classification, Bayes, Data mining, Rule conflicts}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900460217\&partnerID=40\&md5=bec565675923a67f04838dadf519210d}, author = {Huang, Z. and Zhou, Z. and He, T.} } @article {382, title = {Regularized orthogonal local fisher discriminant analysis}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {154 - 159}, abstract = {Aiming at deficiencies of the ability for preserving local nonlinear structure of recently proposed Regularized Orthogonal Linear Discriminant Analysis (ROLDA) for dimensionality reduction, a kind of dimensionality reduction algorithm named Regularized Orthogonal Local Fisher Discriminant Analysis (ROLFDA) is proposed in the paper, which is originated from ROLDA. The algorithm introduce the idea of local structure preserving in Local Fisher Discriminant Analysis (LFDA) on the basic of ROLDA, following properties of ROLDA and strengthening the ability for capturing local structure information of data with nonlinear structures. Experiments on real face datasets demonstrate the effectiveness of our proposed algorithm.}, keywords = {Dimensionality reduction, Local fisher discriminant analysis, Local nonlinear structure, Regularized orthogonal linear discriminant analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879121480\&partnerID=40\&md5=294ec31f3b8631180e347dff9cae6b78}, author = {Xu, S.} } @article {369, title = {The research and realization of wireless energy consumption detector based on the internet of things}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {62 - 68}, abstract = {Intelligent power consumption detection device is an important part in Smart Home system, which can intelligent identification , positioning , tracking, monitoring and management the household electrical parameters, enabling users to keep abreast of household electricity consumption. This paper is mainly about the design of a Wireless Energy Consumption Detector (WECD) based on the Internet of Things, combine with the IEEE802.15.4E wireless protocol. The whole system includes hardware and software parts, the choice of MCU chip, RF chip and power measurement chip for WECD, the design of each module circuit based on the chip working principle, the paper also make a key analysis of device driver module, wireless data forwarding module and wireless data showing module of indoor terminal. After a series of rigorous testing, the result indicates a high reliability and accuracy of the WECD.}, keywords = {IEEE802.15.4E, Smart home, Wireless energy consumption detector}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879106063\&partnerID=40\&md5=32877c7463cacdf6d4cc123f5922c0a9}, author = {Fu, W. and Shui, M. and Chen, Y. and Chen, L.} } @article {421, title = {The research of algorithm for data mining based on fuzzy theory}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {327 - 334}, abstract = {Data Mining is a new filed in data processing research. Support Vector Machine (SVM) is one of the new methods using in data mining, which has gained great applicable success. However, there are still plenty of limitations in SVM. For example, SVM won{\textquoteright}t work if its training set contains uncertain information. In order to solve the problem presented above, this paper discusses the constraining programming of fuzzy chance and the characteristic of fuzzy classification as well as its expression methods. The algorithm for classifying Support Vector Machine is also included in this paper.}, keywords = {Algorithm, Data mining, Fuzzy classification, Fuzzy linear separable, Fuzzy programming}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890455119\&partnerID=40\&md5=cafd40536136512fd2e0485a0240a565}, author = {Wang, A. and Li, J.} } @article {432, title = {Research on an adaptive algorithm of service selection in pervasive computing}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {482 - 488}, abstract = {An adaptive genetic algorithm of service selection in pervasive computing is presented in this paper. By means of matrix encoding, this algorithm carries out selection, crossover and mutation operations of genetic algorithm, with matrix as individual chromosome and matrix array as gene. Based on the elitism selection strategy and adaptive strategy, this algorithm replicates the optimal individual of every generation to the next generation, and adaptively adjusts crossover and mutation probabilities according to the fitness value of individual, which is aimed at protecting the individuals with high fitness and weeding out those with low fitness. Simulated comparison proves that this algorithm is of good convergence, which also shows more stable optimization ability, compared with ordinary genetic algorithm and random selection algorithm.}, keywords = {Adaptive Algorithm, Elitism Selection, Pervasive computing, Service Selection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892166746\&partnerID=40\&md5=ea96f5d6b9c178bdf71b3822a053afae}, author = {Wei, L. and Lanfei, Z. and Jianqiang, D.} } @article {423, title = {Research on cluster analysis of high dimensional space based on fuzzy extension}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {359 - 365}, abstract = {Traditional spatial data are generally high dimensional features, and in the clustering of high dimensional data can be directly applied to data processing because of Dimension effect and the data sparseness problem. For CLIQUE algorithm, which usually have the problem such as prone to non-axis direction of over-clustering, boundary judgment of fuzzy clustering and smoothing clustering. In this paper, a fuzzy clustering algorithm based on fuzzy extension of the high-dimensional spatial data is proposed. This algorithm not only considers effect of adjacent grid of data points in the sparse grid, but also extending the sparse grid region to avoid smoothing clustering phenomenon occurs. What{\textquoteright}s more, it can alleviate the problem of over-clustering and clustering fuzzy boundaries. Firstly, this passage gives a brief introduction to the characteristics of high dimensional spatial data as well as the Clustering methods. Based on the fuzzy extension a high-dimensional space data clustering analysis algorithms is put forward. The impact of the data samples around the point on the data points within the investigated grid is considered, sparse grid fuzzy extension, and at last, the problems of clustering fuzzy boundaries and to avoid excessive clustering produce meaningless clustering are solved.}, keywords = {Clustering integration, Fuzzy extension, Multi-scale clustering, Spatial clustering of high dimensional}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890448809\&partnerID=40\&md5=ad16385737a42e682c93f28740cee12a}, author = {Shan, D. and Li, W.Y.} } @article {364, title = {Research on digital library personalized information service model based on agent model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {418 - 422}, abstract = {Taking the personalized information needs of users as the research object, this article introduced the individualized service process of digital library, established the Agent model, built multivariate function by combining with the user preference model, and expounded the process of personalized information acquisition, analysis and push. We could conclude that digital library personalized information service system operated coordinately between each module, and had a complete chain of relationships. It could discovery and track information resources independently, effectively solve the problem of information overload, and realize the optimization of user information needs.}, keywords = {Digital Library, Information Service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892164200\&partnerID=40\&md5=5b059b6ec77bef4ae78981c43fbfa23f}, author = {Cao, J. and Liu, M. and Cao, L.} } @article {370, title = {Research on factors affecting farmers{\textquoteright} network information consumption}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {33 - 38}, abstract = {Research on farmers{\textquoteright} network information consumption behavior is an important issue, which cannot be avoided in Chinese rural informatization construction. Logit model is used to research the factors affecting farmers{\textquoteright} network information consumption, and the conclusions are as follows: 1) there are a number of factors affecting farmers{\textquoteright} consumption by using modern network information media; 2) environmental characteristics is the main factor affecting farmers{\textquoteright} information consumption via modern network information; 3) younger farmers more often use modern network information media; 4) farmers have a clear purpose by using modern network information media in information consumption, that is, to gain benefits by the use of information. The conclusions of this study will provide a reference for the government to solve the problem in the current informatization construction.}, keywords = {Consumption behavior, Farmers, Information consumption, Network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879070031\&partnerID=40\&md5=afb20649e0143ffa20b16c6c7f385bb8}, author = {Meng, H. and Ge, X. and Xie, M.} } @article {422, title = {The research on giant complex system using intelligent decision support system}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {335 - 341}, abstract = {Mankind is confronted with an increasingly complex system, especially the major decision issues, such as organization and management, coordination, planning, forecasting, controlling and so on. Due to the complexity of the system, many fuzzy factors and the limitations of the existing complex giant system theory, there are still many problems to be solved. The research on the giant complex system based on the theory of fuzzy decision theory theoretically had been proving the reliability of the group decision and has established "the multijudgments information" fuzzy synthesis computational method. It has designed the corresponding multipurpose intelligent decision support system IDSS.}, keywords = {Artificial intelligence, Decision support system, Fuzzy processing, Giant complex system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890477476\&partnerID=40\&md5=62072c647fcaedfc91f59a55e1124f4d}, author = {Li, J. and Wang, A.} } @article {409, title = {Research on management of mobile communication network centralized alarm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {261 - 266}, abstract = {This paper, starting from the level of mobile communication network alarm management, comes up with the alarm types and the six-stage model. The paper also discusses the step of recessive maintenance and management from the perspective of mobile communication in terms of the effective control of network alarms, and also extends the network equipment alarm logic correlation to the logical level of network equipment alarm correlation, at the same time, discusses the study and application of data mining algorithms in alarm correlation. Finally, the paper provides the plan for construction steps and function for stage target for the intelligent alarm analysis system.}, keywords = {Alarm correlation, Alarm management, Centralized monitoring, Mobile communication network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888333439\&partnerID=40\&md5=95535069f8aee6f6ca3093cd7ac4d8c0}, author = {Wang, Y. and Zhang, R.} } @article {397, title = {Research on the anti-perspective correction algorithm of QR barcode}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {202 - 206}, abstract = {2-D (2-dimension) bar code has many advantages compared with 1-D bar code, so it has many prevalent applications in recent days. However, there{\textquoteright}re several factors that affecting the sampling process, they lead to a certain degree of deformation towards the 2-D bar code. Furthermore, this deformation may too severe for 2-D bar code to be recognized. Generally, the main stream of twisted image correcting is based on the approach of control-point transformation. So how to locate the control point accurately becomes a key factor in 2-D bar code correcting. This paper develops a QR barcode searching graph and gets the precise location of control point. Experiment shows that our algorithm has good efficiency and accuracy.}, keywords = {Image correction, Line fitting, Perspective transformation, QR code, Searching graphics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880830674\&partnerID=40\&md5=4b80f450374df6601877d816dd4cc9af}, author = {Li, J. and Wang, Y.-W. and Wang, Y. and Chen, Y. and Wang, G.} } @article {383, title = {Research on the e-commerce of agricultural products in Sichuan province}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {97 - 101}, abstract = {A detailed investigation on the production, processing and sales of Sichuan agricultural products was made. Issues like how to bring into full play the regional advantages of Sichuan agricultural products and how to promote the advantageous resource allocation and competitiveness of agricultural products in market economy were also probed. Suggestions and schemes for the e-commerce service system of Sichuan agricultural products were proposed through the analysis framework of fuzzy comprehensive evaluation method and improved D\&M model.}, keywords = {Agricultural products, E - commerce, Logistics information platform}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879093653\&partnerID=40\&md5=a6a6161eb5e909e880cfcdfd360a539c}, author = {Jiong, M. and Xu, L. and Huang, Q. and Li, C.} } @article {363, title = {Research on the service modeling method of information management software based on the petri net model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {430 - 434}, abstract = {With the continuous development of science and technology, the development of the enterprise also requires the agility of enterprises. At present,SOA is one of the most popular means of achieving enterprise{\textquoteright}s agility.This article embarks on the Petri net model to study the service modeling method of information management software. Firstly, it introduces service-oriented architecture SOA and the methodology of service modeling SOMA, it has been understood its theoretical basis.Secondly, it expounds the structure and characteristics of Petri net. And then it introduces the PN -SM modeling process and the basic structure of the model. Finally, it draws the conclusion: Petri net is a kind of system model that suitable for describing concurrent characteristic.}, keywords = {Petri Net, PN-SM, SOA, SOMA}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892141654\&partnerID=40\&md5=9aefdc360773763828cb2e16117ebeed}, author = {Rui, S. and Xiaoyan, W.} } @article {437, title = {Research on transmission based on collaboration coding in WSNs}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {441 - 445}, abstract = {In order to reduce the increase of network delay and excessive energy consumption, which are caused by network code in WSNs, a fast random linear mechanism of network coding based on nodes collaboration is introduced. Energy consumption of nodes is reduced by transmitting the initial code of the node, and transmitting linear independent packets received merely. After gathering node coding, ACK return along the best path to reduce the network delay. Simulation results show that delay of data transmission is reduced greatly by introducing random linear network coding for sensor network, and the improved coded mode balances the network load.}, keywords = {Nodes Collaboration, Random Linear Network Coding, Wireless sensor network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892145435\&partnerID=40\&md5=2d72868947bda082492e18284f12ea5b}, author = {Xiao-Xing, L.V. and Bai-Hai, Z.} } @article {398, title = {Robust zero-watermarking algorithm for CAD models}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {240 - 243}, abstract = {Copyright protection and authentication of digital contents have become a significant issue in the current digital epoch with efficient communication mediums such as Internet. Digital watermarking technique is now one of the hot research fields of copyright protection for CAD graphic data under the network environment. But there are very limited techniques available for that because of its high shape-preserving demand. Zero-watermarking is such a good means to deal with it and it has lots of advantages such as high capacity, good robustness and various functions. In this paper, we will discuss zerowatermarking algorithm for CAD models and eventually propose a watermarking-based digital rights management system that would test our techniques.}, keywords = {CAD, Chaos, Copyright, Embedded design, NURBS, Zero-watermarking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880814416\&partnerID=40\&md5=7e8682b26931ad23644dd6e4bbbd6318}, author = {Liu, N. and Zhang, S. and Zhang, Y.} } @article {426, title = {Robustness analysis of social network based on a dynamic model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {453 - 461}, abstract = {Due to the high vulnerability of today{\textquoteright}s social systems against disruptions, it has become critical to measure and manage the robustness of social networks. In this study the relationship between social network{\textquoteright}s topology and its robustness in the presence of cascading failures is examined. In the attempt to help practice in increasing the robustness of social systems, the concept of the robustness of social systems is discussed and defined first. And then we propose a new dynamic model of social systems to investigate the robustness of social systems. We theorize that network characteristics such as average path length, node degree, and size of the largest connected component in social networks and so on. Based on the model, a good evaluation method is proposed to investigate the robustness of social networks against the cascading failures of component nodes. Finally, the damage degree of social networks considering cascading failures is investigated through our model. The simulation results confirm that there is a positive relationship between the robustness of social systems and social system performance, while a negative relationship between the topology structure and the robustness of social systems. By the dynamic model, we not only identify the potential key nodes, but also obtain the parameter value which can make the social network reach strongest robustness level. Our work develops a new methodology to the real world application. This research is helpful to increase the robustness of such complex systems and tackle the optimization problem of them.}, keywords = {Disruptions, Graph Theory, Network Damage Degree, Robustness, Social Network Analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892163854\&partnerID=40\&md5=861e44abb43f2d1f64ca3d9c26ee9c4f}, author = {Wu, H. and Ying, S. and Jia, X. and Zhang, L. and Chen, X.} } @article {428, title = {Rotation invariant texture image retrieval based on log-polar and NSCT}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {470 - 475}, abstract = {In order to solve the problem of rotation invariant texture image retrieval, an image retrieval algorithm based on Log-Polar and nonsubsampled contourlet transform (NSCT) is proposed. Log-Polar transform was first applied to texture image to convert the rotation to translation. Then, translation invariant NSCT was employed to decompose the transformed images. Standard deviations, energies and entropies of the different directional subbands features were calculated to make up a 45-dimension feature vector. Finally, Canberra distance was used to compute the comparability of this feature vector to retrieval images. The experiment results showed that the proposed algorithm was able to obtain a higher recall rate.}, keywords = {Image Retrieval, Log-Polar Transform, Nonsubsampled Contourlet Transform (NSCT), Rotation Invariant}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892172030\&partnerID=40\&md5=1266a1090a336e697f9579c13ca705a6}, author = {Xu, B. and Li, Z. and Xie, S.} } @article {342, title = {Real-time fault-tolerant scheduling algorithm for distributed computing systems}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {289 - 294}, abstract = {This article proposes a Distributed Realtime Fault-tolerant model, priority Real-time Fault-tolerant algorithm and computational architecture of Distributed Real-time Fault-tolerant. According to this model, the problem of how to schedule a weighted Directed Acyclic Graph (DAG) in Distributed computing system for high reliability can be solved in the presence of multiprocessors faults. When some tasks in a DAG have dependence on each other, a task must be scheduled to make sure that maximum communication efficiency and high reliability can be guaranteed due to a processor failure. Firstly, this paper propose task model, communication model and reliability model for evaluating fault-tolerant performance of the system, and define the priority of a task so that a critical task is defined as one with the highest priority. To add some constrained conditions that do not influence the earliest start time of its successors in the process of scheduling task, The Distributed Realtime Fault-tolerant Scheduling Algorithm (DRFACS) targets maximizing reliability to dynamically schedule dependent, non-preemptive, non-periodic real-time tasks to improve the quality of service through scheduling in the case of arising massive resource failures. Finally, Experimental results demonstrate the feasibility of the proposed algorithm.}, keywords = {Communication reliabiity, Directed acyclic graph (DAG), Fault-tolerant scheduling algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870824298\&partnerID=40\&md5=b2233dbb54c6e75335831b70d22145e8}, author = {Ling, Y. and Ouyang, Y.} } @article {311, title = {Research and analysis of improved extraction based on information processing technology}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {142 - 146}, abstract = {This paper analyzes the problem of research topics. The key words are extracted from the academic papers published in the key journals based on information processing technology, and these words have the cooccurrence relationship between clustered. Research topics in the academic field analysis applications, researchers can provide a clear outline; in the information retrieval process, you can help clarify the information needs. We will apply the proposed method to ROCLING seminar papers on the data to extract the important field of computational linguistics research topics. The results show that this method can be applied to the special circumstances of domestic academic field, while taking out the key words in English and Chinese. the word has been said that the field of cluster results can also be an important research topic. These results in a preliminary validation of the method proposed in this paper the feasibility. It can also be found that application of computational linguistics research and practice are closely related, taking out many of the words in the cluster and machine translation, speech processing and information retrieval related to the calculation model in the language, grammar patterns and analysis, broken words and statistical language model type is the calculation is the subject of interest to linguists.}, keywords = {Analysis, Natural language, Seminar}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866466102\&partnerID=40\&md5=408ac5cc2bfbffd4fed15d3005d825c2}, author = {Wei, Y. and Guo, Y.} } @article {313, title = {Research and practice of characteristic teaching resources sharing and interactive platform}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {59 - 63}, abstract = {By using advanced cloud computing, virtualization and distributed video load balance technology, the paper constructs an interactive platform which shares the teaching resources. On the one hand it provides a beyond time and space, free and equal interactive teaching and learning platform for the teachers and students. On the other hand it offers teaching resources Networked storage, utilization, communication and show space. Dispersive resources will be classified automatically and integrated modularly in order to perform Characteristic and high-quality multimedia resource database and media teaching characteristic of material database.}, keywords = {Characteristic teaching resource, Interactive platform, Sharing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866460216\&partnerID=40\&md5=4feb99d8b6bba4b616f6710a86bd53c2}, author = {Yun, W.} } @article {316, title = {Research on face recognition based on wavelet transform and PCA-ANN}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {136 - 141}, abstract = {This paper mainly studies the basic theory and technology on the identification of people{\textquoteright}s faces. The better methods are chosen and a new method is proposed. It integrates three elements (Wavelet Transform, Principal Component Analysis, Artificial Neural Networks), and the method can recognize faces more effectively. Meanwhile, this method lessens the effect of light on face appearance. Experimental result indicates that our new face recognition system is effective in the aspects of both correct ratio and speed of distinguishing.}, keywords = {Face recognition, Feature extraction, Principal component analysis, Radial basis function neural network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866450615\&partnerID=40\&md5=f0bb715fcc45b0395a7a2fee9540fdb9}, author = {Yuanzhi, W. and Xiao, L.} } @article {308, title = {A retrieval method based on language model considering neighboring contents}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {1 - 9}, abstract = {The World Wide Web (WWW) has a massive number of Web pages, so that it is difficult for users to get useful information. In recent years, however, it is said that the probabilistic language model can help to improve retrieval accuracies of some kinds of search engines. The probabilistic language model has statistical background and can adapt previous text information retrieval model. However, we cannot directly adapt the probabilistic language model to Web search engines, because data on the Web has a hyperlink environment while the probabilistic language model can only text information on it. In this paper, we propose a novel approach for searching Web pages considering a Web page as well as its neighboring oneson the hyperlink environment.}, keywords = {Hyperlink Analysis, Language Model, Web search}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857609599\&partnerID=40\&md5=78bc4a283c5231cf36f479f17c8ab0e5}, author = {Tamura, K. and Hatano, K. and Yadohisa, H.} } @article {319, title = {Review on virtual Human{\textquoteright}s affective model and related applied algorithm}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {71 - 78}, abstract = {The artificial intelligence simulation with virtual humans in virtual environment is considered as a research focus after movement simulation in field of artificial intelligence and simulation with virtual human include affective model and influence of affection to movement planning of virtual human. It{\textquoteright}s necessary to review on virtual human{\textquoteright}s affective model and related applied algorithm. A* algorithm is the main heuristic algorithm in artificial intelligence to search for the optimal solution of embodiment{\textquoteright}s path planning. In miscellaneous ergodic algorithms and heuristic search algorithms A* algorithm both has its own advantages. But facing more intricate virtual environment A* algorithm need to be improved by effective affective evaluation to get more flexible, comprehensive and humanized optimal path.}, keywords = {A* algorithm, Affective model, Movement planning, Optimal path, Virtual Human}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463534\&partnerID=40\&md5=9d6a46a01aa39f2875b7e69bd67a41e5}, author = {Liang, Z.} } @article {351, title = {Risk evaluation of rural financial organization operation based on the BP}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {341 - 346}, abstract = {The rural financial organization plays an important role in promoting the healthy development of the national economy especially the development of the rural economy. However, the rural financial organization risk especially the operating risk is still an outstanding problem. It has become a big obstacle in new countryside development. In this paper we analyzes the rural financial organization operational risk index firstly, then use these index as the input data for the BP neural network. After that we modeling rural financial organization operational risk early warning based the BP neural network. At last we take an experiment on a rural somewhere, the result shows that the BP neural network can reflect of the operation risk of the rural financial organization quickly and accurately.}, keywords = {BP Neural Network, Risk early warning, Risk evaluation, Rural finanical}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870856910\&partnerID=40\&md5=85d32baadc606adc5051d555a7003b8a}, author = {Fan, S. and Zhao, Y. and Xie, H. and Li, C.} } @article {295, title = {Reasoning on context satisfiability for service recommendation in mobilenetwork}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {249 - 254}, abstract = {The Ubiquitous Computing envisions a world of communicating mobile devices. As mobile devices usually have limited resources, it brings up the challenge to search and invoke services at any time and any place in an accurate, efficient and adaptive way. In this paper, we propose to filter services by matchmaking the precondition of service invocation and the context information of service consumer, in order to increase the accuracy and adaptivity of service discovery and recommendation in mobile environment. We construct context ontology to describe the environment when a service consumer submits service request first. And then, we propose to formalize the precondition of a successful service invocation based on a lightweight DL theory. Finally, reasoning on context satisfiability can be used for service recommendation. A case study shows our approach works well.}, keywords = {Context Satisfiability, Precondition Formalization, Service Reasoning, Service Recommendation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855397903\&partnerID=40\&md5=409b304a3bf247ee3b6d37e361841e41}, author = {Kuang, L. and Chen, L. and Xia, Y.} } @article {289, title = {Reconfiguration of graphical user interface}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {213 - 218}, abstract = {The usability and the prime value of a software product increases proportionately with the number of different types of users supported and the number of different types of services provided at any one time by the product. The user interface for the product plays a critical role in this context. In this paper, the authors describe a dynamically reconfigurable graphical user interface for a web-based application. The user interface for this application is designed as a collection of controls. The users will not only be able to view selective information from the user interface, but also will be able to rearrange the controls on the user interface. In addition, users will also be able to introduce new controls and modify existing controls on the user interface without manually recompiling the original code thus achieving greater flexibility and saving time. The paper illustrates this dynamic reconfiguration of user interface through a case study on a health care application.}, keywords = {Dynamic reconfiguration, Graphical user interface}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855393429\&partnerID=40\&md5=b5e09662f0a73d94b82934fd0f54d7df}, author = {Periyasamy, K. and Perkinian, V.} } @article {268, title = {A refined methodology for automatic keyphrase assignment to digital documents}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {55 - 63}, abstract = {Keyphrases precisely express the primary topics and themes of documents and are valuable for cataloging and classification. Manually assigning keyphrases to existing documents is a tedious task; therefore, automatic keyphrase generation has been extensively used to classify digital documents. Existing automatic keyphrase generation algorithms are limited in assigning semantically relevant keyphrases to documents. In this paper we have proposed a methodology to refine the result set of automatically generated keyphrases by Keyphrase Extraction Algorithm (KEA++), so that the keyphrases accurately and precisely represent the content of the document. Our approach is an additional layer at the top of KEA++ and exploits semantic relationships and hierarchical structure of the controlled vocabulary to filter out irrelevant keyphrases from the result set generated by KEA++. The methodology was applied on different sets of academic publications for evaluation. Evaluation demonstrates that the proposed refinement methodology improves the quality of generated keyphrases.}, keywords = {Automatic indexing, Keyphrase assignment, Vocabulary}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960690550\&partnerID=40\&md5=aeb220f4fd01fa335a93432979341abe}, author = {Khan, S. and Fatima, I. and Irfan, R. and Latif, K.} } @article {302, title = {Research on color consistency for color marketing in network transactionsystem based on color management}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {276 - 280}, abstract = {Color consistency is one of the key techniques for color marketing in color reproduction in network transaction system. A new color management method is presented based on analyzing the color rendering principles of scanned input images. Firstly, the method substitutes color blocks in color shade district in standard color target for complete color space to solve the difficulties of color sample selection. Secondly, contraction-expansion curve fitting algorithm is improved to improve its search efficiency and decrease its calculation. Thirdly, parameters of Yule-Nielson equation are reinterpreted, making them applied for non-printing dot image which only can be used for printed dot image originally and then the color conversion model for scanned images is deduced gradually though single color, double color and tricolor conversion correction. Finally the experimental results show that the model can improve scanner color conversion accuracy and can guarantee color consistency in color marketing in electronic business system in practice.}, keywords = {Color Management, Color Reproduction, Contraction-expansion Curve Fitting, Yule-Nielson Equation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855376957\&partnerID=40\&md5=0b49993c20664cc749d00431998517a2}, author = {Li, X.} } @article {283, title = {Role of segment progressive filter in dynamic data mining}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {171 - 175}, abstract = {Association rule mining perhaps the most widely described technique among the minding paradigms. The temporal association rule mining in the association rule mining tries to find relations among items in datasets. The temporal association mining has strength in detecting the dynamic nature of databases. Unfortunately the current mining methods ignore the consideration of database content updates. In the current research we have introduced the Incremental Standing method for Segment Progressive Filter (ISPF). The proposed technique can support the database update and mine updated datasets. We prove that the proposed algorithm is an optimal way of mining. We have applied the scan reduction technique to generate all candidate k-item sets to form 2-candidate item sets directly. We also bring good experimentation to validate and document clearly the algorithm with good examples.}, keywords = {Mining algorithms, Segment Progressive Filter, Temporal association rules}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053099423\&partnerID=40\&md5=e113d860dc0339efdd1f9af97d9c9121}, author = {Naqvi, M. and Hussain, K. and Asghar, S. and Fong, S.} } @article {284, title = {Route maintenance using link state prediction for dense mobile Ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {153 - 158}, abstract = {An ad hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be robust and simple. In mobile ad hoc networks (MANETs), node mobility causes network topologies to change dynamically over time, which complicates the important tasks such as route discovery and maintenance. Most of the routing algorithms usually focus on how to discover a stable route, but rarely considers the adaptability of constructed route to the change of node{\textquoteright}s motion. This paper proposes a new ad hoc route maintenance protocol called Route Maintenance using Link State Prediction (RM-LSP). RM-LSP utilizes node locality to enhance resilience against mobility and hence the throughput. RM-LSP reduces the overhead of route failure recovery in source end and attempts to improve route efficiency and network throughput. Our simulation results show that RM-LSP delivers packets efficiently while substantially reducing control overhead in various environments. Simulation study of the algorithm proves it to offer significant benefits in dense scenarios.}, keywords = {Handoff, Promiscuous mode, RCPI, RM-LSP}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053097391\&partnerID=40\&md5=c78b385ffa38ed082a3ca58d4fdd388f}, author = {Sankar, S. and Sankaranarayanan, V.} } @article {231, title = {Rule based autonomous citation mining with tierl}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):9Export Date: 10 July 2014}, month = {2010}, pages = {196 - 204}, abstract = {Citations management is an important task in managing digital libraries. Citations provide valuable information e.g., used in evaluating an author{\textquoteright}s influences or scholarly quality (the impact factor of research journals). But although a reliable and effective autonomous citation management is essential, manual citation management can be extremely costly. Automatic citation mining on the other hand is a non-trivial task mainly due to non-conforming citation styles, spelling errors and the difficulty of reliably extracting text from PDF documents. In this paper we propose a novel rule-based autonomous citation mining technique, to address this important task. We define a set of common heuristics that together allow to improve the state of the art in automatic citation mining. Moreover, by first disambiguating citations based on venues, our technique significantly enhances the correct discovery of citations. Our experiments show that the proposed approach is indeed able to overcome limitations of current leading citation indexes such as ISI Web of Knowledge, Citeseer and Google Scholar.}, keywords = {Citation index, Citation mining, Digital libraries, Information extraction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79951786283\&partnerID=40\&md5=4fbea6129a6c4c727c3c0618ccbe6087}, author = {Afzal, M.T. and Maurer, H. and Balke, W.-T. and Kulathuramaiyer, N.} } @article {190, title = {The role of interoperability in egovernment applications: An investigation of critical factors}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {235 - 243}, abstract = {The aim of this paper is to provide a better understanding on the role of interoperability in eGovernment applications. The focus of interest is on eGovernment applications involving more than one agency or heterogeneous technical infrastructures. The main research objective is to identify a set of critical factors that influence eGovernment interoperability. To fulfil this objective we reviewed the relevant literature and examined 18 case studies of European eGovernment applications where interoperability has a significant role. The results enabled us to identify a number of critical factors categorized as technical, semantic, organizational, political, legal, managerial and economic. We believe that the results of this research can be used by practitioners and researchers alike. Practitioners may use the results as guidance when developing their own applications. Researchers can further extend these results, for example, by attempting to better understand current trends, by identifying additional critical factors and by investigating the relationships between factors.}, keywords = {Critical factors, Interoperability, Public service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953270343\&partnerID=40\&md5=c3757c55a2892aedc09fa0f7b0d14650}, author = {Tambouris, E. and Loutas, N. and Peristeras, V. and Tarabanis, K.} } @article {139, title = {Rate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {180 - 188}, abstract = {The motivation of this work is based on the observation that Cauchy distribution provides more accurate estimates of rate and distortion characteristics of video sequences than the previously used distribution such as Laplacian distribution. In this paper, we propose a new rate control scheme for H.264 low-delay video transmission using Cauchy rate-distortion optimization model. Our proposed method uses the Lagrange Multiplier technique to optimize the cost function, and be able to find the rate and distortion model subject to the target bit rate constraint resulting in the optimum choice of quantization step sizes. Model parameters are estimated using statistical linear regression analysis. The target number of bits for each frame is determined according to their buffer status, the number of bits use in the previous frame, and basic unit complexity. The proposed scheme has been implemented on H.264 video coder. Simulation results show that the proposed rate control algorithm achieves, on the average, an improvement in PSNR for up to 1.68dB with lesser number of frames skipped as compared with the default H.264 JM8.6 rate control scheme.}, keywords = {Cauchy distribution, Lagrange multiplier technique, Linear regression analysis, Low delay, Rate control}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449205119\&partnerID=40\&md5=60340eb5bbe6774b89e2d6c72f1c7181}, author = {Eiamjumrus, N. and Aramvith, S.} } @article {114, title = {A recommendation model based on site semantics and usage mining}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {244 - 255}, abstract = {The explosive growth of online data and the diversity of goals that may be pursued over the web have significantly increased the monetary value of the web traffic. To tap into this accelerating market, web site operators try to increase their traffic by customizing their sites to the needs of specific users. Web site customization Involves three great challenges: (I) the accurate identification of the user Interests in the sites{\textquoteright} content (II) the detection of the user goals in their site visits and (III) the encapsulation of the user interests and goals into the sites{\textquoteright} presentation and content. In this paper, we study how we can effectively identify the user interests and goals in their site visits and we evaluate their correlation as this is exemplified in the users{\textquoteright} navigational patterns and the site{\textquoteright}s semantic content and structure. Based on our findings we propose a novel recommendation mechanism that employs web mining techniques for suggesting customized site views that satisfy both the user preferences and goals. Our experimental evaluation shows that the user site interests and interaction goals can be accurately detected from the users{\textquoteright} navigational behavior and that our recommendation model, which uses the identified user preferences and goals yields significant improvements in the sites{\textquoteright} usability.}, keywords = {Recommendations, Subject hierarchy, User profiles, Web site customization, Web usage mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350741026\&partnerID=40\&md5=9afb2fa2b33a9de355f329041b572518}, author = {Stamou, S. and Kozanidis, L. and Tzekou, P. and Zotos, N.} } @article {161, title = {Restricted continuous KNN queries on road networks with caching enhancement}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {38 - 50}, abstract = {Using a Global Positioning System (GPS) in the car navigation system enables the driver to perform a wide range of queries, from locating the car position, to finding a route from a source to a destination, or dynamically selecting the best route in real time. With spatial network databases (SNDB), objects are restricted to move on pre-defined paths (e.g., roads) that are specified by an underlying network. In our previous work, we proposed a novel approach, termed Progressive incremental Network Expansion (PINE), to efficiently Support several spatial queries. In this work, we utilize our developed PINE system to efficiently support Restricted Continuous K Nearest Neighbors (RCKNNs) queries. RCKNN continously finds the K nearest objects to a query point an a given path that are within a specified distance bound. Our solution addresses a new type of query that is plausible to many applications where the answer to the query not only depends an the distances of the nearest neighbors, but also on the user ar application needs. By distinguishing between two types of split points, we reduce the number of computations required to retreive the RCKNNs of moving object. We futher define a caching model to expedite RCKNN query response time.}, keywords = {Navigation system, Network databases, Spatial databases}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703\&partnerID=40\&md5=cc8d24f89ed2e864614cd064ddf33afc}, author = {Safar, M. and Ebrahimi, D. and Jane, M.M.F. and Nadarajan, R.} } @article {148, title = {Reversible data embedding for color images}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {143 - 150}, abstract = {The data hiding technique is used to hide a secret message into a cover image which is then sent to a receiver without raising any suspicions. With a reversible (lossless) data hiding method, a receiver can extract a secret message and exactly restore an original cover image from an embedded image. This paper presents a novel reversible data embedding scheme for color images. The proposed scheme mostly embeds two secret bits into one cover pixel by replacing the cover pixel with its permutation whose Euclidean distance is closest to the cover pixel. The experimental results show that the proposed scheme can achieve a high embedding rate while maintaining the visual quality of stego color images in comparison with other methods.}, keywords = {Color image, Data hiding, Reversible data embedding, Steganography}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449195742\&partnerID=40\&md5=1b853cfe31f8ca5c0628ba531a66fd92}, author = {Chang, C.-C. and Kieu, T.D. and Chou, Y.-C.} } @article {142, title = {Robust video watermarking based on dual-plane correlation for immunity to rotation, scale, translation, and random distortion}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {161 - 167}, abstract = {A robust video watermarking method is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It can detect watermarks without any search for canceling the effect of random distortion. Rotation, scale, and translation are canceled by searching for the angle, size, and origin of the original picture. The search for the angle and size is combinatorial but is independent of the search for the origin. That is, the angle and size of the target picture can be restored without restoring the picture{\textquoteright}s origin. Furthermore, the search for the origin is divided into horizontal and vertical searches that can be carried out independently. The number of searches is thus drastically reduced, making the processing speed high enough for practical application. Experimental evaluation using actual video samples demonstrated that the proposed method can embed watermarks immune to all four types of transformations.}, keywords = {Random distortion, RST, Survivability, Video watermarking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67949090393\&partnerID=40\&md5=66e6b7ff3c851392463bf9ef0b6f2ae3}, author = {Atomori, Y. and Echizen, I. and Dainaka, M. and Nakayama, S. and Yoshiura, H.} } @article {132, title = {Route navigation method for disabled access GIS in consideration of abilities and psychologies}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {348 - 352}, abstract = {This paper aims to propose a route navigation method for disabled access GIS. We focused the disabled{\textquoteright}s psychologies as well as their physical conditions. This paper represents quantization of physical and psychological burden of the disabled persons inflicted by various barrier factors. Also it represents estimation of total burden of a route to determine the optimum route. The route is represent ed by graph theory and route navigation method which is based on Dijkstra algorithm is applied. We extend the algorithm to make it possible to provide information on obstacles even when there are no accessible routes available to destination. The result of this study is being implemented and published as 3D Web Disabled Access GIS.}, keywords = {Dijkstra algorithm, Disabled GIS access, Route navigation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349999422\&partnerID=40\&md5=4e6caeba1ef58b3c7c8a134d5f996e57}, author = {Izumi, S. and Kobayashi, G. and Yoshida, T.} } @article {111, title = {A real time S-box construction using arithmetic modulo prime numbers}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2007}, pages = {354 - 360}, abstract = {This paper proposes an implementation of the inverse function of the Advanced Encryption Standard using the field of prime numbers instead of the Galois Field originally proposed by Rijndael. The paper will show that the former approach is simpler and requires less execution time and implementation circuitry compared to the latter. The authors analyzed several implementations of the inverse function for the S-Box using various approaches in search for an optimal one. In particular, simulation was used to analyze performances of algorithms for computing the inverse function based on: the arithmetic modulo a power-of-two; arithmetic modulo a power-of-two plus one; and arithmetic modulo a prime number. The simulation revealed that the modulo a prime number approach has the best performance. Furthermore, the analysis revealed that using this approach may enhance security relative to the original approach. The proposed implementation will provide a better alternative that can be embedded in many systems.}, keywords = {Diffusion, Hardware implementation, Modulo prime arithmetic, Parallel execution, Pipelining, VHDL}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149096383\&partnerID=40\&md5=a1fe3d6b0e1b163d7545da8586d0fc0f}, author = {Abuelyman, E.S. and El-Affendi, M.A.} } @article {68, title = {A review of quality of service (QoS) route provisioning in mobile ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {32 - 47}, abstract = {With the increase of portable devices as well as rapid advancement in computing and wireless technologies, mobile ad hoc networking is gaining importance with the increasing number of widespread applications. Quality of service (QoS) routing plays a prominent role for providing QoS in mobile wireless ad hoc networks. Real time and multimedia applications need stringent QoS requirements. Providing a complete quality-of-service (QoS) solution for the ad hoc networking environment requires the interaction and co-operation of several components which include a QoS routing protocol, a resource reservation mechanism and a QoS capable medium access control (MAC) layer. The tasks of QoS routing are in general selecting routes with satisfied QoS requirement(s), and achieving global efficiency in terms of resource utilization. QoS is more difficult to guarantee in mobile ad hoc networks than in other type of networks due to the sharing of wireless bandwidth among adjacent nodes, its dynamic topology and generally imprecise network state information. This work is intended to provide a broad and comprehensive review of the QoS routing protocols proposed for ad hoc networks. This paper also describes important QoS frameworks for MANETs which attempt to provide required/promised services to each user or application.}, keywords = {Code division multiple access (CDMA), MAC, Mobile ad hoc networks (MANETs), Multi-path routing, QoS framework, QoS routing, Quality-of-service (QoS), Time division multiple access (TDMA)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947328537\&partnerID=40\&md5=32892d1835b3d07244ec98fa129cdf02}, author = {Kumar, R. and Misra, M. and Sarje, A.K.} } @article {88, title = {Robust adaptive beamforming with SSMUSIC performance optimization in the presence of steering vector errors}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {107 - 114}, abstract = {A novel subspace projection approach was proposed to improve the robustness of adaptive beamforming and direction finding algorithms. The cost function of the signal subspace scaled multiple signal classification (SSMUSIC) is minimized in the uncertainty set of the signal steering vector, the optimal solution to the optimization problem is that the assumed steering vector can be modified as the weighed sum of the vectors orthogonally projected onto the signal subspace and the noise subspace. Using the estimated steering vector with small error to the true steering vector, the spectral peaks in the actual signal directions are guaranteed. Consequently, the problem of signal self-canceling encountered by adaptive beamforming due to steering vector mismatches is eliminated. Simulation and lake trial results show that the proposed method not only possesses high resolution performance, but also is robust to a few steering vector errors. Furthermore, the modified MUSIC algorithm outperforms the conventional MUSIC and SSMUSIC methods excellently.}, keywords = {Diagonal loading, Direction of arrival, Robust adaptive beamforning, Steering vector error, Subspace projection matrix}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350695756\&partnerID=40\&md5=2214a4d0fbafc0be565751c0b0993b3d}, author = {Jiang, B. and Cheng, Q. and Ling, G.} } @article {69, title = {A robust outlier detection scheme for collaborative sensor networks}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {12 - 18}, abstract = {In-networks, Data Aggregation is usually warranted for distributed wireless sensor networks, owing to reliability and energy efficiency reasons. Sensor nodes are usually deployed in unattended and unsafe environments and hence are vulnerable to intentional or unintentional damages. Individual nodes are prone to different type of faults such as hardware faults, crash faults etc and other security vulnerabilities wherein one or more nodes are compromised to produce bogus data so as to confuse the rest of the network in collaborative sensing applications. The availability of constrained resources and the presence of faulty nodes make designing fault tolerant information aggregation mechanisms in large sensor networks particularly challenging. In our work, we consider Byzantine type of faults, which encompasses most of the common sensor node faults [9]. Faulty nodes are assumed to send inconsistent and arbitrary values to other nodes during information exchange process. These values are termed as outliers and we use a statistical test called Modified Z-score method to reliably detect and remove outliers. We show by simulation that the proposed strategy works well for 2 major classes of collaborative sensor network applications viz. (i) Target/Event detection and (ii) Continuous data gathering.}, keywords = {Data aggregation, Detection accuracy, Distributed information processing, False positives, Fault tolerance, Outliers}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947305265\&partnerID=40\&md5=2fae284d218d7852052fabf8a0ef68ca}, author = {Jayashree, L.S. and Arumugam, S. and Vijayalakshmi, K.} } @article {92, title = {Robust self embedding watermarking technique in the DWT domain for digital colored images}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {211 - 219}, abstract = {In this work, a robust watermarking algorithm is proposed for colored digital images. The 24 bits/pixel RGB images are converted to YCbCr color format, and the Y part is converted to Discrete Wavelet Transform (DWT). The resulted LL part is resized to the original size of the host image and its blocks are scrambled using certain key. The watermark is another copy of the LL part and its pixels are, also, scrambled and each pixel is embedded in one of the scrambled blocks of the LL part. The algorithm takes into account the Human Visual System via relating the embedding process to the intensity of each block of the host image. We have used the average PSNR as a quality measure for the embedding stage. In all our experiments we got more than 68 dB which satisfies the PSNR bench mark. Also we got an average value of 0.15 for MAE, which is the robustness measure. This means that our algorithm is very robust and the watermark is still recognizable.}, keywords = {Copyright, Digital images, Embedding, Robustness, Scrambling, Watermaking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949187327\&partnerID=40\&md5=d8e2ad97422a0852424c209b57cc93ff}, author = {Al-Tahan Al-Nu{\textquoteright}aimi, A. and Qahwaji, R.} } @article {85, title = {Rotation-based three dimensional shape descriptor}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {138 - 141}, abstract = {Recent developments in techniques for modeling, digitizing and visualizing three dimensional shapes have led to an explosion in the number of available three dimensional models on the Internet and in many domain-specific databases. However, how to describe three dimensional shapes is a difficult problem. A new three dimensional shape description method based on rotation is proposed in this paper. The first step is to sample points on the surface and compute normal vectors. Secondly, we do Gauss mapping and rotate model, at the same time, rotate the Gauss sphere. The third step is to analysis normal distributions on the sphere surface. Then the Euclidean distance is computed, and finally a statistic histogram is constructed. Experimental results show the effectiveness of this method.}, keywords = {3 d space descriptors, Gauss mapping, Three dimensional shapes}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350689502\&partnerID=40\&md5=11b5b46b07b7146eba309aa78ff8f501}, author = {Luo, H. and Chu, S.-C. and Pan, J.-S. and Lu, Z.-M.} } @article {33, title = {RDF-based peer-to-peer based ontology editing}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {50 - 55}, abstract = {The evolution of the Semantic Web has accelerated the need for ontologies. There is a need to build new ontologies and to extend and merge existing ontologies. To achieve this we need software tools to edit and build ontologies. Our paper describes software to develop a protocol for collaborative ontology editing based on RDF and using a Peer-to-Peer (P2P) networking architecture. The protocol allows for the implementation a voting mechanism embedded into the RDF data itself, using a mixed initiative design for notification. This is implemented as extensions to an ontology browser called OntoRama. The P2P approach is compared to the classic ontology editing approaches and the special requirements of the ontology editing environment are discussed. The protocol, design, implementation and architecture for ontology update are also elaborated.}, keywords = {Network protocol, Ontology, P2P network architecture, RDF data, Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748271282\&partnerID=40\&md5=6e01c9d91afd3edb7ba6d4f2ba608881}, author = {Becker, P. and Eklund, P. and Roberts, N.} }