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

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

}, doi = {https://doi.org/10.6025/jdim/2024/22/2/63-73}, url = {https://www.dline.info/fpaper/jdim/v22i2/jdimv22i2_3.pdf}, author = {Bo Zhao} } @article {752, title = {Empirical Analysis on the Efficiency of Clustering Algorithms Based on the Significance of Cluster Size}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {03/2023}, pages = {9-17}, type = {Research}, chapter = {9}, doi = {https://doi.org/10.6025/jdim/2023/21/1/9-17}, url = {http://www.dline.info/download.php?sn=3682}, author = {Sunitha Cheriyan and Shaniba Ibrahim and Susan Treesa} } @article {743, title = {ERP Project Lifecycle costs: A Review-}, journal = {Journal of Digital information Management}, volume = {21}, year = {2023}, month = {12/2024}, pages = {110 -116}, type = {Research}, chapter = {110}, abstract = {

Today, many organizations acquire and implement enterprise resource planning (ERP) solutions to improve their operations performance and create value. However, they fail to achieve these objectives due to a lack of knowledge and a better estimating of all the costs related to an ERP system project. The purchasing costs of ERP systems are the most visible expense for many organizations that have adopted ERP systems, but the entire ERP lifecycle phase of implementation contains many hidden costs. As a result, institutions have long struggled with information system implementation cost overruns. This document presents the research on the various costs associated with the different stages of the life cycle of the REP project according to the literature on ERP lifecycle costs.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/110-116}, url = {http://www.dline.info/download.php?sn=3898}, author = {L{\textquoteright}YARFI Hanane and MOTAKI Noureddine and DERRHI Mostafa} } @article {733, title = {ERP Project Lifecycle costs: A Review-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {110-116}, chapter = {110}, abstract = {

Today, many organizations acquire and implement enterprise resource planning (ERP) solutions to improve their operations performance and create value. However, they fail to achieve these objectives due to a lack of knowledge and a better estimating of all the costs related to an ERP system project. The purchasing costs of ERP systems are the most visible expense for many organizations that have adopted ERP systems, but the entire ERP lifecycle phase of implementation contains many hidden costs. As a result, institutions have long struggled with information system implementation cost overruns. This document presents the research on the various costs associated with the different stages of the life cycle of the REP project according to the literature on ERP lifecycle costs.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/110-116}, url = {https://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_2.pdf}, author = {L{\textquoteright}YARFI Hanane and MOTAKI Noureddine and DERRHI Mostafa and LAHLOU Imane} } @article {843, title = {EEMCRP: Energy Efficient Multi-hop Clustering Routing Protocol for Wireless Sensor Networks}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {06/2022}, pages = {35-45}, type = {Research}, chapter = {35}, abstract = {

Clustering is the key to overcoming the energy challenge in the wireless sensor network. For this reason, we propose a novel static clustering routing protocol called Energy Efficient Multi-hop Clustering Routing Protocol for Wireless Sensor Networks (EEMCRP). EEMCRP, partitions the network into static clusters, eliminates the overhead of dynamic clustering and distributes the energy load among high power sensor nodes by using Secondary-cluster-heads. EEMCRP partitions the nodes into unequal size clusters. Clusters closer to the base station have smaller sizes than those farther away from the base station. Thus, cluster heads closer to the base station can preserve some energy for the inter-cluster data forwarding. We, also, propose an energy-aware multihop routing protocol for inter-cluster communication based on Energy-Efficient Routing Protocol for wireless sensor networks (EERP). Simulation results show that our protocol balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.

}, doi = {http://www.dline.info/download.php?sn=3510}, url = {https://doi.org/10.6025/jdim/2022/20/2/35-45}, author = {Samra BOULFEKHAR and Fatima BELAMRI and Mohammed BENMOHAMMED and Djamil A{\"\i}ssani} } @article {765, title = {Efficient Measuring of Readability to Improve Documents Accessibility for Arabic Language Learners}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {09/21}, pages = {75-82}, type = {Research}, chapter = {75}, abstract = {

This paper presents an approach based on supervised machine learning methods to build a classifier that can identify text complexity in order to present Arabic language learners with texts suitable to their levels. The approach is based on machine learning classification methods to discriminate between the different levels of difficulty in reading and understanding a text. Several models were trained on a large corpus mined from online Arabic websites and manually annotated. The model uses both Count and TF-IDF representations and applies five machine learning algorithms; Multinomial Na{\~A}{\textasciimacron}ve Bayes, Bernoulli Na{\~A}{\textasciimacron}ve Bayes, Logistic Regression, Support Vector Machine and Random Forest, using unigrams and bigrams features. With the goal of extracting the text complexity, the problem is usually addressed by formulating the {\^a}{\texteuro}\~{}level identification{\^a}{\texteuro}{\texttrademark} as a classification task. Experimental results showed that n-gram features could be indicative of the reading level of a text and could substantially improve performance, and showed that SVM and Multinomial Na{\~A}{\textasciimacron}ve Bayes are the most accurate in predicting the complexity level. Best results were achieved using TF-IDF Vectors trained by a combination of word-based unigrams and bigrams with an overall accuracy of 87.14\% over four classes of complexity.

}, doi = {https://doi.org/10.6025/jdim/2021/19/3/75-82}, url = {http://www.dline.info/download.php?sn=3326}, author = {Sadik Bessou and Ghozlane Chenni} } @article {800, title = {Effective Evaluation of XML Queries in a Visual Environment-}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2019}, month = {06/2-29}, pages = {113-121}, type = {Research}, chapter = {113}, abstract = {

\ Since its emergence in 1997, Extensible Markup Language (XML) has become a standard data format for data exchange among a variety of web applications. In this paper, we present a framework to effectively evaluate XML queries in a visual environment. We have developed a system termed VXPath, which is a visual XPath query evaluator that allows the user to evaluate various XPath queries by clicking the nodes in an expanding tree instead of typing the whole XPath queries manually. Our system GUI is built on top of Microsoft .NET Windows Forms Applications. We have implemented most XPath axes in our system, including child, descendant, self, parent, ancestor, following-sibling, preceding-sibling, predicate and so on. In order to handle large size XML documents, instead of loading the whole XML document into memory, we developed an effective algorithm to extract a concise data synopsis called structural summary from the original XML document to avoid the loading overhead for large XML documents. We evaluated our system over the data from XMark and DBLP and our system can handle large XML documents up to gigabytes.

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/113-121}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_1.pdf}, author = {Weimin He and Teng Lv and Ping Yan} } @article {714, title = {Effective Evaluation of XML Queries in a Visual Environment}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {113-121}, type = {Research}, chapter = {113}, abstract = {
}, doi = {https://doi.org/10.6025/jdim/2019/17/3/113-121}, author = {Weimin He}, editor = {Teng Lv and Ping Yan} } @article {653, title = {Efficient Management of Community Question Answering Sites using Improved Spectral Clustering}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {76-84}, type = {Research}, author = {Abhishek Kumar Singh and Naresh Kumar Nagwani and Sudhakar Pandey} } @article {831, title = {Efficient Management of Community Question Answering Sites using Improved Spectral Clustering {\textendash}}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {76-84}, type = {Research}, chapter = {76}, abstract = {

Community Question-Answering(CQA) sites are the major platform where posts are generated by peers in the form of questions and answers for information seeking in online environments. In general, multiple posts are created by different users on a particular topic or subject. Large number of posts raises the difficulties in information management of these sites. A number of approaches are suggested in recent research work for efficient management of data for CQA sites. Many of the existing approaches have suggested use of clustering techniques for managing the CQA sites, but ignored the tagging data (user tags) of the posts. In this paper, an improved spectral clustering technique is derived based on similarity measures for text processing (SMTP) and utilized for clustering the posts considering the tagging data available on CQA sites. A specialized data structure, namely, folksonomy is developed for clustering using the relationship between tags, posts and users.

}, url = {http://dline.info/fpaper/jdim/v16i2/jdimv16i2_3.pdf}, author = {Abhishek Kumar Singh and Naresh Kumar Nagwani and Sudhakar Pandey} } @article {670, title = {Emotional Intelligence: A Valuable Contrivance for Analyzing Emotional Facet}, journal = {Journal of Information Organization}, volume = {8}, year = {2018}, month = {06/2018}, pages = {58-69}, type = {Research}, author = {Aasim Mir and Gaurav Sehgal} } @article {650, title = {An Empirical Study to Develop a Decision Support System (DSS) for Measuring the Impact of Quality Measurements over Agile Software Development (ASD)}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {03/2018}, pages = {27-43}, type = {Research}, author = {Osama Alshareet} } @article {665, title = {An Empirical Study to Understanding Students{\textquoteright} Continuance Intention Use of Multimedia Online Learning}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {06/2018}, pages = {60-69}, type = {Research}, author = {Taqwa Hariguna} } @article {686, title = {Exploiting Links to Improve Search in XML Documents}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {169-179}, type = {Research}, author = {Samia Berchiche-Fellag and Mohamed Mezghiche} } @article {822, title = {Exploiting Links to Improve Search in XML Documents-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {169-179}, type = {Research}, chapter = {169}, abstract = {

This paper describes an approach that exploits links in XML retrieval. The proposed approach consists of reranking the set of documents returned for a given query by considering three sources of evidence namely, the relevance scores w.r.t query of a document neighbours, the text of the anchor links, and the document title tag. Our approach is evaluated on INEX 2006 collection. The results showed significant improvements of the retrieval performances.

}, doi = {https://doi.org/10.6025/jdim/2018/4/169-179}, url = {http://dline.info/fpaper/jdim/v16i4/jdimv16i4_2.pdf}, author = {Samia Berchiche-Fellag and Mohamed Mezghiche} } @article {493, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020194163\&partnerID=40\&md5=4a1663e5d7e717676be3e722b9ba11bc} } @article {488, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021830069\&partnerID=40\&md5=cf41060a52fa38bfffb099c1d413ebbf} } @article {484, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026663505\&partnerID=40\&md5=e682b442d254b92b43b404dba680b090} } @article {500, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016489076\&partnerID=40\&md5=e1ae86d66e0f4660a415221b53fe54d1} } @article {477, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036667524\&partnerID=40\&md5=c98218f7b699e7f5fbe0376e0d5f2424} } @article {469, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041076013\&partnerID=40\&md5=085cfa5b37bc804ef4aa4e2426425b32} } @article {489, title = {An efficient optimization method for extreme learning machine using artificial bee colony}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {135 - 147}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021814012\&partnerID=40\&md5=23df5d471829ac289d14f78e14dac00d}, author = {Ma, C.} } @article {495, title = {Ensemble learning to find deceptive reviews using personality traits and reviews specific features}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {84 - 94}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020169399\&partnerID=40\&md5=68f6cd81afc51c91e5b486adcb7dfaf6}, author = {Saini, M. and Sharan, A.} } @article {530, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974806696\&partnerID=40\&md5=1da7f466070aecb9266bc6db9c57fa3a} } @article {516, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991632822\&partnerID=40\&md5=65bb3595a5fe6ae471609af13e3e3c13} } @article {503, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950496\&partnerID=40\&md5=6b6fe7fe188cad1d1161479c070e743b} } @article {506, title = {Emonews: An emotional news recommender system}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {392 - 402}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85011002763\&partnerID=40\&md5=8b7f0afd931aaf9ee2688f258598a5ef}, author = {Parizi, A.H. and Kazemifard, M. and Asghari, M.} } @article {549, title = {Exploring government uses of social media through Twitter sentiment analysis}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {290 - 301}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006868159\&partnerID=40\&md5=11144532b5f9c5b4092fdc815b6c7878}, author = {Chen, H.M. and Franks, P.C. and Evans, L.} } @article {609, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930395044\&partnerID=40\&md5=238b690a729266667f0341a46b8fb1ba} } @article {571, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84956511799\&partnerID=40\&md5=f08e72c487745b4fbb237699a8bd571e} } @article {602, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930343347\&partnerID=40\&md5=c319ff8af0531cf1506ee50172fd0677} } @article {612, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938560172\&partnerID=40\&md5=0d7f09712bb854bba464d0dd671719bc} } @article {559, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {i}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959186858\&partnerID=40\&md5=52a91d866ea136c2dd9b9a69b3cffb58} } @article {579, title = {An efficient RFID data cleaning method based on wavelet density estimation}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {10 - 14}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930330566\&partnerID=40\&md5=9044ba6bdb789f569e8827e6132ce5f8}, author = {Liu, Y. and Zhang, H. and Han, F. and Tan, J.} } @article {449, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900397968\&partnerID=40\&md5=cab115be1393d3861d80cd3c160359f5} } @article {443, title = {Evaluation model for internet cloud data structure audit system}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {108 - 113}, abstract = {As economic globalization and information industry develop at top speed, Internet has penetrated into all walks of life rapid, with an immeasurable impact on all aspects of people{\textquoteright}s life. Computer technology is an integral part in the evaluation of audit system, technically prepared for application of cloud data structure in the evaluation of audit system. Based on the concept of Internet cloud data structure, this paper constructs a new audit system evaluation model. Firstly, it performs a theoretical analysis of Internet cloud data structure audit system; then it explores applications of cloud data structure audit system; finally, feasibility of cloud data structure audit system is evaluated by means of AHP and fuzzy analysis. It is found that the system has incomparable superiority in audit practices.}, keywords = {Audit system evaluation, Cloud data structure, Could data processing, Information processing, Internet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903171427\&partnerID=40\&md5=13723b36a13841eb49681a783fae6727}, author = {Fan, W.} } @article {430, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892149940\&partnerID=40\&md5=b922ec5a35933d8cebf439855820ccc4} } @article {365, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879107959\&partnerID=40\&md5=93df30dd0327de4b42fd96551b58fd7f} } @article {417, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890511635\&partnerID=40\&md5=e3c808f2849b55c0e265a4ef0f83391f} } @article {389, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879112019\&partnerID=40\&md5=72399cf5058ac4195b016eef539bb617}, author = {Li, G.} } @article {408, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888374235\&partnerID=40\&md5=e32c0bcd695ba92f192288c14345f02b} } @article {411, title = {An efficient use of a mapping knowledge base}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {307 - 313}, abstract = {In a wide range of commercial and industrial applications data from different sources - web, databases or documents - are integrated into databases for the purpose of querying and analysis. It is then determined for each of the information contained in the source schema, what should be the corresponding column in the target relational database, that is to say, to establish a correspondence (Mapping) between the data source and the target column. A number of tools and prototypes of Schema Matching have been developed in order to automate the process of finding a suitable mapping. One technique employed is to use mapping decisions previously taken by the user manually. These decisions are stored in a Mapping Knowledge Base. The problem with this procedure is that the volume of the Mapping Knowledge Base increases very significantly over time. Processing large volumes of information may take several hours or even days. The prototype described in this article, keeps processing time at acceptable levels.}, keywords = {Data integration, Relational databases, Schema matching, Similarity coefficients, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888320638\&partnerID=40\&md5=d04798bbda1e485e62f2df159a46f9a2}, author = {Kahloula, B. and Bouamrane, K.} } @article {405, title = {Enhancing workflow systems resiliency by using delegation and priority concepts}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {267 - 276}, abstract = {Enforcing dynamic access control constraints in workflow management systems (WFMS) is a very important requirement with regard to security issues. However, respecting those constraints may prohibit the completion of a workflow instance in the case of the lack of authorized users. Such situation is known in the literature as a WSP (Workflow Satisfiability Problem). The ability of a WFMS to use different methods to bypass a WSP situation is often seen as a resiliency property. In this work, we propose a new approach that aims to enhance the resiliency of a WFMS while meeting -at run time-the main workflow dynamic access control requirements. In fact, by using both delegation and priority concepts it is possible to find a user which is as suitable as possible to perform the current task instance with lesser security risks.}, keywords = {Delegation, Dynamic access control constraints, Priority, Resiliency, Workflow Satisfiability Problem}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888373794\&partnerID=40\&md5=fedc10e4bf4acaa3224e1a9dfa459fc0}, author = {El Bakkali, H.} } @article {378, title = {Exception detection for web service composition using improved bayesian network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {108 - 114}, abstract = {New application systems generated by composition of web services dynamically have become a development trend in network environment. However, since a variety of external services are invoked with different quality of service during processing, the problem of how to keep the execution stable must be addressed in order to improve the reliability and availability of the combination of services. In this paper, an approach of exception detection is presented for web service composition by improved Bayesian network. Firstly, the topological structure of Bayesian network is established, where the causal relationships between underlying web services are mapped to Bayesian network in service combination process. The conventional Bayesian network algorithm is improved to satisfy the demand of better conversion from nodes in web service composition to nodes in Bayesian network. Secondly, the parameter setting in Bayesian network is explored for determining the prior probability of service nodes and the conditional probability of service output node. Thirdly, the algorithm of the improved exception detection model is introduced, with the aim of locating the web services that cause exceptions in the execution of composite services. Lastly, a case study is given and the results analysis is also conducted. The results show that the presented approach not only considers the uncertainty during exception detection, but also can identify the exception web services in the process.}, keywords = {Bayesian network, Exception handling, Web service, Web service composition}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879099166\&partnerID=40\&md5=0973327f022946c84a165872a2285524}, author = {Chen, Y. and Ying, S. and Zhang, L. and Wu, J.} } @article {362, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874887195\&partnerID=40\&md5=11a016fc7cf6f668670cec4c327a5d6a} } @article {353, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870820511\&partnerID=40\&md5=0a1285fba51c505abaa2624d343b1bc3}, author = {Li, G. and Chen, T. and Xiong, H.} } @article {336, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866446334\&partnerID=40\&md5=da13d634d1e4b39ad93182c6d987f7ae} } @article {305, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857537098\&partnerID=40\&md5=6a479ac509720ccaa2853695ab575766} } @article {329, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866445471\&partnerID=40\&md5=1248a8e53f5b217b9ddba6977922742c} } @article {361, title = {Effective implementation of basic operations for information retrieval}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {389 - 398}, abstract = {In the article we describe the approach to parallel implementation of elementary operations for textual data categorization. In the experiments we evaluate parallel computations of similarity matrices and k-means algorithm. The test datasets have been prepared as graphs created from Wikipedia articles related with links. W also present the approach to computing pairs of eigenvectors and eigenvalues for visualizations of the datasets. The implemented basic operations: computing similarity matrix, data clustering and spectral analysis have been used in our system for visualization of the Wikipedia categories on SOM as well as in a system for categorization search results in Wikipedia.}, keywords = {Documents Categorization, Information retrieval, PCA, SOM, Text clustering}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874861039\&partnerID=40\&md5=f0cc1565c8fce706ec0125e688e6474a}, author = {Szymanski, J.} } @article {312, title = {An equivalent circuit model for on-chip inductors with gradual changed structure}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {99 - 103}, abstract = {Inductor with gradual changed metal width and space by good design can get better Q factor than the inductor with fixed metal width and space. In this paper, a simple wide-band inductor model is presented considering both the increase of resistance and the decrease of inductance due to the skin and proximity effects. This model has been verified with simulation and the experimental results of spiral inductors with various geometrical configurations on high-resistivity silicon substrate. Good agreements have been achieved under the selfresonance frequency, which indicates its accuracy. This model has also been proved to be suitable for both the conventional inductor with fixed structure and the inductor with gradual changed structure.}, keywords = {Eequivalent circuit, Gradually changed structure, Inductor, Model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866462474\&partnerID=40\&md5=02e9de97a74f79993822587bc84bfc42}, author = {Li, X. and Ren, Z. and Shi, Y.} } @article {330, title = {Experimental evaluation for impact factors of online signature verification}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2012}, pages = {187 - 193}, abstract = {A study of online signature verification has been carried out based on experimental evaluation. We started by presenting a brief survey of the recent literatures on important factors of online signature verification. Four main issues have been addressed in the work: 1) assessment for signature consistency caused by different physiological factor. 2) Analysis for variation and complexity of online signature. 3) Performance evaluation for features widely used in several datasets. 4) Comparative analysis for algorithms applied on acquired datasets. From detailed experimental analysis, we identified and characterized some important aspects of online signatures.}, keywords = {Biometrics, Dynamic timing warping, Experimental evaluation, Online signature verification, Support vector machine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866459887\&partnerID=40\&md5=efb57c0a5eb8df586d615ad81371552d}, author = {Hao, C. and Ming, D.D.} } @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 {334, title = {Exploring lexicographic ontologies for hierarchically organizing the greek wikipedia articles}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {157 - 167}, abstract = {To effectively manage the proliferating online content, it is imperative that we come up with efficient data structuring and organization methods. Based on the findings of previous research [6] [7] that the most flexible and useful way to organize the online content is via the use of taxonomies and/or ontologies, we carried out the present study, which aims at structuring the content of the Greek Wikipedia via the use of the Greek WordNet. In particular, our study objective is to design a model that can automatically organize the Greek Wikipedia categories into a thematic taxonomy and based on the derived organization, to implicitly assign hierarchical structure to the encyclopedia articles that have been classified to the respective categories. To this end, we relied on the data encoded in Greek WordNet out of which we harvested the hierarchical relations that hold between the terms used to verbalize the Wikipedia categories. The effectiveness of our model is verified by the findings of several experimental evaluations conducted, which demonstrate that semantic networks are powerful resources for hierarchically organizing large volumes of dynamic data.}, keywords = {Hierarchical organization, Wikipedia articles, WordNet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866437570\&partnerID=40\&md5=f78ff732a8358e3c52247f353ea4acc2}, author = {Niarou, M. and Stamou, S.} } @article {292, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855367587\&partnerID=40\&md5=2e6b58ecf6c83ad9a99a7485563c524b}, author = {Yuxin, M. and Xu, L.} } @article {291, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855410927\&partnerID=40\&md5=5b500c0d9d5b012377893a4c7ac11717} } @article {282, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053092628\&partnerID=40\&md5=b04c52e61e35721f703490a70af6310c} } @article {265, title = {Elementary patterns for converting textual and visual formalisms based on set theory and ORM}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2011}, pages = {64 - 71}, abstract = {Textual formalisms, visual formalisms, or both types of formalisms can be used to develop a formal model. The exact syntax and semantics of textual formalisms reduce ambiguity and increase formulation precision. This has as side effect that textual formalisms can become complex and suitable for limited audiences only. Visual formalisms consist of graphical notations with formal semantics. The intuitive and well-organized char acter of such models improves their comprehensibility and eases commu nication. Unfortunately, visual formalisms can become unreadable when the complexity or number of formalisms increases. Conversion patterns are introduced to enable conversion of textual to visual formalisms and vice versa. These patterns can be applied to benefit from the advantages of both ways to represent formalisms. The Object-Role Modeling (ORM) language has been used to develop the visual patterns and the textual formalisms are founded in set theory. While the primary focus of this paper is on the theoretic coupling between textual and visual formalisms, the presented patterns are also materialized and evaluated in two applications. First, an ORM model of the ISO/IEC 19763-5 standard to register information of process models is converted to a textual formal model. Sec ond, a textual formal model of an information market is converted to an ORM variant.}, keywords = {Object Role Modeling, Set theory, Textual formalisms, Visual formalisms}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960694971\&partnerID=40\&md5=fb5b641c92f12de5340fa890fca9fa44}, author = {Overbeek, S. and van Bommel, P.} } @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 {287, title = {Evaluation of topic identification methods on arabic corpora}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2011}, pages = {185 - 192}, abstract = {Topic Identification is one of the important keys for the success of many applications. Indeed, there are few works in this field concerning Arabic language because of lack of standard corpora. In this study, we will provide directly comparable results of six text categorization methods on a new Arabic corpus Alwatan-2004. Hence, Topic Unigram Language Model (TULM), Term Frequency/Inverse Document Frequency (TFIDF), Neural Network, SVM, M-SVM and TR have been experimented, and showed that TR-Classifier is the most efficient among the set of classifiers, nevertheless, only binary SVM outperformed it thanks to its characteristics. Moreover, we should note that the size of Alwatan-2004 corpus used to achieve our experiments is considered the most important compared to any other Arabic corpus which had been used for topic identification experiments until now. In addition, we aim through using small sizes of vocabularies to reduce the time of computation. This is important for adaptive language modeling, particularly Topic Adaptation, which is required in real time applications such as speech recognition and machine translation systems. Our experiments indicate that the results are better than other works dealing with Arabic text categorization.}, keywords = {Alwatan-2004 corpus, Arabic language, Neural network, SVM, Topic Identification, TR, TULM}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855410016\&partnerID=40\&md5=8736f4304c67d00c33512bbcb14394fa}, author = {Abbas, M. and Smaili, K. and Berkani, D.} } @article {211, 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-77958036375\&partnerID=40\&md5=77e073b1f1ef1e51a6dbafd4610f190e} } @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 {245, title = {Enabling automatic just-in-time evaluation of in-class discussions in on-line collaborative learning practices}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {322 - 329}, abstract = {Learning by discussion when applied to on-line collaborative learning settings can provide significant benefits for students in education in general. Indeed, the discussion process plays an important social task in collaborative learning practices. Participants can discuss about the activity being performed, collaborate with each other through the exchange of ideas that may arise, propose new resolution mechanisms, justify and refine their own contributions, and as a result, acquire new knowledge. Considering these benefits, current educational organizations incorporate on-line discussions into web-based courses as part of the very rationale of their pedagogical models. However, in-class collaborative assignments are usually greatly participated and contributed, which makes the monitoring and assessment tasks by tutors and moderators time-consuming, tedious and error-prone. Specially hard if not impossible by human tutors is to manually deal with the sequences of hundreds of contributions making up the discussion threads and the relations between these contributions. Consequently, tutoring tasks during on-line discussions usually restrict to offer evaluation results of the contributing effort and quality after the collaborative learning activity takes place and thus neglect the essential issue of constantly considering the process of knowledge building while it is still being performed. In this paper, we propose a multidimensional model based on data analysis from online collaborative discussion interactions that provides a first step towards an automatic evaluation in just-in-time fashion. The context of this study is a real on-line discussion experience that took place at the Open University of Catalonia.}, keywords = {Automatic evaluation, Collaborative learning, Groupware, Knowledge discovery, Machine learning}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960216812\&partnerID=40\&md5=0f38528ca7e6fa26bdcaf9c0b81206c9}, author = {Caball{\'e}, S. and Lapedriza, {\`A}. and Masip, D. and Xhafa, F. and Abraham, A.} } @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 {243, title = {Exploiting multi-word similarity for retrieval in medical document collections: The TSRM approach}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {315 - 321}, abstract = {In this paper, we investigate on potential improvements to Information Retrieval (IR) models related to document representation and conceptual, topic retrieval, in medical document collections. We propose the TSRM1 (Term Similarity and Retrieval Model) approach, where document representations are based on multi-word domain terms, rather than mere single key-words, typically applied in traditional IR. The proposed representation is semantically compact and more efficient, being reduced to a limited number of meaningful multi-word terms (phrases), rather than large vectors of single-words, part of which may be void of distinctive content semantics. In computing document similarity, contrary to other state-of-theart methods examined in this work, TSRM adopts a knowledge poor solution, namely an approach which does not require any existing knowledge resources, such as ontologies, or thesauri. The evaluation of TSRM is based on OHSUMED, a standard TREC collection of medical documents and illustrated the effciency of TSRM over other well established general purpose IR models.}, keywords = {Document representation, Information retrieval, Medical information retrieval, Term extraction, Term Similarity}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960229245\&partnerID=40\&md5=f9f58b511661960f2a01ed0691084e33}, author = {Drymonas, E. and Zervanou, K. and Petrakis, E.G.M.} } @article {257, title = {Extraction of characteristic description for analyzing news agencies}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {349 - 354}, abstract = {News agencies report news from different viewpoints and with different writing styles and these differences often ap pear in their article descriptions. We propose a method to extract characteristic descriptions on certain entities (persons, locations, organizations, etc.) in news agency articles. For a given entity, a description is one tuple (called an SVO tuple) consisting of that entity and other words or phrases appearing in the same sentence on the basis of their SVO (Subject (S), Verb (V) and Object (O)) roles. We extract characteristic descriptions of entities by computing the fre quency and inverse agency frequency of each description. By arranging characteristic descriptions chronologically, we were able to ascertain the left-or right-leanings of news agencies and how those leanings varied with the passage of time.}, keywords = {News agencies, News analysis, Text characteristics, Text description, Word frequency analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960674167\&partnerID=40\&md5=ecab8d077da920129f8c0e884ea0c5b4}, author = {Ishida, S. and Ma, Q. and Yoshikawa, M.} } @article {236, title = {Extraction of children{\textquoteright}s friend relations from activity level}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {270 - 275}, abstract = {This paper proposes the method to extract the friendship relations of children by using motion sensors. Children learn to fit into society through living in a group, and it{\textquoteright}s greatly influenced by their friend relations. Although preschool teachers need to observe them to assist in the growth of children{\textquoteright}s social progress and support the development each child{\textquoteright}s personality, only experienced teachers can watch over children while providing high-quality guidance. To resolve the problem, this paper proposes a mathematical and objective method that assists teachers with observation. It uses numerical data of activity level recorded by pedometers, and the authors make tree diagram called dendrogram based on hierarchical clustering with recorded activity level. Also, the authors calculate children{\textquoteright}s "breadth" and "depth" of friend relations by using more than one dendrogram. When the authors record children{\textquoteright}s activity level in a certain kindergarten for two months and evaluated the proposed method, the results usually coincide with remarks of teachers about the children.}, keywords = {Acceleration sensor, Clustering, Friendship relation, Pedometer}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960659287\&partnerID=40\&md5=0f94aed0a83203638341b37b6cb7cc8b}, author = {Haga, H. and Kaneda, S. and Kono, A. and Shintani, K.} } @article {233, title = {Extraction of features for diagnosing pneumoconiosis from chest radiographs obtained with a CCD scanner}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {147 - 152}, abstract = {This paper presents a computer-aided diagnosis for pneumoconiosis radiographs obtained with a common CCD scanner. Since the existing diagnosis systems for pneumo coniosis extract abnormalities of pneumoconiosis from im ages obtained with a special scanner which can appropri-ately-apply-for-chest- radiographs,-it-is-difficult-toapply the systems to images obtained with a CCD scanner due to un clear shadow and the systems are not practical for medical doctors due to high costs. In the unclear images, the ab normal levels of pneumoconiosis could depend on density distribution in each of intercostal and rib areas. Therefore, the proposed method measures the abnormalities by extract ing characteristics of the distribution in the areas. Besides, using the-abnormalities,-the-proposed-method-classifies-the-imagesinto the three categories of pneumoconiosis. Exper imental results-of-the-classifications-for- 51-right-lung-im-ages-including 6 pneumoconiosis images have shown that the proposed abnormalities are well extracted according to the standards of pneumoconiosis categories.}, keywords = {Chest radiographs, Computer-aided diagnosis, Medical image processing, Pneumoconiosis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960677554\&partnerID=40\&md5=95072c54ff5968028fd8e2985166c663}, author = {Nakamura, M. and Abe, K. and Minami, M.} } @article {194, title = {Enabling automatic just-in-time evaluation of in-class discussions in on-line collaborative learning practices}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2009}, pages = {289 - 296}, abstract = {Learning by discussion when applied to on-line collaborative learning settings can provide significant benefits for students in education in general. Indeed, the discussion process plays an important social task in collaborative learning practices. Participants can discuss about the activity being performed, collaborate with each other through the exchange of ideas that may arise, propose new resolution mechanisms, justify and refine their own contributions, and as a result, acquire new knowledge. Considering these benefits, current educational organizations incorporate on-line discussions into web-based courses as part of the very rationale of their pedagogical models. However, in-class collaborative assignments are usually greatly participated and contributed, which makes the monitoring and assessment tasks by tutors and moderators time-consuming, tedious and error-prone. Specially hard if not impossible by human tutors is to manually deal with the sequences of hundreds of contributions making up the discussion threads and the relations between these contributions. Consequently, tutoring tasks during on-line discussions usually restrict to offer evaluation results of the contributing effort and quality after the collaborative learning activity takes place and thus neglect the essential issue of constantly considering the process of knowledge building while it is still being performed. In this paper, we propose a multidimensional model based on data analysis from online collaborative discussion interactions that provides a first step towards an automatic evaluation in just-in-time fashion. The context of this study is a real on-line discussion experience that took place at the Open University of Catalonia.}, keywords = {Automatic evaluation, Collaborative learning, Groupware, Knowledge discovery, Machine learning}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953238102\&partnerID=40\&md5=6dce6350dd861170e2133b9b2f597627}, author = {Caball{\'e}, S. and Lapedriza, {\`A}. and Masip, D. and Xhafa, F. and Abraham, A.} } @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 {82, title = {Editorial: Special issue on computational intelligence in information retrieval}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {97 - 98}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350664206\&partnerID=40\&md5=881162d6fe901d46e633d998f654ed1b}, author = {Abraham, A. and Chen, Y. and Xhafa, F.} } @article {73, title = {An efficient path query processing support for parent-child relationship in native XML databases}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2007}, pages = {82 - 87}, abstract = {Due to its flexibility and efficiency in transmission of data, XML has become the emerging standard for data transfer and exchange across the Internet. In native XML database, XML documents are usually modeled as trees, and XML queries are typically specified in path expression. The primitive structural relationships are parent-child and ancestor-descendant in the path expression. Thus, finding all occurrences of these relationships is crucial. We adopt the decomposition-matching-merging approach and propose INLAB a novel hybrid query processing merging both indexing and labeling technologies, Experimental results show that INLAB can process XML path queries by up to an order of magnitude faster than conventional top-down approach.}, keywords = {Matching, Path expression, Path query, Query evaluation, Query pattern, Query processing, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-36048941577\&partnerID=40\&md5=7e045de46c15618285abdf54053caa5f}, author = {Haw, S.-C. and Rao, G.S.V.R.K.} } @article {72, title = {Emergent semantics in personalized multimedia content}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):7Export Date: 10 July 2014}, month = {2007}, pages = {55 - 60}, abstract = {Authoring of personalized multimedia content can be considered as a process consisting of selecting, composing; and assembling media elements into coherent multimedia presentations that meet the user{\textquoteright}s or user group{\textquoteright}s preferences, interests, current situation, and environment. In the approaches we find today, media items and semantically rich metadata information are used for the selection and composition task. However, most valuable semantics for the media elements and the resulting multimedia content that emerge with and in the authoring process are not considered any further. This means that the effort for semantically enriching media content comes to a sudden halt in the created multimedia document - which is very unfortunate. In this paper, we propose with the SemanticMM4U framework an integrated approach for deriving and exploiting multimedia semantics that arise with and from the creation of personalized multimedia content and make it available for further use and applications. In this approach, not only the metadata are considered that are semantically evolving from the media elements of the newly created presentation. Also the actual usage of media elements for the authoring can emerge new semantics of the single media elements employed. In the application domain of authoring of digital photo albums we show where and how semantics emerge in the authoring process and how these contribute to an even richer media content pool, both for single media and also for the composition and its later use.}, keywords = {Metadata, Multimedia elements, Multimedia personalization, Multimedia semantics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-37849008165\&partnerID=40\&md5=366f71c39eca694096c9135c18c67f12}, author = {Scherp, A. and Boll, S. and Cremer, 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 {38, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {100 - 101}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649109659\&partnerID=40\&md5=1372fbf024af643ce6af2ec7b0a60a11}, author = {Chbeir, R. and Yetongnon, K.} } @article {49, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {158}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749407706\&partnerID=40\&md5=797926d82d7289fb4e88f4899809bc04}, author = {Pichappan, P. and El-Qawasmeh, E.} } @article {59, title = {Enabling metaphor evolution for improving systems{\textquoteright} usability}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {243 - 248}, abstract = {In this paper we consider both the interface language and domain language of a software system. That system co-evolves with its user group, with its usage context, application domain, and usage conditions. We presuppose that the evolution of that system is triggered by and reflected in the use of those languages. Since human language use is essentially metaphorical we expect the metaphors employed by system users to evolve when the software system evolves. To assure maximum usability of that system we suggest using a signal interception and pattern substitution component for implementing a controlled change of the metaphors that are available in the mentioned languages. We show how our prototype of such a component can be used for implementing the evolution of the used metaphors. Our approach focuses on the maintainability of the metaphors rather than on a once-and-for-all method for optimally choosing them.}, keywords = {Information system, Metaphor, Software evolution}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845955932\&partnerID=40\&md5=5e4f1d1515e1ac91de0d2055cd054533}, author = {Kaschek, R.H. and Tretiakov, A.} } @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 {39, title = {Expressing and interpreting user intention in pervasive service environments}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2006}, pages = {102 - 106}, abstract = {The introduction of pervasive computing environments enforce new ways of human-machine-interaction. The welldefined interaction interfaces will make place for other, more intuitive ways of interaction. In a pervasive service environment, the system middleware should take care of capturing the users expression of an action intention, solving ambiguousness in this expression, and executing the final pervasive action This article introduces the Pervasive Service Action Query Language (PsaQL), a language to formalize the description of a user intention using composed pervasive services. It presents the next steps of intention treatment in a pervasive service environment: A mathematical model is given, which helps to express the algorithms performing translation of the user intention into an executable action. To implement such algorithms, a suitable object- oriented model representing actions is introduced. In the scope of PERSE, a pervasive service environment developed by our research group, general evaluation metrics for such algorithms are identified, a prototype has been developed and first benchmark results are presented in this article.}, keywords = {Algorithms in pervasive computing, Object-oriented model, Pervasive computing, Pervasive Service Action Query Language (PsaQL)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-34547320698\&partnerID=40\&md5=47a322c63cbf87aec59acd1e5104f08d}, author = {Bihler, P. and Scuturici, V.-M. and Brunie, L.} } @article {40, title = {Extracting information from coarser-grained data in XML documents}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {117 - 123}, abstract = {XML is fast emerging as the dominant standard for representing data in the applications centric documents. While there has been a great deal of works recently proposing the extraction of relevant data of natural langujge texts, Most of the underlying works confront with the irregular structure hidden in the text. To this end, a large spectrum of wrappers has been conceived lot- web pages. Unfortunately, they cannot deal with semi-structured data and cannot still take into consideration the natural language processing. In this paper, we present a specification language to write expressive and easy extraction patterns. The specification relies on rectular expression fashion in order to write patterns by non expert users. In addition, we introduce the Xtractor wrapper for coarser-grained data (i.e. paragraphs). The Xtractor hinges on linguistic parsing. of paragraphs and applies technical and natural language dictionaries. Then it employs the extraction patterns against the pre-processed paragraphs in order to locate relevant data. The key idea of our approach consists of translating the extraction patterns to Finite State Transducers (FST) and even using the FST to build the domain specific dictionaries.}, keywords = {Data exchange, Finite state transducers, XML database, Xtractor wrapper}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649098973\&partnerID=40\&md5=e3df331dc7e1172e6d94226eecc4f744}, author = {Badr, Y.} }