@article {746, title = {Improvement of English-Chinese Translation Method by Feature Reduction and Rule Optimization Based on Rough Set Theory-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {09-2023}, pages = {83-87}, type = {Research}, chapter = {83}, abstract = {

The traditional machine translation algorithm faces low efficiency and low accuracy due to complex grammar and multiple rules of English noun phrases. A kind of noun phrase identification method based on a rough set was proposed to improve the accuracy of English noun phrases. The rough set method regarded the identification of English noun phrases as a decision problem. We used rough set theory to reduce features, optimize rules for English noun phrases, and finally identify them. Then, a simulation experiment was carried out on an English noun phrase sample on the Wall Street Journal (WSJ) using rough set theory. The stimulation demonstrated that the accuracy of the noun phrase improved by the rough set was higher than another translation method; therefore, it is an effective machine identification method for English noun phrases, providing a basis for practical design.

}, doi = {https://doi.org/10.6025/jdim/2023/21/3/83-87}, url = {http://www.dline.info/download.php?sn=3837}, author = {Hongxia Wei} } @article {761, title = {A Survey of Sentiment Analysis in the Arabic Language}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {03/2022}, pages = {10-24}, type = {Research}, chapter = {10}, abstract = {

\ {\^a}{\texteuro}{\oe}What the others think?{\^a}{\texteuro} is an essential question for individuals, companies, and governments. All need to know the public opinions to make their decisions wisely. In the last decade, sentiment analysis and opinion mining have become one of the growing research areas. This paper presents the current state of sentiment analysis and opinion mining research. In particular, researches those deals with the Arabic language. We tried to cover the techniques and methods in sentiment analysis and the challenges in the field. We described the leading methods and approaches that have been introduced in the literature for Arabic Sentiment analysis and opinion mining. The main contributions of this paper include the sophisticated categorizations of a large number of recent articles about Arabic Sentiment analysis. These articles are categorized according to their contributions in the various sentiment analysis techniques.

}, doi = {https://doi.org/10.6025/jdim/2022/20/1/10-24}, url = {http://www.dline.info/download.php?sn=3449}, author = {Kamel JAFAR and Bassel Alkhatib and Hazem WANNOUS} } @article {771, title = { Automated Management of Computer Management Procedure of Critical Control Point Information on HACCP System-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {03/2021}, pages = {27-30}, type = {Research}, chapter = {27}, abstract = {

Aiming to solve the management and decision- making problems occurring in food production field at present, this study strives to build an accurate and effective hazard analysis and critical control point (HACCP) computer automated management system combined with computer management programs by taking the HACCP system as standard. This system is able to be integrated into the overall framework of the system applying case-based reasoning (CBR) technology combined with ontological content and extended content, and emphasizes on exploring knowledge representation of HACCP system and computing method of similar cases, which improves the safety and order of food production.

}, doi = {https://doi.org/110.6025/jdim/2021/19/1/27-30}, url = {http://www.dline.info/download.php?sn=3173}, author = {Yongmei Li and Yang Zhao and Lingjun Wang and Ying Wang} } @article {782, title = {Comparison of the Effects Stemmer Porter and Nazief-Adriani on the Performance of Winnowing Algorithms for Measuring Plagiarism-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {04/2020}, pages = {49-56}, type = {Research}, chapter = {49}, abstract = {

Current technological developments change physical paper patterns into digital, which has a very high impact. Positive impact because paper waste is reduced, on the other hand, the rampant copying of digital data raises the amount of plagiarism that is increasing. At present, there are many efforts made by experts to overcome the problem of plagiarism, one of which is by utilizing the winnowing algorithm as a tool to detect plagiarism data. In its development, many optimizing winnowing algorithms used stemming techniques. The most widely used stemmer algorithms include stemmer porter and nazief-adriani. However, there has not been a discussion on the comparison of the effect of performance using stemmer on the winnowing algorithm in measuring the value of plagiarism. So it is necessary to do research on the effect of stemmer algorithms on winnowing algorithms so that the results of plagiarism detection are more optimal. The results of this study indicate that the effect of nazief-adriani stemmer on the winnowing algorithm is superior to the stemmer porter, only decreasing the detection performance of the 0.28\% similarity value while the porter stemmer is superior in increasing the processing time to 69\% faster.

}, doi = {https://doi.org/10.6025/jdim/2020/18/2/49-56}, url = {http://dline.info/fpaper/jdim/v18i2/jdimv18i2_1.pdf}, author = {Alam Rahmatulloh and Neng Ika Kurniati and Irfan Darmawan and Adi Zaenal Asyikin and Deden Witarsyah} } @article {792, title = {Optimization of Topic Recognition Model for News Texts Based on LDA-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {257-269}, type = {Research}, chapter = {257}, abstract = {

\ Latent Dirichlet Allocation (LDA) is the technique most commonly used in topic modeling methods, but it requires the number of topics generated by LDA to be specified for topic recognition modeling. Except the main iterative methods based on perplexity and nonparametric methods, recent research has no simple way to select the optimal number of topics in the model. Aiming at appropriately determining the number of topics and then optimizing the LDA topic model, this paper proposes a non-iterative method for automatically determining the number of topics. The clustering method is based on fast seeking and locating density peaks. This method transforms the traditional topic cluster number selection problem into clustering problem and thus can be used to optimize the topic recognition model for news texts. It does not need iterative optimization and can simplify model development. This method uses Word2Vec for word embedding on corpus text to explore the superior performance of word-related relationships and to express the implicit semantic relationship between topic corpora. Then, using a clustering algorithm that quickly searches for and finds the cluster peaks; the word vectors after word embedding are clustered to obtain the number of word vector clusters after word embedding. The number of clusters is used as the number of topics in the text. Finally, the experimental results show that the proposed method enjoys better precision and F1 value than the perplexitybased method, and is suitable for the identification of the number of topics in corpora in different sizes. This method can effectively find the appropriate number of topics from the news text dataset and improve the accuracy of the LDA theme model.

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/257-269}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_1.pdf}, author = {Hongbin Wang and Jianxiong Wang and Yafei Zhang and Meng Wang and Cunli Mao} } @article {706, title = {Viscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {13-24}, doi = {https://doi.org/10.6025/jdim/2019/1/13-24}, author = {Ignacio Espinoza and Marcelo Mendoza and Pablo Ortega and Daniel Rivera and Fernanda Weiss} } @article {809, title = {Viscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {13-24}, type = {Research}, chapter = {13}, abstract = {

Opinions in forums and social networks are released by millions of people due to the increasing number of users that use Web 2.0 platforms to opine about brands and organizations. For enterprises or government agencies it is almost impossible to track what people say producing a gap between user needs/ expectations and organizations actions.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/13-24}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_2.pdf}, author = {Ignacio Espinoza and Marcelo Mendoza, and Pablo Ortega and Daniel Rivera, and Fernanda Weiss} } @article {622, title = {Application of the Fiber Image Detection Algorithm Based on the Grey System Theory and Directed Graph}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, pages = {8-15}, author = {Xiaodong Wang and Jianhui Yang} } @article {652, title = {Non-words Spell Corrector of Social Media Data in Message Filtering Systems}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {64-75}, type = {Research}, author = {Zar Zar Wint and Th{\'e}o Ducros and Masayoshi Aritsugi} } @article {634, title = {Solution to Harmonics Interference on Track Circuit Based on ZFFT Algorithm with Multiple Modulation}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {03/2018}, pages = {12-26}, type = {Research}, author = {Xiaochun Wu and Guanggang Ji} } @article {659, title = {Team Capacity Evaluation and Scheduling Model for Collaborative Product Design}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {02/2018}, pages = {1-12}, type = {Research}, author = {Xiaolei Wang} } @article {467, title = {Multicast optimization and node fast location search method for wireless sensor networks based on ant colony algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {303 - 311}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041033655\&partnerID=40\&md5=96fc8eeac1d35f0e46d39f00d5a8e7f2}, author = {Wang, R. and He, G. and Wu, X. and Wang, F. and Hu, Y.} } @article {837, title = {Multicast Optimization and Node Fast Location Search Method for Wireless Sensor Networks Based on Ant Colony Algorithm-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {303-311}, type = {Research}, chapter = {303}, abstract = {

\ Wireless sensor network is a new information acquisition and processing technology. A large number of sensor nodes form a network through self-organization including each node integrates sensing unit, processing unit, communication unit and energy supply. The protocol multicast technology of wireless sensor network routing is a means of group communication, which requires information from the source node at the same time sent to multiple destination nodes, routing as the core technology of multimedia networks, its scope of study is extensive, including routing protocols, routing strategy and routing algorithms. In this paper, we mainly study the multicast routing algorithm which is based on Quality of Service (QoS), and introduce the search strategy which is based on the shortest path of pheromone in the process of ant colony feeding. MATLAB ant colony algorithm is also used in the WSN routing protocol multicast problem in the application of the problem solving for local optimization. The result of computer simulation shows that the ant colony algorithm has a better effect on solving the multicast protocol of WSN, and the algorithm can realize the fast positioning and query of wireless sensor network routing nodes.

}, doi = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_1.pdf}, author = {Ruiying Wang, Guoping He and Xiaoming Wu and Fuqiang Wang and Yifan Hu} } @article {521, title = {A clustering with slope algorithm based on mapreduce}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {168 - 176}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982801686\&partnerID=40\&md5=59c334c0b1dd3e8b94a3cc75d5785e89}, author = {Wang, Y. and Wu, H. and Liang, J. and Ou, J. and Huang, Y.} } @article {505, title = {DVM-based topic detection for microblog}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {383 - 391}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010949216\&partnerID=40\&md5=25b19644aeefdf985af20e330561f8dd}, author = {Lv, J.-G. and Jiang, X.-Y. and Chi, Q.-Y. and Wei, Z. and Jocshi, A.} } @article {525, title = {Image fusion based on WRV and NHM rules for medical digital image in contourlet domain}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {151 - 159}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982840475\&partnerID=40\&md5=9ce1fb8c2ef06112889a547afa917d4e}, author = {Wang, J. and Lai, S. and Borjer, T.H.} } @article {502, title = {Improved Convolutional Neural Network for biomedical word sense disambiguation with enhanced context feature modeling}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {342 - 350}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950516\&partnerID=40\&md5=976019ac152af0c2f33880cb6ca688a6}, author = {Ren, K. and Wang, S.-W.} } @article {533, title = {An improved SMOTE algorithm based on genetic algorithm for imbalanced data classification}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {92 - 103}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974814392\&partnerID=40\&md5=8541ce719ff30daad12313b47f996454}, author = {Gu, Q. and Wang, X.-M. and Wu, Z. and Ning, B. and Xin, C.-S.} } @article {546, title = {Model of e-commerce cloud warehouse grading based on mass simulation data}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {311 - 321}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006846917\&partnerID=40\&md5=31b0b8c45c1082ef2e532a89c8699927}, author = {Wang, F. and Wang, Y.-L. and Liu, Z.-J. and Cui, X. and Zhang, P.} } @article {541, title = {Technological relatedness based on co-classification network analysis: A case study on electricity sector}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {26 - 32}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969776908\&partnerID=40\&md5=6479b8e4f2d84118e5b1591e47ca376a}, author = {Wen, F.-F.} } @article {561, title = {Application of a NewmAnt-MinerPRAlgorithm in Classification Rule Mining}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {311 - 320}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959855322\&partnerID=40\&md5=063496b12a1e92c72d123e5a9f9044f3}, author = {Yang, L. and Li, K.S. and Zhang, W.S. and Wang, Y. and Ke, Z.X.} } @article {597, title = {Cloud-based government procurement information integration platform}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {147 - 155}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938587940\&partnerID=40\&md5=a0687e73f079a9f60c27328d138c7b97}, author = {Wang, P.Y. and Shen, J. and Guo, W.Q. and Zhang, C. and Zhang, B.} } @article {577, title = {Computer graphics algorithm based on visualization teaching theory}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {137 - 141}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938590017\&partnerID=40\&md5=7ae622ba1163d0246f51519817a5ff89}, author = {Wang, F.} } @article {593, title = {Differential evolution enhanced with composite population information based mutation operators}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :3Export Date: 22 February 2018}, month = {2015}, pages = {210 - 223}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942511121\&partnerID=40\&md5=7309be081ccccb38955635c7e2c213ec}, author = {Liao, J. and Cai, Y. and Chen, Y. and Wang, T. and Tian, H.} } @article {576, title = {A hybrid method to extract triggers in biomedical events}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {300 - 305}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942513410\&partnerID=40\&md5=2e0586033f81cb3990ed8b5f9af40cb4}, author = {Wei, X. and Zhu, Q. and Lyu, C. and Ren, K. and Chen, B.} } @article {589, title = {A malicious peers detection framework for peer-to-peer systems}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {224 - 233}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942519413\&partnerID=40\&md5=fc3039a25dbc94ef9afe8a2afb325e1b}, author = {Wei, X. and Fan, J. and Wang, T. and Wang, Q.} } @article {560, title = {Medical image retrieval based on an improved non-negative matrix factorization algorithm}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {421 - 428}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959237960\&partnerID=40\&md5=ee501167cf7cb57cf0c511a61603a1a2}, author = {Wang, J. and Lai, S.Y. and Li, M.D. and Lies, D.H.} } @article {594, title = {A new recognition approach for logical link blocks in webpages}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {76 - 85}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930396310\&partnerID=40\&md5=4d563f444bd172f8c11110f370212a2a}, author = {Wang, X.M. and Wu, Z.D. and Huang, Y.N. and Gu, Q.} } @article {583, title = {Study on the 3D information reconstruction and management of cultural relics based on the articulated arm scanner}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {31 - 38}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930349218\&partnerID=40\&md5=53aa49c6b138faae7f80780d39bb0fde}, author = {Zhang, X.-D. and Hou, M.-L. and Hu, Y.-Y. and Zhang, X.-Q. and Wu, Y.-H.} } @article {610, title = {Tacit knowledge spreading based on knowledge spreading model on networks with consideration of intention mechanism}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :4Export Date: 22 February 2018}, month = {2015}, pages = {293 - 299}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942525245\&partnerID=40\&md5=49327da3411a33f3822677a64952560c}, author = {Zhu, H.-M. and Zhang, S.-T. and Zhang, Y.-Y. and Wang, F. and Liu, K.} } @article {451, title = {Analysis of information management and scheduling technology in hadoop}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {133 - 138}, abstract = {Development of big data computing has brought many changes to society and social life is constantly digitized. {\textquoteright}How to handle vast amounts of data{\textquoteright} has become a more and more fashionable topic. Hadoop is a distributed computing software framework, which includes HDFS and MapReduce distributed computing method, make distributed processing huge amounts of data possible. Then job scheduler determines the efficiency of Hadoop clusters and user experience. Under the premise of familiar with the mechanism of Hadoop{\textquoteright}s running tasks, make a full analysis of the existing Hadoop task scheduling algorithm, such as FIFO-Scheduler, Capacity-Scheduler, FairShare-Scheduler and LATE-Scheduler, found that the existing scheduling algorithms do not perceive the performance of the computing node, so that it cannot assign different tasks depending on the machine performance in heterogeneous Hadoop cluster.}, keywords = {Cloud computing, Hadoop, Map Reduce, Task Scheduling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903118321\&partnerID=40\&md5=9c6201daf048bd5fc8d52c577eeb6126}, author = {Weihua, M. and Hong, Z. and Qianmu, L. and Bin, X.} } @article {453, title = {The performance evaluation of university scientific research project management based on the FAHP}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {18 - 25}, abstract = {Along with the advance of scientific powers strategic of our country, all types and levels funding limit and quantity of college scientific research project have also increased constantly. It is very important to have complete, accurate and fair evaluations for university scientific research project management performance. Fuzzy analytic hierarchy process (FAHP) as a qualitative, a quantitative and comprehensive evaluation method can be able to evaluate the university scientific research project management performance effectively.}, keywords = {College research, Fuzzy analytic hierarchy process (FAHP), Fuzzy judgment matrix, Management performance evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900456922\&partnerID=40\&md5=ce39e1cb0f995af4ded628027c5968ea}, author = {Wang, B. and Liu, D.} } @article {390, title = {Algorithm research for supply chain demand prediction - Taking fresh agricultural product enterprises as example}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {160 - 164}, abstract = {Supply chain demand prediction plays a very important role for enterprises to realize sales and markets management target effectively, especially for fresh agricultural product enterprises. A new model for supply chain demand prediction for fresh agricultural product enterprises is presented based on improved BP neural network. First the advantages and disadvantages of BP neural network algorithm are analyzed when it is used in supply chain demand prediction; Second, Legendre wavelets algorithm is used to speed up the convergence and improve the prediction accuracy of original BP neural network algorithm and based on this the paper advances a new supply chain demand prediction model for fresh agricultural product enterprises. Finally, certain fresh agricultural product enterprise is taken for example to verify the validity and feasibility of the model and the experimental results show that the model can improve prediction accuracy and decrease the calculation time and can be used for supply chain demand prediction practically.}, keywords = {BP Neural Network, Legendre wavelets, Markets management, Supply chain demand prediction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879120765\&partnerID=40\&md5=78a05f213a7f4f86b41f6e014b4c897b}, author = {Wang, H.} } @article {414, title = {Application of finite volume method for solving two-dimensional Navier Stokes equations}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {321 - 326}, abstract = {The finite volume method combines the advantage of the finite element method and the finite difference method, while overcoming their shortcomings. This paper describes the development of the finite volume method and the process of using finite volume method for fluid calculations. Finally, this paper introduces the process of using improved finite volume method for solving the flow equations of NS.}, keywords = {Finite volume method, NS equations, Riemann}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890477987\&partnerID=40\&md5=7acba40f69d1d5d175c6bb896216f1c4}, author = {Ni, J. and Wei, X.} } @article {401, title = {The computer design of practical filter}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {175 - 178}, abstract = {This paper discussed how to use computer to directly transfer the simulative low pass prototype design to all kinds of needed principles and design methods. This method{\textquoteright}s advantage is that it is very direct, and universal. So, this method is simple, convenient, practical and fast.}, keywords = {Filter, Polynomial shift, Transform matrix}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880791462\&partnerID=40\&md5=b00b61c35f2558a8a5cc5066cdb53b3d}, author = {Li, Z. and Weixi, Z.} } @article {435, title = {Differential evolution for rule extraction and its application in recognizing oil reservoir}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {435 - 440}, abstract = {The method of rule extraction based on differential evolution (DE-Rule) is proposed in this paper. The style of rule is IF-THEN. Connection word is AND in the antecedent of rule. The consequence of rule is class label. The above rule is encoded and expressed to individual in population of differential evolution. Then the population is iterated through differential mutation and binomial crossover. Optimal rule set is obtained after decoding the optimal individual. Finally, DE-Rule, RS-Rule and ANN-GA-Cascades-Rule are used to recognize oil reservoir (dry layer, water layer, inferiority layer and oil layer) in the Jianghan oil field. Data of well oilsk81 is training data and data of well oilsk83 is testing data. The results show that performance of accuracy and interpretability in DE-Rule is the best.}, keywords = {Differential Evolution, Oil Reservoir, Rule Extraction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892182107\&partnerID=40\&md5=822605bef25e5d8a1d8382dfd3d0fb86}, author = {Li, J.-L. and Guo, H.-X. and Zhu, K.-J. and Wang, D.-Y. and Hu, J.-L.} } @article {404, title = {A diversity-based multi-antenna cooperative detection model in cognitive radio network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {220 - 226}, abstract = {Spectrum sensing is a key technology in the study of cognitive radios, but its attributes are easily influenced by the channel fading. Compared with singleuser spectrum sensing, multiple-user spectrum sensing can overcome the impacts caused by the fading environment of cognitive radio. Since diversity technology has been proved to provide the system high transmission rate and high link reliability, we propose a diversity-based multi-antenna cooperative detection model based on the original cooperative detecting model. By introducing the antenna technology, sensing users are equipped with a multi-antenna system. Simulations show that the performance of our proposal is better than that of detection based on single-antenna in cognitive radio network. What{\textquoteright}s more, performance of cooperative detection based on multi-antenna is even better than that of cooperative detection based on single-antenna cognitive radio network.}, keywords = {Cooperative detection, Diversity technique, Multi-antenna technology, Spectrum sensing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880787172\&partnerID=40\&md5=c40e6173f1ef81d864ae8908b3329067}, author = {Zhenquan, Q. and Wenjing, L. and Huizhen, J. and Weifeng, S.} } @article {378, title = {Exception detection for web service composition using improved bayesian network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {108 - 114}, abstract = {New application systems generated by composition of web services dynamically have become a development trend in network environment. However, since a variety of external services are invoked with different quality of service during processing, the problem of how to keep the execution stable must be addressed in order to improve the reliability and availability of the combination of services. In this paper, an approach of exception detection is presented for web service composition by improved Bayesian network. Firstly, the topological structure of Bayesian network is established, where the causal relationships between underlying web services are mapped to Bayesian network in service combination process. The conventional Bayesian network algorithm is improved to satisfy the demand of better conversion from nodes in web service composition to nodes in Bayesian network. Secondly, the parameter setting in Bayesian network is explored for determining the prior probability of service nodes and the conditional probability of service output node. Thirdly, the algorithm of the improved exception detection model is introduced, with the aim of locating the web services that cause exceptions in the execution of composite services. Lastly, a case study is given and the results analysis is also conducted. The results show that the presented approach not only considers the uncertainty during exception detection, but also can identify the exception web services in the process.}, keywords = {Bayesian network, Exception handling, Web service, Web service composition}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879099166\&partnerID=40\&md5=0973327f022946c84a165872a2285524}, author = {Chen, Y. and Ying, S. and Zhang, L. and Wu, J.} } @article {391, title = {Fair virtual bandwidth allocation model in virtual data centers}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {179 - 183}, abstract = {Network virtualization opens a promising way to support diverse applications over a shared substrate by running multiple virtual networks. Current virtual data centers in cloud computing have flexible mechanisms to partition compute resources but provide little control over how tenants share the network. This paper proposes a utility-maximization model for bandwidth sharing between virtual networks in the same substrate network. The aim is to improve the fairness of virtual bandwidth allocation for multi tenants, especially for virtual links which share the same physical link and carry nonfriendly traffic. We first given a basic model and then proved the model can be split into many sub models which can run on each rack-switch port. In the sub model, every physical link is associated with a fairness index constraint in maximize utility calculating. The goal is to limit the differences among the bandwidth allocation of the virtual links which share the same physical link. Experimental results show that the virtual bandwidth allocation between tenants is more reasonable.}, keywords = {Bandwidth allocation, Multi-tenant, Network virtualization, Virtual data centers}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880784551\&partnerID=40\&md5=592719b8e0f5ff76a5dbdb85fdbe06e3}, author = {Yuan, Y. and Wang, C.-R. and Wang, C.} } @article {384, title = {Optimization and application of support vector machine based on SVM algorithm parameters}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {165 - 169}, abstract = {The hospital customer classification is very important for the integration and allocation of hospital resources, can greatly enhance the market competitiveness of the hospital. Support Vector Machine (SVM) is an approach to solve classification problem by using optimization method. Selecting different kernel parameters can construct different classifiers, meanwhile parameters decide their learning and generalization ability. In order to solve the limitation of selecting parameters by experience, so the particle swarm (PSO) pattern search algorithm is proposed to search optimal parameters and take them into the practice of hospital customer classification; The PSO mode search algorithm is to combine the advantages of PSO algorithm and pattern search algorithm, PSO mode search algorithm has strong global search capability and good advantage of local convergence. The result of experiment shows that this method is not only efficient, but also to search the optimal parameters achieving a high accuracy, which is an effective method of SVM parameter optimization.}, keywords = {Customer data classification, Kernel parameters selection, Particle swarm pattern search, Support vector machine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879098093\&partnerID=40\&md5=aa26078b417c2386e1244d36d3bacb09}, author = {Yan, H.-F. and Wang, W.-F. and Liu, J.} } @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 {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 {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 {427, title = {Segmentation strategies for passage retrieval from internet video using speech transcripts}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {400 - 408}, abstract = {We compare the effect of different segmentation strategies for passage retrieval of user generated internet video. We consider retrieval of passages for rather abstract and complex queries that go beyond finding a certain object or constellation of objects in the visual channel. Hence the retrieval methods have to rely heavily on the recognized speech. Passage retrieval has mainly been studied to improve document retrieval and to enable question answering. In these domains best results were obtained using passages defined by the paragraph structure of the source documents or by using arbitrary overlapping passages. For the retrieval of relevant passages in a video no author defined paragraph structure is available. We compare retrieval results from 5 different types of segments: segments defined by shot boundaries, prosodic segments, fixed length segments, a sliding window and semantically coherent segments based on speech transcripts. We evaluated the methods on the corpus of the MediaEval 2011 Rich Speech Retrieval task. Our main conclusions are (1) that fixed length and coherent segments are clearly superior to segments based on speaker turns or shot boundaries; (2) that the retrieval results highly depend on the right choice for the segment length; and (3) that results using the segmentation into semantically coherent parts depend much less on the segment length. Especially, the quality of fixed length and sliding window segmentation drops fast when the segment length increases, while quality of the semantically coherent segments is much more stable. Thus, if coherent segments are defined, longer segments can be used and consequently fewer segments have to be considered at retrieval time.}, keywords = {Multimedia Retrieval, Text Segmentation, User Generated Content, Video Segmentation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892167136\&partnerID=40\&md5=41e146d1a72335b63599072284ec5b9e}, author = {Wartena, C.} } @article {360, title = {Application study on visual discussion technique in group decision making of sudden disasters}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {373 - 378}, abstract = {Emergency management of sudden disasters needs a quick and efficient decision made by a group. The authors propose a visual discussion technique in group decision making of sudden disasters and construct the main technique process based on visualization theory. Based on this, Through the key techniques are researched and implemented. As for Multiagents in the discussion, they can obtain more accurate cognition of current sudden disaster situation and form efficient emergency predetermined plan by discussion and analysis in the short time.}, keywords = {Emergency Management of Sudden Disasters, Group Decision Making, Semantic Cluster Analysis, Visual Discussion Technique}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874910051\&partnerID=40\&md5=0a893329cccfb221cc012d5e9b72840e}, author = {Tao, F. and Wang, H. and Liu, G.} } @article {323, title = {CMCCR: Classification based on multiple class-correlation rules}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {64 - 70}, abstract = {Previous studies show that associative classification achieves higher classification accuracy than traditional classification approaches. However, associative classification suffers from two major deficiencies and thus sometimes has lower classification accuracy. First, it often generates a large number of rules when the minimum support is set to be low. It is not only time consuming to discover so many itemsets, but also very difficult to select high quality rules from a huge set of rules. Second, the association measure confidence does not reflect correlation relationships between itemsets and the class label. To deal these problems, in this paper, we propose a new classification approach called classification based on multiple class-correlation rules (CMCCR). First, we use both support and all-confidence to mine not only frequent but also mutually associated itemsets. This method not only saves the running time but as well considerably reduces the number of itemsets generated, and thus sharply decreases the number of class-correlation rules produced. Second, we use a new correlation measure correlation confidence to discover class-correlation rules. The measure correlation confidence has two bounds:- 1and 1. It is easy to control the correlation degree of the class-correlation rules found. Finally, we use multiple class-correlation rules and average correlation degree to measure the combined effect of group rules. Experimental results on the mushroom data set show that CMCCR has higher and more stable accuracy than associative classification and decision tree method.}, keywords = {All-confidence, Class-correlation rule, Classification, Correlation confidence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866448185\&partnerID=40\&md5=10fb4c8ff12d02f2555fb4ba4c8f5d04}, author = {Zhou, Z. and Wang, X. and Pan, G.} } @article {358, title = {D3-P2P: Managing distributed and replicated database in P2P environment by using quorum system}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {351 - 364}, abstract = {The need for large-scale data sharing between autonomous and possibly heterogeneous decentralized systems on the Web led to the concept of P2P database systems. In this paper, we present D3- P2P a new architecture which allows to manage a distributed and replicated database, in Peer-To-Peer (P2P) system with high node dynamicity. This architecture is based on a quorum system to solve problems of concurrent update and nodes failure. The proposed architecture allows assigning a unique timestamp to each distributed transaction in order to build a local precedence order graph in each peer, to select the server replicas and to coordinate the distributed execution of the transaction. To avoid deadlock between nodes, we propose a fully distributed algorithm.}, keywords = {Database, Deadlock, Failure, Node Dynamicity, P2P, Partial Replication, Quorum System}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874883777\&partnerID=40\&md5=d05a262f0b42b99fd75e7a6488bc8fd4}, author = {Mounine, H.S. and Walid, H.K.} } @article {349, title = {An intelligent communication path planning method of metallurgical equipment multi-dimensional information space}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {295 - 300}, abstract = {With the development of ubiquitous information environment in metallurgical industry, driving type of metallurgical equipment systems is changing from energy-driven to information-driven. The problems of the metallurgical equipment information communication path intelligent planning are taken as the research object. Based on the cellular automata theory, the integrated framework of metallurgical equipment information space is built. Information communication path intelligent planning method of metallurgical equipment based on ant colony algorithm is explored. The practicality and effectiveness of the divided information spaces and designed algorithms are verified by simulation, which provides theoretical support to enhance the level of metallurgical equipment.}, keywords = {Ant colony algorithm, Cellular automata, Intelligent planning of the communication path, Metallurgical equipments}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870775516\&partnerID=40\&md5=662c43d3290cf4324b438895204b0c6b}, author = {Liu, J. and Kong, J. and Zhou, M. and Wang, X.} } @article {314, title = {Mechanism analysis of protocols based on the FPCPN model}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {86 - 93}, abstract = {Focusing on the protection of privacy and non- publicity of special networks, the CPN model is extended to PCPN by the protocol factor and the formal model. The FPCPN (Formal Protocol Colored Petri Net) is presented to analyze the operation mechanism of protocols. It is introduced by four steps, such as the whole structure, the network element conversion, the conditions of transition triggers/executions and sub-system partitions. Finally, the feasibility and efficiency of FPCPN is validated by an example.}, keywords = {CPN, FPCPN, Mechanism of protocol, Petrinet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866451164\&partnerID=40\&md5=eb201b179c8b50ddc41f54eabc15fec2}, author = {Wang, W.} } @article {309, title = {A Personalization layer for mediation systems}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {29 - 38}, abstract = {Mediation systems allow integration of disparate and heterogeneous data sources. Unfortunately, with the increasing number of integrated sources, especially in the context of web, mediator{\textquoteright}s responses time increases considerably while the answers are not adapted to users profiles. In this paper, we present a personalization layer that makes the mediation system more sensitive to user{\textquoteright}s preferences. The layer sits between the user and the mediation system. It captures the user profile and performs a smart source selection according to user{\textquoteright}s interests and quality preferences. Selection is based on similarity measurement between users and sources models. Our solution for personalizing data source selection provides the mediator with a set of relevant data sources. These are then involved in the rewriting process to give more satisfying response.}, keywords = {Mediation systems, Personalization, Source selection, User profile}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857594503\&partnerID=40\&md5=345cb9fd1cebc3bd1598d806adb3d012}, author = {Zaoui, I. and Wadjinny, F. and Chiadmi, D. and Benhlima, L.} } @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 {294, title = {A dynamic role-based authorization model in grid environment}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {242 - 248}, abstract = {In large-scale grid environment, the authorization plays a vital role in access control to resources. For the demand of higher dynamicity, complexity and granularity on grid environment, a novel model named dynamic role-based access control (DRBAC) based on RBAC model is presented. DRBAC introduces conceptions of several objects such as rolegraph initial structure, atom role and middle role, and it can automatically adjust the role-graph{\textquoteright}s structure through dynamically adding new roles or deleting original roles. The authorization mechanism which combines DRBAC model and CAS servers provides an effective method to solve loading and security problems. Theoretical analyses and example demonstrate that it is of high safety and has good time and space complexity when authorizing.}, keywords = {CAS server, DRBAC, Dynamic role}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855373392\&partnerID=40\&md5=1f10e75d6a2d4f01105000efde1e9fdc}, author = {Sun, W. and Guo, C. and Zhang, P. and Zhang, N. and Wang, H.} } @article {266, title = {Fast remote user authentication scheme with smart card based on quadratic residue}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {51 - 54}, abstract = {There are many kinds of online services in our daily life, such as e-mail and messenger. When we link to a remote host, we are required to login first, supplying a username and the corresponding password, and then obtain the resources or have services. Most commonly, we might use a smart card to assistant us to login a remote site. In 1981, Lamport proposed a remote authentication scheme for communication through insecure channels. Lu and Cao further proposed an efficient scheme based on quadratic residue in 2005. In the Lu-Cao scheme, it is unnecessary for the server to store the verification table. However, some obvious drawbacks are that users cannot freely choose their own passwords and their scheme is inefficient due to complex computations. In this paper, we proposed an improvement of the Lu-Cao scheme to make it more efficient and secure.}, keywords = {Password authentication, Quadratic residue, Smart card, Verification table}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960674401\&partnerID=40\&md5=9e6a08e95cf41ee5f01ee9be34b06573}, author = {Wu, T.-S. and Lin, H.-Y. and Lee, M.-L. and Chen, W.-Y.} } @article {298, title = {Fusion user browsing behavior and user interests autonomous control of personalized search results sort}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {271 - 275}, abstract = {Reference simplifies the ODP concept, establish a user hierarchical structure can be controlled autonomously interest preference expression of use interests model. Meanwhile, from the user{\textquoteright}s browsing behavior can reflect the user{\textquoteright}s interest in starting, this paper analyzes the relationship between the user{\textquoteright}s browsing behavior and user interest. Considering both the times of page visiting and the browsing speed for the degree of use interest, as well as the similarity of the page keywords and a single user interest point, the index can be obtained for evaluating whether a page meets the user interest preference. Utilizing it as search results of evaluation indexes, search results sorting. Further analysis under different integrity of user interests of description and different results processing under the way of sorting effect, through individual apiration is decided according to user{\textquoteright}spersonal interest in server-side describe file integrity of, will be willing to disclosure of personal information stored in the search engine server in order to improve the quality of the search results, sensitive personal information retained in local client, reach users privacy protection effect.}, keywords = {Degree of User Interest, Personalized Search, Privacy protection, Sort Search Results, User Interest Model, User{\textquoteright}s Browsing Behaviors}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855413177\&partnerID=40\&md5=42962ce43dcfb6f7b617b32ec5cecdcd}, author = {Li, J. and Wang, H. and Guo, Y.} } @article {242, title = {Bidirectional recommendation technology for web digital texts}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {240 - 246}, abstract = {Recently, e-learning systems have begun to be used in companies and education institutions. The spread of e-learning is mainly due to development of the learning management system (LMS), which includes SCORM and WebCT. Therefore, the introduction of learning the web digital web digital texts have become much simpler. The increase of contents of the web digital texts has realized a wider range of learning. As a result, we are concerned that learners will be confused with selecting the best learning web digital texts. In our research, we are developing a bidirectional recommendation system that extracts the relationship among learning the web digital texts with historical logs and recommends an effective web digital text for learners. In this paper, we first discuss the design of the bidirectional recommendation system, and second, we show its evaluation results. Finally, we conclude that our recommendation system is useful for learners.}, keywords = {Bidirectional recommendation, Collaborative filtering}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960678552\&partnerID=40\&md5=26da622fa54ccbb85a451552ee79e801}, author = {Wada, Y. and Matsuzawa, S. and Yamaguchi, M. and Dohi, S.} } @article {224, title = {Editorial preface: Special issue on context-aware and mobile multimedia databases and services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {2 - 3}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089\&partnerID=40\&md5=7b82f006c7ffa103ca31e784f7cd8bf8}, author = {Grigoras, R. and Charvillat, V. and Chbeir, R. and Kosch, H. and Bailer, W. and Boll, S. and Brunie, L. and Cao, Y. and Delgado, J. and Granitzer, M. and Hausenblas, M. and Eidenberger, H. and Klamma, R. and Lux, M. and Marques, O. and Oria, V. and Plesca, C. and Pr{\'e}teux, F. and Sedes, F. and Spaniol, M. and Ternier, S. and Wolpers, M.} } @article {238, title = {Knowledge management of 1D SDS PAGE gel protein image information}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {223 - 232}, abstract = {Computational management and analysis of proteomics data is providing important insights into the biological and clinical sciences. In this research study, a knowledge management strategy for 1D SDS PAGE gel protein image information has been developed and implemented in the New Vision to Protein intensity Analysis System (NeVPAS) application. This application focused on the analysis of skin mucus protein changes during a key developmental stage of Atlantic salmon (Salmo salar), the smoltification period. It includes a database to archive proteomics data. In this paper, knowledge management is expressed in terms of data acquisition, hierarchical organisation of data, knowledge retrieval by means of an information retrieval technique and knowledge presentation using text and graphics. This application of proteomics knowledge management in the marine field may also be extended to clinical analysis and environmental monitoring.}, keywords = {1D SDS PAGE protein gel image, Atlantic salmon, Gel image analysis, Knowledge management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960692176\&partnerID=40\&md5=be17770f0ee0ad9cba603f903cdd0aee}, author = {Ramaswamy, G. and Wu, B. and Macevilly, U.} } @article {248, title = {A novel access control strategy for distributed data systems}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {291 - 297}, abstract = {It is one of the most important challenges to balance between security and scalability in large distributed data systems. In this paper, we introduce a new data distribution model, which is a generalized tree structure called as multitree. And its access control strategy is investigated. In our multitree data model, the database schema is expressed as a schema graph, and a database instance is imagined as a data graph. It is different from the traditional hierarchical data model, since a node in our multitree model can have many parent nodes. All the data graphs or schema are transformed into multitrees. The complex data relation of the distributed data systems is reduced based on graph theory. The complexity of distribution is decreased significantly. In the multitree model, each user has a maximum access range corresponding to its multitree. It is integrated naturally with security. We use organization structure to bound the data range that a user can access, and use roles to restrict the operations that the user can perform. The scalability of data distribution and access control administration are evaluated through the instance adapted from the TPC-C database. The results illustrates our data distribution model is helpful for the system to be resilient and scalable. It is suitable for large distributed system and cloud relational database.}, keywords = {Access control, Cloud database, Data distribution, Multi-hierarchical model, Multitree}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960669952\&partnerID=40\&md5=82211ced06d718d2f20daa5dfc146798}, author = {Zhang, J. and Wang, X. and Liu, H. and Meng, J.} } @article {175, title = {Distributed Web 2.0 crawling for ontology evolution}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {114 - 119}, abstract = {The World Wide Web as a social network reflects changes of interest in certain domains. It has been shown that free online content available through blogs, wikis, news media and online forums is a valuable source of information to identify trends in certain domains. Utilizing this data, one can construct ontologies that describe this information and provide a semantically correct overview of a domain. Tracked over time this also enables a user to identify trends and hypes. The decentralised structure of the Internet, the huge amount of data and upcoming Web2.0 technologies pose several challenges to a crawling system for ontology learning, evolution and trend analysis. This paper presents a distributed crawling system with browser integration for Web2.0. The proposed crawler is a high performance Web data retrieval system aimed to gather browser-equivalent textual Web content and prepare it for ontology learning.}, keywords = {Distributed crawling, Executed crawling, Ontology evolution, Ontology learning, Web 2.0 crawling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350630600\&partnerID=40\&md5=7b88c38575eca72b620a0a6e113a8f55}, author = {Juffinger, A. and Neidhart, T. and Granitzer, M. and Kern, R. and Weichselbraun, A. and Wohlgenannt, G. and Scharl, A.} } @article {197, title = {Machine learning based work task classification}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2009}, pages = {305 - 312}, abstract = {Increasing the productivity of a knowledge worker via intelligent applications requires the identification of a user{\textquoteright}s current work task, i.e. the current work context a user resides in. In this work we present and evaluate machine learning based work task detection methods. By viewing a work task as sequence of digital interaction patterns of mouse clicks and key strokes, we present (i) a methodology for recording those user interactions and (ii) an in-depth analysis of supervised classification models for classifying work tasks in two different scenarios: a task centric scenario and a user centric scenario. We analyze different supervised classification models, feature types and feature selection methods on a laboratory as well as a real world data set. Results show satisfiable accuracy and high user acceptance by using relatively simple types of features.}, keywords = {Data model, Data structure, Work task classification user interaction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953256434\&partnerID=40\&md5=ad1b8dc83a81694afe23a15ad90c66af}, author = {Granitzer, M. and Rath, A.S. and Kr{\"o}ll, M. and Seifert, C. and Ipsmiller, D. and Devaurs, D. and Weber, N. and Lindstaedt, S.} } @article {144, title = {Commius - An email based interoperability solution tailored for SMEs}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {430 - 433}, abstract = {More than 99\% of European enterprises are SMEs (Small and Medium-sized Enterprises). While in the current market situation collaboration is evolving to an indispensable key factor of success, research is yet to produce results which can be used by SMEs. This paper introduces an interoperability approach in the context of the European Commius Project which enables SMEs collaborate easily on the level of process interoperability. The Commius solution will dock onto existing E-Mail structures and enrich incoming E-Mails with additional information dependant upon its content and provide recommendations of expedient further steps to process the E-Mail. A first picture of the Commius process interoperability layer architecture will be drawn. Furthermore proposals to adapt Commius to the specific processes every SME has, in a simple way, are being exposed.}, keywords = {Business process, Collaboration, Email, Interoperability, SME}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70449333910\&partnerID=40\&md5=5e75b584683eae1a1025309705abc10f}, author = {Burkhart, T. and Werth, D. and Loos, P.} } @article {129, title = {An improved biometric template protection method based on non-uniform quantization}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {169 - 174}, abstract = {In recent literature, the issue of biometric template protection was raised. Some schemes were proposed to solve the contradiction between the fuzzy biometric information and accurate cryptography functions to achieve the protection of biometric template via cryptography method. In this paper, a novel methodology to achieve the security of the biometric templates in biometric systems is proposed. An adaptive non-uniform quantization (ANUQ) algorithm is introduced to eliminate the contradiction between the fuzziness of the biometric information and the sensitive of the Hash function. The ANUQ algorithm maps different biometric feature vectors from the same individual to a unique quantized feature vector. Then the quantized feature vector can be saved and identified by its hash and the biometric system can be free from the risk of the leakage of users{\textquoteright} privacy information. Based on the ANUQ algorithm, two biometric template protection scheme are designed to meet different applications. Scheme-I involved a single quantizing template while scheme-II use a quantizing template array. The comparison of the two schemes are raised. Further, the testing of these schemes are carried out on an iris recognition algorithm. The results show the feasibility of the ANUQ-based schemes.}, keywords = {Biometrics template, Non-uniform quantization, Privacy security, Quantizing template}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67449162388\&partnerID=40\&md5=2c7c418154a7c1360f7d9e69ff418824}, author = {Han, Q. and Wang, Z. and Niu, X.} } @article {150, title = {Learning transfer rules for machine translation from parallel corpora}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {285 - 293}, abstract = {In this paper we present JETCAT, a Japanese-English transfer-based machine translation system. Our main research contribution is that the transfer rules are not handcrafted but are learnt automatically from a parallel corpus. The system has been implemented in Amzi! Prolog, which offers scalability for large rule bases, full Unicode support for Japanese characters, and several APIs for the seamless integration of the translation functionality into common office environments. As a first user interface we have developed a translation environment under Microsoft Word. The dynamic nature of our system allows for an easy customization of the rule base according to the user{\textquoteright}s personal preferences by simply post-editing the translation results, which leads to an automatic update. The user interface for Microsoft Word also provides the possibility for the user to display token lists, parse trees, and transfer rules, which makes JETCAT also a very useful tool for language students.}, keywords = {Japanese-English translation, Language transfer rules}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349984013\&partnerID=40\&md5=b27c9c795bbe154aace0b228c131a68e}, author = {Winiwarter, W.} } @article {146, title = {Smoke detection for early fire-alarming system based on video processing}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2008}, pages = {196 - 202}, abstract = {The paper presents a smoke-detection method for early fire-alarming system based on video processing. The basic strategy of smoke-pixel judgment is composed of two decision functions: a chromaticitybased decision function in static characteristic and a diffusion-based decision function in dynamic characteristic. The chromatic decision rule is deduced by grayish color of smoke and the dynamic decision rule is dependent on the diffusion attribute of smoke. To give an appropriate alarm, a fuzzy scheme is introduced to enhance the reliability of alarming by checking if the quantity of smoke extracted increases with the checking time. Experimental results show that the proposed method can provide an early alarm at a lower false alarm rate before the fire burns up, and hence is very attractive for the important places, social security, commercial applications, and so on.}, keywords = {Fire-alarming, Fuzzy scheme, Image processing, Smoke detection, Smoke pixels}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449134788\&partnerID=40\&md5=1d71de0f8f9dde2103aa7102bd316fc3}, author = {Wang, D.-J. and Chen, T.-H. and Yin, Y.-H. and Chen, T.-Y.} } @article {160, title = {Topic maps management in spatial-temporal multimedia blogs}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {92 - 99}, abstract = {Web-based blogging has entered the mainstream of society as an easy way to publish information, and it is exponentially increasing the data volume and its related complexity. Spatial-temporal information (Where and When contexts) contained inside multimedia postings needs to be better semantically handled by search engines or by end-users as current web blogs still lack semantic support. The semantic web community has promoted Topic Maps as a technology that reduces the lack of semantics regarding optimization of information creation, exchange, navigation, merging, and dissemination. This paper introduces a new layer that combines blogging standards (e.g. RSS and Atom) with the Topic Maps data model for semantic-augmented and interoperable information exchange support. In addition, the paper includes examples from the Isfahan Islamic Architecture DataBase (IIADB) project, the pilot user of the topic maps layer bridging the semantic gap of multimedia postings in a historical and architectural context.}, keywords = {Multimedia blogs, Topic maps, Web based blogs}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849111393\&partnerID=40\&md5=8bf91066001e7e131a7ed018919772f3}, author = {Rajbhandari, S. and Andres, F. and Naito, M. and Wuwongse, V.} } @article {77, title = {Contextualizing multimedia semantics towards personalised eLearning}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {62 - 67}, abstract = {Recent developments of the Internet and the World Wide Web (WWW) have resulted in the proliferation of multi-media, resources and learning with existing multimedia web resources on the Web is becoming more prevalent and important. While recent standardization efforts in eLearning such as LOM, SCORM, and IMS Learning Design work towards learning content description, packaging, and delivery; existing eLearning solutions still lack the ability to adequately use multi-media resources to provide a learner with personalised learning resources. Effective use of multimedia for web-based learning provides quality interactive learning experience, but current techniques does not adequately provide a semantic approach for organising multimedia resources. With evolving trend in learning through the use of web technology, eLearning systems are expected to provide personalised learning resources for effective learning. We have accordingly proposed a way of organising existing multimedia resources based on contexts towards providing a truly personalised eLearning experience. This paper presents a framework for achieving context-based multimedia semantic annotation and organisation towards personalised learning.}, keywords = {Multimedia technology, Web based learning, WWW}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849139810\&partnerID=40\&md5=bef7d9f2dbe792bb21840530e2dbb14d}, author = {Eze, E. and Ishaya, T. and Wood, D.M.} } @article {93, title = {A non reference fingerpint image validity via statistical weight calculation}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {220 - 224}, abstract = {Clarity of fingerprint image structure is crucial for many fingerprint applications, as well as the performance of built systems which relies on the validity and quality of captured images. Validity check will eliminate invalid images before starting the life cycle of fingerprint metadata enrolling for system processing cycle; therefore the overall benchmarking system accuracy will not be affected by rejecting an invalid image before getting in the system cycle. In this paper we propose a validity check algorithm (VCA). The VCA is applied to the base image eiement statistical weight calculation because the image element (pixel) describes an image object with the contrast, brightness, clarity and noising attributes. Our algorithm depends on fingerprint object segmentation, background subtraction, total image thresholding and pixel weight calculation. A VTC200ODB1_B, TIMA databases was used to evaluate the VCA and it has been compared with NIST fingerprint image quality results. Correlation results indicate that the proposed algorithm is feasible in detecting low quality as well as non-fingerprint images.}, keywords = {Fingerprint, Image quality, Image subtraction, Otsu threshold, Segmentation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949123442\&partnerID=40\&md5=c56872a67fd18e70e84324f95df34eaf}, author = {Altarawneh, M.S. and Khor, L.C. and Woo, W.L. and Dlay, S.S.} } @article {27, title = {Continuously evaluating approximate similarity search on high dimensional data stream}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {82 - 86}, abstract = {In many applications, including online video monitoring system, it is often necessary to find out the most similar sequence, from a sequence set in database, for the high dimensional data stream. Due to its high computation complexity and the restrictions of query processing on data stream, continuously retrieving the similar content on high dimensional data stream is very challenging. The evaluating algorithm is expected to be very fast to match data stream arrival rate. To address this problem, we propose a method called CVNN in this paper. In our method, the sequences in database are represented into the compact summaries, namely CVs, which can be stored in memory. An online algorithm is conducted to transform data stream into a small number of CVs continuously, at the same time the nearest neighbor query is processed periodically based on the similarity of CVs. Experimental results show that our method is fairly effective.}, keywords = {Data stream, High dimensional space, Query processing, Similarity Search, Video indexing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748267270\&partnerID=40\&md5=da6323dddf161caf008918184cbec115}, author = {Wang, W. and Li, J. and Ai, C. and Shi, S.} } @article {37, title = {TWSO - Transactional web service orchestrations}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2006}, pages = {56 - 62}, abstract = {There is a need for transactional processing in the Web service world. Software industry responded to this need by publishing a couple of Web service transaction proposals that are quite alike. However, these proposals define basically only communication protocols that indirectly implement advanced transaction models. The proposals lack accurate usage suggestions and the rather obvious question "How can I use transactions in Web service based distributed systems?" is not covered anywhere satisfyingly. The use of arbitrary advanced transaction models is provided only by some of the proposals and likely requires an update of various transaction system components. This paper introduces TWSO (Transactional Web Service Orchestrations), a new approach to integrate transactional processing with Web service orchestrations. It tries to overcome the hassles stated above. TWSO concepts may appear in different manifestations, like an XML vocabulary (TWSOL) or an API for Java (TWSO4J). Constructs of TWSO manifestations are intended to be directly incorporated in Web service orchestration definitions. The usage pattern of TWSO is designed to resemble the programming pattern used when application programmers use transaction - enabled components like databases or application servers. Moreover, arbitrary advanced transaction models can be synthesized by using a basic set of transaction primitives without the demand for system-updates.}, keywords = {Network protocol, Transactional Web Service Orchestrations, TWSO}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748275471\&partnerID=40\&md5=072dab0b6eaba78383708fb1f1d20e04}, author = {Hrastnik, P. and Winiwarter, W.} }