@article {778, title = {A Novel Algorithm for Generating pseudo Random Number-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {08/2020}, pages = {151-156}, type = {Research}, chapter = {151}, abstract = {

This paper proposes a pseudo random number generation algorithm based on cellular neural networks. It used the hyper-chaos characteristics of the cellular neural networks and sets the appropriate parameters to generate the pseudo random number. The experimental results show that, compared with other similar algorithms, this algorithm has the characteristics of simple operation, low complexity, large key space, and good randomness. It can meet the needs of secure communication and network information security, which has good application prospects.

}, doi = {https://doi.org/10.6025/jdim/2020/18/4/151-156}, url = {http://dline.info/fpaper/jdim/v18i4/jdimv18i4_3.pdf}, author = {Gangyi Hu and Weili Kou and Sumeth Yuenyong and Jian Qu} } @article {699, title = {A Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, pages = {246-257}, chapter = {246}, doi = {https://doi.org/10.6025/jdim/2018/5/246-257}, author = {Gangyi Hu and Sumeth Yuenyong and Jian Qu and Jian Rong and Weili Kou} } @article {819, title = {A Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2018}, month = {10/2018}, pages = {246-257}, type = {Research}, chapter = {246}, abstract = {

We propose an image encryption algorithm based on a 6-dimensional chaotic cellular neural network (CNN) that is robust to noise/missing pixels in the cipher image. We performed parameter search on the templates of the CNN in order to discover the parameters that leads to 6D chaotic evolution of the state, and then used the resulting chaotic sequence as the basis of encryption. The encryption process itself consists of shuffling the positions of image pixels based on the numerical value of the chaotic sequence; the second half of the encryption process consists of changing the shuffled image pixel values by performing XOR operation between the pixel values and the numerical value of the chaotic sequence. By using simple operations like sorting and XOR in the encryption process, the algorithm is robust to noise/ missing pixels in the cipher image. We illustrate this by comparing the robustness against 3 recently proposed chaos-based image encryption algorithms. The results show that our algorithm is competitive with the state-ofthe-art in term of encryption security, and superior in term of robustness.

}, doi = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_4.pdf}, url = {https://doi.org/10.6025/jdim/2018/16/5/246-257}, author = {Gangyi Hu and Sumeth Yuenyong and Jian Qu and Jian Rong, and Weili Kou} } @article {520, title = {Hot topic extraction and public opinion classification of tibetan texts}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {160 - 167}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982786667\&partnerID=40\&md5=65894d6a0354bc43e13d953109c62b93}, author = {Xu, G. and Qiu, L. and Peng, X.} } @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 {564, title = {Tibetan Word Sense Disambiguation Based on a Semantic knowledge Network Diagram}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {346 - 353}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959854282\&partnerID=40\&md5=6ebfa5c50654802f8807568584d3d3e6}, author = {Qiu, L. and Jiang, X. and Ling, R.} } @article {451, title = {Analysis of information management and scheduling technology in hadoop}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {133 - 138}, abstract = {Development of big data computing has brought many changes to society and social life is constantly digitized. {\textquoteright}How to handle vast amounts of data{\textquoteright} has become a more and more fashionable topic. Hadoop is a distributed computing software framework, which includes HDFS and MapReduce distributed computing method, make distributed processing huge amounts of data possible. Then job scheduler determines the efficiency of Hadoop clusters and user experience. Under the premise of familiar with the mechanism of Hadoop{\textquoteright}s running tasks, make a full analysis of the existing Hadoop task scheduling algorithm, such as FIFO-Scheduler, Capacity-Scheduler, FairShare-Scheduler and LATE-Scheduler, found that the existing scheduling algorithms do not perceive the performance of the computing node, so that it cannot assign different tasks depending on the machine performance in heterogeneous Hadoop cluster.}, keywords = {Cloud computing, Hadoop, Map Reduce, Task Scheduling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903118321\&partnerID=40\&md5=9c6201daf048bd5fc8d52c577eeb6126}, author = {Weihua, M. and Hong, Z. and Qianmu, L. and Bin, X.} } @article {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 {446, title = {A SEIR model epidemic of virus on the online social network}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {102 - 107}, abstract = {Vigorous development of computer technology has made computers play an integral role in people{\textquoteright}s lives, but at the same time propagation of the virus on a computer network also cost a great loss to the people. So the research on the mechanism of computer virus propagation and pointing out the key factors in the propagation of the virus has a significant influence on the prevention of computer virus and can also promote the development of relevant policies. The paper researched the influence of the user re-login frequency, the average number of friends on the user{\textquoteright}s friend list and the initial spread rate of the virus on the social networks during the epidemic of the propagation of the computer virus. By the means of mathematical analysis, an SEIR model to describe the epidemic of the virus on the online social network is established in this paper. The research shows that the re-login frequency of the user and the average friend number of the user would make a significant influence on the virus propagation. The two factors enhance the risk of a virus outbreak in the social network, at the same time.}, keywords = {Complex network, Computer virus, Epidemic spreading, Social Network, Social networks, Transmission factor, Virus propagation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903186303\&partnerID=40\&md5=6a9d4aa50e806dcc14698506b1e5b115}, author = {Min, Y. and Qianmu, L. and Yaoliang, S.} } @article {410, title = {The analysis of network structure model and innovation network characteristics for industrial cluster: Using complicated network perspective}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {277 - 283}, abstract = {

Industry cluster is a new feature under the background of globalization, informationization and integration. Along with the development of science and technology, the competition between industry clusters is gradually changed from the traditional cost competition into the innovation ability. The ability of innovation is not only concerned with single enterprise or institution{\textquoteright}s ablity but also concerned with the relationship built up by the enterprises in the industry cluster and the innovation environment around them. This article analyzed network structure and evolution of innovation networks on the basis of complicated network theory. According to the construction principle of complex network, we simulated the evolution process of innovation network structure of different types. And, we also analyzed the features and differences of two typical complex networks. The conclusion will provide suggestions for industry cluster to build up innovation system and upgrade the competition ability.

}, keywords = {Industry cluster, Innovation network, Network structure model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888314006\&partnerID=40\&md5=b983e8753037ff953c725592163f7847}, author = {Qi, W.} } @article {392, title = {The statistical analysis of family names of donators for wenchuan}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {235 - 239}, abstract = {It is analyzed that the family names of personal donators who donated through China Construction Bank Corporation to Chinese Red Cross Foundation for the WenChuan earthquake. The distribution of family names, the first 100 family names and their shares, the probability of the same family names as well as the Gini coefficient are all given in this paper. A heavy disproportion is showed in the distribution, that is to say a small part of family names occupy the absolutely large proportion while most of them are rare. This character is similar to power-law that has been observed in many demonstrations about family names. However, the Kolmogorov-Smirnov test fails to support the hypothesis. Instead, part of the data shows an exponential characteristic. As an innovative sampling method, the discussion may help to know the family name{\textquoteright}s distribution of China.}, keywords = {Distribution, Exponential, Powerlaw, The family name}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880773341\&partnerID=40\&md5=5ab1d739ad89b517599a75710dec963b}, author = {Yufan, L. and Qinghua, C.} } @article {320, title = {A comparison of pattern classification approaches for structural damage identification}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {126 - 130}, abstract = {A structural damage identification approach based on wavelet packet decomposition (WPD) and random forests (RF) was proposed and compared with other pattern classification approachs. The main procedure involves extracting energy features from vibration acceleration data through wavelet packet decomposition and then using these features as input for a RF classifier. The experiment was carried on an 8-storey steel shear building model in the case verification. The results show that the proposed method is effective for structure damage detection and can achieve a higher accuracy than other commonly used methods.}, keywords = {Extraction algorithms, Pattern matching, Sensor identificaiton, Wavelet packet decomposition}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866443034\&partnerID=40\&md5=17335eb07404e2de90828f9bb812e1da}, author = {Qingqing, Z. and Qifeng, Z. and Yongpeng, N. and Fan, Y. and Jiayan, L. and Run, T. and Minda, L.} } @article {321, title = {Exploration in to reform in computer application technology major in higher vocational colleges based on tripartite linkage}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {147 - 152}, abstract = {It has become an important subject to reform Computer Application Technology (CAT) major in higher vocational colleges against the backdrop of fierce competition. Firstly, this paper analyzes the prevailing problems in this major and their causes. Secondly, this paper proposes that reform in CAT major can only be realized based on the tripartite linkage of industry, enterprise and college. Thirdly, this paper further introduces the channel for major orientation, course system development and teaching staff building with the mechanism of tripartite linkage.}, keywords = {Computer application technology major, Course system development, Higher vocational education, Tripartite linkage}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866466981\&partnerID=40\&md5=a2ce9de57c2c14a652be2794a635c08d}, author = {Qiming, T.} } @article {352, title = {Swarm-robot system based on wireless sensor network}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2012}, pages = {277 - 283}, abstract = {The study about the swarm-robot system is one of the most important directions of multitudinous robots system. It is an extraordinary challenged issue which how to communicate with each swarm-robot to cooperate together to accomplish a mission in numerous units. The swarm-robot system, which is based on CC2510 wireless sensor network, with the Radio Frequency of FHSS as the communication mode, has realized the swarm-robot unit sensor organ information coordination alternately fleet that improving the stability, interference immunity and transferability. The coordinating scheme possesses availability and practicability has been proved.}, keywords = {CC2510, Coordination, FHSS, Swarm-robot}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870787456\&partnerID=40\&md5=1543551d520c6b04bd2a82a95ffe8283}, author = {Peng, J.-S. and Li, X. and Qin, Z.-Q. and Li, W.} } @article {326, title = {A taxonomic relationship learning approach for log ontology content event}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {109 - 113}, abstract = {To construct the log ontology is one of the main tasks of semantic Web usage mining. In order to discover the hierarchy of users{\textquoteright} visit interesting for web sites, we propose a taxonomic relationship learning approach for content events on log ontology. In this method, event is used to express the users{\textquoteright} visiting action, and content event is the semantic behavior of users{\textquoteright} visiting to the page content of sites. This method extracts the taxonomic relationship of content event by web document cluster based on swarm intelligence, which combines web content mining and web usage mining. This method improves the results of semantic Web usage mining and provides more decision-making for optimizing the structure of Web sites. The simulation experimental results show that this method is effective and quite feasible to solve practical problems.}, keywords = {Content event taxonomic relationship, Log ontology, Semantic web mining, Swarm intelligence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866440989\&partnerID=40\&md5=9e0960d7e083c77e4cd41cbb915068b6}, author = {Ming, S. and Qinghong, S. and Bo, C.} } @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 {250, title = {Towards building ranking models with annual reports}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {338 - 343}, abstract = {The textual content of company annual reports has proven to contain predictive indicators for the company future performance. This paper addresses the general re search question of evaluating the effectiveness of applying machine learning and text mining techniques to building predictive models with annual reports. More specifically, we focus on these two questions: 1) the feasibility of build ing ranking models with annual reports to rank future firm performance and 2) the effect of integrating meta seman tic features to help improve and support our prediction. We compare models built with different ranking algorithms and document models. We evaluate our models with a simulated portfolio. Our results show significantly positive average returns over 5 years with a power law trend as we increase the ranking threshold. Adding meta features to document model has shown to improve ranking performance. The SVR \& Meta-augemented model outperforms the others and pro vides potential for explaining the textual factors behind the prediction.}, keywords = {Annual reports, Documentation models, Information retrieval, Ranking models}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960663639\&partnerID=40\&md5=391fa47605e7e864c26988ad0b95ab63}, author = {Qiu, X.Y.} } @article {167, title = {A query answering surveillance system for detecting and tracking moving objects using bounding rectangles}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {15 - 20}, abstract = {In many computer vision applications such as surveillance systems, detecting moving objects is the first step of information extraction. This paper introduces a query answering system that aims at responding to user queries without the need to scan the whole video tape. the proposed system is based on finding the minimum boundary rectangles (MBRs) of moving objects which appear in the video. It detects moving objects in the video frame set, keeps track of those objects, and saves information to answer future queries.}, keywords = {Background subtraction, MBR, Object tracking, Rgb difference, Surveillance system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350676981\&partnerID=40\&md5=bf39ff54dd637a3f58625643a68ed65a}, author = {Sleit, A. and Almobaideen, W. and Qatawneh, M. and Barakat, A. and Saadeh, H.} } @article {97, title = {Anomaly detection through quasi-functional dependency analysis}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2007}, pages = {191 - 200}, abstract = {Anomaly detection problems have been investigated in several research areas such as database, machine learning, knowledge discovery, and logic programming, with the main goal of identifying objects of a given population whose behavior is anomalous with respect to a set of commonly accepted rules that are part of the knowledge base. In this paper we focus our attention on the analysis of anomaly detection in databases. We propose a method, based on data mining algorithms, which allows one to infer the "normal behavior" of objects, by extracting frequent "rules" from a given dataset. These rules are described in the form of quasi-functional dependencies and mined from the dataset by using association rules. Our approach allows us to consequently analyze anomalies with respect to the previously inferred dependencies: given a quasi-functional dependency, it is possible to discover the related anomalies by querying either the original database or the association rules previously stored. By further investigating the nature of such anomalies, we can either derive the presence of erroneous data or highlight novel information which represents significant exceptions of frequent rules. Our method is independent of the considered database and directly infers rules from the data. The applicability of the proposed approach is validated through a set of experiments on XML databases, whose results are here reported.}, keywords = {Anomaly detection, Association rules, Data mining, Qausi-functional dependencies}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949112157\&partnerID=40\&md5=cdbe91548ea650327ae0cdf87c4cf97f}, author = {Bruno, G. and Garza, P. and Quintarelli, E. and Rossato, R.} } @article {92, title = {Robust self embedding watermarking technique in the DWT domain for digital colored images}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {211 - 219}, abstract = {In this work, a robust watermarking algorithm is proposed for colored digital images. The 24 bits/pixel RGB images are converted to YCbCr color format, and the Y part is converted to Discrete Wavelet Transform (DWT). The resulted LL part is resized to the original size of the host image and its blocks are scrambled using certain key. The watermark is another copy of the LL part and its pixels are, also, scrambled and each pixel is embedded in one of the scrambled blocks of the LL part. The algorithm takes into account the Human Visual System via relating the embedding process to the intensity of each block of the host image. We have used the average PSNR as a quality measure for the embedding stage. In all our experiments we got more than 68 dB which satisfies the PSNR bench mark. Also we got an average value of 0.15 for MAE, which is the robustness measure. This means that our algorithm is very robust and the watermark is still recognizable.}, keywords = {Copyright, Digital images, Embedding, Robustness, Scrambling, Watermaking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949187327\&partnerID=40\&md5=d8e2ad97422a0852424c209b57cc93ff}, author = {Al-Tahan Al-Nu{\textquoteright}aimi, A. and Qahwaji, R.} }