@article {738, title = {Evaluation of Local Green Supply Chain Performance Using a Three-Phase Data Envelopment Analysis (DEA) Model and Malmquist Efficiency Framework}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {06/2024}, pages = {63-73}, chapter = {63}, abstract = {

Regional synergistic development and lowcarbon economy are China{\textquoteright}s current themes of regional economic development. Based on the background of lowcarbon development, the relevant data of the Ningbo metropolitan area from 2017 to 2022 are selected, and the three-stage DEA model and Malmquist model are used to measure the low-carbon logistics efficiency of Ningbo metropolitan area region from static and dynamic dimensions, respectively. The results show that regional economic development, residents{\textquoteright} consumption and research and development expenditures have a certain impact on the measurement of low-carbon logistics efficiency in Ningbo metropolitan area. From the static perspective, the low-carbon logistics efficiency of Ningbo metropolitan area has reached the ideal state. Still, the overall lowcarbon logistics efficiency of Ningbo metropolitan area has not reached the optimal state. There is still room for upward mobility, mainly due to the fact that the scale of the logistics industry has room for upgrading. From a dynamic point of view, technological progress promotes the development of low-carbon logistics efficiency.

}, doi = {https://doi.org/10.6025/jdim/2024/22/2/63-73}, url = {https://www.dline.info/fpaper/jdim/v22i2/jdimv22i2_3.pdf}, author = {Bo Zhao} } @article {741, title = {Introducing a Process-Oriented Framework for the Design of Advertising Campaigns}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {03/2024}, pages = {17-32}, chapter = {17}, abstract = {

Research on advertising campaigns is intriguing due to their recent emergence and rapid expansion. These campaigns encounter various challenges, such as determining the most effective advertising strategies to achieve their objectives. This study aims to present a practical model for advertising campaigns, outlining the necessary steps for companies to follow. The research methodology involved a qualitative analysis of 180 advertising-related articles, with 80 articles selected as a sample through library studies. Data collection included semi-structured interviews with 10 advertising experts and the distribution of an open questionnaire to identify key indicators. The findings led to developing a framework comprising 9 categories, 27 themes, and 54 indicators for advertising campaigns. Indicators such as storyboards, client briefs, campaign scripting, and slogan writing are identified as novel elements within campaign models, offering valuable insights for advertising organizations.

}, doi = {https://doi.org/10.6025/jdim/2024/22/17-32}, url = {https://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_3.pdf}, author = {Maysam Shafiee and Parasto Iranpak and Mohammad Zand} } @article {753, title = {How Much Difference in Earthquake Risk among China{\textquoteright}s Areas: A Study based on Pricing a Seismic Catastrophe Bond}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {03/2023}, pages = {18-23}, type = {Research}, chapter = {18}, abstract = {

Firstly, this paper gives a data aggregation algorithm based on learning automata to solve the problem that the existing data aggregation algorithm can{\^a}{\texteuro}{\texttrademark}t solve, the uneven energy cost, and the existing algorithm can{\^a}{\texteuro}{\texttrademark}t change the gathering path dynamically existing the overhead environment. In the proposed method, nodes can change its gathering path to adjust the overhead environment. All the nodes of WSN equipped with a learning automata. These leaning automata learn all the gathering path of the nodes. In the process of transmit information two kinds of data are transmitted, including data packet, knowledge packet .When the information of the nodes changes, according to the feedback of the nods, the learning automata gives the reward or punish to the current gathering path, which help to find the best gathering path. Secondly, this paper improved the wavelet data compression algorithm, which was brought out as the correlation between different data. The algorithm do not reduce much of the data relate to the original data. After the wavelet data compression, Huffman coding compression algorithm will improve the data compression ratio.

}, doi = {https://doi.org/10.6025/jdim/2023/21/1/18-23}, url = {http://www.dline.info/download.php?sn=3683}, author = {Yong Zhang and Wei Liu} } @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 {774, title = {Incentive Mechanism of Innovation Failure Knowledge Sharing of Virtual Research Organization-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {194}, type = {Research}, chapter = {184}, abstract = {

\ Purpose Innovation failure knowledge sharing plays an important role in reducing the probability of repeated failure of subsequent innovation and improving innovation ability of virtual research organization. However, it is very difficult for members to actively share the innovation failure knowledge without incentives. This study aims to establish the incentive mechanism of innovation failure knowledge sharing, and promote the sharing behavior of innovation failure knowledge in virtual research organization. Design/methodology/approach By using game theory, considering the risk aversion degree of organization members and the negative effect of innovation fault-tolerance environment, the incentive model of innovation failure knowledge sharing of virtual research organization was constructed, and the incentive relationship of innovation failure knowledge sharing between organization and its members under the influence of different states was analyzed. Findings Without considering the negative effect of innovation fault-tolerant environment, the optimal incentive coefficient of innovation failure knowledge sharing is positively related to the sharing rate of innovation failure knowledge and the transformation ability of innovation failure knowledge of organization members, and negatively related to the sharing cost and risk aversion degree of organization members. Considering the negative effect of innovation fault-tolerant environment, virtual research organization should make a corresponding modification of sharing incentive intensity according to the estimation of tolerance degree to innovation fault-tolerant environment by itself and its members, so as to reduce the knowledge input of organization. Originality/value This study proposes an incentive mechanism of innovation failure knowledge sharing considering the negative effect of innovation fault-tolerant environment, which provides a novel idea and method for the design of incentive mechanism of innovation failure knowledge sharing in virtual research organization.

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/184-194}, url = {http://www.dline.info/download.php?sn=3105}, author = {Xiong Zhuang and Wang Pengju} } @article {775, title = {A New Approach Based Symbiotic Organism Search using Data Mining for Medical Decision-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {195-209}, type = {Research}, chapter = {195}, abstract = {

In the medical field the decision represents an extremely important asset because the risk must be zero. This is why decision approaches which are based on a predictive vision are a must solution. The decision is generally based on the exploitation of a large volume of medical data. The processing and analysis of mass data is only possible through an extraction of knowledge allowing the medical experts to make the best decision. Thus to meet this need, data mining has become the most promising approach. There are several techniques of datamining, and although they are quite developed the y still remain even less efficient notably the classical meta-heuristics. In this paper, we are exploiting a new meta-heuristic called symbiotic organisms search (SOS) that is based on a biological process. In this paper, we develop the formal model of the SOS based data mining process in the medical field with a comparative study with other metaheuristics to show its performance and credibility of treatment.

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/195-209}, url = {http://www.dline.info/download.php?sn=3104}, author = {Samia Nouredine and Abida Toumi and Baarir Zineeddine} } @article {793, title = {An Agent-Based Approach for Extracting Business Association Rules from Centralized Databases Systems-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {270-288}, type = {Research}, chapter = {270}, abstract = {

Today, enterprises use a variety of applications to manage day-by-day business activities using a large centralized database. Since a huge amount of data stored in this centralized database produced by the daily use of several systems, it is important to integrate decision-making tools to analyse and interpret these business data. For this purpose, Data Mining is a powerful technology that promote information and knowledge extraction from large databases. In this paper, we present an agent-based approach for extracting business association rules from centralized database systems. This approach combine paradigm of multi-agent system and the association rules as a data mining technique to build anefficient model. It is relying on the intelligent partitioning of data to make the execution of business association rules in a parallel and distributed way from a large centralized database. To validate our approach, we applied it during the realization of a real case study on ERP database at the National company of Well Services (ENSP)using JADE platform with machine learning WEKA toolbox for association rules mining. The developed system has been compared with the classic association rules algorithms and has proved it is more efficient and more scalable. The main objective of our work is to improve and accelerate the process of extracting association rules by business through centralized database systems. As a result, the decision process of these systems becomes more improved.

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/270-288}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_2.pdf}, author = {Nadjib Mesbahi and Merouane Zoubeidi and Abdelhak Merizig and Okba Kazar} } @article {717, title = {Ontological Approach Based on Multi-Agent System for Indexing and Filtering Arabic Documents}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {145-163}, type = {Research}, chapter = {145}, doi = {https://doi.org/10.6025/jdim/2019/17/3/145-163}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_4.pdf}, author = {Samia Zouaoui and Khaled Rezeg} } @article {803, title = {Ontological Approach Based on Multi-Agent System for Indexing and Filtering Arabic Documents-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {145-163}, type = {Research}, chapter = {145}, abstract = {

: In recent years, Automatic Natural Language Processing (ANLP) for Arabic language has received a great amount of attention for the development of several applications such as question answering, information retrieval and translation, etc. However, there are a few automated applications using Semantic Web technologies for retrieving Arabic-language documents despite the high demand and need for this content. In addition, the Arabic language presents serious challenges to researchers and developers of NLP applications. These challenges are due to the complexity of the morphological, syntactic and semantic characteristics specific to the Arabic text, which requires the use of semantic resources such as ontology. In our work, we propose a new approach based on ontology and multi-agent systems to index and filter Arabic documents. Our proposal is composed of five layers, each layer contains several agents: (1) Lexical Layer; (2) Syntactic Layer; (3) Semantic Layer; (4) Indexing Layer; and GUI/Interface Layer. Our Arabic ontology is manually constructed on the basis of schemes\  and their semantics meanings. We use also combination of Arabic WordNet contents and Arabic VerbNet in the process of constructing the ontology. We use the semantic similarity to find the relevant documents according to the user{\textquoteright}s queries. The aim of this paper is to study the effect of patterns in solving the problem of the semantic indexing system (SIS). The main objective is to improve the quality of the indexing process to ensure the accuracy of the information search of relevant documents based on us ers{\textquoteright} multiword queries, and also to reduce indexing and search time. Indeed, our experiments are conducted on the basis of the combination of two Arab corpus: OSAC\  and SemEval. We compared our results

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/145-163}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_4.pdf}, author = {Samia Zouaoui and Khaled Rezeg} } @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 {697, title = {A New Look at the TOR Anonymous Communication System}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {223-229}, type = {Research}, chapter = {223}, doi = {https://doi.org/10.6025/jdim/2018/5/223-229}, author = {Imran Ahmad and M. Saddique and U. Pirzada and M. Zohaib and A. Ali and M. Khan} } @article {817, title = {A New Look at the TOR Anonymous Communication System-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {223-229}, type = {Research}, chapter = {223}, abstract = {

\ Whenever a user tries communicating with another recipient on the Internet, vibrant information is sent over different networks until the information is intercepted or normally reaches the recipient. Precarious information crisscrossing networks is usually encrypted. In order to conceal the sender{\textquoteright}s identity, different implementations have proven successful - one of which is the invention of anonymous communication systems. There are many anonymous communication systems developed but, the Onion Router (Tor) is the greatest organized anonymous communication system, which offers online anonymity and privacy. There are a vast number of obstacles in security that have to be considered when deploying Tor. This paper thoroughly investigates and presents these security issues in Tor.

}, doi = {https://doi.org/10.6025/jdim/2018/16/5/223-229}, url = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_2.pdf}, author = {Imran Ahmad and M. Saddique, and U. Pirzada, and M. Zohaib and A. Ali, and M. Khan} } @article {664, title = {SA-min: An Efficient Algorithm for Minimizing the Spread of Influence in a Social Network}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {06/2018}, pages = {48-59}, type = {Research}, author = {Yong Liu and Shengnan Xie and Wei Zhang and QianqianRen} } @article {646, title = {Time Optimal Profit Maximization in a Social Network}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {03/2018}, pages = {8-22}, type = {Research}, author = {Yong Liu and Wei Zhang} } @article {487, title = {Computer aided fire safety engineering model based on shortest path algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {106 - 114}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021799816\&partnerID=40\&md5=d6600cfbe468d44ff4fc46e50a018498}, author = {Gao, Y. and Zhao, J.} } @article {497, title = {A novel approach for regularization of convolutional neural network}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {30 - 36}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016461859\&partnerID=40\&md5=546e0229eda800292c211f2c58adf7b5}, author = {Zhang, Y. and Shi, B.} } @article {475, title = {Study on digital image inpainting method based on multispectral image texture synthesis}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {251 - 258}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036655486\&partnerID=40\&md5=87cd3fb02681716474621172e64e05b9}, author = {Zhaoyang, J. and Guangxue, C.} } @article {515, title = {Algorithm for coding unit partition in 3D animation using high efficiency video coding based on Canny operator segment}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {237 - 245}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991688577\&partnerID=40\&md5=e79dd6271010e213a188565709bc9824}, author = {Zhao, H. and Li, J.-B. and Zeng, X.-Y.} } @article {501, title = {Analysis on cloud data service platform for digital oilfields}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {413 - 422}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85011003724\&partnerID=40\&md5=b4b0c49bf0677be5bce7f05b7c7bc5ae}, author = {Zhu, Z.-P. and Pan, R.-F. and Chen, Z. and Li, G.-Q. and Zheng, G.-S.} } @article {536, title = {Application of K-means algorithm to web text mining based on average density optimization}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {41 - 46}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969799196\&partnerID=40\&md5=94816cbcc150372d5cf67b43d1d23d52}, author = {Fan, G.-L. and Liu, Y.-W. and Tong, J.-Q. and Zhao, S.-H. and Nie, Z.-Q.} } @article {535, title = {Intuitionistic fuzzy Petri nets for knowledge representation and reasoning}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {104 - 113}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974817409\&partnerID=40\&md5=d032ac3e4f411c8d29c603f648b24755}, author = {Meng, F.-X. and Lei, Y.-J. and Zhang, B. and Shen, X.-Y. and Zhao, J.-Y.} } @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 {512, title = {Modeling the evolution of collaboration network and knowledge network and their effects on knowledge flow through social network analysis}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :4Export Date: 22 February 2018}, month = {2016}, pages = {246 - 254}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991694298\&partnerID=40\&md5=427e307104a58f9c53dfc82d364d3a94}, author = {Zhang, Y.-R. and Ma, D.} } @article {517, title = {New clustering algorithm for multidimensional data}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {255 - 262}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991716924\&partnerID=40\&md5=4ea7d8f5df341e1c97837cd8fa674428}, author = {Fan, L. and Zhong, J.} } @article {514, title = {A novel digital image classification algorithm via low-rank sparse bag-of-features model}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {227 - 236}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991711411\&partnerID=40\&md5=4cf33f1f8c9b9d91db67d686facdeffd}, author = {Zou, X.-M. and Sun, H.-J. and Yang, S. and Zhu, Y.} } @article {534, title = {A novel recommendation strategy for user-based collaborative filtering in intelligent marketing}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {81 - 91}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974784671\&partnerID=40\&md5=a48f248084cf977768be0931a9ac4d89}, author = {Yi, J. and Zhang, L. and Phelan, C.A.} } @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 {540, title = {Trajectory prediction of vessels based on data mining and machine learning}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :3Export Date: 22 February 2018}, month = {2016}, pages = {33 - 40}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969857942\&partnerID=40\&md5=e96a78463c16dcccf34d6c8b1511f98b}, author = {Qi, L. and Zheng, Z.} } @article {539, title = {A web service-based approach to integrated information management for railway emergency scenario}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {1 - 7}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969902467\&partnerID=40\&md5=923eef1ca98ee271af3c1795c2517677}, author = {Zhang, Z.-H. and Xu, Z.-L. and Zhang, Y.-P. and Dang, J.-W. and Shen, L.-X.} } @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 {607, title = {Denoising and segmentation of digital feather image using mean shift algorithm}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {25 - 30}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930363955\&partnerID=40\&md5=d65edfcff5e6774e9248ab177dbaed8d}, author = {Yue, H. and Cai, K. and Luo, B. and Jin, Y. and Zeng, Z.} } @article {579, title = {An efficient RFID data cleaning method based on wavelet density estimation}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {10 - 14}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930330566\&partnerID=40\&md5=9044ba6bdb789f569e8827e6132ce5f8}, author = {Liu, Y. and Zhang, H. and Han, F. and Tan, J.} } @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 {568, title = {Model Computing System for Emergent Infectious Disease Prevention and Control Ability Evaluation of Medical Building Network}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {373 - 380}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857446\&partnerID=40\&md5=ad80f478bba0d7ef819f61056d0d1d02}, author = {Zhang, H. and Zhang, S. and Liu, N.} } @article {555, title = {A novel defect tracking algorithm for ink-jet printing video based on particle filter framework}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {405 - 410}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959201190\&partnerID=40\&md5=5a43eb9e5b049c7ccbe814100c4f200c}, author = {Zhou, J.-N. and Feng, Z.-L. and Lin, Z.-H.} } @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 {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 {552, title = {Simulation study on the effect of employee mobility on the spreading of tacit knowledge among industrial enterprises based on the knowledge spreading model}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {445 - 450}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959184125\&partnerID=40\&md5=8d279888fcea216ca2346d99c18ce71a}, author = {Zhu, H.M. and Zhang, S.T. and Lang, Y.J.} } @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 {567, title = {Understanding Geographical Space with Big Data: A Network Perspective}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {354 - 360}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959853984\&partnerID=40\&md5=e14d86c5b381ac06445461758f94aef8}, author = {Mao, L. and Zheng, B. and Zhao, G. and Liu, L.} } @article {586, title = {The wavelength division multiplexing passive optical network breakpoint precision detection system based broadband chaos light}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {276 - 285}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942510569\&partnerID=40\&md5=5c796d62fc66eaece2d1ef7fd3501ee7}, author = {Zou, D. and Zhang, Y.J.} } @article {447, title = {Adaptive fuzzy PID control for servo motor direct-drive pump control system}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2014}, pages = {1 - 7}, abstract = {The direct-drive pump control system has been gradually applied to the industrial control field due to its high control precision, fast response, small throttle loss and compact structure. This paper adopts the fuzzy PID control method to resolve the hydraulic cylinder position servo control of direct-drive pump control system. The system model and fuzzy PID control algorithm was established by using AMEsim/Simulink joint simulation platform. The step response and Sine tracking performance of the system with PID and fuzzy PID control algorithms was investigated by simulation. At the same time, the performance of PID and fuzzy PID control was studied on the self-developed electro-hydraulic servo control experiment table. The results show that the adaptive fuzzy PID control can greatly improve the performance of the PID control, and has the characteristics of fast response, short rise time, small time delay and overshoot.}, keywords = {Adaptive fuzzy PID control, AMESim/simulink, Direct-drive pump control system, Labview, Position servo control}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900429525\&partnerID=40\&md5=987ea43b8cb58e566d21061a4b7a3558}, author = {Zheng, J.-M. and He, M.-J. and Liu, E.-D. and Yuan, Q.-L. and Xiao, J.-M. and Tang, A.-F.} } @article {455, title = {Campsna: A cloud assisted mobile peer to peer social network architecture}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {126 - 132}, abstract = {In the social network, people with same interest construct a group, where people can share their interesting contents. With the popularity of the mobile devices, mobile users can connect to the internet for services such as downloading videos, music and pictures anywhere at any time, which may cause heavy traffic burden on the core network. The service content (eg. video, picture, music) downloaded and shared in the same social network interest group may always be similar, which may lead to repeated traffic transmitted in a short time period; on the other hand, the size of the service content may be very large for a single user, which will take it along time and spend much money to finish a complete service request or sharing. It is necessary to study how to reduce the requests in internet from the mobile users to reduce the flow on the core network, as well as reducing the economic cost and the service time, which is the main motivation of our research. Based on the universal mobile social network architecture, this paper proposed CAMPSNA: a cloud assisted mobile peer to peer social network architecture. In which, the cloud center is introduced to help the mobile devices offloading complex tasks to the cloud. The end devices in the architecture construct a local mobile peer to peer network to share their existing content based on their social relationships to reduce the burden of the cloud center.}, keywords = {Data exchange, Mobile Cloud, Mobile peer to peer Network, Network Architecture, Social Network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903137451\&partnerID=40\&md5=eeaa0a8cdbbd54b68c6c7fb395d21692}, author = {Liu, Y.-N. and Tang, H. and Zhao, G.-F.} } @article {457, title = {An indirect security trust method based on credibility evaluation}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {139 - 150}, abstract = {In existing trust models, the recommending services often provide a single trust value (computed by them during their interaction with the unknown entity in question) as a recommendation. However, a single trust value recommended by a recommender represents its subjective opinion about the unknown entity and cannot depict the real trust level very well under certain circumstances. To solve this problem, a fuzzy based credibility evaluation method for indirect trust computation is proposed. The calculation method cannot just incorporate a mechanism to determine the weight each valid recommendation should carry on aggregation process, but also distinguish between honest and dishonest recommendations in the meantime.}, keywords = {Credibility Evaluation, Fuzzy based Evaluation, Indirect Recommendation, Reputation, Security Evaluation, Trust Mechanism}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903216443\&partnerID=40\&md5=a59d1e2ce7d032c7b4f8031b81f95742}, author = {Xianghe, W. and Hong, Z. and Zhen, L. and Qianmu, L. and Bin, X.} } @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 {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 {396, title = {Augmented broadcaster identity-based broadcast encryption}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {227 - 234}, abstract = {Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user{\textquoteright}s private key, which is an obstacle of the application of IBBE. The existing approaches to solving key escrow problem need the user to submit identity to multiple PKGs or interactions between PKG and the user in the private key extraction phase. For Point-to-Multipoint Identity-based Broadcast Encryption (P2MIBBE) that the computing capabilities of receiver are limited, these approaches are impracticable. We propose a new approach what we call Augmented Broadcaster Identity-based Broadcast Encryption (ABIBBE). It requires neither multiple PKGs nor calculation of receiver in the private key extraction phase. We construct a universal scheme to realize AB-IBBE, such that any IND-ID-CPA secure IBBE scheme can be extended to an IND-ID-CPA secure AB-IBBE scheme.}, keywords = {Identity-based broadcast encryption, Key escrow}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880816896\&partnerID=40\&md5=1b3634203833f7e75593ce577d867ca5}, author = {Zhang, J. and Xu, Y. and Chen, 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 {416, title = {Digital information facial recognition based on PCA and its improved algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {390 - 395}, abstract = {Face recognition (PCA algorithm) based on principal component analysis method is a classic algorithm of digital information face recognition. This paper first analyzes the PCA algorithm and its basic principles. And in view of the shortage that it is affected by its subject facial expression changes and other factors, it designs the improved PCA algorithm, namely adding the image enhancement processing method, such as the local mean and standard deviation, to the original algorithm to increase the robustness of human face illumination and facial expression change during recognition. In addition, verify it on ORL face database and the results show that the improved PCA algorithm can get a higher resolution of the human face and up to 81.59\% accuracy rate. The average growth of time-consuming is 0.378 seconds compared to traditional algorithms, and it is a fruitful improved algorithm.}, keywords = {Digital information, Face recognition, Image enhancement processing method, Principal component analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890454789\&partnerID=40\&md5=9180e88599a60f794e63948a9a7036db}, author = {Zhu, H.-F.} } @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 {399, title = {Fault prediction of nonlinear system using time series novelty estimation}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {207 - 212}, abstract = {Many complex nonlinear systems have the characteristics such as difficult modeling, dangerous testing, and high cost to experiment with fault. Aim at these points, a new kind of novelty estimation method based on an on-line Least Square Support Vector Regression (LS-SVR) algorithm is presented for fault prediction of nonlinear system in this paper. Firstly, a set of characteristic token values, which represent normal state of time series at the beginning, are selected as the training data to establish the on-line LS-SVR model. Then, the output values of the on-line model are analyzed to estimate novel pattern. Once the novel pattern is affirmed, the fault of system is forecasted immediately. The proposed method needs neither the math model of system nor the fault training data and primary knowledge, and it is believed with good real-time capability. The results of simulation on Continuous Stirred Tank Reactor (CSTR) show the efficiency.}, keywords = {Fault prediction, Nonlinear system, Novelty estimation, Time series}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880818113\&partnerID=40\&md5=5fe267d630eb652afa900d99483c0dcf}, author = {Su, S. and Zhang, W.} } @article {377, title = {Information sharing in supply chain: A review}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {125 - 130}, abstract = {The importance of information sharing in supply chain management is a matter of consensus between practitioners and researchers. Information sharing can increase supply chain efficiency by reducing inventories and smoothing production. Studies from different and recognised authors are reviewed, compiled and analyzed in three aspects. First, the types of shared information in supply chain are summarized. After, the value of different shared information and the factors which affect its value are presented. Moreover, the methodologies used in literature are detailed. The paper concludes with some future directions for theory construction and empirical research.}, keywords = {Information sharing, Literature review, Supply chain network, Supply chains management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879070693\&partnerID=40\&md5=492576360136fd7384f5e3b18e51a4d1}, author = {Yang, Z. and Zhang, L.} } @article {420, title = {Modeling and simulation of DIGSILENT-based micro-grid system}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {342 - 351}, abstract = {The accurate modeling of micro-grid access to power system planning and design stage needs is the primary problem to solve. This paper modeled the micro grid photovoltaic power generation system, including silicon solar cell, photovoltaic inverters, battery energy storage system, and the micro power distribution system. In the use of power system analysis software (DIGSILENT) of actual power system simulation, the simulation results verify the model{\textquoteright}s correctness. In the power grid fault disturbance, the light intensity of disturbance and the load disturbances, the simulation results show that the optical storage combined with micro network has fast dynamic response characteristics, and its network of grid-connected voltage influenced by the changes of the light and load is little, while more affected by the network fault influence.}, keywords = {Battery energy storage system, Micro grid, Photovoltaic inverter, Silicon solar cell}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890522361\&partnerID=40\&md5=6ae6926a5a8e9c87e46f14f7d564b0cc}, author = {Zhang, Y. and Zhu, X. and Li, Q. and Liu, T.} } @article {403, title = {Parameters selection in the discrete particle swarm optimization algorithm solving gate and runway combinational optimization problem}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {197 - 201}, abstract = {Gate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance of the algorithm. Optimal values exist in the specific application of the respective parameters. The optimal value interval of the population size does not vary with different acceleration constants when inertia weight is constant. Increasing the population size can improve the solution quality, but the time overhead increases significantly. Finally, each parameters selection guidelines are provided.}, keywords = {Airport operation, Discrete particle swarm optimization, Gate and runway combinational optimization, Parameters selection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880782704\&partnerID=40\&md5=b89c7c4e42430962155e9283216c7b70}, author = {Ding, J. and Zhang, Y.} } @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 {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 {434, title = {Secure digital certificate design based on the RSA algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {423 - 429}, abstract = {With the popularity of the Internet, people can purchase and sell goods and services online just staying at home, and this trend is becoming increasingly apparent. The Internet, as a global computer network, has to provide the following five services: security, data integrity, authentication, usability, and reliable information. In case of lack of safety measures, Internet trading risk is very high. Digital certificates can provide proof of identity in Internet transactions, so that we can greatly reduce transaction risk. This paper describes an approach based on the X.509 standard for digital certificates, using the C language generate public key algorithm RSA, enabling digital certificate generation and signature verification process, the identity of certification users can be verified.}, keywords = {Authentication, Digital Certificates, Internet, RSA}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892153961\&partnerID=40\&md5=9398ee5232d46b8d829b73ca5dbee714}, author = {Zhong, Y.} } @article {373, title = {The short-term wind power forecast based on phase-space reconstruction and neural networks}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {40 - 45}, abstract = {The short-term forecast of the wind power of a wind farm is of great significance for the security and stability of a grid-connected generation system. An accurate forecast may reduce the spinning reserve of a grid while providing reliable references for operation dispatch of a wind farm. In order to improve the accuracy of short-term forecasts, introducing the phase-space reconstruction technique of the chaos theory, this paper was established forecasting models by reconstructing the historical time-series data of the wind power of a single unit based on the dynamical properties of chaos sequences, choosing the best delay time with the mutual information method, determining the best combination of embedding dimensions with the Cao algorithm, as well as utilizing the Elman recurrent neural network and others like the BP. As comparative case analysis shows, the forecasts of Elman model are more accurate than that of the others, exhibiting a positive prospect of utilizing this combined model of phase-space reconstruction and neural network in wind power forecasting of a single unit.}, keywords = {BP Neural Network, Delay time, Elman neural network, Embedding dimensions, Phase-space reconstruction, The short-term wind power forecasts}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879073309\&partnerID=40\&md5=fdd64e3c0ae9db677a30cd0fc318f9ba}, author = {Zhang, J.-H. and Liu, Y.-Q. and Tian, D.} } @article {371, title = {Study on current protection in distribution network with distributed generation}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {46 - 53}, abstract = {Running with distributed generation, configuration of distribution network will be changed, that influences strength, flowing direction and duration of fault current. It analysed influence on current protection in main feeder, recloser and conventional branch line protection through the calculation formula of fault current before and after distributed generation synchronization development. In Matlab/Simulink, it constructed distribution network model with distributed generation, used simulation examples to prove influence on current protection and put forward improvement measures which can meet requirements of relay protection in distribution network.}, keywords = {Current protection, Distributed generation, Distribution network, Fault current}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879100407\&partnerID=40\&md5=c313cd9e2a75b7b6bd904c992a809445}, author = {Zhu, X.-L. and Liu, J. and Han, F.} } @article {413, title = {Tuning of PID controller for air conditioning unit based on adaptive genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {385 - 389}, abstract = {PID control is widely used in air conditioning system. The algorithm is simple but has a long response time, and the adjustment is not flexible. In this paper, we propose a method of optimizing PID controller parameters based on adaptive genetic algorithm. Specifically, the fitness function with penalty terms is added to the classical genetic algorithm and adaptive crossover and mutation factor genes to make the PID parameters converge to global optimum quickly. In addition, the method can prevent overshoot and improve stability effectively. Simulation results indicate that our method achieved a 83\% reduction in regulation time of response of an airconditioning unit compared with the original PID system . The method can be used for online tuning of PID parameters as well.}, keywords = {Adaptive genetic, Air-conditioning unit, Control system, Penalty factor, PID parameter optimizatio}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890505004\&partnerID=40\&md5=0eb209969776e5c94c3b9272214e4d6f}, author = {Zhou, Y.-T. and Nie, J.-B. and Han, N. and Li, D. and Chen, C.} } @article {380, title = {Vehicle routing optimization problem with time-windows and its solution by genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {136 - 145}, abstract = {Vehicle Routing Problem (VRP) is a hot issue in the field of logistics. Furthermore, the Vehicle Routing Problem with Time-Windows (VRPTW) is an additional constraint of the customer access time windows based on the VRP. It becomes a noticeable problem with the development of logistics distribution and the just-intime distribution demand from customers, which increases a visiting window to traditional VRP. This paper firstly analyzes the distribution vehicle scheduling optimization problem with time-windows. Subsequently, through transforming the capacity and soft time-windows constraint into objective constraint, the authors establish a non-full loaded VSP model. Moreover, genetic algorithm is used to solve this problem, where natural number is adopted to realize problem coding and the maximum reservation crossover and improved inverse mutation technology are used to generate new individuals. Finally through the simulation experiment, the results verify its feasibility and effectiveness.}, keywords = {Genetic Algorithm, Logistics distribution, Time-windows, Vehicle routing optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879123858\&partnerID=40\&md5=7522f4b2d16a9e979a5ea8b102a48e5a}, author = {Chen, T. and Zhou, 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 {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 {324, title = {Low overhead geometric on-demand routing protocol for mobile ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {114 - 120}, abstract = {At present, Mobile Ad Hoc Networks (MANET) have become a hot research field, in view that the mobile nodes have the characteristics of mobility, limited energy, limited storage space and so on. Thus to design a simple and high-efficiency routing protocol is an important issue. AODV routing protocol can resolve the routing problem of Mobile Ad Hoc Networks, but it still has many shortcomings, such that it uses flooding method to broadcast messages and finds the route, which cause heavy network overhead and other problems. In this paper, in order to resolve the low efficiency of simple flooding, we first analyze AODV routing protocol briefly. After that we propose an improved routing broadcast algorithm-GAODV, which aims to restrict the forwarding nodes within a local area through the geometrical routing, and prevent from flooding the control packet in the whole network. Simulation results show that the G-AODV effectively reduces network overhead and the end to end delay. Moreover, it also significantly improves the effectiveness of protocol and the overall performance of the network.}, keywords = {AODV, Flooding, Geometrical routing, Mobile ad hoc network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866448629\&partnerID=40\&md5=1ddb21882f2996c7fdd5e7fbfd1511cb}, author = {Su, C. and Zheng, L. and Si, X. and Shang, F.} } @article {335, title = {Modeling push-based live P2P streaming by stochastic activity networks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {236 - 244}, abstract = {Live P2P streaming has been widely used in recent years because of its scalability and low costs. At the same time, it meets some new challenges that centralized systems never faced, for example, churn and content pollution. It is the first paper which uses stochastic activity networks (SANs) to model and analyze pushbased live P2P streaming systems from the users{\textquoteright} point of view. The model provides a new line of thinking to model push-based live P2P streaming, which enables the effect of churn, pollution and buffer size to be studied simultaneously. It explains why there is a gap between theoretical results in previous studies of content pollution in P2P streaming and the observed effect. It also points out the threshold of buffer size for non-significant QoS improvement.}, keywords = {Modeling, P2P streaming, Pollution, QoS, Stochastic activity networks(SAN)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866465492\&partnerID=40\&md5=34d4755b1ae344b34d02b8146fa92325}, author = {Zhang, P. and Helvik, B.E.} } @article {338, title = {A novel RDB-SW approach for commodities price dynamic trend analysis based on web mining}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2012}, pages = {230 - 235}, abstract = {In order to improve the accuracy of price forecasting for dynamic trend analysis on imperfect data by web extracting, a novel repair data algorithm based on dichotomy backfilling is proposed in this paper. The price forecasting algorithm based on the Sliding Window (SW) is utilized to verify the validity of Repair Dichotomy Backfilling (RDB) algorithm. Experiments demonstrated that the mean absolute errors can be achieved to 5.31 percent average. Furthermore, the price forecasting algorithm based on original data and that based on RDB data are explored to compare their accuracy. Experiments demonstrated the reduction of mean absolute errors in the price dynamic trend analysis verification model. The average MAE on original data is 2.38 percent when the average MAE on RDB data is 2.31 percent. Experiment results proved that the proposed RDB-SW approach is meaningful and useful to analyze and to research the price market on imperfect data by Web extracting.}, keywords = {Dichotomy backfilling, Disturbance factor, Imperfect data, Price forecast algorithm, Sliding window}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463450\&partnerID=40\&md5=5874dc4739d723f46728438c22a52b9a}, author = {Zhu, Q. and Zhou, P. and Cao, S. and Yan, Y. and Ding, J.} } @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 {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 {350, title = {A survey on data migration management in cloud environment}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {324 - 331}, abstract = {Cloud computing has become a hot technology. The virtualization technology, one of its core support technologies, is also developing quickly. In recent years, a lot of research and practice have been done in the virtualization field. Live virtual machine migration has drawn much attention as a representative technology of the virtualization field. This paper summarizes the research progress of live virtual machine migration technology including pre-copy, post-copy and CR/TR-Motion analyzes the future research trend.}, keywords = {Cloud computing, Live migration, Virtual machine, Virtualization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870801122\&partnerID=40\&md5=b4c2238489deb4c292137fd14e4a2091}, author = {Hu, L. and Zhao, J. and Xu, G. and Ding, Y. and Chu, J.} } @article {333, title = {Word combination kernel for text categorization}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {202 - 211}, abstract = {We proposed a novel kernel for text categorization. This kernel is an inner product in the feature space generated by all word combinations of specified length. A word combination is a collection of different words co-occurring in the same sentence. The word combination of length k is weighted by the k-th root of the product of the inverse document frequencies (IDF) of its words. A computationally simple and efficient algorithm was proposed to calculate this kernel. By restricting the words of a word combination to the same sentence and considering multi-word combinations, the word combination features can capture similarity at a more specific level than single words. By discarding word order, the word combination features are more compatible with the flexibility of natural language and the dimensionality this kernel can be reduced significantly compared to the word-sequence kernel. We conducted a series of experiments on the Reuters-21578 dataset and 20 Newsgroups dataset. This kernel consistently achieves better performance than the classical word kernel and word-sequence kernel on the two datasets. We also assessed the impact of word combination length on performance and compared the computing efficiency of this kernel to those of the word kernel and word-sequence kernel.}, keywords = {Kernel methods, Machine learning, Support vector machine, Text classification, Word-combination kernel}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866439932\&partnerID=40\&md5=8649dfc8c1ee23ca70f2b137a74a19e4}, author = {Zhang, L. and Hu, X. and Qin, S.} } @article {296, title = {Application-level solution for data integration in ubiquitous computing environment}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {233 - 241}, abstract = {The Ubiquitous Computing envisions a world of communicating mobile devices and sensors. Advances in wireless communications raise users{\textquoteright} expectations about the accessibility of information in Ubiquitous Computing environments. Getting meaningful information from disparate sensor nodes and/or mobile devices spread in Ubiquitous Computing environment is an urgent task. On the one hand, the heterogeneity of the sensor nodes makes share and finding data at the mobile devices and sink nodes much harder. On the other hand, nodes in Ubiquitous Computing environment are highly dynamic which means query planning in Ubiquitous Computing environment should be able to dynamically re-make their plan when the network conditions change due to intermittent connectivity. To address these two issues, this paper proposes a new service-oriented framework(called UCDS, standing for Ubiquitous Computing Data Services ) at application-level, which supports for semantic integration and querying of heterogeneous data sets distributed over the Ubiquitous Computing environment. We propose a RDF-View-based approach for mobile data mediation, and describe the service-composition-based query planning algorithm implemented in UCDS. We explore an ontology based approach to, mapping mobile data to data services (DS for short), publishing DS with the shared domain ontology. We also explore dynamically evolving service interface enabled by richly service description capability using the semantic web languages, and answering queries through DS composition. Experimental results show that the approach adopted by UCDS provides a better performance compared with the conventional approach.}, keywords = {Data integration, Query processing, Service composition, Ubiquitous Computing Data Services}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855403966\&partnerID=40\&md5=c0fbe9d31dec46666f6361a5d9fb7a72}, author = {Zhou, L. and Zhang, Y. and Guan, B.} } @article {293, title = {Applications classification and scheduling on heterogeneous hpc systems using experimental research}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {227 - 232}, abstract = {Heterogeneous high-performance computing (HPC) systems have been proposed as a power efficient alternative to traditional homogeneous systems. In heterogeneous HPC system, fast CPUs which have complex pipelines, high clock frequencies as well as high power consumption are combined with slow ones which have simple pipelines, low clock frequencies as well as low power consumption. Different types of applications should be distributed to run on different type of CPUs, in order to achieve a trade-off between energy and performance. In this paper, we use experimental research to investigate the applications classifications which categorize each application as the CPU-intensive, memory-intensive, or phase-change application. We also conduct some experiments to measure the current, power, and energy of different types of applications. Afterwards, a scheduling method for applications on heterogeneous HPC systems is proposed. The experiment shows that the scheduling method can trade off the latency and energy consumption based on the applications classification and measurement.}, keywords = {Applications Classification, Heterogeneous Systems, High Performance Computing, Scheduling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855410151\&partnerID=40\&md5=442c0fa54ceef88eed0bc85373d116ff}, author = {Xia, Y. and Zhu, M. and Kuang, L. and Ma, X.} } @article {297, title = {The design and challenges of online reprogramming system for wireless sensor networks}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2011}, pages = {255 - 260}, abstract = {At present, the online network reprogramming faces two challenges: 1) How to save the energy consumed during the code dissemination; and 2) How to enhance the security of online network reprogramming. In this paper, we modify the work flow of online reprogramming system and separates an alone reprogramming component from the whole program image which need not be transmitted in order to reduce the energy consumption. According to the security vulnerabilities in the image management aspects of code dissemination, acipher puzzle-based image management algorithm is proposed. According to the based-request attacks, several counter measures are introduced in our online reprogramming system, such as secure broadcast authentication based on cluster keys and the request count technique. By integrating several key techniques, our online reprogramming system can securely and energy-efficiently disseminate the new program image into the whole WSNs.}, keywords = {Authentication, Hash Key Chain, Online Network Reprogramming, Wireless sensor networks}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855387891\&partnerID=40\&md5=a4ce74298f75f1a849cd6ed7c203d24f}, author = {Xie, M. and Zhang, G.} } @article {303, title = {The design and implementation of the digital down converter based on the improved dds and dspbuilder techniques}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {281 - 286}, abstract = {DDC (Digital Down Converter), as a key part of digital receivers, aims to get low-speed digital baseband signals by extracting and filtering the digital signals transformed by high-speed ADC (Analog Digital Conversion). This paper employs the multi-rate process technique to design the DDC, i.e. firstly conducting data CIC (Cascade Integrator Comb) extraction, then HBF (Half-Band Filtering) and at last low pass filtering. CIC, which doesn{\textquoteright}t need multiplication, can realize high speed filtering and the HBF has high operation efficiency and good realtime performance. FPGA realization is taken into full consideration during the project design of the top. In the end, this paper adopts the Simulink instrument in MATLAB and combines Altera{\textquoteright}s signal processing toolbox-DSPBuilder to implement the design scheme by the FPGA. It focuses on the description of FPGA implementation of the digitally controlled oscillator, CIC filter, half-band extracting filter and the low pass filter.}, keywords = {Digital Down Converter, Direct Digital Synthesizer, DSPBuilder}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855395419\&partnerID=40\&md5=64afa914e4030e52506b12f1d4b5d816}, author = {Zhang, G. and Xie, M.} } @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 {280, title = {Froglingo, a programming language empowered by a total-recursive-equivalent data model}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {134 - 146}, abstract = {The EP (Enterprise-Participant) data model is a language homomorphic to and semantically equivalent to a class of total recursive functions. It takes a unique position in the fields of programming languages and database management. Mathematically, it enables a programming language to achieve the greatest possible ease of use in software development and maintenance. (This assumes that a programming language incorporated with a higher expressive data model was easier than another one with a lower expressive data model, or no data model at all.) Practically, Froglingo - a programming language incorporated with the EP data model is a monolith that consolidates multiple software components of traditional software architecture. In addition, Froglingo is untyped, i.e., programmers write application programs without a necessity of user-defined types. Finally, Froglingo is a novel approach to many challenges facing traditional technologies, including feature scalability, user interface flexibility, and similarity. In this paper, we show with further clarity the concept of ease of use by proposing a mathematical definition for the concept of data models and by relating Froglingo with other programming language through the analysis of types and higher-order functions.}, keywords = {EP data model, Froglingo programming langauge, Higher-order functions, Knowledge management, Total-recursive equivalence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053114137\&partnerID=40\&md5=1d550173b3aa984474c5a8e1930a465a}, author = {Xu, K. and Zhang, J. and Gao, S.} } @article {243, title = {Exploiting multi-word similarity for retrieval in medical document collections: The TSRM approach}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {315 - 321}, abstract = {In this paper, we investigate on potential improvements to Information Retrieval (IR) models related to document representation and conceptual, topic retrieval, in medical document collections. We propose the TSRM1 (Term Similarity and Retrieval Model) approach, where document representations are based on multi-word domain terms, rather than mere single key-words, typically applied in traditional IR. The proposed representation is semantically compact and more efficient, being reduced to a limited number of meaningful multi-word terms (phrases), rather than large vectors of single-words, part of which may be void of distinctive content semantics. In computing document similarity, contrary to other state-of-theart methods examined in this work, TSRM adopts a knowledge poor solution, namely an approach which does not require any existing knowledge resources, such as ontologies, or thesauri. The evaluation of TSRM is based on OHSUMED, a standard TREC collection of medical documents and illustrated the effciency of TSRM over other well established general purpose IR models.}, keywords = {Document representation, Information retrieval, Medical information retrieval, Term extraction, Term Similarity}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960229245\&partnerID=40\&md5=f9f58b511661960f2a01ed0691084e33}, author = {Drymonas, E. and Zervanou, K. and Petrakis, E.G.M.} } @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 {183, title = {Mobile lab clients for testing application specific integrated circuits in education}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {181 - 184}, abstract = {The aim of this work is to develop a simultaneous multi user access system - READ (Remote ASIC Design and Test) that allows users to perform test and measurements remotely via clients running on mobile devices as well as on PCs. The system also facilitates the remote design of circuits with the PAC - Designer The system is controlled by LabVIEW and was implemented using a Data Acquisition Card from National instruments. Such systems are specially suited for manufacturing process monitoring and control. The performance of the simultaneous access was tested under load with a variable number of users. The server implements a queue that processes user{\textquoteright}s commands upon request.}, keywords = {ASICs, Mobile devices, Mobile labs, Online laboratories, Remote systems, Server-client communication}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249148043\&partnerID=40\&md5=22ca5f36d66213765126ebee1739ec06}, author = {Auer, M.E. and Zutin, D.G.} } @article {185, title = {A novel graph containment query algorithm on graph databases}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {143 - 151}, abstract = {Nowadays, efficient graph query processing method is coming more and more important along with the structured data accumulating. Given a graph database, a graph containment query retrieves the graphs from the database that are subgraphs of the query graph. In this paper, an algorithm is proposed, which is founded on a CFG (Closed Frequent subgraph) based index, to answer graph containment query. CFG is a set of special frequent subgraph of a graph database. When query processes through this index, it gets back a smaller candidate answer set than other methods which means much less subgraph isomorphism calculation. Both theoretical analysis and experimental evaluation result shows that the proposed method not only efficiently prunes the search branches in the feature index, but also effectively reduces the subgraph isomorphism test between the query graph and the indexed features.}, keywords = {Frequent subgraphs, Graph databases, Graph indexing, Graph querying}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249130115\&partnerID=40\&md5=c53fbe52cb4f2481146df6768914245f}, author = {Li, X. and Zhang, W. and Li, J.} } @article {188, title = {Query-by-multiple-examples using support vector machines}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {202 - 210}, abstract = {We identify and explore an Information Retrieval paradigm called Query-By-Multiple-Examples (QBME) where the information need is described not by a set of terms but by a set of documents. Intuitive ideas for QBME include using the centroid of these documents or the well-known Rocchio algorithm to construct the query vector. We consider this problem from the perspective of text classification, and find that a better query vector can be obtained through learning with Support Vector Machines (SVMs). For online queries, we show how SVMs can be learned from one-class examples in linear time. For offline queries, we show how SVMs can be learned from positive and unlabeled examples together in linear or polynomial time, optimising some meaningful multivariate performance measures. The effectiveness and efficiency of the proposed approaches have been confirmed by our experiments on four real-world datasets.}, keywords = {Information retrieval, Machine learning, Supportvector machine, Text classification}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953247724\&partnerID=40\&md5=8fea0823a5d70e478bf228f315a5ef89}, author = {Zhang, D. and Lee, W.S.} } @article {162, title = {Cluster based mixed coding schemes for inverted file index compression}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {30 - 37}, abstract = {The cluster property of document collections in today{\textquoteright}s search engines provides valuable information for index compression. By clustering d-gaps of an inverted list based on a threshold, and then encoding clustered and non-clustered d-gaps using different methods, we can tailor to the specific properties of different d-gaps and achieve better compression ratio. Based on this idea, in this paper we propose a cluster based approach and presents two new codes for inverted file index compression: mixed gamma/flat binary code and mixed delta/flat binary code, Experiment results show that the two new codes achieve better or equal performance in terms of compression ratio comparing to interpolative code which is considered as the most efficient bitwise code at present Besides, the two new codes have much lower complexity comparing to interpolative code and therefore enable faster encoding and decoding. By adjusting the parameters for the mixed codes, even better results may be achieved. Experiments show promising results with our approaches.}, keywords = {d-gap, Index compression, Inverted file, Inverted list}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849117299\&partnerID=40\&md5=e6f756f0e7e96db7d5c31eadd73799d6}, author = {Chen, J. and Zhong, P. and Cook, T.} } @article {135, title = {Co-training for search-based automatic image annotation}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {214 - 218}, abstract = {Search-based automatic image annotation is an effective technology to enhance the performance of annotation. By integrating the co-training technique, this paper addresses on a novel scheme for search-based image annotation, in which two classifiers can contribute to each other during the training phase. Since each classifier can select some most confident images to enhance the generalization ability of the other one, the co-training learning algorithm is triggered out for automatically mining more and more relevant images, which improve the annotation performance greatly. To characterize the various contribution of each relevant image, the probability output of the classification is taken as the corresponding weight. Moreover, the histogram of retrieved keywords is proposed to re-rank the final reliability of the keywords to be annotated, which can also guarantee the scalability property of annotation to some extent. With the promoted search precision on the basis of co-training strategy, the experimental results demonstrate the improvement of annotation performance.}, keywords = {Automatic image annotation, Bayesian classifier, Co-training, SVM}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449186106\&partnerID=40\&md5=73219b4c7b5383b4a06f69f6ba3903d1}, author = {Zhao, Y. and Zhao, Y. and Zhu, Z.} } @article {122, title = {Personalized document ranking: Exploiting evidence from multiple user interests for profiling and retrieval}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):14Export Date: 10 July 2014}, month = {2008}, pages = {354 - 365}, abstract = {The goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a novel model for both user profiling and document ranking that consider the user interests as sources of evidence in order to tune the accuracy of the documents returned in response to the user query. User profiling is performed by managing the user search history using statistical based operators in order to highlight the user short-term interests seen as surrogates for building the long-term ones. The document ranking model{\textquoteright}s foundation comes from influence diagrams which are extension of Bayesian graphs, dedicated to decision-making problems. Hence, query evaluation is carried out as an inference process that aims at computing an aggregated utility of a document by considering its relevance to the query but also the corresponding utility with regard to the user{\textquoteright}s topics of interest. Experimental results using enhanced TREC collections indicate that our personalized retrieval model is effective.}, keywords = {Data Quality, Grammar Formalism, Integrity Constraint Checking, Spatial Consistency, Topological Relationships, Visual Language Parsing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349921290\&partnerID=40\&md5=8adac2115f775267c564b7fcb8a379f1}, author = {Tamine-Lechani, L. and Boughanem, M. and Zemirli, N.} } @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 {118, title = {Web information extraction using web-specific features}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {235 - 243}, abstract = {Several problems exist with traditional HMM based approaches for Web information extraction (IE) due to the lack of consideration on Web-specific features. To address this Issue we present a Generalized Hidden Markov Model (GHMM) that extends HMMs by making use of Web-specific Information for Web IE. In GHMMbased approach, Web content blocks instead of terms are used as basic extraction unit. Besides, instead of using the traditional sequential state transition order, GHMM decides the state transition order based on layout structure of the corresponding web page. Furthermore, GHMM uses multiple emission features derived from Web information instead of single emission feature. Experimental study shows that GHMM based approach can effectively improve Web IE comparing to traditional HMM based approaches.}, keywords = {Hidden, Information extraction, Markov model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350728184\&partnerID=40\&md5=f0b7ac3e808f4c890768399e96e15bca}, author = {Chen, J. and Zhong, P.} } @article {74, title = {Analysis of the data quality of audio descriptions of environmental sounds}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):9Export Date: 10 July 2014}, month = {2007}, pages = {48 - 54}, abstract = {In this paper we perform statistical data analysis of a broad set of state-of-the-art audio features and low-level MPEG-7 audio descriptors. The investigation comprises data analysis to reveal redundancies between state-of-the-art audio features and MPEG-7 audio descriptors. We introduce a novel measure to evaluate the information content of a descriptor in terms of variance. Statistical data analysis reveals the amount of variance contained in a feature. It enables identification of independent and redundant features. This approach assists in efficient selection of orthogonal features for content-based retrieval. We believe that a good feature should provide descriptions with high variance for the underlying data. Combinations of features should consist of decorrelated features in order to increase expressiveness of the descriptions. Although MPEG-7 is a popular and widely used standard for multimedia description, only few investigations do exist that address analysis of the data quality of low-level MPEG-7 descriptions.}, keywords = {Audio descriptors, Audio features, MPEG-7 descriptors, Multimedia content retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849119790\&partnerID=40\&md5=8ed62cb5e71bdeccf00462d93d30e2db}, author = {Mitrovic, D. and Zeppelzauer, M. and Eidenberger, H.} } @article {113, title = {Clustering frequent graph patterns}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {335 - 346}, abstract = {In recent years, graph mining has attracted much attention in the data mining community. Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns. Several novel concepts such as δ-cover graph, jump value and δ-jump pattern are proposed for efficiently summarizing frequent graph patterns. Based on the property of all δ-jump patterns being representative graph patterns, we propose two efficient algorithms for summarizing frequent graph patterns, RP-FP and RP-GD. The RP-FP algorithm computes representative graph patterns from a set of closed frequent graph patterns, whereas the RP-GD algorithm directly mines representative graph patterns from graph databases. The RP-FP has tight approximation (summarization) bound but higher computational complexity. The RP-GD has no approximation bound guarantee but is far more efficient. We conducted extensive experimental studies using various real and synthetic datasels. Experimental results show that RP-FP and RP-GD are able to obtain compact summarization in both real and synthetic graph databases. When the number of closed graph patterns is very large, RP-GD is much more efficient than RP-FP, while achieving comparable summarization quality.}, keywords = {Closed graph pattern, Frequent graph pattern, Graph mining, Representative graph pattern, δ-jump pattern}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149118250\&partnerID=40\&md5=cae15cbd3bb5b1a9e3f57a95dbe295b5}, author = {Liu, Y. and Li, J. and Zhu, J. and Gao, H.} } @article {98, title = {A comparative study on key phrase extraction methods in automatic Web Site Summarization}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2007}, pages = {323 - 332}, abstract = {Web Site Summarization is the process of automatically generating a concise and informative summary for a given Web site. It has gained more and more attention in recent years as effective summarization could lead to enhanced Web information retrieval systems such as searching for Web sites. Extraction-based approaches to Web site summarization rely on the extraction of the most significant sentences from the target Web site based on the density of a list of key phrases that best describe the entire Web site. In this work, we benchmark five alternative key phrase extraction methods, TFIDF, KEA, Keyword, Keyterm, and Mixture, in an automatic Web site summarization framework we previously developed. We investigate the performance of these underlying methods via a formal user study and demonstrate that Keyterm is the best choice for key phrase extraction while Mixture should be used to obtain key sentences. We also discuss why one method performs better than another and what could be done to further improve the summarization system.}, keywords = {Key phrase extraction, Web retrieval, Web site study}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350686085\&partnerID=40\&md5=1e62cb16df24be6167a1dbde14d4281c}, author = {Zhang, Y. and Milios, E. and Zincir-Heywood, N.} } @article {80, title = {Empirically validating software metrics for risk prediction based on intelligent methods}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {99 - 106}, abstract = {The software systems which are related to national science and technology projects are very crucial. This kind of systems always involves high technical factors and has to spend a large amount of money, so the quality and reliability of the software deserve to be further studied. Hence, we propose to apply four intelligent classification techniques most used in data mining fields, including Bayesian belief networks (BBN), nearest neighbor (NN), rough set (RS) and decision tree (DT), to validate the usefulness of software metrics for risk prediction. Results show that comparing with metrics such as Lines of code (LOC) and Cyclomatic complexity (V(G)) which are traditionally used for risk prediction, Halstead program difficulty (D), Number of executable statements (EXEC) and Halstead program volume (V) are the more effective metrics as risk predictors. By analyzing obtained results we also found that BBN was more effective than the other three methods in risk prediction.}, keywords = {Bayesian belief networks, Decision tree, Nearest neighbor, Risk prediction, Software metrics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350695759\&partnerID=40\&md5=f939c6d69c641cbeee0b6e64381ba65a}, author = {Xu, Z. and Zheng, X. and Guo, P.} } @article {75, title = {Energy efficient and QoS-aware tasks allocation for 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 = {88 - 94}, abstract = {Collaborative processing among sensors to fuffill given tasks is a promising solution to save significant energy in resource-limited wireless sensor networks (WSN). Quality-of-Service (QoS) such as lifetime and latency is largely affected by how tasks are mapped to sensors in network. Tasks allocation is a well-defined problem in the area of high performance computing and has been extensively studied in the past. Due to the limitations of WSN, existing algorithms cannot be directly used. In this paper, a novel nested optimization technique based on genetic algorithm is proposed to assign tasks onto sensors with minimal cost while meeting application{\textquoteright}s QoS requirements. Optimal solution can be achieved by incorporating task mapping, routing path allocation, communication scheduling, dynamic voltage scaling. Performance is evaluated through experiments with randomly generated Directed Acyclic Graphs (DAG) and experiments results show better solution compared with existing methods.}, keywords = {Genetic algorithm (GA), Quality-of-service (QoS), Tasks graph, Tasks scheduling, Wireless sensor network (WSN)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849126976\&partnerID=40\&md5=62663602655dc452190f9dd9b2a26fc5}, author = {Zhu, J.H. and Li, J.Z. and Gao, H.} } @article {84, title = {Knowledge-based support for object-oriented software design and synthesis: A category theoretic approach}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2007}, pages = {115 - 122}, abstract = {To reuse previous knowledge of objectoriented design and adapt them to solve new problems, the collaboration relationships and the responsibility distribution among software objects need to be thoroughly understood and precisely formulated. The paper proposes a knowledge-based approach that employs category theoretic models to formalize and mechanize objectoriented software design and synthesis by focusing concern on reasoning about the interdependency relationships at different levels of abstraction and granularity. The major benefit of our approach is twofold: First, it provides an explicit semantics for formal object-oriented specifications, and therefore enables a high-level of reusability and dynamic adaptability. Second, it utilizes the ability of categorical computations to support automated software composition and refinement. A prototype tool that demonstrates the feasibility and effectiveness of our approach is also presented.}, keywords = {Automated software, Object oriented design, Software metrics, Software quality}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350673897\&partnerID=40\&md5=de1990a30fe9efe685a0df6e39e37b82}, author = {Zheng, Y. and Xue, J. and Hu, Q.} } @article {95, title = {Promotion of local to global operation in train control system}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):15Export Date: 10 July 2014}, month = {2007}, pages = {231 - 236}, abstract = {Railway interlocking system is a safety critical system. Its failure can cause the loss of human life, severe injuries and loss of money. Therefore the complication of this type of system requires advanced methodologies, which provide complete security and quality of a system. One way of achieving this goal is by using formal methods, which are mathematically based languages, techniques and tools used for specifying and verifying such systems. This paper provides the control of trains in a sector of moving block interlocking system using the approach of promotion. The promotion is the approach used to link the local state with a global state in Z specifications. The control comprises three components, i.e. sector, trains and security of a train in a sector.}, keywords = {Formal specification, Predicate logic, Schema calculus, Z notation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949158690\&partnerID=40\&md5=9dfd5e28516c12ab2f9a5cfc8da8d3f9}, author = {Khan, S.A. and Zafar, N.A.} } @article {100, title = {Social search with missing data: Which ranking algorithm?}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {249 - 261}, abstract = {Online social networking tools are extremely popular, but can miss potential discoveries latent in the social {\textquoteright}fabric{\textquoteright}. Matchmaking services which can do naive profile matching with old database technology are too brittle in the absence of key data, and even modern ontological markup, though powerful, can be onerous at data-input time. In this paper, we present a system called BuddyFinder which can automatically identify buddies who can best match a user{\textquoteright}s search requirements specified in a term-based query, even in the absence of stored user-profiles. We deploy and compare five statistical measures, namely, our own CORDER, mutual information (MI), phi-squared, improved MI and Z score, and two TF/IDF based baseline methods to find online users who best match the search requirements based on {\textquoteright}inferred profiles{\textquoteright} of these users in the form of scavenged web pages. These measures identify statistically significant relationships between online users and a term-based query. Our user evaluation on two groups of users shows that BuddyFinder can find users highly relevant to search queries, and that CORDER achieved the best average ranking correlations among all seven algorithms and improved the performance of both baseline methods.}, keywords = {Instant messaging, Ranking algorithms, Relation discovery, Social software}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350629888\&partnerID=40\&md5=a263e560496728c004285a55b37a4e27}, author = {Zhu, J. and Eisenstadt, M. and Gon{\c c}alves, A. and Denham, C. and Uren, V. and Song, D.} } @article {89, title = {Storage and indexing of relational OLAP views with mixed categorical and continuous dimensions}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {180 - 190}, abstract = {Due to the widespread adoption of location-based services and other spatial applications, data warehouses that store spatial information are becoming increasingly prevalent. Consequently, it is becoming important to extend the standard OLAP paradigm with features that support spatial analysis and aggregation. While traditional OLAP systems are limited to data characterized by strictly categorical feature dimensions, Spatial OLAP systems must provide support for both categorical and spatial feature dimensions. Such spatial feature dimensions are typically represented by continuous data values. In this paper we propose a technique for representing and indexing relational OLAP views with mixed categorical and continuous data. Our method builds on top of an established mechanism for standard OLAP and exploits characteristic properties of space-filling curves. It allows us to effectively represent and index mixed categorical and continuous data, while dynamically adapting to changes in dimension cardinality during updates. We have implemented the proposed storage and indexing methods and evaluated their build, update, and query times using both synthetic and real datasets. Our experiments show that the proposed methods based on Hilbert curves of dynamic resolutions offers significant performance advantages especially for view updates.}, keywords = {Continuous space, Space-filling curves, Spatial OLAP, View indexing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949248100\&partnerID=40\&md5=a63605fb283d6f4f67f8f3aaa7a854be}, author = {Baltzer, O. and Rau-Chaplin, A. and Zeh, N.} } @article {96, title = {Unsupervised learning aided by clustering and local-global hierarchical analysis in knowledge exploration}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {237 - 246}, abstract = {Unsupervised learning plays an important role in the Knowlede exploration discovery. The basic task of unsupervised learning is to find latent variablesor relationships in a given dataset wihout any assumed regularities or patterns. In this paper we apply two advanced models, clustering analysis and hierarchial analysis to accomplish unsupervised learning. K-Means clustering presents its strength in large scale clustering. The original data can be pre-processed and the potential variables are targeted. Correlations among these variables are explored in the subsequent sets by Local Global Hierarchial Analysis (LGHA) assisted by three main steps. In the first step, we use a structural approach to find qualititative patterns from the given variables. Then, the second step applies a quantitative based algorithm to find quantitative patterns from those variables. The and last step generated global hybrid patterns by combining the local patterns obtained from the first two steps based on a certain criterion. Both of the K-Means and Local Global Hierarchial Analysis (LGHA) models are applied in experiments with real world longitutional medical datasets.}, keywords = {Hierarchical analysis, K-means clustering, Knowledge exploration, Unsupervised learning}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949188275\&partnerID=40\&md5=2448112a6f72451c391f1e75cc38eeed}, author = {Zhang, Y. and Orgun, M.A. and Lin, W.} } @article {29, title = {Automatic and flexible web services discovery in semantic web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {22 - 25}, abstract = {The main objective of the semantic web is to make the interoperation among web services or between users and web services more automated and flexible. The basic step toward the interoperation is that users or web services can discover their required web services. In this paper we present a practical application on Semantic Web and Web Services concepts where a flexible and automatic matching procedure in e-learning is shown. We illustrate how the requirements, web services and domain knowledge are described in machine-understandable forms to support the automatic and flexible discovery of web services. Then a matchmaking algorithm based on the semantic information is proposed. Finally the design and implementation of a prototype for the automatic discovery of web services is described.}, keywords = {Discovery, Elearning, Semantic web, Web service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748262446\&partnerID=40\&md5=f576cda3c55219ff4617a04d7dcb8d8f}, author = {Lu, L. and Chen, J. and Zhu, G.} } @article {61, title = {User interactions with multimedia repositories using natural language interfaces - OntoNL: An architectural framework and its implementation}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2006}, pages = {220 - 226}, abstract = {We present a generalized architectural framework for constructing and using natural language interfaces for interactions with multimedia repositories. The system allows the users to specify natural language queries about the multimedia content with rich semantics. It uses an extensive set of methodologies and tools for linguistic processing, and utilizes the MPEG-7 and the domain ontologies to reduce the ambiguities in the natural language and to rank the results. We describe the implementation of this framework for supporting interactions with a multimedia repository, described with the MPEG-7 MDS (Multimedia Description Schemes) structures, that also uses User Profile information for better ranking of the result queries.}, keywords = {MPEG 7, Natural language interface, Ontology, Semantics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845925229\&partnerID=40\&md5=78be53ce109a805416d2c49e78d10de5}, author = {Karanastasi, A. and Zotos, A. and Christodoulakis, S.} }