@article {759, title = {Impact of Digital Leadership on Kuwaiti hospitals{\textquoteright} Employees{\textquoteright} Performance-}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {09/2022}, pages = {104-110}, type = {Research}, chapter = {104}, abstract = {

\ The study aimed to identify the Impact of Digital Leadership on Kuwaiti hospitals{\textquoteright} employees{\textquoteright} performance using a descriptive and analytical methodology. According to statistics from the Kuwaiti Ministry of Health, the study population consists of administrators in Kuwaiti hospitals, numbering 12006. A simple random sample commensurate with the study{\textquoteright}s objectives was drawn, numbering 372 administrators to distribute the study questionnaire to them, and 277 valid questionnaires were retrieved for analysis. It was also found that there is a statistically significant impact at the significance level (a=0.05) of digital leadership with its dimensions (innovation, persuasion, and knowledge) on Kuwaiti hospitals{\textquoteright} employees{\textquoteright} performance. The researchers recommended that it is essential to strengthening the factors that lead to enhancing the concept of digital leadership under its crucial elements in the work environment. as well as paying attention to the priorities of the impact of the digital leadership elements on the performance of employees to obtain a practical effect.

}, doi = {https://doi.org/10.6025/jdim/2022/20/3/104-110}, url = {http://www.dline.info/download.php?sn=3568}, author = {Esraa Omran and Salah Al Sharhan and Tyrone Grandison} } @article {773, title = { Formation Mechanism of Knowledge Stickiness in the Collaborative Innovation of Industry{\textendash}University{\textendash}Research-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {173-183}, type = {Research}, chapter = {173}, abstract = {

\ Purpose In the context of deepening the cooperation of Industry{\^a}{\texteuro}{\textquotedblleft}University{\^a}{\texteuro}{\textquotedblleft}Research (IUR), enterprises must gain competitive advantage by transferring external knowledge to the enterprise for knowledge appreciation. On the basis of the knowledge stickiness encountered in the process of knowledge transfer in the collaborative innovation of IUR, the formation process and causes of knowledge stickiness are analyzed. Design/methodology/approach In this study, the knowledge flow model based on heat conduction theory was proposed. The dynamic simulation was carried out using MATLAB software. The knowledge flow and evolution process in IUR were analyzed from the macro level, whereas the role and influence of various factors in knowledge stickiness was analyzed from the micro level. Finally, the preliminary mechanism of knowledge management (sharing and transfer) between IUR was established. Findings Results show that: the process of knowledge transfer between IUR is the process of continuously realizing knowledge increment and knowledge creation, and the process of knowledge evolution between IUR is a process that the Industry, the University and the Research approach continuously; and knowledge stickiness has a direct impact on the efficiency of knowledge transfer. Strengthening the cognition between IUR, increasing the number of activities between IUR, and creating a collaborative innovation atmosphere between IUR will reduce knowledge stickiness and improve the efficiency of knowledge transfer. Originality/value: Knowledge stickiness is classified from the perspective of {\^a}{\texteuro}{\oe}Situation{\^a}{\texteuro}{\textquotedblleft}Action{\^a}{\texteuro}{\textquotedblleft}Cognition{\^a}{\texteuro} (S{\^a}{\texteuro}{\textquotedblleft} A{\^a}{\texteuro}{\textquotedblleft}C) and the generation process of knowledge stickiness in knowledge transfer is explored by using heat conduction theory, which makes a positive contribution to the exploration of the internal mechanism and transfer path of knowledge stickiness.

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/173-183}, url = {http://www.dline.info/download.php?sn=3104}, author = {Zhang Feng, and Liu Guoxin} } @article {630, title = {Are Two Emotion States Distinguishable From Each Other? An Alternative Study}, journal = {Signals and Telecommunication Journal}, volume = {7}, year = {2018}, month = {03/2018}, pages = {1-7}, type = {Research}, author = {Anilesh Dey and Purnendu B. Acharjee and Tanushrre Ghosh and Pompy R Gogoi} } @article {680, title = {Design and Development of IoT enabled Multi Robot System for Search and Rescue Mission}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {06/2018}, pages = {51-63}, type = {Research}, author = {Rajesh Singh and Rohit Samkaria and Anita Gehlot and Sushabhan Choudhary} } @article {672, title = {Dimensions of Changeability of Futuristic Organizations: Need of Organizations in Change Environment}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {06/2018}, pages = {51-62}, type = {Research}, author = {Najme Jalalian and Masoud Gramipour} } @article {661, title = {Health Care Monitoring Using Wifi Through Mobile Devices}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {02/2018}, pages = {18-25}, type = {Research}, author = {Krishna Chaitanya Gogineni and Lakshmi Soundharya Uppuluri} } @article {674, title = {New Ideas for Applying Ant Colony Optimization to the Protein Function}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {06/2018}, pages = {74-81}, type = {Research}, author = {Mohana Prabha. G and Chitra. S} } @article {654, title = {Query Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {85-98}, type = {Research}, author = {ThayyabaKhatoon MD and A. Govardhan} } @article {832, title = {Query Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval {\textendash}}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {86-98}, type = {Research}, chapter = {85}, abstract = {

The aim of this paper is to improve the search query performance of the biomedical literature by expanding the queries with most significant terms. Methods: In this article, an enhanced BM25 mathematical approach is proposed to retrieve the most query relevant literature from clustered Biomedical literature bank with query expansion from MeSH. The clustered biomedical topics are analyzed with different pre-processing methods and term-weighting functions and found the best values for the tuning parameters K1, b, K3 and the right combination of pre-processing and term weighting functions for improving the query performance in terms of Average Precision, Mean Average Precision and R-precision. Novelty/Improvements: In this approach, the existing best match retrieval technique is normalized with the calibrate constants K1 = 1.3, b = 0.75, K3 = 1.2 and the significant terms are identified with comparison of MeSH for query expansion. The retrieval performance is improved in terms of Mean Average Precision and R-precision

}, url = {http://dline.info/fpaper/jdim/v16i2/jdimv16i2_4.pdf}, author = {ThayyabaKhatoon MD and A. Govardhan} } @article {643, title = {Rain Water Harvesting Basic Need of Present Urban Sector {\textendash} Use of Digital Technology for Rain Water Harvesting}, journal = {Transactions on Machine Design}, volume = {6}, year = {2018}, month = {02/2018}, pages = {21-25}, type = {Research}, author = {Anil Gaikwad} } @article {619, title = {Stock Price Prediction Using Multilayer Perceptron Neural Network by Monitoring Frog Leaping Algorithm}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {3/2018}, pages = {15-23}, url = {http://www.dline.info/jic/fulltext/v9n1/jicv9n1_2.pdf}, author = {Ahdieh Rahimi Garakani} } @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 {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 {483, title = {Temporal JSON schema versioning in the TJSchema framework}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {179 - 202}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026631105\&partnerID=40\&md5=857d828ea22094d110f2391a970dc431}, author = {Brahmia, S. and Brahmia, Z. and Grandi, F. and Bouaziz, R.} } @article {507, title = {A cloud-assisted architecture for content distribution in mobile peer to peer networks}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {403 - 412}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010972068\&partnerID=40\&md5=478dd69ec164325e2daff594a03ec7d0}, author = {Liu, Y.-N. and Chen, H.-Y. and Gilani, S.M.M.} } @article {533, title = {An improved SMOTE algorithm based on genetic algorithm for imbalanced data classification}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {92 - 103}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974814392\&partnerID=40\&md5=8541ce719ff30daad12313b47f996454}, author = {Gu, Q. and Wang, X.-M. and Wu, Z. and Ning, B. and Xin, C.-S.} } @article {545, title = {A systematic approach for changing XML namespaces in XML schemas and managing their effects on associated XML documents under schema versioning}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {275 - 289}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006957183\&partnerID=40\&md5=86f720e96986f3731d3e5138d1ad8ff9}, author = {Brahmia, Z. and Grandi, F. and Bouaziz, R.} } @article {563, title = {Application of Word Embeddings in Biomedical Named Entity Recognition Tasks}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :3Export Date: 22 February 2018}, month = {2015}, pages = {321 - 327}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857144\&partnerID=40\&md5=efd3cf470dbf495aa4ca4561b2af31b8}, author = {Chang, F.X. and Guo, J. and Xu, W.R. and Chung, S.R.} } @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 {585, title = {A feature selection method to handle imbalanced data in text classification}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {169 - 175}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938570184\&partnerID=40\&md5=ae4937f9352d817db15e4e6609735561}, author = {Chang, F. and Guo, J. and Xu, W. and Yao, K.} } @article {599, title = {Implementation and evaluation of division-based broadcasting system for webcast}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :4Export Date: 22 February 2018}, month = {2015}, pages = {234 - 246}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942508437\&partnerID=40\&md5=36e8b45c02dd6dc84df523639afa8527}, author = {Gotoh, Y. and Kimura, A.} } @article {594, title = {A new recognition approach for logical link blocks in webpages}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {76 - 85}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930396310\&partnerID=40\&md5=4d563f444bd172f8c11110f370212a2a}, author = {Wang, X.M. and Wu, Z.D. and Huang, Y.N. and Gu, Q.} } @article {565, title = {Recognizing Discrepant Traffic Data Based on Least Square Support Vector Machine}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {381 - 384}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959856888\&partnerID=40\&md5=7cb3fbd419b2490aba4f5c026628003f}, author = {Yao, C. and Gu, J.} } @article {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 {419, title = {Investigating a new design pattern for efficient implementation of prediction algorithms}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {366 - 377}, abstract = {In our previously published researches we used different prediction algorithms to solve several problems in computer architecture and ubiquitous computing. During the time, we observed what is common among different solutions and also what can differentiate these solutions. Therefore, due to our experience in designing predictors, we are able now to propose a simple and efficient general solution for any problem that implies prediction. Since prediction is a widely used technique in many fields, our proposed design pattern can be very useful for software developers.}, keywords = {Design patterns, Markov Chain, Multi-layer perceptron, Predictor, Reusable object-oriented software}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890511699\&partnerID=40\&md5=d755a7c4e09429fec9144a9ed21aa353}, author = {Gellert, A. and Florea, A.} } @article {418, title = {Orchestrating the natural language processing software in the cloud computing environment}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {396 - 399}, abstract = {The most of natural language processing problems are data-intensive. An important step in the distributed orchestration of natural language processing software is a rational choice of the specific middleware. The middleware should solve the presented problem with minimal deployment, support and usage costs. It is necessary to run and use that software in the distributed cloud computing environment to achieve such advantages such as consolidation, isolation, and efficient use of the existent infrastructure. It is often impossible to modify the existent natural language processing software to integrate it into the cloud computing environment because of licensing or organizational issues. This paper studies various popular distributed data processing tools and evaluates the selected natural language processing tools on a relatively large document collection in distributed way using the Gearman framework. The document collection is a 10{\textquoteright}000 sentences from the Russian news subcorpus of the Leipzig corpora. The benchmarks are presented and discussed.}, keywords = {Cloud computing, Data-intensive computing, Distributed computing, Natural Language Processing, Service orchestration}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890443570\&partnerID=40\&md5=80168707d25eb1e8a3acabfb35fdf93f}, author = {Ustalov, D. and Goldshtein, M.} } @article {370, title = {Research on factors affecting farmers{\textquoteright} network information consumption}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {33 - 38}, abstract = {Research on farmers{\textquoteright} network information consumption behavior is an important issue, which cannot be avoided in Chinese rural informatization construction. Logit model is used to research the factors affecting farmers{\textquoteright} network information consumption, and the conclusions are as follows: 1) there are a number of factors affecting farmers{\textquoteright} consumption by using modern network information media; 2) environmental characteristics is the main factor affecting farmers{\textquoteright} information consumption via modern network information; 3) younger farmers more often use modern network information media; 4) farmers have a clear purpose by using modern network information media in information consumption, that is, to gain benefits by the use of information. The conclusions of this study will provide a reference for the government to solve the problem in the current informatization construction.}, keywords = {Consumption behavior, Farmers, Information consumption, Network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879070031\&partnerID=40\&md5=afb20649e0143ffa20b16c6c7f385bb8}, author = {Meng, H. and Ge, X. and Xie, M.} } @article {315, title = {A feature points matching algorithm based on wavelet analysis}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {94 - 98}, abstract = {In this paper, we present an application of wavelet analysis on feature points matching. Wavelet coefficients which produced by wavelet transform can best display part character of the image. Through the new feature description and feature matching method, we can build a feature point database for each image and improve the efficiency of feature points matching. The experimental results show that this method is practicability, feasibility, good precision and fast speed.}, keywords = {Coefficients, Feature points matching, Wavelet analysis, Weighted statistics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866439147\&partnerID=40\&md5=94422ee81166dc1c5a0b1ffc243d1686}, author = {Lijun, W. and Xin, X. and Guang, X.} } @article {355, title = {Investigating factors influencing non-use and abandonment of microblogging services}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {421 - 429}, abstract = {This study explores the reason for non-usage and abandonment of microblogging. While previous studies mainly focused on individual behaviors associated with the use of social media, this research identifies why people do not use, or terminate their microblogging accounts. Studying the reasons for non-usage and abandonment is important as it helps organizations devise strategies to counteract this behavior by addressing nonusers{\textquoteright} concerns. First, focus group interviews were conducted to uncover non-usage reasons. The elicited reasons were then used to construct a survey instrument and administered. Our results suggests that preference for other technologies, privacy concern and time constraints are the top three reasons contributing to the non-use and abandonment of microblogging accounts. The paper also proposes potential improvements to microblogs to attract more users.}, keywords = {Abandonment, Focus Group, Microblogging, Non-use, Social media, Social networks, Survey}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874905735\&partnerID=40\&md5=087e167bd1bd9f4c37ad9988561e5f69}, author = {Guo, Y. and Goh, D.H.-L. and Ilangovan, K. and Jiao, S. and Yang, X.} } @article {310, title = {Playing games with information: Investigating perceptions of a mobile content sharing game}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {10 - 19}, abstract = {We introduce Indagator (Latin for explorer), an application which incorporates multiplayer, pervasive gaming elements into mobile content sharing. Indagator allows users to annotate real world locations with multimedia content, and concurrently, provides opportunities for play through engaging interactive game elements. A study of Indagator was conducted to obtain usability feedback, and to examine the impact of the usability of its content sharing and gaming features on participants{\textquoteright} intention to use it. Participants used the software to complete a set of tasks and subsequently completed a questionnaire and attended an interview, both of which were to elicit their opinions on the usability of the system. Participants felt that the features in Indagator were able to support the objectives of content sharing and gaming, and that idea of gaming could be a motivator for content sharing. In terms of intention to use, usability of Indagator{\textquoteright}s gaming features emerged as significant predictors.}, keywords = {Mobile Content Sharing Game, Social Computing, Usability, User Evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84863281265\&partnerID=40\&md5=41c91a3b7957ec0b637c641bf9ba9a6e}, author = {Goh, D.H.-L. and Lee, C.S. and Chua, A.Y.K.} } @article {311, title = {Research and analysis of improved extraction based on information processing technology}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {142 - 146}, abstract = {This paper analyzes the problem of research topics. The key words are extracted from the academic papers published in the key journals based on information processing technology, and these words have the cooccurrence relationship between clustered. Research topics in the academic field analysis applications, researchers can provide a clear outline; in the information retrieval process, you can help clarify the information needs. We will apply the proposed method to ROCLING seminar papers on the data to extract the important field of computational linguistics research topics. The results show that this method can be applied to the special circumstances of domestic academic field, while taking out the key words in English and Chinese. the word has been said that the field of cluster results can also be an important research topic. These results in a preliminary validation of the method proposed in this paper the feasibility. It can also be found that application of computational linguistics research and practice are closely related, taking out many of the words in the cluster and machine translation, speech processing and information retrieval related to the calculation model in the language, grammar patterns and analysis, broken words and statistical language model type is the calculation is the subject of interest to linguists.}, keywords = {Analysis, Natural language, Seminar}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866466102\&partnerID=40\&md5=408ac5cc2bfbffd4fed15d3005d825c2}, author = {Wei, Y. and Guo, Y.} } @article {331, title = {A strategic search method for requirement-aware functional-block selection and composition in a flexible network}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {194 - 201}, abstract = {Internet applications have reached such a high complexity that the network stack concept introduced decades ago is not suitable anymore. Future Internet research activities try to increase the flexibility of the Internet in order to allow the network to adapt to present and future requirements and applications. A well known approach is to build protocol graphs, which will be used instead of inflexible network stacks, by connecting functional blocks together. A functional block encapsulates a particular network function. The protocol graph that should be used is the one most suitable to the application{\textquoteright}s requirements. To find the most suitable graph, all possible protocol graphs must be evaluated. However, the number of possible protocol graphs increases exponentially as the number of functional blocks increases. This article presents a method of modeling the protocol graph search space as a set of search trees and then using search strategies to manage the inherent complexity of the search process. We evaluate our proposed method by simulation.}, keywords = {Complexity, Composition, Flexible networks, Future internet, Protocol graph, Selection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463034\&partnerID=40\&md5=b30673b530b454aa1a7fead4a7f771ad}, author = {G{\"u}nther, D. and Kerr, N. and M{\"u}ller, P.} } @article {261, title = {Application of Esscher transformed Laplace distribution in Web server data}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {19 - 26}, abstract = {In this article, we introduce an alternative distribution, namely Esscher transformed Laplace distribution good enough to model the fle size distribution of Web servers. It exhibits asymmetry, peakedness and tail heaviness, which are common features of fle size data. Esscher transformed Laplace distribution belongs to one parameter regular exponential family. We derive their representations and obtain explicit forms for their densities, distribution functions and quantile functions. Also the probability R = P(X > Y) and an asymptotic confdence interval for R, when X and Y are two independent but not identically distributed Esscher transformed Laplace variables are estimated and its application in the service performance of a Web server is discussed. Extensive simulation studies are carried out to study the performance of these estimators. Finally using real data, we established the goodness of ft of the proposed distribution to the fle size distribution of a Web server data.}, keywords = {Asymptotic confdence interval, Esscher transformation, Esscher transformed Laplace distribution, File size distribution, Heavy tail distribution}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960684244\&partnerID=40\&md5=df49fdec131cd1ab8f2b958022b553e6}, author = {George, D. and George, 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 {281, title = {B-mail: A brain-controlled mail client}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {167 - 170}, abstract = {For centuries, humans fantasized about the idea of controlling objects only by thoughts. In the last decade, this idea has shifted from fantasy or science fiction to reality. Brain Computer Interfaces (BCI) have made this a reality. A BCI is a communication channel between the brain and a computer program or application. It allows the development of new applications that provide assistance to people with disabilities in regular everyday activities, making them accessible and easy to perform. We present in this paper a simple yet efficient email client which enables severely motor-disabled people to open, compose, send, reply and forward emails. It performs a real-time classification of user{\textquoteright}s brain activity signals using the P300 technique and performs the appropriate corresponding actions.}, keywords = {Assistive technology, Brain computer interface, Mail client, P300-Technique, People with disabilities}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053115577\&partnerID=40\&md5=a1ba320d72ea04d8618894cb42e306fb}, author = {Gannouni, S. and Alrayes, N. and Alsaudi, A.A.A. and Alabdulkareem, A.} } @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 {262, title = {Enhanced learning and educational management through online collaborative technologies}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {33 - 42}, abstract = {Merging traditional ways of teaching with modern approaches as e-Learning, focused on online multimedia applications and technologies, developed in a collaborative manner, became a real necessity in order to enhance learning and educational management. In this paper we introduce our developed Education Management Tool (EDM), a visual, interactive and collaborative e-Learning solution, dedicated for optimizing the teaching, learning and testing processes in different Computer Science topics but also in any other scientifc feld. EDM allows geographically distributed students to contribute concurrently and collaboratively by working on the same application: designing, programming, debugging, testing and documenting. Besides that, EDM is free, easy to use, and helps to improve quality and performance in e-Learning, providing fexibility, extensibility and interactivity. The EDM Learning module allows defning lessons that consists of text-descriptions and media fles such as images, fash movies or video clips. We illustrate how third-party lessons can be integrated into EDM by presenting our interactive fash applications about digital logic circuits and algorithms, two fundamental topics of Computer Science. One of the latest development achievements consists in a Management module, with proper administration of marks, averages, lessons and student{\textquoteright}s presence at courses and laboratories, which allows generating, printing and exporting reports. Another issue, extremely necessary during collaborative writing and programming, is versioning, a mechanism which allows recovering any of the last ten versions of lessons or source codes.}, keywords = {Algorithms, Collaborative technologies, Digital logic circuits, e-Learning, Education Management Tool, Web applications}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960666591\&partnerID=40\&md5=5b162b4c94771ec8eac487c8670056dc}, author = {Florea, A. and Gellert, A. and Anghel, T. and Florea, D.} } @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 {298, title = {Fusion user browsing behavior and user interests autonomous control of personalized search results sort}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {271 - 275}, abstract = {Reference simplifies the ODP concept, establish a user hierarchical structure can be controlled autonomously interest preference expression of use interests model. Meanwhile, from the user{\textquoteright}s browsing behavior can reflect the user{\textquoteright}s interest in starting, this paper analyzes the relationship between the user{\textquoteright}s browsing behavior and user interest. Considering both the times of page visiting and the browsing speed for the degree of use interest, as well as the similarity of the page keywords and a single user interest point, the index can be obtained for evaluating whether a page meets the user interest preference. Utilizing it as search results of evaluation indexes, search results sorting. Further analysis under different integrity of user interests of description and different results processing under the way of sorting effect, through individual apiration is decided according to user{\textquoteright}spersonal interest in server-side describe file integrity of, will be willing to disclosure of personal information stored in the search engine server in order to improve the quality of the search results, sensitive personal information retained in local client, reach users privacy protection effect.}, keywords = {Degree of User Interest, Personalized Search, Privacy protection, Sort Search Results, User Interest Model, User{\textquoteright}s Browsing Behaviors}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855413177\&partnerID=40\&md5=42962ce43dcfb6f7b617b32ec5cecdcd}, author = {Li, J. and Wang, H. and Guo, Y.} } @article {227, title = {A dynamic load distribution algorithm for virtual worlds}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {181 - 189}, abstract = {The introduction of modern communication and computation technologies has greatly changed the traditional approaches processing computationally intensive applications such as Virtual Environments (VEs). Distributed and multi-server architectures are scalable and exploit the concepts of spatial and temporal locality for handling massive Distributed VEs (DVEs). However, using these environments require special attention for scalability, consistency, load balancing, and latency. The existing mechanisms primarily developed for games have key performance issues in managing large scale virtual worlds. In our previous work (Farooq and Glauert, 2009a), we have proposed a hierarchical infrastructure named JoHNUM for the development of scalable and consistent virtual worlds. Further, we have introduced the concept of aggregate region assignment to minimise resource utilisation and distribute the load as balanced as possible among servers (Farooq and Glauert, 2009a, 2009b). This paper presents our proposed load distribution algorithm that yields regular and contiguous areas for assignment. It examines possible combinations of regions based on proposed strategies but greatly reduces the aggregation process by using different filters. It also presents a simple communication model justifying the proposed strategies and load distribution algorithm. Simulation results with an extended set of experiments show that the proposed algorithm obtains fair distribution of load and has the capability to cope with small, medium and large scale environments while minimising communication and implementation cost.}, keywords = {Consistency, Load balancing, Scalability, Second life, Virtual Environment, Virtual world}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960667976\&partnerID=40\&md5=0447704980b109c746d050be6818c613}, author = {Farooq, U. and Glauert, J.} } @article {224, title = {Editorial preface: Special issue on context-aware and mobile multimedia databases and services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {2 - 3}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089\&partnerID=40\&md5=7b82f006c7ffa103ca31e784f7cd8bf8}, author = {Grigoras, R. and Charvillat, V. and Chbeir, R. and Kosch, H. and Bailer, W. and Boll, S. and Brunie, L. and Cao, Y. and Delgado, J. and Granitzer, M. and Hausenblas, M. and Eidenberger, H. and Klamma, R. and Lux, M. and Marques, O. and Oria, V. and Plesca, C. and Pr{\'e}teux, F. and Sedes, F. and Spaniol, M. and Ternier, S. and Wolpers, M.} } @article {214, title = {Evaluation of multimedia features in mobile guide applications}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {28 - 36}, abstract = {Mobile guide applications are among the most used applications in Today{\textquoteright}s smartphones. These applications provide position information, map, directory services as well as guidance. Still there are many multimedia features that could be added to these applications. We present a user study on such applications, comparing the commercial Google Maps and Nokia Maps with two prototypes that we have created to expose missing multimedia features in the commercial applications. We have evaluated the applications with real users and we have obtained direct feedback via questionnaires as well as implicit feedback using an observer framework.}, keywords = {Mobile Applications, Multimedia applications, User Evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958074631\&partnerID=40\&md5=11c8aa34465d113aadb7a6cfe58a3b3b}, author = {Choudary, O. and Baccot, B. and Grigoras, R. and Charvillat, V.} } @article {210, title = {A MPEG-based architecture for generic distributed multimedia scenarios}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {47 - 53}, abstract = {This paper presents a standards-based architecture for a complex and generic distributed multimedia scenario, which combines content search and retrieval, DRM, and context-based content adaptation together. It is an innovative and totally generic approach trying to narrow the semantic-gap by integrating a fl exible language for multimedia search based on MPEG Query Format (MPQF) standard with the application of video analysis algorithms for the automatic extraction of low level features and with the use of contextual information.}, keywords = {Context-based adaptation, Digital Rights Management-Rights Expression Language, Features extraction, MPEG query format}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958070468\&partnerID=40\&md5=fccf7895a6f9802b4adb6febe511be2f}, author = {Carreras, A. and Tous, R. and Rodr{\'\i}guez, E. and Delgado, J. and Cordara, G. and Francini, G. and Gibellino, D.} } @article {235, title = {Multi-objective optimization in service systems}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {254 - 259}, abstract = {Muti-objective optimization deals with the simultaneous optimization of two or more conficting objective functions in real-life systems. This paper deals with the multi-objective optimization in service systems. The goal of service systems is to provide cost-efficient service to customers, while at the same time, reducing the customer waiting time for service. In general, a low cost in system operation leads to longer waiting times, while a higher cost in system operation leads to shorter waiting times. The two objectives - service cost (operational cost) and waiting time (customer satisfaction) are, therefore, conficting in nature. We use the novel Multi-Objective Particle Swarm Optimization (MOPSO) algorithm to optimize the two conficting objective functions simultaneously. MOPSO is a fairly recent swarm intelligence meta-heuristic algorithm known for its simplicity in programming and its rapid convergence. The multi-objective optimization procedure is illustrated with the example of a practical service system. MOPSO produces a family of well-spread Pareto fronts for the two objective functions in the practical service system.}, keywords = {Multi-Objective Particle Swarm Optimization, Service cost, Service systems, Simulation optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960666260\&partnerID=40\&md5=6941ee36882d582a6672bdc8a5f37555}, author = {Gonsalves, T. and Yamagishi, K. and Itoh, K.} } @article {232, title = {Performance evaluation of fixed and mobile relay in WiMAX system}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {190 - 195}, abstract = {Future wireless communication systems are expected to provide more stable and higher data rate transmissions in the whole network. WiMAX is one of the technologies to cover diverse geographic regions. WiMAX covers the high dense urban areas and provide access over large geographic regions in remote rural area. However, in both scenarios it is challenging to cover the entire service area. In both cases relays are foreseen to extend the range of the BS and to increase the system throughput allowing for a cost-efficient deployment and service. As multi-hop/relay has complex interactions between the routing and medium access control decisions, the extent to which analytical expressions can be used to explore its benefits are limited. Consequently simulations tend to be the preferred way of assessing the performance of relays. In this paper, we explain, how to deploy fixed-relay and mobile relay by using computer simulation in WiMAX system and we consistently observed that the throughput is increased and the outage is decreased in the relay-augmented WiMAX network, which is converted to range extension without any capacity penalty, for the realistic range of values of the propagation and other system parameters investigated.}, keywords = {Coverage area, Fixed relay, Throughput, WiMAX}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960663765\&partnerID=40\&md5=08f3181dd0a1828512060fb801f8eadc}, author = {Mumtaz, S. and Tu, L.T. and Sadeghi, R. and Gameiro, A.} } @article {222, title = {V-isoNet: A virtualised and isolated network using open source technologies}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {95 - 100}, abstract = {Computer Security and Forensics is an emerging academic discipline in which there are many challenges facing educational institutions in teaching, from both an educational and technical perspective. The School of Computing in Dublin Institute of Technology offers two Security and Forensic Computing modules, a 4th year BSc (Hons) module and an MSc module. Currently the BSc module requires a practical section to the course while the MSc module does not require practical work. In order to aid teaching during the next semester, both sets of students will be exposed to a Security and Forensics practical laboratory. This series of research proposes a phased approach to design and establish a suitable overall environment to provide a comprehensive Computer Security and Forensics practical laboratory. The three identifiable components are (1) an isolated networked environment, (2) an exposed repository to be used to demonstrate vulnerabilities and (3) the formation of a Security and Forensics toolkit to be used in conjunction with the isolated network environment and the exposed repository. This first paper, in a series of three, will introduce the reader to the overall research objective. It will then focus on research and development of the first identified component, namely an isolated network environment.}, keywords = {Education, Forensics, Isolated, Network, Open source, Security, Virtualization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960692758\&partnerID=40\&md5=67245f8ace4f0dc027e9fdd56f9771d2}, author = {Gleeson, M. and Markey, D. and Mtenzi, F.} } @article {182, title = {About the reusable software remote laboratories have in common}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {166 - 172}, abstract = {In this paper, we present a new device brought online thanks to our Collaborative Remote Laboratories framework. Whereas previous devices integrated in our remote laboratory belongs to the domain of electronics, such as Vector Network Analyzers, the device at the concern in this paper is an antenna workbench. Because the middleware and framework for our environment were designed to be reusable, we wanted to illustrate these qualities by providing a completely new device in our Online Engineering catalog. After presenting the device to be put online, we will expose the software development efforts required in regards to the reusability of the solution.}, keywords = {Interoperability, Middleware, Online laboratories, Ontologies, Remote laboratories, Remote systems}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249142470\&partnerID=40\&md5=639fc7fb80ea23878b67430f914497fe}, author = {Gravier, C. and Fayolle, J. and Lardon, J. and Bayard, B.} } @article {201, title = {Addressing the challenge of managing large-scale digital multimedia libraries}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {261 - 269}, abstract = {Traditional Digital Libraries require human editorial control over the lifecycles of digital objects contained therein. This imposes an inherent (human) overhead on the maintenance of these digital libraries, which becomes unwieldy once the number of important information units in the digital library becomes too large. A revised framework is needed for digital libraries that takes the onus off the editor and allows the digital library to directly control digital object lifecycles, by employing a set of transformation rules that operate directly on the digital objects themselves. In this paper we motivate and describe a revised digital library framework that utilises transformation rules to automatically optimise system resources. We evaluate this library in three scenarios and also outline how we could apply concepts from this revised framework to address other challenges for digital libraries and digital information access in general.}, keywords = {Design, Digital objects, Experimentation, Human factors, Video objects}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953277044\&partnerID=40\&md5=75419cab710ca0152f89b3a277933c71}, author = {Gurrin, C. and Aarflot, T. and Sav, S. and Johansen, D.} } @article {166, title = {Design and development of a Query Graph Visualization system}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {21 - 29}, abstract = {Collaborative querying is a technique that harnesses the collective search experiences of users to assist in query formulation. We present the Query Graph Visualizer (QGV), a visual collaborative querying system that recommends related queries to a user{\textquoteright}s submitted query through a network visualization scheme. Users are able to explore the query network and select queries for execution on an information retrieval (IR) system. the QGV is not meant to be a replacement for IR systems but as a value-added module to help users search more effectively. Consequently, the QGV is not an IR system but works in tandem with existing IR systems. the design of the QGV is discussed, focusing on its architecture, the interaction between the QGV{\textquoteright}s main components and the implementation of the user interface. An evaluation of the QGV was also conducted to assess the performance of the system against to a conventional search engine. Results indicate that the evaluators who used the QGV completed their tasks much faster compared to those using a search engine alone. A usability evaluation also showed that the system complied with standard user interface heuristics.}, keywords = {Collaborative querying, Information retrieval, Query Graph Visualize, Query network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350660828\&partnerID=40\&md5=33ccaf28cf0dad32e0b47d01f84a8707}, author = {Goh, D.H.-L. and Lee, C.S. and Chua, A.Y.K. and Luyt, B.} } @article {175, title = {Distributed Web 2.0 crawling for ontology evolution}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {114 - 119}, abstract = {The World Wide Web as a social network reflects changes of interest in certain domains. It has been shown that free online content available through blogs, wikis, news media and online forums is a valuable source of information to identify trends in certain domains. Utilizing this data, one can construct ontologies that describe this information and provide a semantically correct overview of a domain. Tracked over time this also enables a user to identify trends and hypes. The decentralised structure of the Internet, the huge amount of data and upcoming Web2.0 technologies pose several challenges to a crawling system for ontology learning, evolution and trend analysis. This paper presents a distributed crawling system with browser integration for Web2.0. The proposed crawler is a high performance Web data retrieval system aimed to gather browser-equivalent textual Web content and prepare it for ontology learning.}, keywords = {Distributed crawling, Executed crawling, Ontology evolution, Ontology learning, Web 2.0 crawling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350630600\&partnerID=40\&md5=7b88c38575eca72b620a0a6e113a8f55}, author = {Juffinger, A. and Neidhart, T. and Granitzer, M. and Kern, R. and Weichselbraun, A. and Wohlgenannt, G. and Scharl, A.} } @article {206, title = {GA and PSO-based resource scheduling for orchestrated, distributed computing}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {343 - 351}, abstract = {A new distributed computing architecture, Dynamic Virtual Private Network (DVPN), is introduced. The DVM (Dynamic VPN Manager) works as the Autonomous System (AS) administrator in the DVPN system to perform resource scheduling and liaise with the underlying connection management. The approach combines on-demand reservation of both the communications infrastructure and various higherlevel processing facilities. This enables support of orchestrated computing where a complex job can be considered to be a VPN community. This job may be decomposed into tasks to be located at various distributed processing sites. Data can flow between them rather like a production line, in order to deliver the finished "product" to chosen end hosts. Two variants of a resource-scheduling algorithm are proposed for job scheduling in the DVPN system. Genetic Algorithm (GA) and Particle Swarm Optimisation (PSO) mechanisms are considered for use within the optimization process. Simulation results show that both approaches are feasible. The authors then compare the performance of GA against PSO in this dynamic VPN environment to compare their suitability.}, keywords = {GA, Grid computing, Inter-domain, PSO, Resource scheduling, VPN}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960659450\&partnerID=40\&md5=d9ea15f86f2d90b8c89711571dc61514}, author = {Gao, Y. and Phillips, C. and He, L.} } @article {197, title = {Machine learning based work task classification}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2009}, pages = {305 - 312}, abstract = {Increasing the productivity of a knowledge worker via intelligent applications requires the identification of a user{\textquoteright}s current work task, i.e. the current work context a user resides in. In this work we present and evaluate machine learning based work task detection methods. By viewing a work task as sequence of digital interaction patterns of mouse clicks and key strokes, we present (i) a methodology for recording those user interactions and (ii) an in-depth analysis of supervised classification models for classifying work tasks in two different scenarios: a task centric scenario and a user centric scenario. We analyze different supervised classification models, feature types and feature selection methods on a laboratory as well as a real world data set. Results show satisfiable accuracy and high user acceptance by using relatively simple types of features.}, keywords = {Data model, Data structure, Work task classification user interaction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953256434\&partnerID=40\&md5=ad1b8dc83a81694afe23a15ad90c66af}, author = {Granitzer, M. and Rath, A.S. and Kr{\"o}ll, M. and Seifert, C. and Ipsmiller, D. and Devaurs, D. and Weber, N. and Lindstaedt, S.} } @article {179, title = {Students{\textquoteright} review of acceptance, usability and usefulness of WebLab-Deusto}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {173 - 180}, abstract = {The paper shows the results of the evaluation of three remote labs implemented at the University of Deusto -WebLab-Deusto- as a learning tool. The paper presents the results of the surveys done by students since 2004. This survey consists of some questions and its main objective is to measure the acceptance, usability and usefulness of the remote laboratory developed at University of Deusto. To the best of our knowledge, this survey is the largest one in terms of number of academic years and total number of students involved.}, keywords = {Computing architecture, Hardware, Remote laboratories, Web laboratories}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249122403\&partnerID=40\&md5=ca83df5c2e11b7b56703ac6f3c0f0669}, author = {Garc{\'\i}a-Zubia, J. and Ordu{\~n}a, P. and Hern{\'a}ndez, U. and Angulo, I. and Irurzun, J.} } @article {151, title = {Application schema mapping based on ontology: An approach for geospatial data storage}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {51 - 60}, abstract = {The heterogeneous nature of geospatial data makes the sharing of it across organizations a complex issue. As a standard means of geospatial data encoding, Geography Markup Language (GML) has been proposed by Open Geospatial Consortium (OGC), which facilitates sharing and exchange of geospatial information. With the proliferation of GML in many geospatial applications and storage support from the standard DBMS, the need arises for the efficient storage mechanism of GML data. This paper analyses. approaches for XML data storage in traditional DBMS and proposes alternative solutions for GML. Every GML document structure is defined in an application schema. We propose an approach for GML storage based on the analysis of the underlying application schema. A semi-automatic mapping mechanism has been proposed for the application schema to relational schemas of standard database with the utilization of the domain ontology. A set of relational schema is presumed to exist for different geospatial features. The proposed ontology based schema-matching approach for GML storage enhances the mapping process, thus facilitates sharing of heterogeneous data repositories.}, keywords = {GML storage, OGC Standards, Ontology, Schema Mapping, Spatial Data Interoperability}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849122330\&partnerID=40\&md5=d3859ad1904574ca7d3094b2262d4952}, author = {Manoj, P. and Ghosh, S.K.} } @article {157, title = {Efficient power aware and reputation-based routing protocol for MANET}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2008}, pages = {21 - 29}, abstract = {Energy conservation is a critical issue in Mobile Ad hoc Networks (MANETs) for node and network life, as the nodes are powered by batteries only. In order to maximize the lifetime of MANETs, traffic should be sent through a shortest path that does not contain nodes with low residual energy and consumes minimum total transmission power. The above objectives cannot be satisfied simultaneously by applying the existing power aware routing algorithms. For this reason, several power-aware routing approaches have been proposed in the literature attempting to maximize the network lifetime. An interesting approach called Minimum Drain Rate (MDR) aims to predict the lifetime of nodes according to the current traffic conditions. However, it does not guarantee that the total transmission power is minimized over a chosen route. In this paper, we provide an new approach called Secure Extended Optimal Energy Drain Rate (SEOEDR) able to extend the MANET lifetime and duration of the path, and also to minimize the total transmission power consumed per packet. In our approach, the traffic is routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves. We also handle the selfishness of nodes by considering the node reputation while making the routing decisions. It results in selection of routes that are simultaneously energy efficient and reliable. The simulation results that we have conducted during our study show the relevance of our algorithm, in terms of energy saving and overall network lifetime, in comparison with existing ones.}, keywords = {Battery cost, DSR, Energy efficient routing protocol, MAC layer, MANET, NIC}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849115358\&partnerID=40\&md5=3571c3639e44fc54a89c22a1452df377}, author = {Gomathi, S.S. and Chbeir, R. and Krishnamurthi, S.} } @article {147, title = {A generic framework for visualizing the news article domain and its application to real-world data}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2008}, pages = {434 - 441}, abstract = {In this work we present APA Labs, a generic framework for visualizing the news article domain. APA Labs is a web-based platform enabling retrieval and analysis of news repositories provided by the Austrian Press Agency. APA Labs is designed as a rich internet application combined with a modular system of interactive visualizations. News articles are analyzed using domain specific named entity extraction methods combined with language specific heuristics. The proposed methods were subject to an evaluation procedure outlined in this contribution. This article illustrates the domain, the underlying concepts and implementation details. Several visualization modules are presented and an outlook on planned modules is given. Being online for around six months the community feedback as well as the easy integration of new modules shows the success of the underlying concept and the platform itself.}, keywords = {Business process, Collaboration, Email, Interoperability, SME}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77950335223\&partnerID=40\&md5=e07a8280eb1e93146ec05ab62b545f5a}, author = {Lex, E. and Seifert, C. and Kienreich, W. and Granitzer, M.} } @article {119, title = {A smart card based remote user authentication scheme}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {256 - 261}, abstract = {Password based authentication schemes are commonly used to authenticate remote users. Many schemes have been proposed both with and without smart cards but each have Its own merits and demerits. This paper analyzes the security of an enhanced Dynamic ID based remote user authentication scheme and shows that the enhanced scheme has major security weaknesses. The paper also presents a new scheme which overcomes the weaknesses and provides better security strength.}, keywords = {Smart cards, User authentication, User passowords}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350745322\&partnerID=40\&md5=472b89ddad64850ae41b20e57c01c3b9}, author = {Misbahuddin, M. and Premchand, P. and Govardhan, A.} } @article {133, title = {Standardized multimedia retrieval based on web service technologies and the MPEG query format}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2008}, pages = {315 - 331}, abstract = {In recent years, the growing number of digital audiovisual media files available over the internet or even on users hard discs is overwhelming. In order to support efficient storage and retrieval of those data, several comprehensive and rich multimedia retrieval systems (MMRS) have been introduced. Unfortunately, a standardized query format does not yet exist and almost every retrieval framework provides its own proprietary solution. Therefore, the ISO/IEC SC29 WG11 committee decided to contribute to this application by establishing the MPEG Query Format (MPQF). The MPQF is currently in Final Committee Draft (FCD) status and provides besides the standardization of messages from and to multimedia services also functionalities for service discovery, aggregated services and definition of service capability descriptions. In this context, the paper briefly introduces the MPQF and concentrates thereby on the management part. Based on this, a Web Service based framework is presented that realizes the management functionalities of MPQF. One of its central novel features is the distribution of a MPQF request to multiple multimedia services and the aggregation of individual result sets.}, keywords = {Audio visual media, ISO multimedia standards, MPEG query format}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67650583071\&partnerID=40\&md5=ad0ab700b7cdca43c561426ac442090a}, author = {D{\textquoteright}Oller, M. and Bauer, K. and Kosch, H. and Gruhne, M.} } @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 {79, title = {Biological model for information retrieval}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {123 - 129}, abstract = {Heuristic methods based on biological aspects have been successfully used in many computer science areas of research, including information retrieval (IR). This let us ask: why there is no biological environment for the problem of information retrieval. In this paper, we tried to introduce a new biological environment and model for information retrieval that broad the modeling concept from the mathematical formula that simulates the basic elements of IR problem to their dual schemas in biology. It{\textquoteright}s a new way of thinking of, and dealing with, the problem of information retrieval.}, keywords = {Biological environment, Biological model, Genetic algorithms, Information retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350691855\&partnerID=40\&md5=22f8442d6b340f89f18dd39e3c99ed99}, author = {Girgis, M.R. and Aly, A.E.-M.A. and Latef, B.A.A. and El-Gamil, B.R.} } @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 {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 {66, title = {Impact of node mobility on MANET routing protocols models}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):36Export Date: 10 July 2014}, month = {2007}, pages = {19 - 24}, abstract = {A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links to form an arbitrary topology without the use of existing infrastructure. In this paper, we have studied the effects of various mobility models on the performance of two routing protocols Dynamic Source Routing (DSR-Reactive Protocol) and Destination-Sequenced Distance-Vector (DSDV-Proactive Protocol). For experiment purposes, we have considered four mobility scenarios: Random Waypoint, Group Mobility, Freeway and Manhattan models. These four Mobility Models are selected to represent possibility of practical application in future. Performance comparison has also been conducted across varying node densities and number of hops. Experiment results illustrate that performance of the routing protocol varies across different mobility models, node densities and length of data paths.}, keywords = {MANET, Mobile adhoc networks, Mobility models}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947316746\&partnerID=40\&md5=9ec1ff712eea94ec5e6ac514c870c542}, author = {Divecha, B. and Abraham, A. and Grosan, C. and Sanyal, S.} } @article {87, title = {Multi-source remote sensing classification based on Mallat fusion and residual error feature selection}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {130 - 137}, abstract = {Classification of multi-source remote sensing images has been studied for decades, and many methods have been proposed or improved. Most of these studies focus on how to improve the classifiers in order to obtain higher classification accuracy. However, as we know, even if the most promising method such as neural network, its performance not only depends on the classifier itself, but also has relation with the training pattern (i.e. features). On consideration of this aspect, we propose an approach to feature selection and classification of multi-source remote sensing images based on Mallat fusion and residual error in this paper. Firstly, the fusion of multi-source images can provide a fused image which is more preferable for classification. And then a featureselection scheme approach based on fused image is proposed, which is to select effective subsets of features as inputs of a classifier by taking into account the residual error associated with each land-cover class. In addition, a classification technique base on selected features by using a feed-forward neural network is investigated. The results of computer experiments carried out on a multisource data set confirm the validity of the proposed approach.}, keywords = {Feature selection, Mallet fusion, Multi-source classification, Neural network, Residual error}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350668378\&partnerID=40\&md5=8e01a98aa0645ce6934545475591db77}, author = {Cao, D. and Yin, Q. and Guo, P.} } @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 {23, title = {Creating dependable web services using user-transparent replica}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {16 - 21}, abstract = {Dependability is a major concern in software development, deployment, and operation. A commonly accepted solution for providing fault tolerant services on the Internet is to create replica of the services and to deploy them to several hosts. Whenever the service or the underlying node or network fails, another service is ready to take over. In the Venice project, several techniques are combined to create a dependable framework for deploying and managing distributed services using replica on several distinct network nodes.}, keywords = {Dependable web services, Software development, Venice framework, Web service technology, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748249857\&partnerID=40\&md5=2f82439b41c666055dd9bd6d4a3dea11}, author = {Hillenbrand, M. and G{\"o}tze, J. and M{\"u}ller, P.} } @article {35, title = {The designing of web services to deliver web documents associated with historical links}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {11 - 15}, abstract = {The historical links of a web site include the URLs invalidated due to web site reorganization, document removal, renaming or relocation, or links to document snapshots, which are defined as the document{\textquoteright}s contents as of a specific point in time. Tracking historical links will allow users to use out-of-date URLs, retrieve removed documents and document snapshots. This paper presents a logging and archiving scheme to track a source document{\textquoteright}s history of changes, and designs web services to deliver the source document associated with a historical link.}, keywords = {Concept mapping, Hyper space, Information extraction, Knowledge discovery, Semantic web, Web knowledge discovery, Web navigation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748275472\&partnerID=40\&md5=8f950d21d3b688c9a0c1bb1159d7a54d}, author = {Chao, D. and Gill, S.} } @article {43, title = {Energy efficient adaptive message transmission algorithm for wireless sensor networks}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {142 - 146}, abstract = {An energy efficient adaptive message transmission algorithm is proposed to save the energy consumption of the wireless sensor networks when answering the event-based ad hoc query. Compared with other algorithms based on either active or inactive message transmission mode, our adaptive algorithm emphasizes that every event lasts for a period of time, in which the ratio between the query frequency and the data production frequency changes from time to time, so using only one kind of message transmission mode is not enough to save energy. Our algorithm can adaptively change the message transmission mode for the sensor nodes according to this ratio. Experimental results showed that our adaptive algorithm could save more energy than other algorithms.}, keywords = {Adaptive message transmission, Data management for wireless sensor networks, Energy efficiency, Event-based ad hoc query processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649137406\&partnerID=40\&md5=1f91920bf596f1fc95306fa2882e01b4}, author = {Li, G.L. and Li, J.Z. and Guo, L.J.} } @article {56, title = {Introduction to the Multimedia Semantics issue}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {206}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845938735\&partnerID=40\&md5=6cc5552751fc285d3d1d350093fe3395}, author = {Grosky, B. and Stanchev, P.L.} } @article {46, title = {A new persistent labelling scheme for XML}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {112 - 116}, abstract = {With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. Thereby, several path indexing, labelling and numbering scheme have been proposed. However if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. The goal of the research reported in this paper is to design a persistent structural labelling scheme, namely a labelling scheme where labels encode ancestor-descendant relationships and sibling relationship between nodes but need not to be changed when the document is updated.}, keywords = {Data exchange, Labeling scheme, XML database, XML standards}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649170430\&partnerID=40\&md5=b06e66fe740929637d6b20adf7fe0e9e}, author = {Gabillon, A. and Fansi, M.} } @article {52, title = {On the use of ontologies for an optimal representation and exploration of the web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2006}, pages = {159 - 168}, abstract = {The use and definition of ontology for the representation and the exploration of knowledge are critical issues for approaches dealing with information retrieval. In this paper, we propose a new ontology-based approach for improving the quality, in terms of relevance, of the results obtained when searching documents on the Internet. This is done by a coherent integration of ontologies, Web data and query languages. We propose new data structures built upon ontologies: the WPGraph and the W 3Graph which allow Web data to be modelled. We also discuss the use of ontologies for an efficient exploration of the knowledge contained in our conceptual structures using ASK, a specific query language introduced in this paper. An experimental validation of our approach is proposed through a prototype supporting our innovative framework.}, keywords = {Conceptual structures, Graphs, Ontology, Query language, Web search}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749389716\&partnerID=40\&md5=2881871777661cd78d3507f448bedc32}, author = {Guelfi, N. and Pruski, C.} }