@article {782, title = {Comparison of the Effects Stemmer Porter and Nazief-Adriani on the Performance of Winnowing Algorithms for Measuring Plagiarism-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {04/2020}, pages = {49-56}, type = {Research}, chapter = {49}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2020/18/2/49-56}, url = {http://dline.info/fpaper/jdim/v18i2/jdimv18i2_1.pdf}, author = {Alam Rahmatulloh and Neng Ika Kurniati and Irfan Darmawan and Adi Zaenal Asyikin and Deden Witarsyah} } @article {789, title = {Query Expansion in Text Information Retrieval with Local Context and Distributional Model-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2020}, month = {12/2019}, pages = {313-320}, type = {Research}, chapter = {313}, abstract = {

The Semantic Distributional Model is based on the frequency of contexts of use of language terms in large open corpus such as the web, to establish similarity or the relationship between words. These relationships or similarities can be used to add terms when expanding queries. The idea explored in this paper is that, for queries in closed collections of text documents, a posterior filter based on the restricted vocabulary of the collection can improve the effectiveness of automatic query expansion. This idea is developed and evaluated in publicly available benchmarks presenting promising results.

}, doi = {https://doi.org/10.6025/jdim/2019/17/6/313-320}, url = {http://dline.info/fpaper/jdim/v17i6/jdimv17i6_1.pdf}, author = {Fabiano Tavares da Silva and Jos{\'e} E. B. Maia} } @article {795, title = { Corpus-Based Techniques for Sentiment Lexicon Generation: A Review-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {296-305}, type = {Research}, chapter = {296}, abstract = {

State-of-the-art sentiment analysis systems rely on a sentiment lexicon, which is the most essential feature that drives their performance. This resource is indispensable for, and greatly contributes to, sentiment analysis tasks. This is evident in the emergence of a large volume of research devoted to the development of automated sentiment lexicon generation algorithms. The task of tagging subjective words with a semantic orientation comprises two core approaches: dictionarybased and corpus-based. The former involves making use of an online dictionary to tag words, while the latter relies on co-occurrence statistics or syntactic patterns embedded in text corpora. The end result is a linguistic resource comprising a priori information about words, across the semantic dimension of sentiment. This paper provides a survey on the most prominent research works that utilize corpus-based techniques for sentiment lexicon generation. We also conduct a comparative analysis on the performance of state-of-the-art algorithms proposed for this task, and shed light on the current progress and challenges in this area.

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/296-305}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_4.pdf}, author = {Mohammad Darwich and Shahrul Azman Mohd Noah and Nazlia Omar and Nurul Aida Osman} } @article {627, title = {Applied Management Support for an Efficient WSN Infrastructure}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, month = {01/2018}, pages = {1-12}, abstract = {

There are many management applications such as disaster management, air pollution management, weather management, traffic control management etc. which requires continuous attentions and prompt actions. Inclusion of theory of management support and timely decision to any un-managed system will improve the performance, usability and sustainability. Wireless Sensor Network is a self build infrastructure which deployed on the areas where there is no continuous power supply to the sensor nodes. There are many researches and approach has been proposed and protocols designed to address the network performance. We analyzed and identified the issue areas where management support and timely organized decisions improve the wireless sensor network performance. We categorized the system based on levels of management and presented our proposed protocols in all levels with process flow and performance comparisons through our simulation models.

}, author = {Nilayam Kumar Kamila and Sunil Dhal and Bhagirathi Nayak} } @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 {657, title = {From Words to Emoticons: Deep Emotion Recognition in Text and Its Wider Implications}, journal = {International Journal of Computational Linguistics Research}, volume = {9}, year = {2018}, month = {03/2018}, pages = {10-26}, type = {Research}, author = {Rafal Rzepka and Mitsuru Takizawa and Jordi Vallverdu and Michal Ptaszynski and Pawel Dybala and Kenji Araki} } @article {684, title = {Fusion Model for Traffic Sign Detection, Tracking and Recognition}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {06/2018}, pages = {72-79}, type = {Research}, author = {Hubham Dhingra and Shalini Diwakar and G. Saranya and Manish Kumar} } @article {693, title = {A Hybrid Feature Selection Algorithm Based on Information Gain and Sequential Forward Floating Search}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {09/2018}, pages = {93-101}, type = {Research}, author = {Jianli Ding and Liyang Fu} } @article {679, title = {Mathematical Formulation for Programmers to Select Background and Foreground Colors in Designing Websites}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {06/2018}, pages = {47-50}, type = {Research}, author = {Veeresh Duvvuri and Srinivas Laggoni and Shankar Karinga} } @article {620, title = {NDSOM: Self Organizing Maps Learning Approach to Extract Noisy Data}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {3/2018}, pages = {24-32}, chapter = {24}, url = {http://www.dline.info/jic/fulltext/v9n1/jicv9n1_3.pdf}, author = {Vikas Chaudhary and Mesfin Jariso Delbu and R. S. Bhatia} } @article {652, title = {Non-words Spell Corrector of Social Media Data in Message Filtering Systems}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {64-75}, type = {Research}, author = {Zar Zar Wint and Th{\'e}o Ducros and Masayoshi Aritsugi} } @article {696, title = {A Novel Framework for Context-aware Outlier Detection in Big Data Streams-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {213-222}, type = {Research}, chapter = {213}, doi = {https://doi.org/10.6025/jdim/2018/5/213-222}, author = {Hussien Ahmad and Salah Dowaji} } @article {816, title = {A Novel Framework for Context-aware Outlier Detection in Big Data Streams-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {213-222}, type = {Research}, chapter = {213}, abstract = {

Outlier and anomaly detection has always been a critical problem in many fields. Although it has been investigated deeply in data mining, the problem has become more difficult and critical in the Big Data era since the volume, velocity and variety of data change drastically with rather complicated types of outliers. In such an environment, where real-time outlier detection and analysis over data streams is a necessity, the existing solutions are no longer effective and sufficient. While many existing algorithms and approaches consider the content of the data stream, there are few approaches which consider the context and conditions in which the content has been produced. In this paper, we propose a novel framework for contextual outlier detection in big data streams which inject the contextual attributes in the stream content as a primary input for outlier detection rather than using the stream content alone or applying the contextual detection on content anomalies only. The detection algorithm incorporates two approaches; the first, a supervised detection method and the other, an unsupervised, which allows the detection process to adapt to the normal change in the stream behavior over time. The detected outliers are either both content and contextual outliers or contextual outliers only. The proposed contextual detection approach prunes the false positive outliers and detects the true negative outliers at the same time. Moreover, in this framework, the detection engine preserves both outliers and context values in which those outliers were detected to be used in the engine self-training and in outliers modeling in order to enhance the outlier prediction accuracy.

}, doi = {https://doi.org/10.6025/jdim/2018/16/5/213-222}, url = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_1.pdf}, author = {Hussien Ahmad and Salah Dowaji} } @article {647, title = {Value Driven Management of Cloud Services}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {03/2018}, pages = {22-37}, type = {Research}, author = {Salah Eddin Murad and Salah Dowaji} } @article {474, title = {Building consistent UML models for better model driven engineering}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {289 - 300}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036620073\&partnerID=40\&md5=3f141768de4df003a8dd47e8ece70abb}, author = {Allaki, D. and Dahchour, M. and En-nouaary, A.} } @article {511, title = {Improved digital image restoration algorithm based on Criminisi}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {302 - 310}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85000893942\&partnerID=40\&md5=cfd761694d61d770d0fcf37e2c8c563d}, author = {Dai, L. and Jiang, D.-H. and Ding, B. and Hahn, J.K.} } @article {539, title = {A web service-based approach to integrated information management for railway emergency scenario}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {1 - 7}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969902467\&partnerID=40\&md5=923eef1ca98ee271af3c1795c2517677}, author = {Zhang, Z.-H. and Xu, Z.-L. and Zhang, Y.-P. and Dang, J.-W. and Shen, L.-X.} } @article {588, title = {A 3D audio augmented reality system for a cultural heritage management and fruition}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :6Export Date: 22 February 2018}, month = {2015}, pages = {203 - 209}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942510273\&partnerID=40\&md5=d148a64add2087fe57ff0e4483dc5bf8}, author = {D{\textquoteright}Auria, D. and Di Mauro, D. and Calandra, D.M. and Cutugno, F.} } @article {573, title = {Construction and application of teaching file management system in institutions of higher learning based on OpenKM}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {286 - 290}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84956704691\&partnerID=40\&md5=5c0b7f8150eef63ce1be7af402d69597}, author = {Deng, H.} } @article {603, title = {An improved classification scheme with adaptive region growing and Wishart classification algorithm for digital images}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {15 - 24}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930368317\&partnerID=40\&md5=74e8e8ba6a445312904e04e7119c16ab}, author = {Chen, J. and Du, P. and Tan, K. and Borjer, T.H.} } @article {596, title = {Paper hijacking: Hijackers are attacking journals for hijacking unpublished papers}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {306 - 307}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942516743\&partnerID=40\&md5=7f7001b6621fbfce1e57b4250206d070}, author = {Dadkhah, M.} } @article {558, title = {Power station flue gas desulfurization system based on automatic online monitoring platform}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {480 - 488}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959194530\&partnerID=40\&md5=412732dc4426687d89037ffb1fe20837}, author = {Liu, X. and Ma, C. and Yang, X. and Yang, C. and Diao, Y.} } @article {590, title = {Providing mobile traffic analysis as-a-Service: Design of a service-based infrastructure to offer high-accuracy traffic classifiers based on hardware accelerators}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :8Export Date: 22 February 2018}, month = {2015}, pages = {256 - 265}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942523467\&partnerID=40\&md5=be532781710ddddfc3aa468942d2fc76}, author = {Barbareschi, M. and De Benedictis, A. and Mazzeo, A. and Vespoli, A.} } @article {403, title = {Parameters selection in the discrete particle swarm optimization algorithm solving gate and runway combinational optimization problem}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {197 - 201}, abstract = {Gate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance of the algorithm. Optimal values exist in the specific application of the respective parameters. The optimal value interval of the population size does not vary with different acceleration constants when inertia weight is constant. Increasing the population size can improve the solution quality, but the time overhead increases significantly. Finally, each parameters selection guidelines are provided.}, keywords = {Airport operation, Discrete particle swarm optimization, Gate and runway combinational optimization, Parameters selection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880782704\&partnerID=40\&md5=b89c7c4e42430962155e9283216c7b70}, author = {Ding, J. and Zhang, Y.} } @article {354, title = {Creating multi-level class hierarchy for question classification with NP analysis and wordnet}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {379 - 388}, abstract = {Question answering systems provide answer to the questions using various question processing techniques and extracts answers from a set of documents. Finding the exact answer is more interesting and useful than getting a list of documents to look through and find the answer manually. Question answering is not same as a traditional document retrieval search engine where a set of relevant documents are returned in response of the query, whereas, in the question answering systems the response of the query is a concise and exact answer to the question. Typically, Question Classification (QC) is the first step in a Question Answering (QA) system. This phase is responsible for finding out the type of the expected answer by pruning out the extra information that is not relevant to extract the answer. Almost all the previous QC algorithms evaluated their work on the basis of a common class hierarchy already defined. The coarse grained classes Location, Entity and Numeric in the existing hierarchy have a fine grained class Other. We present the framework to create new fine grained classes to replace the Other classes. We also discuss the motivation behind the replacement and how the new fine grained classes may support the answer extraction. Additionally, we also present an automatic hierarchy creation method to add new class nodes using WordNet and Noun phrase parsing.}, keywords = {Meta Information Management, Natural Language Processing, Question Answering4, Question Class Hierarchy, Question Classification}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874837728\&partnerID=40\&md5=3f2a45281c24dba71e9fbc36717f9a70}, author = {Bakhtyar, M. and Kawtrakul, A. and Baber, J. and Doudpota, S.M.} } @article {338, title = {A novel RDB-SW approach for commodities price dynamic trend analysis based on web mining}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2012}, pages = {230 - 235}, abstract = {In order to improve the accuracy of price forecasting for dynamic trend analysis on imperfect data by web extracting, a novel repair data algorithm based on dichotomy backfilling is proposed in this paper. The price forecasting algorithm based on the Sliding Window (SW) is utilized to verify the validity of Repair Dichotomy Backfilling (RDB) algorithm. Experiments demonstrated that the mean absolute errors can be achieved to 5.31 percent average. Furthermore, the price forecasting algorithm based on original data and that based on RDB data are explored to compare their accuracy. Experiments demonstrated the reduction of mean absolute errors in the price dynamic trend analysis verification model. The average MAE on original data is 2.38 percent when the average MAE on RDB data is 2.31 percent. Experiment results proved that the proposed RDB-SW approach is meaningful and useful to analyze and to research the price market on imperfect data by Web extracting.}, keywords = {Dichotomy backfilling, Disturbance factor, Imperfect data, Price forecast algorithm, Sliding window}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463450\&partnerID=40\&md5=5874dc4739d723f46728438c22a52b9a}, author = {Zhu, Q. and Zhou, P. and Cao, S. and Yan, Y. and Ding, J.} } @article {350, title = {A survey on data migration management in cloud environment}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {324 - 331}, abstract = {Cloud computing has become a hot technology. The virtualization technology, one of its core support technologies, is also developing quickly. In recent years, a lot of research and practice have been done in the virtualization field. Live virtual machine migration has drawn much attention as a representative technology of the virtualization field. This paper summarizes the research progress of live virtual machine migration technology including pre-copy, post-copy and CR/TR-Motion analyzes the future research trend.}, keywords = {Cloud computing, Live migration, Virtual machine, Virtualization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870801122\&partnerID=40\&md5=b4c2238489deb4c292137fd14e4a2091}, author = {Hu, L. and Zhao, J. and Xu, G. and Ding, Y. and Chu, J.} } @article {340, title = {True: A trust evaluation service for mobile ad hoc networks resistant to malicious attacks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {262 - 271}, abstract = {Trust evaluation is an essential service to ensure reliability on security relationships on networks, including Mobile Ad Hoc Networks (MANETs). However, the implementation of an effective trust evaluation service is very difficult in these networks, due to their dynamic characteristics. Though many trust evaluation services for MANETs can be found in the literature, they were not designed considering malicious attacks or were not evaluated under these attacks. This work presents TRUE, a distributed trust evaluation service for MANETs which creates a self-organized context-based trust network. To estimate the trustworthiness of other nodes, nodes form trust chains based on behavior evidences maintained within the context-based trust network. Periodically, nodes exchange trust information with the neighbors, providing an efficient method to disseminate these information through the network. Simulation results show that TRUE is very efficient on gathering evidences to build the trust networks, maintaining a small communication and memory overhead. Further, it is the first trust evaluation scheme evaluated under bad mouthing and newcomers attacks and it maintains its effectiveness in such scenarios.}, keywords = {Attacks, MANETs, Security, Selforganization, Trust evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866468796\&partnerID=40\&md5=08ff8aec3056b7029837f9948c2ccdcf}, author = {Da Silva, E. and Misaghi, M. and Albini, L.C.P.} } @article {348, title = {University teachers{\textquoteright} performance appraisals model based on DEA and AHP}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {332 - 340}, abstract = {The university teachers{\textquoteright} performance appraisals model decides the development of scientific research. And a set of scientific, reasonable and comprehensive model is the premise and foundation to evaluate it. First, this article analyses the domestic and foreign university teachers{\textquoteright} performance appraisals model. Second, it combines the current teachers{\textquoteright} performance appraisals theory and practice research, and discusses the questionnaire suitable for the university teachers{\textquoteright} performance appraisals model in our country. Third, through the questionnaire data analysis, the paper uses factor-analysis-method to screen indexes. Fourth, the paper uses AHP method and calculates the index weights for all levels. Finally, the paper establishes the university teachers{\textquoteright} performance appraisals index model based on DEA.}, keywords = {AHP, Index system, Performance appraisals, Quantization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870835193\&partnerID=40\&md5=a2b5682b9d4038ce96253a8d99015975}, author = {Bei, W. and Dongsheng, L.} } @article {263, title = {An ontology-based approach for detecting knowledge intensive tasks}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2011}, pages = {9 - 18}, abstract = {In the context detection field, an important challenge is automatically detecting the user{\textquoteright}s task, for providing contextualized and personalized user support. Several approaches have been proposed to perform task classification, all advocating the window title as the best discriminative feature. In this paper we present a new ontology-based task detection approach, and evaluate it against previous work. We show that knowledge intensive tasks cannot be accurately classified using only the window title. We argue that our approach allows classifying such tasks better, by providing feature combinations that can adapt to the domain and the degree of freedom in task execution.}, keywords = {Classification, Context-awareness, Task detection, User context detection, User context ontology}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960684788\&partnerID=40\&md5=2680764b7de9a96a3bfc50e670a65ce8}, author = {Rath, A.S. and Devaurs, D. and Lindstaedt, S.N.} } @article {299, title = {The performance analysis of a service deployment system based on the centralized storage}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {287 - 291}, abstract = {Because of its data centralized management characteristic, which conveniently realize resources sharing and the data fast clone, the service deployment technology based on the centralized storage can achieve fast deployment for the system service through the network boot methed or the method of downloading disk image from the remote storage server. However, for the data centralism the I/O load is also congested on the storage server, which creates the drop of the overall system performance and the reducing of the service quality. So we need to test and analyze its performance factors, which provide the clue for the solution of the performance bottleneck. In this paper, we use the SonD deployment system, which is based on the centralized storage, as the analysis prototype to carry on the analysis to the client boot process, evaluate its performance influence factors such as the memory size of storage server, data distribution on the storage server through the real or simulated method, and give suggestion of the performance optimized.}, keywords = {Centralized Storage, Performance Analysis, Service Deployment}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855403722\&partnerID=40\&md5=ef5c7bf82725ab97629cbfa9acd24bfb}, author = {Dong, Z.X.} } @article {278, title = {A semantic annotation model for indexing and retrieving learning objects}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {159 - 166}, abstract = {The internet is an important part of our world. Offering a large and increasing amount of information, people can use it for learning, teaching, etc. Automatic tools for learning information retrieval based on semantic tags have not been effective yet. We propose here a model which aims at automatically annotating texts with semantic metadata. These metadata would allow us to index and extract learning objects from texts. This model is composed of two parts. While the first part consists of a semantic annotation of learning objects according to their categories (definition, example, exercise, etc.), the second one uses automatic semantic annotation. Generated by the first part, the latter aims at creating a semantic inverted index able to find relevant learning objects for queries. To sort the results according to their relevance, we apply the Rocchio{\textquoteright}s classification technique to the learning objects. We have implemented a system called SRIDoP, on the basis of the proposed model and we have verified its effectiveness.}, keywords = {Contextual exploration, Learning objects, Rocchio algorithm, Semantic annotation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053105137\&partnerID=40\&md5=a9c6f1a4944e56cbefac59e5ce025592}, author = {Smine, B. and Faiz, R. and Descl{\'e}s, J.-P.} } @article {242, title = {Bidirectional recommendation technology for web digital texts}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {240 - 246}, abstract = {Recently, e-learning systems have begun to be used in companies and education institutions. The spread of e-learning is mainly due to development of the learning management system (LMS), which includes SCORM and WebCT. Therefore, the introduction of learning the web digital web digital texts have become much simpler. The increase of contents of the web digital texts has realized a wider range of learning. As a result, we are concerned that learners will be confused with selecting the best learning web digital texts. In our research, we are developing a bidirectional recommendation system that extracts the relationship among learning the web digital texts with historical logs and recommends an effective web digital text for learners. In this paper, we first discuss the design of the bidirectional recommendation system, and second, we show its evaluation results. Finally, we conclude that our recommendation system is useful for learners.}, keywords = {Bidirectional recommendation, Collaborative filtering}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960678552\&partnerID=40\&md5=26da622fa54ccbb85a451552ee79e801}, author = {Wada, Y. and Matsuzawa, S. and Yamaguchi, M. and Dohi, S.} } @article {224, title = {Editorial preface: Special issue on context-aware and mobile multimedia databases and services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {2 - 3}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089\&partnerID=40\&md5=7b82f006c7ffa103ca31e784f7cd8bf8}, author = {Grigoras, R. and Charvillat, V. and Chbeir, R. and Kosch, H. and Bailer, W. and Boll, S. and Brunie, L. and Cao, Y. and Delgado, J. and Granitzer, M. and Hausenblas, M. and Eidenberger, H. and Klamma, R. and Lux, M. and Marques, O. and Oria, V. and Plesca, C. and Pr{\'e}teux, F. and Sedes, F. and Spaniol, M. and Ternier, S. and Wolpers, M.} } @article {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 {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 {184, title = {A generic context model enhanced with self-configuring features}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2009}, pages = {159 - 165}, abstract = {This paper addresses two fundamental research problems in the domain of context aware autonomic systems: the development of a generic context model that can be used to represent general purpose contexts in a system interpretable way and the autonomic context model management. The proposed context model uses two equivalent and synchronized ways of representing the context: a set based representation and an ontology based representation. The set based representation is used to evaluate the conditions under which the self-* processes should be executed in order to enforce the autonomic properties. The ontology representation is used by context aware applications for reasoning and learning purposes. The increasing complexity of execution environments of the context aware systems and the difficulties of their management have headed us towards the necessity of defining and integrating the self-configuring autonomic paradigm in the context model management process. The self-configuring property is enforced by monitoring the real world context in order to detect context variations or conditions for which the context artifacts must be updated.}, keywords = {Autonomic computing, Context awareness, Pervasive middleware, Self-configuring}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249115300\&partnerID=40\&md5=f9d617fff380ea06eb2e277b2d81a580}, author = {Cioara, T. and Anghel, L. and Salomie, L. and Dinsoreanu, M.} } @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 {121, title = {Citation auctions as a method to improve selection of scientific papers}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {414 - 420}, abstract = {This paper describes the basis of citation auctions that are introduced as a new approach to selecting scientific papers for publication. Unlike the state of the art in paper selection that relies on peer reviews, our main idea is to use an auction in which bids consist of the number of citations that an author expects to receive if the paper is published. Hence, a citation auction is the selection process itself, and no reviewers are involved. The benefits of the proposed approach are two-fold. First, the cost of refereeing will be either totally eliminated or significantly reduced, because the process of citation auction does not need prior understanding of the paper{\textquoteright}s content to judge the quality of its contribution. Additionally, the method does not prejudge the content of the paper, so it will increase the openness of publications to new ideas. Second, scientists will be much more committed to the quality of their submitted papers, paying close attention to distributing and explaining their papers in detail to maximize the number of citations that the paper receives when published. Sample analyses of the number of citations collected via Google scholar for papers published in years 1999-2004 in a series of proceedings, and in years 2003-2005 in a series of conferences (in a totally different discipline) are provided. Finally, a simple simulation of an auction is given to outline the behaviour of the citation auction approach.}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865494320\&partnerID=40\&md5=ebc2cdcc8ee9804c72cf125c9ee6c619}, author = {De La Rosa, J.L. and Szymanski, B.K.} } @article {136, title = {Map integrity constraint verification by using visual language parsing}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {332 - 341}, abstract = {In the last decade there has been an increasing interest in the use of tools for the creation of geographic maps. However, these tools include functionalities that allow users to insert information without verifying their consistency with the constraints defined by the designer. In this paper we propose an approach based on visual language parsing for guaranteeing the integrity of data produced during the map editing process. According to our approach, constraints are expressed by using high-level data model, such as OMT-G, and converted in a proper visual language grammar automatically. From such a grammar, a parser able to identify incorrect aggregation of spatial data input is generated. The grammar formalism also allows us to associate suitable semantic actions with productions in order to perform automatic corrections of inconsistent input data, error recognition and visualization, prompting actions for error recovery. We also present a system prototype supporting the proposed process.}, keywords = {Data Quality, Grammar Formalism, Integrity Constraint Checking, Spatial Consistency, Topologicalrelationships, Visual Language Parsing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349979001\&partnerID=40\&md5=74efb0fc7499a7151d63110ec06db5d6}, author = {Del Fatto, V. and Deufemia, V. and Paolino, L.} } @article {126, title = {Map integrity constraint verification by using visual language parsing}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {386 - 395}, abstract = {In the last decade there has been an increasing interest in the use of tools for the creation of geographic maps. However, these tools include functionalities that allow users to insert information without verifying their consistency with the constraints defined by the designer. In this paper we propose an approach based on visual language parsing for guaranteeing the integrity of data produced during the map editing process. According to our approach, constraints are expressed by using high-level data model, such as OMT-G, and converted in a proper visual language grammar automatically. From such a grammar, a parser able to identify incorrect aggregation of spatial data input is generated. The grammar formalism also allows us to associate suitable semantic actions with productions in order to perform automatic corrections of inconsistent input data, error recognition and visualization, prompting actions for error recovery. We also present a system prototype supporting the proposed process.}, keywords = {Data Quality, Grammar Formalism, Integrity Constraint Checking, Spatial Consistency, Topological Relationships, Visual Language Parsing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865514855\&partnerID=40\&md5=c3f7b43fbb1550bfd3198eec27ecb801}, author = {Fatto, V.D. and Deufemia, V. and Paolino, L.} } @article {142, title = {Robust video watermarking based on dual-plane correlation for immunity to rotation, scale, translation, and random distortion}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {161 - 167}, abstract = {A robust video watermarking method is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It can detect watermarks without any search for canceling the effect of random distortion. Rotation, scale, and translation are canceled by searching for the angle, size, and origin of the original picture. The search for the angle and size is combinatorial but is independent of the search for the origin. That is, the angle and size of the target picture can be restored without restoring the picture{\textquoteright}s origin. Furthermore, the search for the origin is divided into horizontal and vertical searches that can be carried out independently. The number of searches is thus drastically reduced, making the processing speed high enough for practical application. Experimental evaluation using actual video samples demonstrated that the proposed method can embed watermarks immune to all four types of transformations.}, keywords = {Random distortion, RST, Survivability, Video watermarking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67949090393\&partnerID=40\&md5=66e6b7ff3c851392463bf9ef0b6f2ae3}, author = {Atomori, Y. and Echizen, I. and Dainaka, M. and Nakayama, S. and Yoshiura, H.} } @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 {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 {93, title = {A non reference fingerpint image validity via statistical weight calculation}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {220 - 224}, abstract = {Clarity of fingerprint image structure is crucial for many fingerprint applications, as well as the performance of built systems which relies on the validity and quality of captured images. Validity check will eliminate invalid images before starting the life cycle of fingerprint metadata enrolling for system processing cycle; therefore the overall benchmarking system accuracy will not be affected by rejecting an invalid image before getting in the system cycle. In this paper we propose a validity check algorithm (VCA). The VCA is applied to the base image eiement statistical weight calculation because the image element (pixel) describes an image object with the contrast, brightness, clarity and noising attributes. Our algorithm depends on fingerprint object segmentation, background subtraction, total image thresholding and pixel weight calculation. A VTC200ODB1_B, TIMA databases was used to evaluate the VCA and it has been compared with NIST fingerprint image quality results. Correlation results indicate that the proposed algorithm is feasible in detecting low quality as well as non-fingerprint images.}, keywords = {Fingerprint, Image quality, Image subtraction, Otsu threshold, Segmentation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949123442\&partnerID=40\&md5=c56872a67fd18e70e84324f95df34eaf}, author = {Altarawneh, M.S. and Khor, L.C. and Woo, W.L. and Dlay, S.S.} } @article {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 {44, title = {A method for incorporating user modelling}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {136 - 141}, abstract = {In this paper a method is presented for adding user modelling to (existing) software systems. The method consists of seven steps that lead from initial analysis to the definition and evaluation of the elements needed for the adaptive behaviour. Along with the method, the central concepts of adaptation elements and adaptation graphs are introduced. An adaptation element can be used to determine the impact of personalisations, while adaptation graphs describe the adaptation in a system as a whole.}, keywords = {Adaptation graphs, Adaptive hyper media, Software systems, User modeling techniques}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649122190\&partnerID=40\&md5=81f31d807146f2213cd9d4bec519f998}, author = {de Vrieze, P. and van Bommel, P. and van der Weide, T.} } @article {28, title = {Semantic indexing and hyperlinking of multimedia news: The RitroveRAI system}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {63 - 72}, abstract = {Web services tend to offer functional and non-functional requirements and capabilities in an agreed, machine-readable format. The target is to provide automated services for discovering, selection and binding of information as a native capability of middleware and applications. However, the major limitations are due to the lack of clear and processable semantics. In this paper, a system, RitroveRAI, addressing the general problem of enriching a multimedia news stream with semantic metadata is presented. News metadata are explicitly derived from transcribed sentences or implicitly expressed into a topical category automatically detected. The enrichment process is accomplished by aligning individual audiovisual segments with news or journal articles reachable trough the Web. This distributed process designed for RitroveRAI enables several extensions in light of large scale and public access performance as suggested in the discussion of the evaluation results of our current system.}, keywords = {Hyper link structure, Meta data, Multimedia indexing, RitroveRAI, Semantic web, Web services}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748253466\&partnerID=40\&md5=05e5487b09fcb109fd3c282449982ec4}, author = {Basili, R. and Cammisa, M. and Donati, E. and Moschitti, A.} } @article {63, title = {Some issues in the art image database systems}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2006}, pages = {227 - 232}, abstract = {In this paper we illustrate several aspects of art databases, such as: the spread of the multimedia art images; the main characteristics of art images; main art images search models; unique characteristics for art image retrieval; the importance of the sensory and semantic gaps. In addition, we present several interesting features of an art image database, such as: image indexing; feature extraction; analysis on various levels of precision; style classification. We stress color features and their base, painting analysis and painting styles. We study also which MPEG-7 descriptors are best for fine painting images retrieval. An experimental system is developed to see how these descriptors work on 900 art images from several remarkable art periods. On the base of our experiments some suggestions for improving the process of searching and analysis of fine art images are given.}, keywords = {Art databases, Image processing, Image search and analysis, MPEG 7, Multimedia databases}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845946404\&partnerID=40\&md5=1b636067433b4b642b3499b0c6712dff}, author = {Stanchev, P.L. and Green Jr., D. and Dimitrov, B.} }